1 // -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; tab-width: 8 -*-
2 //
3 // unique.h: Rcpp R/C++ interface class library -- unique
4 //
5 // Copyright (C) 2012 Dirk Eddelbuettel and Romain Francois
6 //
7 // This file is part of Rcpp.
8 //
9 // Rcpp is free software: you can redistribute it and/or modify it
10 // under the terms of the GNU General Public License as published by
11 // the Free Software Foundation, either version 2 of the License, or
12 // (at your option) any later version.
13 //
14 // Rcpp is distributed in the hope that it will be useful, but
15 // WITHOUT ANY WARRANTY; without even the implied warranty of
16 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 // GNU General Public License for more details.
18 //
19 // You should have received a copy of the GNU General Public License
20 // along with Rcpp. If not, see <http://www.gnu.org/licenses/>.
21
22 #ifndef Rcpp__sugar__unique_h
23 #define Rcpp__sugar__unique_h
24
25 namespace Rcpp{
26 namespace sugar{
27
28 template <typename HASH>
29 class InSet {
30 typedef typename HASH::STORAGE STORAGE ;
31
32 public:
InSet(const HASH & hash_)33 InSet( const HASH& hash_ ) : hash(hash_){}
34
operator()35 inline int operator()(STORAGE value){
36 return hash.contains(value) ;
37 }
38
39 private:
40 const HASH& hash ;
41 } ;
42
43 template <int RTYPE, typename TABLE_T>
44 class In {
45 Vector<RTYPE> vec ;
46 typedef sugar::IndexHash<RTYPE> HASH ;
47 HASH hash ;
48
49 public:
In(const TABLE_T & table)50 In( const TABLE_T& table) : vec(table), hash(vec){
51 hash.fill() ;
52 }
53
54 template <typename T>
get(const T & x)55 LogicalVector get( const T& x) const {
56 return LogicalVector( x.begin(), x.end(), InSet<HASH>(hash) ) ;
57 }
58
59 } ;
60
61
62 } // sugar
63
64 template <int RTYPE, bool NA, typename T>
unique(const VectorBase<RTYPE,NA,T> & t)65 inline Vector<RTYPE> unique( const VectorBase<RTYPE,NA,T>& t ){
66 Vector<RTYPE> vec(t) ;
67 sugar::IndexHash<RTYPE> hash(vec) ;
68 hash.fill() ;
69 return hash.keys() ;
70 }
71 template <int RTYPE, bool NA, typename T>
72 inline Vector<RTYPE> sort_unique( const VectorBase<RTYPE,NA,T>& t , bool decreasing = false){
73 return unique<RTYPE,NA,T>( t ).sort(decreasing) ;
74 }
75
76 template <int RTYPE, bool NA, typename T, bool RHS_NA, typename RHS_T>
in(const VectorBase<RTYPE,NA,T> & x,const VectorBase<RTYPE,RHS_NA,RHS_T> & table)77 inline LogicalVector in( const VectorBase<RTYPE,NA,T>& x, const VectorBase<RTYPE,RHS_NA,RHS_T>& table ){
78 typedef VectorBase<RTYPE,RHS_NA,RHS_T> TABLE_T ;
79 return sugar::In<RTYPE, TABLE_T>(table).get( x.get_ref() ) ;
80 }
81
82
83 } // Rcpp
84 #endif
85
86