1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
// table.h: Rcpp R/C++ interface class library -- table match
//
// Copyright (C) 2012 - 2025 Dirk Eddelbuettel, Romain Francois, and Kevin Ushey
// Copyright (C) 2025 Dirk Eddelbuettel, Romain Francois, Kevin Ushey and Iñaki Ucar
//
// This file is part of Rcpp.
//
// Rcpp is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 2 of the License, or
// (at your option) any later version.
//
// Rcpp is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Rcpp. If not, see <http://www.gnu.org/licenses/>.
#ifndef Rcpp__sugar__table_h
#define Rcpp__sugar__table_h
namespace Rcpp{
namespace sugar{
template <typename HASH, typename STORAGE>
class CountInserter {
public:
CountInserter( HASH& hash_ ) : hash(hash_) {}
inline void operator()( STORAGE value ){
hash[value]++ ;
}
private:
HASH& hash ;
} ;
template <typename HASH, int RTYPE>
class Grabber{
public:
Grabber( IntegerVector& res_, CharacterVector& names_ ) : res(res_), names(names_), index(0){}
template <typename T>
inline void operator()( T pair){
res[index] = pair.second ;
names[index++] = internal::r_coerce<RTYPE,STRSXP>(pair.first) ;
}
private:
IntegerVector& res ;
CharacterVector& names ;
R_xlen_t index ;
} ;
template <int RTYPE, typename TABLE_T>
class Table {
public:
typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE ;
Table( const TABLE_T& table ): hash(), map() {
// populate the initial hash
std::for_each( table.begin(), table.end(), Inserter(hash) ) ;
// populate the map, sorted by keys
map.insert( hash.begin(), hash.end() ) ;
}
inline operator IntegerVector() const {
// fill the result
R_xlen_t n = map.size() ;
IntegerVector result = no_init(n) ;
CharacterVector names = no_init(n) ;
std::for_each( map.begin(), map.end(), Grabber<SORTED_MAP,RTYPE>(result, names) ) ;
result.names() = names ;
return result ;
}
private:
typedef std::unordered_map<STORAGE, int> HASH ;
typedef CountInserter<HASH,STORAGE> Inserter ;
HASH hash ;
typedef std::map<STORAGE, int, internal::NAComparator<STORAGE> > SORTED_MAP ;
SORTED_MAP map ;
};
} // sugar
template <int RTYPE, bool NA, typename T>
inline IntegerVector table( const VectorBase<RTYPE,NA,T>& x ){
return sugar::Table<RTYPE,T>(x.get_ref()) ;
}
} // Rcpp
#endif
|
