ztx 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 0f3ebafd30e7497278b5d0ed3cfe793fc85d5dd2
+  data.tar.gz: 8c305537fea1dd3e84aec06eb6166aba76ba7a97
+SHA512:
+  metadata.gz: 32fc00fd5b964f5cbe1763591506de3b134df4a25be39eb6c8b2ee4dcef2c2b5191a928ef777c93f2a9a7916a39d1671dbdb8fb48d7090e64ce27944b0ea0c5c
+  data.tar.gz: 50cc3158dab18730fe27296085167076c8a118f9894545ebb0ae46e59e0818d9d70478238e6873ee7267c93968fdaf1fa4ba6245ad9cbffba83ed8f7d728555c

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in ztx.gemspec
+gemspec

data/README.md

@@ -0,0 +1,41 @@
+# Ztx
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/ztx`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'ztx'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install ztx
+
+## Usage
+
+See http://gimite.net/en/index.php?tx-ruby
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/ztx.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList['test/**/*_test.rb']
+end
+
+task :default => :test

data/doc_src/README.txt

@@ -0,0 +1,59 @@
+This is a Ruby binding of Tx, a library for a compact trie data structure.
+
+See http://gimite.net/en/index.php?tx-ruby to know how to install etc.
+
+For details of Tx, see: http://www-tsujii.is.s.u-tokyo.ac.jp/~hillbig/tx.htm
+
+Usage example of simple index:
+  require "tx"
+  
+  # Builds an index and saves it to a file.
+  builder = Tx::Builder.new
+  builder.add_all(["foo", "ho", "hog", "hoga", "hoge", "hogeshi"])
+  builder.build("test.index")
+  
+  # Loads an index.
+  index = Tx::Index.open("test.index")
+  
+  # Simple lookup.
+  index.include?("hoge")           #=> true
+  index.include?("bar")            #=> false
+  
+  # Searches prefixes of the word.
+  index.longest_prefix("hogeeee") #=> 4 (which means "hoge" is in the index)
+  index.search_prefixes("hoge")   #=> ["ho", "hog", "hoge"]
+  
+  # Searches words which begin with the string.
+  index.search_expansions("hog")  #=> ["hog", "hoga", "hoge", "hogeshi"]
+  
+  # Finds all occurences of words in the index.
+  index.scan("hogefugafoo")       #=> [["hoge", 0], ["foo", 8]]
+  
+  # Replaces words in the index.
+  index.gsub("hogefugafoo"){ |s, i| s.upcase }
+                                  #=> "HOGEfugaFOO"
+
+Usage example of Hash-like index:
+  require "tx"
+  
+  # Builds an index and saves it to a file.
+  builder = Tx::MapBuilder.new
+  builder.add("ho", "foo")
+  builder.add("hoge", "bar")
+  builder.build("test")
+  
+  # Loads an index.
+  map = Tx::Map.open("test")
+  
+  # Simple lookup.
+  map.has_key?("hoge")                     #=> true
+  map["hoge"]                             #=> "bar"
+  map["fuga"]                             #=> nil
+  
+  # Searches prefixes/expansion of the word in keys.
+  map.key_index.longest_prefix("hogeeee") #=> 4 (which means the index has a key "hoge")
+  map.key_index.search_prefixes("hoge")   #=> ["ho", "hoge"]
+  map.key_index.search_expansions("ho")   #=> ["ho", "hoge"]
+  
+  # Finds all occurences of keys in the index.
+  index.scan("hogehoga")                  #=> [["hoge", 0, "bar"], ["ho", 4, "foo"]]

data/ext/Makefile

@@ -0,0 +1,163 @@
+
+SHELL = /bin/sh
+
+#### Start of system configuration section. ####
+
+srcdir = .
+topdir = /usr/local/lib/ruby/1.8/i686-linux
+hdrdir = $(topdir)
+VPATH = $(srcdir):$(topdir):$(hdrdir)
+exec_prefix = $(prefix)
+prefix = $(DESTDIR)/usr/local
+sharedstatedir = $(prefix)/com
+mandir = $(datarootdir)/man
+psdir = $(docdir)
+oldincludedir = $(DESTDIR)/usr/include
+localedir = $(datarootdir)/locale
+bindir = $(exec_prefix)/bin
+libexecdir = $(exec_prefix)/libexec
+sitedir = $(libdir)/ruby/site_ruby
+htmldir = $(docdir)
+vendorarchdir = $(vendorlibdir)/$(sitearch)
+includedir = $(prefix)/include
+infodir = $(datarootdir)/info
+vendorlibdir = $(vendordir)/$(ruby_version)
+sysconfdir = $(prefix)/etc
+libdir = $(exec_prefix)/lib
+sbindir = $(exec_prefix)/sbin
+rubylibdir = $(libdir)/ruby/$(ruby_version)
+docdir = $(datarootdir)/doc/$(PACKAGE)
+dvidir = $(docdir)
+vendordir = $(libdir)/ruby/vendor_ruby
+datarootdir = $(prefix)/share
+pdfdir = $(docdir)
+archdir = $(rubylibdir)/$(arch)
+sitearchdir = $(sitelibdir)/$(sitearch)
+datadir = $(datarootdir)
+localstatedir = $(prefix)/var
+sitelibdir = $(sitedir)/$(ruby_version)
+
+CC = gcc
+LIBRUBY = $(LIBRUBY_A)
+LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
+LIBRUBYARG_SHARED = -Wl,-R -Wl,$(libdir) -L$(libdir) 
+LIBRUBYARG_STATIC = -l$(RUBY_SO_NAME)-static
+
+RUBY_EXTCONF_H = 
+CFLAGS   =  -fPIC -g -O2 $(cflags) 
+INCFLAGS = -I. -I. -I/usr/local/lib/ruby/1.8/i686-linux -I.
+DEFS     = -D_FILE_OFFSET_BITS=64
+CPPFLAGS =   -D_FILE_OFFSET_BITS=64 
+CXXFLAGS = $(CFLAGS) 
+ldflags  = -L.  -rdynamic -Wl,-export-dynamic
+dldflags = 
+archflag = 
+DLDFLAGS = $(ldflags) $(dldflags) $(archflag)
+LDSHARED = $(CC) -shared
+AR = ar
+EXEEXT = 
+
+RUBY_INSTALL_NAME = ruby
+RUBY_SO_NAME = ruby
+arch = i686-linux
+sitearch = i686-linux
+ruby_version = 1.8
+ruby = /usr/local/bin/ruby
+RUBY = $(ruby)
+RM = rm -f
+MAKEDIRS = mkdir -p
+INSTALL = /usr/bin/install -c
+INSTALL_PROG = $(INSTALL) -m 0755
+INSTALL_DATA = $(INSTALL) -m 644
+COPY = cp
+
+#### End of system configuration section. ####
+
+preload = 
+
+libpath = . $(libdir)
+LIBPATH =  -L. -L$(libdir) -Wl,-R$(libdir)
+DEFFILE = 
+
+CLEANFILES = mkmf.log
+DISTCLEANFILES = 
+
+extout = 
+extout_prefix = 
+target_prefix = 
+LOCAL_LIBS = 
+LIBS =  -lstdc++  -lrt -ldl -lcrypt -lm   -lc
+SRCS = tx_swig_wrap.cxx tx.cpp tx_swig.cpp ssv.cpp
+OBJS = tx_swig_wrap.o tx.o tx_swig.o ssv.o
+TARGET = tx_core
+DLLIB = $(TARGET).so
+EXTSTATIC = 
+STATIC_LIB = 
+
+BINDIR        = $(bindir)
+RUBYCOMMONDIR = $(sitedir)$(target_prefix)
+RUBYLIBDIR    = $(sitelibdir)$(target_prefix)
+RUBYARCHDIR   = $(sitearchdir)$(target_prefix)
+
+TARGET_SO     = $(DLLIB)
+CLEANLIBS     = $(TARGET).so $(TARGET).il? $(TARGET).tds $(TARGET).map
+CLEANOBJS     = *.o *.a *.s[ol] *.pdb *.exp *.bak
+
+all:		$(DLLIB)
+static:		$(STATIC_LIB)
+
+clean:
+		@-$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES)
+
+distclean:	clean
+		@-$(RM) Makefile $(RUBY_EXTCONF_H) conftest.* mkmf.log
+		@-$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
+
+realclean:	distclean
+install: install-so install-rb
+
+install-so: $(RUBYARCHDIR)
+install-so: $(RUBYARCHDIR)/$(DLLIB)
+$(RUBYARCHDIR)/$(DLLIB): $(DLLIB)
+	$(INSTALL_PROG) $(DLLIB) $(RUBYARCHDIR)
+install-rb: pre-install-rb install-rb-default
+install-rb-default: pre-install-rb-default
+pre-install-rb: Makefile
+pre-install-rb-default: Makefile
+$(RUBYARCHDIR):
+	$(MAKEDIRS) $@
+
+site-install: site-install-so site-install-rb
+site-install-so: install-so
+site-install-rb: install-rb
+
+.SUFFIXES: .c .m .cc .cxx .cpp .C .o
+
+.cc.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.cxx.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.cpp.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.C.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.c.o:
+	$(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) -c $<
+
+$(DLLIB): $(OBJS) Makefile
+	@-$(RM) $@
+	$(LDSHARED) -o $@ $(OBJS) $(LIBPATH) $(DLDFLAGS) $(LOCAL_LIBS) $(LIBS)
+
+
+
+###
+ssv.o: ssv.cpp ssv.hpp
+tx_core.o: tx.cpp tx.hpp ssv.hpp
+tx_swig.o: tx_swig.cpp tx_swig.h
+tx_swig_wrap.o: tx_swig_wrap.cxx tx_swig.h tx.hpp ssv.hpp
+tx_swig_wrap.cxx: tx_swig.i tx_swig.h
+	swig -c++ -ruby -initname tx_core tx_swig.i

data/ext/depend

@@ -0,0 +1,6 @@
+ssv.o: ssv.cpp ssv.hpp
+tx_core.o: tx.cpp tx.hpp ssv.hpp
+tx_swig.o: tx_swig.cpp tx_swig.h
+tx_swig_wrap.o: tx_swig_wrap.cxx tx_swig.h tx.hpp ssv.hpp
+tx_swig_wrap.cxx: tx_swig.i tx_swig.h
+	swig -c++ -ruby -initname tx_core tx_swig.i

data/ext/extconf.rb

@@ -0,0 +1,15 @@
+require "rbconfig"
+require "mkmf"
+
+if RbConfig::CONFIG["sitearch"] == "i386-msvcrt" && !arg_config("--force-build")
+  # Pre-built binary exists. No need to compile.
+  # Cheats on mkmf.rb not to claim about missing Makefile.
+  $makefile_created= true
+else
+  if have_library("stdc++")
+    create_makefile("tx_core")
+  else
+    $stderr.puts("-lstdc++ is required")
+    exit(1)
+  end
+end

data/ext/ssv.cpp

@@ -0,0 +1,355 @@
+#include "ssv.hpp"
+
+namespace tx_tool{
+
+  ssv::ssv(const uint _size):
+    B(NULL),size(0),oneNum(0),levelL(NULL),levelM(NULL), no_delete(false){
+    if (resize(_size) == -1) return;
+  }
+
+  ssv::ssv(std::vector<bool>& bv):
+    B(NULL),size(0),oneNum(0),levelL(NULL),levelM(NULL), no_delete(false){
+    if (resize((uint)bv.size()) == -1) return;
+    for (uint i = 0; i < (uint)bv.size(); i++){
+      setBit(i,bv[i]);
+    }
+  }
+
+  int ssv::resize(const uint _size){
+    free();
+    size = _size;
+    blockSize = size/SSV_BLOCK + 1;
+    isBuild = false;
+    B = new uint [blockSize];
+    if (B == NULL){
+      return -1;
+    }
+    memset(B,0,sizeof(uint)*blockSize);
+
+    LBlockSize = size / SSV_LBLOCK + 1;
+    MBlockSize = size / SSV_MBLOCK + 1;
+
+    levelL = new uint [LBlockSize];
+    levelM = new uchar [MBlockSize];
+    return 0;
+  }
+
+  void ssv::free(){
+    if (!no_delete){
+      if (B){
+	delete[] B; 
+	B=NULL;
+      }
+    }
+    if (levelL){
+      delete[] levelL; 
+      levelL=NULL;
+    }
+    if (levelM){
+      delete[] levelM;
+      levelM=NULL;
+    }
+  }
+
+  ssv::~ssv(){
+    free();
+  }
+
+  uint ssv::getBits(const uint pos, uint width) const{
+    assert(width <=32);
+    assert(pos+width <= size);
+    if (width == 0) return 0;
+
+    //---: block version
+    const uint endPos = pos+width-1;
+    const uint blockPos_1 = pos / SSV_BLOCK;
+    const uint blockPos_2 = endPos / SSV_BLOCK;
+    const uint offset_1   = pos % SSV_BLOCK;
+
+    if (blockPos_1 == blockPos_2){
+      if (width == 32){
+	return B[blockPos_1]; //avoid 1U << 32
+      }
+      else {
+	return (B[blockPos_1] >> offset_1) & ((1U << width) - 1);
+      }
+    }
+    else {
+      const uint offset_2   = endPos % SSV_BLOCK;
+      return  (B[blockPos_1] >> offset_1) + ((B[blockPos_2] & ((1U << (offset_2+1U))-1U)) << (32U-offset_1));
+    }		
+  }
+
+  void ssv::setBits(const uint pos, const uint width, const uint x){
+    assert(width <= 32);
+    assert(pos+width <= size);
+    if (width == 0) return;
+
+    //---: block version ----
+    const uint endPos     = pos+width-1;
+    const uint blockPos_1 = pos / SSV_BLOCK;
+    const uint blockPos_2 = endPos / SSV_BLOCK;
+    const uint offset_1   = pos % SSV_BLOCK;
+
+    if (blockPos_1 == blockPos_2){
+      if (width == 32){
+	B[blockPos_1] = x;
+      }
+      else {
+	B[blockPos_1] &= ~(((1U << width)-1) << offset_1); // |1111110000000111111|
+	B[blockPos_1] |= (x << offset_1);                  //        xxxxxxx
+      }
+    }
+    else {
+      const uint offset_2 = endPos % SSV_BLOCK;
+      B[blockPos_1] &= ((1U << offset_1)-1U);		
+      B[blockPos_1] |= (x << offset_1);
+      B[blockPos_2] &= ~((1U << (offset_2+1U))-1U);
+      B[blockPos_2] |= (x >> (32-offset_1));
+    }
+  }
+
+
+  uint ssv::rank(uint pos, const uint bit) const{
+    pos++;
+    if (bit == 0) return pos-_rank1(pos);
+    else		  return _rank1(pos);
+  }
+
+  uint ssv::select(const uint pos, const uint bit) const{
+    if (bit) return _select1(pos);
+    else     return _select0(pos);
+  }
+
+  void ssv::setBit(uint pos, uint x){
+    if (!x) B[pos / SSV_BLOCK] &= (~(1U << (pos % SSV_BLOCK)));
+    else    B[pos / SSV_BLOCK] |=   (1U << (pos % SSV_BLOCK));
+  }
+
+  uint ssv::getAllocate() const{
+    uint sum = size;
+    if (isBuild){
+      sum += LBlockSize * 32 + MBlockSize * 8;
+    }
+    return sum;
+  }
+
+  void ssv::build(){
+    oneNum = rankBuild(size);
+    isBuild = true;
+  }
+
+  uint ssv::rankBuild(const uint t_size){
+    uint sum = 0;
+    for (uint il = 0; il <= t_size ;il += SSV_LBLOCK){
+      levelL[il/SSV_LBLOCK] = sum;
+      for (uint im = 0; im < SSV_LBLOCK && il+im <= t_size; im += SSV_MBLOCK){
+	levelM[(il+im)/SSV_MBLOCK] = sum - levelL[il/SSV_LBLOCK];
+	for (uint is = 0; is < SSV_MBLOCK && (il+im+is) <= t_size; is += SSV_BLOCK){
+	  sum += popCount(B[(il+im+is)/SSV_BLOCK]);
+	}
+      }
+    }
+    return sum;
+  }
+
+
+  int ssv::write(FILE* outfp){
+    if (fwrite(&size,sizeof(uint),1,outfp) != 1){
+      return -1;
+    }
+    if (fwrite(B,sizeof(uint),blockSize,outfp) != blockSize){
+      return -1;
+    }
+    if (fwrite(levelL,sizeof(uint),LBlockSize,outfp) != LBlockSize){
+      return -1;
+    }
+    if (fwrite(levelM,sizeof(uchar),MBlockSize,outfp) != MBlockSize){
+      return -1;
+    }
+    return 0;
+  }
+
+  int ssv::read(FILE* infp){
+    if (fread(&size,sizeof(uint),1,infp) != 1){
+      return -1;
+    }
+    if (resize(size) == -1){
+      return -1;
+    }
+
+    if (fread(B,sizeof(uint),blockSize,infp) != blockSize){
+      return -1;
+    }
+    isBuild = true;
+
+    if (fread(levelL,sizeof(uint),LBlockSize,infp) != LBlockSize){
+      return -1; 
+    }
+    if (fread(levelM,sizeof(uchar),MBlockSize,infp) != MBlockSize){
+      return -1;
+    }
+    return 0;
+  }
+
+  size_t ssv::set_array(void* ptr){
+    size = *(uint*)(ptr);
+
+    blockSize = size/SSV_BLOCK + 1;
+    isBuild = false;
+    LBlockSize = size / SSV_LBLOCK + 1;
+    MBlockSize = size / SSV_MBLOCK + 1;
+  
+    B = ((uint*)ptr + 1);
+    levelL = ((uint*)ptr + 1 + blockSize);
+    levelM = ((uchar*)ptr + sizeof(uint)*(1 + blockSize + LBlockSize));
+
+    no_delete = true;
+    return sizeof(uint)*(1 + blockSize + LBlockSize) + MBlockSize;
+  }
+  
+  
+  uint ssv::getBlock(const uint blockPos) const {
+    return B[blockPos]; 
+  }
+
+  void ssv::setBlock(const uint blockPos, const uint x) {
+    B[blockPos] = x; 
+  }
+
+  uint ssv::getSize() const {
+    return size;
+  }
+
+  uint ssv::getBlockSize() const {
+    return blockSize;
+  }
+
+  uint ssv::popCount(uint r) const{
+    r = ((r & 0xAAAAAAAA) >> 1) + (r & 0x55555555);
+    r = ((r & 0xCCCCCCCC) >> 2) + (r & 0x33333333);
+    r = ((r >> 4) + r) & 0x0F0F0F0F;
+    r = (r>>8) + r;
+    return ((r>>16) + r) & 0x3F;
+  }
+
+  uint ssv::_rank1(const uint pos) const{
+    if (pos > size){
+      fprintf(stderr,"_rank1 range error pos:%d size:%d\n",pos,size);
+      return (uint)-1;
+    }
+    //printf("pos:%d size:%d lr:%d lp:%d mr:%d \n",pos,size,levelL[pos >> SSV_LBLOCK_SHIFT],pos >> SSV_LBLOCK_SHIFT,levelM[pos >> SSV_MBLOCK_SHIFT]);
+    return levelL[pos >> SSV_LBLOCK_SHIFT] + 
+      levelM[pos >> SSV_MBLOCK_SHIFT] + 
+      popCount((B[pos >> SSV_BLOCK_SHIFT] & ((1U << (pos  % SSV_BLOCK))-1)));
+  }
+
+  uint ssv::_select0(uint x) const{
+    uint left  = 0;
+    uint right = LBlockSize;
+    while (left < right){
+      uint mid = (left+right)/2;
+      if (SSV_LBLOCK * mid - levelL[mid] < x) left  = mid+1;
+      else                 right = mid;
+    }
+    uint posL = (left != 0) ? left-1: 0;
+
+    // sequential search over levelB
+    uint posM = posL * (SSV_LBLOCK/SSV_MBLOCK);
+    x -= (SSV_LBLOCK*posL - levelL[posL]);
+
+    uint mstep = SSV_LBLOCK/SSV_MBLOCK;
+    while ((posM+1 < MBlockSize) && (((posM+1)%mstep) != 0) && (SSV_MBLOCK*((posM+1)%mstep)-levelM[posM+1] < x)){
+      posM++;
+    }
+
+    x -= (SSV_MBLOCK*(posM % mstep) - levelM[posM]);
+
+    uint ret    = posM * SSV_MBLOCK;
+    uint posB   = posM * (SSV_MBLOCK/SSV_BLOCK);
+    uint rank32 = 32- popCount(B[posB]);
+    if (rank32 < x){
+      posB++;
+      ret += SSV_BLOCK;
+      x -= rank32;
+    }
+
+    uint curB   = B[posB];
+    uint rank16 = 16-popCount(curB & ((1U<<16)-1));
+    if (rank16 < x){
+      curB >>= 16;
+      ret += 16;
+      x -= rank16;
+    }
+
+    uint rank8  = 8-popCount(curB & ((1U << 8)-1));
+    if (rank8 < x){
+      curB >>= 8;
+      ret += 8;
+      x -= rank8;
+    }
+
+    while (x > 0){
+      if ((~curB) & 1){
+	x--;
+      }
+      curB >>= 1;
+      ret++;
+    }
+    return ret-1;
+  }
+
+  uint ssv::_select1(uint x) const{
+    uint left  = 0;
+    uint right = LBlockSize;
+    while (left < right){
+      uint mid = (left+right)/2;
+      if (levelL[mid] < x) left  = mid+1;
+      else                 right = mid;
+    }
+    uint posL = (left != 0) ? left-1: 0;
+
+    // sequential search over levelB
+    uint posM = posL * (SSV_LBLOCK/SSV_MBLOCK);
+    x -= levelL[posL];
+    while ((posM+1 < MBlockSize) && (((posM+1)%(SSV_LBLOCK/SSV_MBLOCK)) != 0) && (levelM[posM+1] < x)){
+      posM++;
+    }
+
+    x -= levelM[posM];
+
+    uint ret    = posM * SSV_MBLOCK;
+    uint posB   = posM * (SSV_MBLOCK/SSV_BLOCK);
+    uint rank32 = popCount(B[posB]);
+    if (rank32 < x){
+      posB++;
+      ret += SSV_BLOCK;
+      x -= rank32;
+    }
+
+    uint curB   = B[posB];
+    uint rank16 = popCount(curB & ((1U<<16)-1));
+    if (rank16 < x){
+      curB >>= 16;
+      ret += 16;
+      x -= rank16;
+    }
+
+    uint rank8  = popCount(curB & ((1U << 8)-1));
+    if (rank8 < x){
+      curB >>= 8;
+      ret += 8;
+      x -= rank8;
+    }
+
+    while (x > 0){
+      if (curB & 1){
+	x--;
+      }
+      curB >>= 1;
+      ret++;
+    }
+    return ret-1;
+  }
+
+}