summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
d6ecf29)
git-svn-id: svn+ssh://idea.nguyen.vg/svn/sxsi/trunk/XMLTree@212
3cdefd35-fc62-479d-8e8d-
bae585ffb9ca
// then sequential search using popcount over a int
// then sequential search using popcount over a char
// then sequential search bit a bit
// then sequential search using popcount over a int
// then sequential search using popcount over a char
// then sequential search bit a bit
+ if(x>ones) return (uint)(-1);
//binary search over first level rank structure
uint l=0, r=n/s;
//binary search over first level rank structure
uint l=0, r=n/s;
// then sequential search using popcount over a int
// then sequential search using popcount over a char
// then sequential search bit a bit
// then sequential search using popcount over a int
// then sequential search using popcount over a char
// then sequential search bit a bit
+ if(x>n-ones) return (uint)(-1);
//binary search over first level rank structure
if(x==0) return 0;
//binary search over first level rank structure
if(x==0) return 0;
class static_bitsequence_brw32 : public static_bitsequence {
private:
uint *data;
class static_bitsequence_brw32 : public static_bitsequence {
private:
uint *data;
//bool owner;
uint n,integers;
uint factor,b,s;
//bool owner;
uint n,integers;
uint factor,b,s;
}
uint static_bitsequence_rrr02::select0(uint i) {
}
uint static_bitsequence_rrr02::select0(uint i) {
- if(i==0) return -1;
- if(i>len-ones) return len;
+ if(i==0) return (uint)-1;
+ if(i>len-ones) return (uint)-1;
// Search over partial sums
uint start=0;
uint end=C_sampling_len-1;
// Search over partial sums
uint start=0;
uint end=C_sampling_len-1;
uint static_bitsequence_rrr02::select1(uint i) {
if(i==0) return -1;
uint static_bitsequence_rrr02::select1(uint i) {
if(i==0) return -1;
// Search over partial sums
uint start=0;
uint end=C_sampling_len-1;
// Search over partial sums
uint start=0;
uint end=C_sampling_len-1;