return pos;
}
+uint wt_node_leaf::rankLessThan(uint &symbol, uint pos, uint l, wt_coder * c) {
+// std::cout <<"this-symbol: " << (uchar)this->symbol << ", symbol = " << (uchar)symbol << ", pos = " << pos << std::endl;
+ if(symbol > this->symbol) return -1;
+ symbol = this->symbol;
+ pos++;
+ return pos;
+}
+
+uint wt_node_leaf::rankLessThan(uint &symbol, uint pos) {
+// std::cout <<"this-symbol: " << (uchar)this->symbol << ", symbol = " << (uchar)symbol << ", pos = " << pos << std::endl;
+ if (pos == (uint)-1)
+ return -1;
+ symbol = this->symbol;
+ pos++;
+ return pos;
+}
+
uint wt_node_leaf::select(uint symbol, uint pos, uint l, wt_coder * c) {
if(symbol!=this->symbol) return (uint)-1;
if(pos==0 || pos>count) return (uint)-1;
}
uint wt_node_leaf::access(uint pos) {
+// std::cout <<"this-symbol: " << (uchar)this->symbol << ", pos = " << pos << std::endl;
+
return symbol;
}
+void wt_node_leaf::access(vector<int> &result, uint i, uint j, uint min, uint max, uint l, uint pivot)
+{
+// std::cout << "At l = " << l << ", [" << i << ", " << j << "], [" << min << ", " << max << "], symbol = " << symbol << std::endl;
+
+ if (i <= j && symbol >= min && symbol <= max)
+ result.push_back((int)symbol);
+}
+
+void wt_node_leaf::access(vector<int> &result, uint i, uint j)
+{
+// std::cout << "At l = " << l << ", [" << i << ", " << j << "], [" << min << ", " << max << "], symbol = " << symbol << std::endl;
+
+ if (i <= j)
+ result.push_back((int)symbol);
+}
+
+uint wt_node_leaf::access(uint i, uint j, uint min, uint max, uint l, uint pivot)
+{
+// std::cout << "At l = " << l << ", [" << i << ", " << j << "], [" << min << ", " << max << "], symbol = " << symbol << std::endl;
+
+ if (i <= j && symbol >= min && symbol <= max)
+ return 1;
+ return 0;
+}
+
uint wt_node_leaf::size() {
return sizeof(wt_node_leaf);
}