bitvector.cpp

// $Id$
// Author: John Wu <John.Wu at ACM.org> Lawrence Berkeley National Laboratory
// Copyright 2000-2014 the Regents of the University of California
//
// The implementation of class bitvector as defined in bitvector.h.
// The major goal of this implementation is to avoid accessing anything
// smaller than a word (uint32_t).
//
//#include<iostream> //only used for test. should be deleted when in use.
#include<iostream>


#if defined(_WIN32) && defined(_MSC_VER)
#pragma warning(disable:4786)	// some identifier longer than 256 characters
#endif
#include "bitvector.h"

#include <iomanip>	// setw

// constances defined in bitvector
const unsigned ibis::bitvector::MAXBITS =
8*sizeof(ibis::bitvector::word_t) - 1;
const unsigned ibis::bitvector::SECONDBIT =
ibis::bitvector::MAXBITS - 1;
const ibis::bitvector::word_t ibis::bitvector::ALLONES =
((1U << ibis::bitvector::MAXBITS) - 1);
const ibis::bitvector::word_t ibis::bitvector::MAXCNT =
((1U << ibis::bitvector::SECONDBIT) - 1);
const ibis::bitvector::word_t ibis::bitvector::MAXCNT_COMPAX = 
((1U << (ibis::bitvector::SECONDBIT-1) -1 ));
const ibis::bitvector::word_t ibis::bitvector::FILLBIT =
(1U << ibis::bitvector::SECONDBIT);
const ibis::bitvector::word_t ibis::bitvector::HEADER0 =
(2U << ibis::bitvector::SECONDBIT);
const ibis::bitvector::word_t ibis::bitvector::HEADER1 =
(3U << ibis::bitvector::SECONDBIT);
const ibis::bitvector::word_t ibis::bitvector::HEADER0_COMPAX =
(4U << (ibis::bitvector::MAXBITS - 2));
const ibis::bitvector::word_t ibis::bitvector::HEADER1_COMPAX =
(7U << (ibis::bitvector::MAXBITS - 2));
const ibis::bitvector::word_t ibis::bitvector::HEADER_LFL_COMPAX = 
(5U << (ibis::bitvector::MAXBITS - 2));
const ibis::bitvector::word_t ibis::bitvector::HEADER_FLF_COMPAX = 
(6U << (ibis::bitvector::MAXBITS - 2));

const ibis::bitvector::word_t ibis::bitvector::COMPAX_DIRTYMASK4 = 
(255U<<24);
const ibis::bitvector::word_t ibis::bitvector::COMPAX_DIRTYMASK3 =  
(255U<<16);
const ibis::bitvector::word_t ibis::bitvector::COMPAX_DIRTYMASK2 =  
(255U<<8);
const ibis::bitvector::word_t ibis::bitvector::COMPAX_DIRTYMASK1 =
(255u);



/// Default constructor.  Creates a new empty bitvector.
ibis::bitvector::bitvector() : nbits(0), nset(0), active(), m_vec() {
    LOGGER(ibis::gVerbose > 9)
	<< "bitvector (" << static_cast<void*>(this)
	<< ") constructed with m_vec at " << static_cast<void*>(&m_vec);
} // ctor default

/// Copy constructor.  The underlying storage (m_vec) is constructed
/// through a copy constructor as well.
ibis::bitvector::bitvector(const bitvector& bv)
    : nbits(bv.nbits), nset(bv.nset), active(bv.active), m_vec(bv.m_vec) {
    LOGGER(ibis::gVerbose > 9)
	<< "bitvector (" << static_cast<void*>(this)
	<< ") constructed with m_vec at " << static_cast<void*>(&m_vec)
	<< " as a copy of " << static_cast<const void*>(&bv)
	<< " with m_vec at " << static_cast<const void*>(&(bv.m_vec));
}

/// Construct a bitvector from an array.  Because the array copy
/// constructor performs shallow copy, this bitvector is not using any new
/// space for the underlying vector.
ibis::bitvector::bitvector(const array_t<ibis::bitvector::word_t>& arr)
    : nbits(0), nset(0), m_vec(arr) {
    if (m_vec.size() > 1) { // non-trivial size
	if (m_vec.back() > 0) { // has active bits
	    if (m_vec.back() < MAXBITS) {
		active.nbits = m_vec.back();
		m_vec.pop_back();
		active.val = m_vec.back();
	    }
	    else {
		LOGGER(ibis::gVerbose > 0)
		    << "Warning -- the serialized version of bitvector "
		    "contains an unexpected last word (" << m_vec.back() << ')';
#if DEBUG+0 > 1 || _DEBUG+0 > 1
		{ // print the array out
		    word_t nb = 0;
		    ibis::util::logger lg(4);
		    lg() << "bitvector constructor received an array["
			 << arr.size() << "] with the following values:";
		    for (word_t i = 0; i < arr.size(); ++ i) {
			if (arr[i] < HEADER0)
			    nb += MAXBITS;
			else
			    nb += (arr[i] & MAXCNT) * MAXBITS;
			lg() << "\n" << i << ",\t0x" << std::hex
			     << std::setw(8) << std::setfill('0')
			     << arr[i] << std::dec << "\tnb=" << nb;
		    }
		}
// 		throw ibis::bad_alloc("bitvector -- the input is not a "
// 				      "serialized bitvector");
#endif
	    }
	}
	else {
	    active.reset();
	}
	m_vec.pop_back();

#if defined(WAH_CHECK_SIZE)
	nbits = do_cnt(); // count the number of bits
#endif
    }
    else { // a one-word bitvector can only be an empty one
	clear();
    }
    LOGGER(ibis::gVerbose > 9)
	<< "bitvector (" << static_cast<void*>(this)
	<< ") constructed with m_vec at " << static_cast<void*>(&m_vec)
	<< " based on an array_t<word_t> at " << static_cast<const void*>(&arr)
	<< " with m_begin at " << static_cast<const void*>(arr.begin());
} // ctor from array_t

/// Constructor.  Reconstruct a bitvector from a file.
ibis::bitvector::bitvector(const char* file) : nbits(0), nset(0) {
    if (file == 0 || *file == 0) return;

    try {
	read(file);
	LOGGER(ibis::gVerbose > 9)
	    << "bitvector (" << static_cast<void*>(this)
	    << ") constructed with m_vec at " << static_cast<void*>(&m_vec)
	    << " by reading file " << file;
    }
    catch(...) {
	clear();
	LOGGER(ibis::gVerbose > 9)
	    << "bitvector constructed an empty bitvector with m_vec at "
	    << static_cast<void*>(&m_vec) << " due to exception from read("
	    << file << ')';
	/*return empty bitvector*/
    }
} // ctor from file

/// Remove the existing content of a bitvector.  The underlying storage is
/// not released until the object is actual freed.
void ibis::bitvector::clear() {
    nset = 0;
    nbits = 0;
    m_vec.clear();
    active.reset();
    LOGGER(ibis::gVerbose > 9)
	<< "bitvector (" << static_cast<void*>(this)
	<< ") clear the content of bitvector with m_vec at "
	<< static_cast<void*>(&m_vec);
} // ibis::bitvector::clear

/// Create a vector with @c n bits of value @c val (cf. memset()).
///@note @c val must be either 0 or 1.
void ibis::bitvector::set(int val, ibis::bitvector::word_t n) {
    clear(); // clear the current content
    m_vec.nosharing(); // make sure the array is not shared
    word_t k = n / MAXBITS;

    if (k > 1) {
	append_counter(val, k);
    }
    else if (k == 1) {
	if (val != 0) active.val = ALLONES;
	else active.val = 0;
	append_active();
    }

    // put the left over bits into active
    active.nbits = n - k * MAXBITS;
    if (val != 0) {
	active.val = (1U << active.nbits) - 1;
	nset = k * MAXBITS;
    }
} // ibis::bitvector::set

/// Append a WAH word.
/// The incoming argument @c w is assumed to be a WAH compressed word.
void ibis::bitvector::appendWord(ibis::bitvector::word_t w) {
    word_t nb1, nb2;
    int cps = (w>>MAXBITS);
    nset = 0;
    if (active.nbits) { // active contains some uncompressed bits
	word_t w1;
	nb1 = active.nbits;
	nb2 = MAXBITS - active.nbits;
	active.val <<= nb2;
	if (cps != 0) { // incoming bits are comporessed
	    int b2 = (w>=HEADER1);
	    if (b2 != 0) {
		w1 = (1<<nb2)-1;
		active.val |= w1;
	    }
	    append_active();
	    nb2 = (w & MAXCNT) - 1;
	    if (nb2 > 1) {		// append a counter
		append_counter(b2, nb2);
	    }
	    else if (nb2 == 1) {
		if (b2 != 0) active.val = ALLONES;
		append_active();
	    }
	    active.nbits = nb1;
	    active.val = ((1 << nb1) - 1)*b2;
	}
	else { // incoming bits are not compressed
	    w1 = (w>>nb1);
	    active.val |= w1;
	    append_active();
	    w1 = (1<<nb1)-1;
	    active.val = (w & w1);
	    active.nbits = nb1;
	}
    } // end of the case where there are active bits
    else if (cps != 0) { // no active bit
	int b2 = (w>=HEADER1);
	nb2 = (w & MAXCNT);
	if (nb2 > 1)
	    append_counter(b2, nb2);
	else if (nb2 == 1) {
	    if (b2) active.val = ALLONES;
	    append_active();
	}
    }
    else { // no active bits
	// new word is a raw bit pattern, simply add the word
	active.val= w;
	append_active();
    }
} // ibis::bitvector::appendWord

 /// Append a bitvector.
ibis::bitvector& ibis::bitvector::operator+=(const ibis::bitvector& bv) {
    if (nset>0 && bv.nset>0)
	nset += bv.nset;
    else
	nset = 0;
    word_t expbits = size() + bv.size();

    // append the words in bv.m_vec
    for (array_t<word_t>::const_iterator i=bv.m_vec.begin();
	 i!=bv.m_vec.end(); i++)
	appendWord(*i);

    // append active bits of bv
    if (active.nbits > 0) { // need to combine the two active bit sets
	if (active.nbits + bv.active.nbits < MAXBITS) {
	    // two active words can fit into one
	    active.val <<= bv.active.nbits;
	    active.val |= bv.active.val;
	    active.nbits += bv.active.nbits;
	}
	else { // two sets can not fit into one single word
	    const word_t nb1 = (active.nbits + bv.active.nbits) - MAXBITS;
	    active.val <<= (MAXBITS - active.nbits);
	    word_t w1 = (bv.active.val >> nb1);
	    active.val |= w1;
	    append_active();
	    active.nbits = nb1;
	    if (nb1 > 0)
		active.val = ((1U << nb1) - 1) & bv.active.val;
	}
    }
    else { // simply copy the active_word from bv the *this
	active.nbits = bv.active.nbits;
	active.val = bv.active.val;
    }

    LOGGER(expbits != size() && ibis::gVerbose > 0)
	<< "Warning -- bitvector::operator+= expected " << expbits
	<< " bits in the resulting bitvector, but got " << size();
    return *this;
} // ibis::bitvector::operator+=

//compress_compax function
void ibis::bitvector::compress_compax() {
    
	if (m_vec.size() < 2 || m_vec.incore() == false) // there is nothing to do
	return;

    struct xrun {
	bool   isFill;
	int    fillBit;
	bool	isDirty;
	int dirtyPos;
	word_t nWords;
	array_t<word_t>::iterator it;

	xrun() : isFill(false), fillBit(0), isDirty(0), dirtyPos(0), nWords(0), it(0) {};
	void decode() {
	    fillBit = (*it > HEADER1);
	    isFill = (*it > ALLONES);
		if(isFill && fillBit) *it = *it | 0xE0000000;
		isDirty =( (int)(bool)(*it & COMPAX_DIRTYMASK1)+(int)(bool)(*it & COMPAX_DIRTYMASK2)+(int)(bool)(*it & COMPAX_DIRTYMASK3)+(int)(bool)(*it & COMPAX_DIRTYMASK4) == 1 );
		dirtyPos = ((int)(bool)(*it & COMPAX_DIRTYMASK4) << 3 )+ ((int)(bool)(*it & COMPAX_DIRTYMASK3) << 2) + ((int)(bool)(*it & COMPAX_DIRTYMASK2) << 1 ) + ((int)(bool)(*it & COMPAX_DIRTYMASK1));   // More efficient
		nWords = (*it & MAXCNT);
	}
    };

	xrun beforeLast; //point to the code word before last code in m_vec.
    xrun last;	// point to the last code word in m_vec that might be modified
                // NOTE: last.nWords is not used by this function
    xrun current;// point to the current code to be examined

	bool existBeforeLast = false;
	bool  existLast = true;
	word_t wah_size = m_vec.end() - m_vec.begin(); // count the wah's size.

    current.it = m_vec.begin();
    last.it = m_vec.begin();
	beforeLast.it = m_vec.begin();

	//predeal, merge all fills. supposed to be finished by compress(), so do not need to repeat it.
/*	for (++ current.it; current.it < m_vec.end(); ++ current.it) {
	current.decode();
	last.decode();
	beforeLast.decode();
	if (last.isFill) { // last word was a fill word
	    if (current.isFill) { // current word is a fill word
		if (current.fillBit == last.fillBit) { // same type of fill
		    *(last.it) += current.nWords;
		}
		else { // different types of fills, move last foward by one
		    ++ last.it;
		    *(last.it) = *(current.it);
		}
	    }
	    else if ((last.fillBit == 0 && *(current.it) == 0) ||
		     (last.fillBit != 0 && *(current.it) == ALLONES)){
		// increase the last fill by 1 word
		++ *(last.it);
	    }
	    else  { // move last forward by one
		++ last.it;
		*(last.it) = *(current.it);
	    }
	}
	else if (current.isFill) {
	    // last word was a literal word, current word is a fill word
	    if ((current.fillBit == 0 && *(last.it) == 0) ||
		(current.fillBit != 0 && *(last.it) == ALLONES)) {
		// change the last word into a fill word
		*(last.it) = *(current.it) + 1;
	    }
	    else { // move last forward by one
		++ last.it;
		last.isFill = true;
		*(last.it) = *(current.it);
	    }
	}
	else if (*(last.it) == *(current.it)) {
	    // both last word and current word are literal words and are
	    // the same
	    if (*(current.it) == 0) { // make a 2-word 0-fill
		*(last.it) = HEADER0 | 2;
	    }
	    else if (*(current.it) == ALLONES) { // make a 2-word 1-fill
		*(last.it) = HEADER1 | 2;
	    }
	    else { // move last forward
		++ last.it;
		*(last.it) = *(current.it);
	    }
	}
	else { // move last forward one word
	    ++ last.it;
	    *(last.it) = *(current.it);
	}
    }
    ++ last.it;
    if (last.it < m_vec.end()) { // reduce the size of m_vec
	m_vec.erase(last.it, m_vec.end());
    }
*/	
	//next step, find all LFL/FLF
    for (++ current.it; current.it < m_vec.end(); ++ current.it) {
	current.decode();
	last.decode();
	beforeLast.decode();

	if(!existLast)
	{
		*(last.it) = *(current.it);
		existBeforeLast = false; 
		existLast = true;
	}
	else if(!existBeforeLast){
	if (last.isFill) { // last word was a fill word
	    if (current.isFill) { // current word is a fill word
		if (current.fillBit == last.fillBit) { // same type of fill
		    *(last.it) += current.nWords;
		}
		else { // different types of fills, move last foward by one
			*(beforeLast.it) = *(last.it);
			last.it++;
			*(last.it) = *(current.it);
			existBeforeLast = true; //set flag to true.
		//	 last.fillBit = current.fillBit;
		}
	    }
/*	    else if ((last.fillBit == 0 && *(current.it) == 0) ||
		     (last.fillBit != 0 && *(current.it) == ALLONES)){
		// increase the last fill by 1 word
		++ *(last.it);
	    }
*/ //  used to be fail-safe code, but seems not necessary.

	    else  { // move last forward by one
			*(beforeLast.it) = *(last.it);
			last.it++;
			*(last.it) = *(current.it);
		existBeforeLast = true;
	    }
	}
	else if (current.isFill) {
	    // last word was a literal word, current word is a fill word
/*	    if ((current.fillBit == 0 && *(last.it) == 0) ||
		(current.fillBit != 0 && *(last.it) == ALLONES)) {
		// change the last word into a fill word
			*(last.it) = current.nWords + 1;
			if(current.fillBit == 0) {*(last.it) += HEADER0;}//equals to change last's type to fill. Since will decode every loop, next two sentences should be deleted.
			else {*(last.it) += HEADER1;}
		}
	    else { */   // used to be fail-safe code, but seems not necessary.
		
		// move last forward by one
			*(beforeLast.it) = *(last.it);
			last.it++;
			*(last.it) = *(current.it);
		existBeforeLast = true;
		}
	else if (*(last.it) == *(current.it)) {
	    // both last word and current word are literal words and are
	    // the same
	    if (*(current.it) == 0) { // make a 2-word 0-fill
		*(last.it) = HEADER0 | 2;
	    }
	    else if (*(current.it) == ALLONES) { // make a 2-word 1-fill
		*(last.it) = HEADER1 | 2;
	    }
	    else { // move last forward
			*(beforeLast.it) = *(last.it);
			last.it++;
			*(last.it) = *(current.it);
			existBeforeLast = true;
	    }
	}
	else { // move last forward one word
			*(beforeLast.it) = *(last.it);
			last.it++;
			*(last.it) = *(current.it);
			existBeforeLast = true;
	}
    }
	else{
		if(beforeLast.isFill == true){
			if(last.isFill == true){
				if(current.isFill == true){
					if(last.fillBit == current.fillBit){
						*(last.it) += current.nWords;
					}
					else{
						beforeLast.it++;
						*(beforeLast.it) = *(last.it);
						last.it++;
						*(last.it) = *(current.it);
					}
				}
				else{
	/*				if((last.fillBit == 0 || *(current.it)==0)&&(last.fillBit!=0 || *(current.it)== ALLONES)){ // FFL, L=2nd F
						*(last.it)++;
					}
					else{ */
					//FFL,L cannot combine with F
					beforeLast.it++;
					*(beforeLast.it) = *(last.it);
					last.it++;
					*(last.it) = *(current.it);
					}
				}
			
			else{ //FL
				if(current.isFill){ //FLF
				/*	if((current.fillBit == 0 || *(last.it)==0)&&(current.fillBit!=0 || *(last.it)== ALLONES)){		//L & F are the same
						*(last.it) = current.nWords + 1;
						if(current.fillBit==0){*(last.it) += HEADER0;}
						else{*(last.it)+= HEADER1;}
					}
					else{*/
						if(!last.isDirty){ //L not dirty
						beforeLast.it++;
						*(beforeLast.it) = *(last.it);
						last.it++;
						*(last.it) = *(current.it);
						}
						else { //L dirty
							if(beforeLast.fillBit != current.fillBit){ // not the same fill. should be modified in SECOMPAX and ICX
								beforeLast.it++;
								*(beforeLast.it) = *(last.it);
								last.it++;
								*(last.it) = *(current.it);
							}
							else{ 
								if(((*(beforeLast.it)&0x3fffffff)>0x000000ff)||(((*(current.it))&0x3fffffff)>0x000000ff))
								{
									beforeLast.it++;
									*(beforeLast.it) = *(last.it);
									last.it++;
									*(last.it) = *(current.it);
								}
								else{
								//FLF encode
								*(beforeLast.it) = beforeLast.nWords << 16;
								switch (last.dirtyPos){
								case 8: *(beforeLast.it) += (*(last.it) >>16); *(beforeLast.it) += (3U << 25);  break;
								case 4: *(beforeLast.it) += (*(last.it) >>8); *(beforeLast.it) += (2U << 25); break;
								case 2: *(beforeLast.it) += *(last.it) ; *(beforeLast.it) += (1U << 25); break;
								case 1: *(beforeLast.it) += (*(last.it) <<8); break;
								}
								if (current.fillBit) {*(beforeLast.it) += (3U << 27);}
								else ;
								*(beforeLast.it) += HEADER_FLF_COMPAX;
								*(beforeLast.it) += current.nWords;
								last.it = beforeLast.it;
								last.it++;
								beforeLast.it++;
								existBeforeLast = false;
								existLast = false;
								}
							}
						}
					}
			
				else{ //FLL
					if(*(last.it)==*(current.it)){
						if(*(current.it)==0){
							*(last.it) = HEADER0 | 2;
						}
						else if(*(current.it)==ALLONES){
							*(last.it) = HEADER1 | 2;
						}
						else{
							beforeLast.it++;
							*(beforeLast.it) = *(last.it);
							last.it++;
							*(last.it) = *(current.it);
						}
					}
					else{ 
					beforeLast.it++;
					*(beforeLast.it) = *(last.it);
					last.it++;
					*(last.it) = *(current.it);
						}
					}
			}	
		}
		else{ //L
			if(!last.isFill){//LL
				if(!current.isFill){//LLL
					if(*(last.it)==*(current.it)){
						if(*(current.it)==0){
							*(last.it) = HEADER0 | 2;
						}
						else if(*(current.it)==ALLONES){
							*(last.it) = HEADER1 | 2;
						}
						else{
							beforeLast.it++;
							*(beforeLast.it) = *(last.it);
							last.it++;
							*(last.it) = *(current.it);
						}	
					}
					else{ //random L
						beforeLast.it++;
					*(beforeLast.it) = *(last.it);
					last.it++;
					*(last.it) = *(current.it);
					}
				}
				else{//LLF
				/*	if((current.fillBit == 0 || *(last.it)==0)&&(current.fillBit!=0 || *(last.it)== ALLONES)){		//L & F are the same
						*(last.it) = current.nWords + 1;
						if(current.fillBit==0){*(last.it) += HEADER0;}
						else{*(last.it)+= HEADER1;}
					}
					else{*/
						// LF cannot combine
						beforeLast.it++;
						*(beforeLast.it) = *(last.it);
						last.it++;
						*(last.it) = *(current.it);
					
				}
			}
			else{//LF
				if(!beforeLast.isDirty){//not dirty
					if(!current.isFill){//LFL (1st L not dirty)
					/*	if((last.fillBit == 0 || *(current.it)==0)&&(last.fillBit != 0 || *(current.it)== ALLONES)){ // FFL, L=2nd F
							*(last.it)++;
						}
						else{ */
							//LFL,L cannot combine with F
						beforeLast.it++;
						*(beforeLast.it) = *(last.it);
						last.it++;
						*(last.it) = *(current.it);						
					}
					else{//LFF (no dirty)
						if(current.fillBit == last.fillBit){ // same kind of fill
							*(last.it) += current.nWords;
						}
						else{//differnet type of fill
								beforeLast.it++;
							*(beforeLast.it) = *(last.it);
							last.it++;
							*(last.it) = *(current.it);
						}	
					}
				}
				else{//fisrt L dirty
					if(current.isFill){//LFF
						if(current.fillBit == last.fillBit){ // same kind of fill
							*(last.it) += current.nWords;
						}
						else{//differnet type of fill
						beforeLast.it++;
						*(beforeLast.it) = *(last.it);
						last.it++;
						*(last.it) = *(current.it);
						}	
					}
					else{//LFL fisrt F dirty
						if(current.isDirty){//LFL encoding!
							if(((*last.it)&0x3fffffff)>0x000000ff)
							{//counter not enough.
								beforeLast.it++;
								*(beforeLast.it) = *(last.it);
								last.it++;
								*(last.it) = *(current.it);
							}
							else{
							switch(beforeLast.dirtyPos){
							case 8: *(beforeLast.it) = (*(beforeLast.it) >> 8); *(beforeLast.it) += (3U << 26); break;
							case 4: *(beforeLast.it) = *(beforeLast.it); *(beforeLast.it) += (2U << 26); break;
							case 2: *(beforeLast.it) = (*(beforeLast.it) << 8); *(beforeLast.it) += (1U << 26); break;
							case 1: *(beforeLast.it) = (*(beforeLast.it) << 16); break;
							} 
							switch(current.dirtyPos){
							case 8: *(beforeLast.it) += (*(current.it) >> 24) ; *(beforeLast.it) += (3U << 24); break;
							case 4: *(beforeLast.it) += (*(current.it) >>16); *(beforeLast.it) += (2U << 24); break;
							case 2: *(beforeLast.it) += (*(current.it) >> 8); *(beforeLast.it) += (1U << 24); break;
							case 1: *(beforeLast.it) += *(current.it); break;
							}
							*(beforeLast.it) += (last.nWords << 8);
							*(beforeLast.it) += (last.fillBit << 28);
							*(beforeLast.it) += HEADER_LFL_COMPAX;						
							last.it = beforeLast.it;
							last.it++;
							beforeLast.it++;
							existBeforeLast = false;
							existLast = false;
							}
						}
						else
						{
							 //LFL,L cannot combine with F
							beforeLast.it++;
							*(beforeLast.it) = *(last.it);
							last.it++;
							*(last.it) = *(current.it);
							
						}
					}
				}
			}
		}
	}
	}
	
	if(existLast) last.it++;

	if (last.it < m_vec.end()) { // reduce the size of m_vec
	m_vec.erase(last.it, m_vec.end());
    }
	//appendWord(wah_size);

} // ibis::bitvector::compress

// Convert stored compax bitvectors into wah for further treatment. (Wen,July 9 2014)

void ibis::bitvector::decompress_compax()
{
	struct xrun {
		bool isLiteral;
		int cpxType;
		int fillType; //only useful for FLF/LFL
		int dirtyBytePos1, dirtyBytePos2;	// only useful for FLF/LFL
		word_t dirtyByte1, dirtyByte2;  // only useful for FLF/LFL
		word_t counter1, counter2;
		array_t<word_t>::iterator it;

		xrun() : isLiteral(false), cpxType(0), dirtyByte1(0), dirtyByte2(0), dirtyBytePos1(0), dirtyBytePos2(0), counter1(0), counter2(0),it(0) {};
		void decode() {
			isLiteral = !(*it >> MAXBITS);
			cpxType = (*it >> MAXBITS - 2) & 3;

			if(!isLiteral)
			{
				if(cpxType == 0) // 0-fill
				{
					fillType = 0;
					counter1 = (*it & 0x3fffffff);
				}
				else if(cpxType == 1)  //LFL
				{
					fillType = (bool)(*it & 0x10000000);
					dirtyBytePos1 = (*it & 0x0cffffff) >> (MAXBITS - 5);
					dirtyBytePos2 = (*it & 0x03ffffff) >> (MAXBITS - 7);
					dirtyByte1 = (*it & 0x00ff0000) >> (MAXBITS -  15);
					dirtyByte2 = (*it & 0x000000ff);
					counter1 = (*it & 0x0000ff00) >> (MAXBITS - 23);
				}
				else if(cpxType == 2)  //FLF
				{
					fillType = bool(*it & 0x10000000);
					dirtyBytePos1 = (*it & 0x06ffffff) >> (MAXBITS - 6);
					dirtyByte1 = (*it & 0x0000ff00) >> (MAXBITS - 23);
					counter1 = (*it & 0x00ff0000) >> (MAXBITS -  15);
					counter2 = (*it & 0x000000ff);
				}
				else if(cpxType == 3) // 1-fill
				{
					fillType = 1;
					counter1 = (*it & 0x3fffffff);
				}
			}
			else;
		}
		};

	xrun current;// point to the current code to be examined
	xrun currentTmp;
	//initialize new bitvector. At last m_vec would be replaced by tmp_vec.
	
	word_t wahLength = *(m_vec.begin());  // read length of wah.
//	int cpxLength = m_vec.size();
	
//	std::cout<<"cpxLength"<<cpxLength<<std::endl;
//	std::cout<<"m_vec.size"<<m_vec.size()<<std::endl;
	
	array_t<word_t> tmp_array(wahLength+1,0);

	bitvector * tmp_vec = new bitvector(tmp_array);

	currentTmp.it = tmp_vec->m_vec.begin();
	current.it = m_vec.begin();
	current.decode();

	for (++current.it; current.it <m_vec.end(); ++ current.it)
	{
		current.decode();
		std::cout<<"cpxType:"<<current.cpxType<<std::endl;
		if(current.isLiteral)
		{
			*currentTmp.it = *current.it;
			currentTmp.it++;
		}
		else
		{
			if(current.cpxType == 0) //0-FILL
			{
				*currentTmp.it = current.counter1;
				*currentTmp.it += 0x80000000;
				currentTmp.it++;
			}
			else if(current.cpxType == 1) //LFL
			{
				switch (current.dirtyBytePos1)
				{
				case 0: *currentTmp.it = current.dirtyByte1;break;
				case 1: *currentTmp.it = (current.dirtyByte1 << 8);break;
				case 2:*currentTmp.it = (current.dirtyByte1 << 16);break;
				case 3:*currentTmp.it = (current.dirtyByte1 << 24);break;
				}
				currentTmp.it ++;
				*currentTmp.it = current.counter1;
				if(current.fillType == 1) *currentTmp.it += 0x40000000;
				*currentTmp.it += 0x80000000;
				currentTmp.it ++;
				switch(current.dirtyBytePos2)
				{
				case 0: *currentTmp.it = current.dirtyByte2;break;
				case 1: *currentTmp.it = (current.dirtyByte2 << 8);break;
				case 2:*currentTmp.it = (current.dirtyByte2 << 16);break;
				case 3:*currentTmp.it = (current.dirtyByte2 << 24);break;
				}
				currentTmp.it++;
			}
			else if(current.cpxType == 2) //FLF
			{
				*currentTmp.it = current.counter1;
				if(current.fillType == 1) *currentTmp.it += 0x40000000;
				*currentTmp.it += 0x80000000;
				currentTmp.it ++;
				switch (current.dirtyBytePos1)
				{
				case 0: *currentTmp.it = current.dirtyByte1;break;
				case 1: *currentTmp.it = (current.dirtyByte1 << 8);break;
				case 2:*currentTmp.it = (current.dirtyByte1 << 16);break;
				case 3:*currentTmp.it = (current.dirtyByte1 << 24);break;
				}
				currentTmp.it++;
				*currentTmp.it = current.counter2;
				if(current.fillType == 1) *currentTmp.it += 0x40000000;
				*currentTmp.it += 0x80000000;
				currentTmp.it ++;
		//		std::cout<<std::hex<<*(m_vec.begin())<<std::endl;	
			}
			else if(current.cpxType == 3) //1-FILL
			{
				*currentTmp.it = current.counter1;
				*currentTmp.it += 0xc0000000;
				currentTmp.it++;
			}
		}
//		std::cout<<std::hex<<*(m_vec.begin())<<std::endl;	
	}
	m_vec.swap(tmp_vec->m_vec);//exanchge the two arrays.
}



/// Compress the current m_vec in-place.  It may reduces storage
/// requirement by merging fills into fill words.
void ibis::bitvector::compress() 
{
	//if (m_vec.size() < 2 || m_vec.incore() == false) // there is nothing to do
	if (m_vec.size() < 2 ) // there is nothing to do
		return;

	struct xrun {
		bool   isFill;
		int    fillBit;
		word_t nWords;
		array_t<word_t>::iterator it;

		xrun() : isFill(false), fillBit(0), nWords(0), it(0) {};
		void decode() {
			fillBit = (*it > HEADER1);
			isFill = (*it > ALLONES);
			nWords = (*it & MAXCNT);
		}
	};
	xrun last;	// point to the last code word in m_vec that might be modified
	// NOTE: last.nWords is not used by this function
	xrun current;// point to the current code to be examined

	current.it = m_vec.begin();
	last.it = m_vec.begin();
	last.decode();
	for (++ current.it; current.it < m_vec.end(); ++ current.it) {
		current.decode();
		if (last.isFill) 
		{ 
			// last word was a fill word
			if (current.isFill) 
			{ 
				// current word is a fill word
				if (current.fillBit == last.fillBit) 
				{ 
					// same type of fill
					*(last.it) += current.nWords;
				}
				else 
				{ 
					// different types of fills, move last foward by one
					++ last.it;
					*(last.it) = *(current.it);
					last.fillBit = current.fillBit;
				}
			}
			else if ((last.fillBit == 0 && *(current.it) == 0) ||
				(last.fillBit != 0 && *(current.it) == ALLONES))
			{
				// increase the last fill by 1 word
				++ *(last.it);
			}
			else  
			{ 
				// move last forward by one
				++ last.it;
				last.isFill = false;
				*(last.it) = *(current.it);
			}
		}
		else if (current.isFill) 
		{
			// last word was a literal word, current word is a fill word
			if ((current.fillBit == 0 && *(last.it) == 0) ||
				(current.fillBit != 0 && *(last.it) == ALLONES)) 
			{
				// change the last word into a fill word
				*(last.it) = *(current.it) + 1;
				last.fillBit = current.fillBit;
				last.isFill = true;
			}
			else 
			{ // move last forward by one
				++ last.it;
				last.isFill = true;
				*(last.it) = *(current.it);
				last.fillBit = current.fillBit;
			}
		}
		else if (*(last.it) == *(current.it)) 
		{
			// both last word and current word are literal words and are
			// the same
			if (*(current.it) == 0) 
			{ // make a 2-word 0-fill
				*(last.it) = HEADER0 | 2;
				last.isFill = true;
				last.fillBit = 0;
			}
			else if (*(current.it) == ALLONES) 
			{ // make a 2-word 1-fill
				*(last.it) = HEADER1 | 2;
				last.isFill = true;
				last.fillBit = 1;
			}
			else 
			{ // move last forward
				++ last.it;
				*(last.it) = *(current.it);
			}
		}
		else 
		{ // move last forward one word
			++ last.it;
			*(last.it) = *(current.it);
		}
	}
	++ last.it;
	if (last.it < m_vec.end()) 
	{ // reduce the size of m_vec
		m_vec.erase(last.it, m_vec.end());
	}
} // ibis::bitvector::compress

/// Decompress the currently compressed bitvector.  It turns all fill words
/// into literal words.  Throws an ibis::bad_alloc exception if it fails to
/// allocate enough memory.
void ibis::bitvector::decompress() {
    if (nbits == 0 && m_vec.size() > 0)
	nbits = do_cnt();
    if (m_vec.size()*MAXBITS == nbits) // already uncompressed
	return;

    array_t<word_t> tmp;
    tmp.resize(nbits/MAXBITS);
    if (nbits != tmp.size()*MAXBITS) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::decompress(nbits=" << nbits
	    << ") failed to allocate a temp array of "
	    << nbits/MAXBITS << "-word";
	throw ibis::bad_alloc("bitvector::decompress failed to "
			      "allocate array to uncompressed bits");
    }

    array_t<word_t>::iterator it = tmp.begin();
    array_t<word_t>::const_iterator i0 = m_vec.begin();
    for (; i0!=m_vec.end(); i0++) {
	if ((*i0) > ALLONES) {
	    word_t cnt = (*i0 & MAXCNT);
	    if ((*i0)>=HEADER1) {
		for (word_t j=0; j<cnt; j++, it++)
		    *it = ALLONES;
	    }
	    else {
		for (word_t j=0; j<cnt; j++, it++)
		    *it = 0;
	    }
	}
	else {
	    *it = *i0;
	    it++;
	}
    }

    if (m_vec.size() != tmp.size())
	m_vec.swap(tmp);  // take on the new vector
} // ibis::bitvector::decompress

/// Decompress the current content to an array_t<word_t>.
void ibis::bitvector::decompress(array_t<ibis::bitvector::word_t>& tmp)
    const {
    const word_t nb = ((nbits == 0 && m_vec.size() > 0) ? do_cnt() : nbits);
    word_t cnt = nb/MAXBITS;
    tmp.resize(cnt);

    array_t<word_t>::iterator it = tmp.begin();
    array_t<word_t>::const_iterator i0 = m_vec.begin();
    for (; i0!=m_vec.end(); i0++) {
	if ((*i0) > ALLONES) {
	    cnt = (*i0 & MAXCNT);
	    if ((*i0)>=HEADER1) {
		for (word_t j=0; j<cnt; j++, it++)
		    *it = ALLONES;
	    }
	    else {
		for (word_t j=0; j<cnt; j++, it++)
		    *it = 0;
	    }
	}
	else {
	    *it = *i0;
	    it++;
	}
    }
} // ibis::bitvector::decompress

/// Decompress the current content to an array_t<word_t> and complement
/// every bit.
void ibis::bitvector::copy_comp(array_t<ibis::bitvector::word_t>& tmp) const {
    word_t cnt = (nbits == 0 && m_vec.size()>0 ? do_cnt() : nbits)/MAXBITS;
    tmp.resize(cnt);

    array_t<word_t>::iterator it = tmp.begin();
    array_t<word_t>::const_iterator i0 = m_vec.begin();
    for (; i0!=m_vec.end(); i0++) {
	if ((*i0) > ALLONES) {
	    cnt = (*i0 & MAXCNT);
	    if ((*i0)>=HEADER1) {
		for (word_t j=0; j<cnt; j++, it++)
		    *it = 0;
	    }
	    else {
		for (word_t j=0; j<cnt; j++, it++)
		    *it = ALLONES;
	    }
	}
	else {
	    *it = ALLONES ^ *i0;
	    it++;
	}
    }
} // ibis::bitvector::copy_comp

/// Return the number of word saved if the function compress is called.
ibis::bitvector::word_t ibis::bitvector::compressible() const {
    word_t cnt = 0;
    for (word_t i = 0; i+1 < m_vec.size(); ++ i) {
	cnt += ((m_vec[i] == m_vec[i+1]) &&
		((m_vec[i] == 0) || (m_vec[i] == ALLONES)));
    }
    return cnt;
} // ibis::bitvector::compressible

/// Count the number of bits and number of ones in m_vec.  Return the
/// number of bits.  Modify the member variable nset to the correct value.
ibis::bitvector::word_t ibis::bitvector::do_cnt() const throw() {
    nset = 0;
    word_t nb = 0;
    if (m_vec.begin() != 0 && m_vec.end() != 0) {
	for (array_t<word_t>::const_iterator it = m_vec.begin();
	     it < m_vec.end(); ++ it) {
	    if ((*it) < HEADER0) {
		nb += MAXBITS;
		nset += cnt_ones(*it);
	    }
	    else {
		word_t tmp = (*it & MAXCNT) * MAXBITS;
		nb += tmp;
		nset += tmp * ((*it) >= HEADER1);
	    }
	}
    }
    return nb;
} // ibis::bitvector::do_cnt

/// Replace a single bit at position @c i with val.  If the value of val is
/// not 0, it is assumed to be 1.  This function can be used to extend the
/// length of the bit sequence.  When the given index (ind) is beyond the
/// end of the current sequence, the unspecified bits in the range of
/// [size(), ind) are assumed to be 0.
///
/// This function may uncompress the object if the bit to be changed is in
/// the middle of a long bitvector.  This is to improve the speed of
/// operation at the cost of some additional space.  The bitvector is
/// considered long if the cube of the number of words is more than the
/// number of bits in the bitvector.
void ibis::bitvector::setBit(const ibis::bitvector::word_t ind, int val) {
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 4)
	<< "bitvector::setBit(" << ind << ", " << val << ") "
	<< "-- " << nbits << " bit(s) in m_vec and "
	<< active.nbits << " bit(s) in the active word";
#endif
    m_vec.nosharing(); // make sure the array is not shared
    if (ind >= size()) {
	word_t diff = ind - size() + 1;
	if (active.nbits) {
	    if (ind+1 >= nbits+MAXBITS) {
		diff -= MAXBITS - active.nbits;
		active.val <<= (MAXBITS - active.nbits);
		if (diff == 0)
		    active.val += (val!=0);
		append_active();
	    }
	    else {
		active.nbits += diff;
		active.val <<= diff;
		active.val += (val!=0);
		diff = 0;
	    }
	}
	if (diff) {
	    word_t w = diff / MAXBITS;
	    diff -= w * MAXBITS;
	    if (diff) {
		if (w > 1) {
		    append_counter(0, w);
		}
		else if (w) {
		    append_active();
		}
		active.nbits = diff;
		active.val += (val!=0);
	    }
	    else if (val != 0) {
		if (w > 2) {
		    append_counter(0, w-1);
		}
		else if (w == 2) {
		    append_active();
		}
		active.val = 1;
		append_active();
	    }
	    else {
		if (w > 1) {
		    append_counter(0, w);
		}
		else if (w) {
		    append_active();
		}
	    }
	}
	LOGGER(size() != ind+1 && ibis::gVerbose > 0)
	    << "Warning -- bitvector::setBit(" << ind << ", " << val
	    << ") changed bitvector size to " << size()
	    << ", but " << ind+1 << " was expected";
	if (nset)
	    nset += (val!=0);
	return;
    }
    else if (ind >= nbits) { // modify an active bit
	word_t u = active.val;
	if (val != 0) {
	    active.val |= (1 << (active.nbits - (ind - nbits) - 1));
	}
	else {
	    active.val &= ~(1 << (active.nbits - (ind - nbits) - 1));
	}
	if (nset && (u != active.val))
	    nset += (val?1:-1);
	return;
    }

    if (m_vec.size() > 16 && m_vec.size()*MAXBITS < nbits &&
	m_vec.size()*m_vec.size()*m_vec.size() >= nbits)
	decompress();	// uncompress the large bitvector

    if (m_vec.size()*MAXBITS == nbits) { // uncompressed
	const word_t i = ind / MAXBITS;
	const word_t u = m_vec[i];
	const word_t w = (1 << (SECONDBIT - (ind % MAXBITS)));
	if (val != 0)
	    m_vec[i] |= w;
	else
	    m_vec[i] &= ~w;
	if (nset && (m_vec[i] != u))
	    nset += (val?1:-1);
    }
    else {
	// compressed bit vector -- 
	// the bit to be modified is in m_vec
	array_t<word_t>::iterator it = m_vec.begin();
	word_t compressed = 0, cnt = 0, ind1 = 0, ind0 = ind;
	int current = 0; // current bit value
	while ((ind0>0) && (it<m_vec.end())) {
	    if (*it >= HEADER0) { // a fill
		cnt = ((*it) & MAXCNT) * MAXBITS;
		if (cnt > ind0) { // found the location
		    current = (*it >= HEADER1);
		    compressed = 1;
		    ind1 = ind0;
		    ind0 = 0;
		}
		else {
		    ind0 -= cnt;
		    ind1 = ind0;
		    ++ it;
		}
	    }
	    else { // a literal word
		cnt = MAXBITS;
		if (MAXBITS > ind0) { // found the location
		    current = (1 & ((*it) >> (SECONDBIT - ind0)));
		    compressed = 0;
		    ind1 = ind0;
		    ind0 = 0;
		}
		else {
		    ind0 -= MAXBITS;
		    ind1 = ind0;
		    ++ it;
		}
	    }
	} // while (ind...
	if (ind1 == 0) { // set current and compressed
	    if (*it >= HEADER0) {
		cnt = ((*it) & MAXCNT) * MAXBITS;
		current = (*it >= HEADER1);
		compressed = 1;
	    }
	    else {
		cnt = MAXBITS;
		current = (*it >> SECONDBIT);
		compressed = 0;
	    }
	}

	if (ind0>0) { // has not found the right location yet
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::setBit(" << ind << ", " << val
		<< ") passed the end (" << size()
		<< ") of bit sequence while searching for position " << ind;
	    if (ind0 < active.nbits) { // in the active word
		ind1 = (1 << (active.nbits - ind0 - 1));
		if (val != 0) {
		    active.val |= ind1;
		}
		else {
		    active.val &= ~ind1;
		}
	    }
	    else { // extends the current bit vector
		ind1 = ind0 - active.nbits - 1;
		appendWord(HEADER0 | (ind1/MAXBITS));
		for (ind1%=MAXBITS; ind1>0; --ind1) operator+=(0);
		operator+=(val != 0);
	    }
	    if (nset) nset += val?1:-1;
	    return;
	}

	// locate the bit to be changed, lots of work hidden here
	if (current == val) return; // nothing to do

	// need to actually modify the bit
	if (compressed == 0) { // toggle a single bit of a literal word
	    *it ^= (1 << (SECONDBIT - ind1));
	}
	else if (ind1 < MAXBITS) {
	    // bit to be modified is in the first word, two pieces
	    -- (*it);
	    if ((*it & MAXCNT) == 1)
		*it = (current)?ALLONES:0;
	    word_t w = 1 << (SECONDBIT-ind1);
	    if (val == 0) w ^= ALLONES;
	    it = m_vec.insert(it, w);
	}
	else if (cnt - ind1 <= MAXBITS) {
	    // bit to be modified is in the last word, two pieces
	    -- (*it);
	    if ((*it & MAXCNT) == 1)
		*it = (current)?ALLONES:0;
	    word_t w = 1 << (cnt-ind1-1);
	    if (val == 0) w ^= ALLONES;
	    ++ it;
	    it = m_vec.insert(it, w);
	}
	else { // the counter breaks into three pieces
	    word_t u[2], w;
	    u[0] = ind1 / MAXBITS;
	    w = (*it & MAXCNT) - u[0] - 1;
	    u[1] = 1 << (SECONDBIT-ind1+u[0]*MAXBITS);
	    if (val==0) {
		u[0] = (u[0]>1)?(HEADER1|u[0]):(ALLONES);
		u[1] ^= ALLONES;
		w = (w>1)?(HEADER1|w):(ALLONES);
	    }
	    else {
		u[0] = (u[0]>1)?(HEADER0|u[0]):static_cast<word_t>(0);
		w = (w>1)?(HEADER0|w):static_cast<word_t>(0);
	    }
	    *it = w;
	    m_vec.insert(it, u, u+2);
	}
	if (nset)
	    nset += val?1:-1;
    }
} // ibis::bitvector::setBit

/// Return the value of a bit.
///
/// @note If the incoming position is beyond the end of this bitmap, this
/// function returns 0.
///
/// @warning To access the ith bit, this function essentially has to
/// determine the values of bits 0 through i-1, therefore, it is highly
/// recommended that you don't use this function.  A compressed bitmap data
/// structure is simply not the right data structure to support random
/// accesses!
int ibis::bitvector::getBit(const ibis::bitvector::word_t ind) const {
    if (ind >= size()) {
        return 0;
    }
    else if (ind >= nbits) {
        return ((active.val >> (active.nbits - (ind - nbits) - 1)) & 1U);
    }
    else if (m_vec.size()*MAXBITS == nbits) { // uncompressed
        return ((m_vec[ind/MAXBITS] >> (SECONDBIT - (ind % MAXBITS))) & 1U);
    }
    else { // need to decompress the compressed words
        word_t jnd = ind;
        array_t<word_t>::const_iterator it = m_vec.begin();
        while (it < m_vec.end()) {
            if (*it > HEADER0) { // a fill
                const word_t cnt = ((*it) & MAXCNT) * MAXBITS;
                if (cnt > jnd) {
                    return (*it >= HEADER1);
                }
                jnd -= cnt;
            }
            else if (jnd < MAXBITS) {
                return ((*it >> (SECONDBIT - jnd)) & 1U);
            }
            else {
                jnd -= MAXBITS;
            }
            ++ it;
        }
    }
    return 0;
} // ibis::bitvector::getBit

/// Select a subset of the bits.  Bits whose positions are marked 1 in mask
/// are put together to form a new bitvector @c res.
void ibis::bitvector::subset(const ibis::bitvector& mask,
			     ibis::bitvector& res) const {
    res.clear();
    if (mask.size() == 0 || mask.cnt()== 0) return;
    if (all0s() && active.val == 0) { // res is all 0
	res.set(0, mask.cnt());
	return;
    }
    else if (all1s() && active.val+1 == (1U << active.nbits)) {
	res.set(1, mask.cnt());
	return;
    }
    else if (mask.size() != size()) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::subset requires mask to have "
	    << size() << " bits, but it has " << mask.size();
	return;
    }

    run cur, sel;
    cur.it = m_vec.begin();
    if (cur.it != m_vec.end()) // avoid accessing nil pointer
	cur.decode();
    for (sel.it = mask.m_vec.begin(); sel.it != mask.m_vec.end(); ++ sel.it) {
	sel.decode();
	if (sel.isFill != 0) { // current word in mask is a fill
	    if (sel.fillBit != 0) { // 1-fill: copy bits
		while (sel.nWords > 0) {
		    if (cur.nWords == 0) {
			++ cur.it;
			cur.decode();
		    }
		    if (cur.isFill != 0) {
			if (sel.nWords >= cur.nWords) {
			    res.appendFill(cur.fillBit, cur.nWords*MAXBITS);
			    sel.nWords -= cur.nWords;
			    cur.nWords = 0;
			}
			else {
			    res.appendFill(cur.fillBit, sel.nWords*MAXBITS);
			    cur.nWords -= sel.nWords;
			    sel.nWords = 0;
			}
		    }
		    else {
			res.appendWord(* cur.it);
			cur.nWords = 0;
			-- sel.nWords;
		    }
		} // while (sel.nWords > 0)
	    }
	    else { // skip sel.nWords
		while (sel.nWords > 0) {
		    if (cur.nWords == 0) {
			++ cur.it;
			cur.decode();
		    }
		    if (cur.isFill != 0) {
			if (sel.nWords >= cur.nWords) {
			    sel.nWords -= cur.nWords;
			    cur.nWords = 0;
			}
			else {
			    cur.nWords -= sel.nWords;
			    sel.nWords = 0;
			}
		    }
		    else {
			cur.nWords = 0;
			-- sel.nWords;
		    }
		}
	    }
	}
	else { // need to tease out a few bits
	    if (cur.nWords == 0) {
		++ cur.it;
		cur.decode();
	    }
	    if (*sel.it == 0) {
		if (cur.isFill != 0)
		    -- cur.nWords;
		else
		    cur.nWords = 0;
	    }
	    else if (*sel.it == ALLONES) {
		if (cur.isFill != 0) {
		    res.appendFill(cur.fillBit, MAXBITS);
		    -- cur.nWords;
		}
		else {
		    res.appendWord(*cur.it);
		    cur.nWords = 0;
		}
	    }
	    else if (cur.isFill != 0) {
		res.appendFill(cur.fillBit, cnt_ones(*sel.it));
		-- cur.nWords;
	    }
	    else if (*cur.it == 0 || *cur.it == ALLONES) {
		res.appendFill(*cur.it == ALLONES, cnt_ones(*sel.it));
		cur.nWords = 0;
	    }
	    else { // one bit at a time
		word_t mk = (*sel.it << 1);
		word_t ck = (*cur.it << 1);
		while (mk > 0) {
		    if (mk > ALLONES)
			res += (ck > ALLONES);
		    mk <<= 1;
		    ck <<= 1;
		}
		cur.nWords = 0;
	    }
	}
    } // for (sel.it ...

    if (mask.active.val > 0) { // deal with the active words
	word_t mk = (mask.active.val << (MAXBITS - active.nbits + 1));
	word_t ck = (active.val << (MAXBITS - active.nbits + 1));
	while (mk > 0) {
	    if (mk > ALLONES)
		res += (ck > ALLONES);
	    mk <<= 1;
	    ck <<= 1;
	}
    }
} // ibis::bitvector::subset

/// Remove the bits in the range of [i, j).
/// The bit positions are counted from 0.  The first position @c i is erased,
/// but not the last position @c j.
void ibis::bitvector::erase(ibis::bitvector::word_t i,
			    ibis::bitvector::word_t j) {
    if (i >= j) {
	return;
    }

    // use copy-and-swap approach, the result bitvector is res
    ibis::bitvector res;
    if (i > 0) { // copy the leading part to res
	const_iterator ip = const_cast<const ibis::bitvector*>(this)->begin();
	ip += i;
	array_t<word_t>::const_iterator cit = m_vec.begin();
	while (cit < ip.it) {
	    res.m_vec.push_back(*cit);
	    ++ cit;
	}
	res.nbits = i - ip.ind;
	if (ip.compressed) {
	    res.appendFill(ip.fillbit, ip.ind);
	}
	else {
	    res.active.val = (ip.literalvalue >> (MAXBITS-ip.ind));
	    res.active.nbits = ip.ind;
	}
    }

    if (j < nbits) { // copy the back half of m_vec
	const_iterator iq = const_cast<const ibis::bitvector*>(this)->begin();
	iq += j;
	// copy second half of iq.it
	if (iq.compressed) {
	    res.appendFill(iq.fillbit, iq.nbits-iq.ind);
	    //for (word_t ii=iq.ind; ii<iq.nbits; ++ii) {
	    //res += iq.fillbit;
	    //}
	}
	else {
	    for (long ii=(iq.nbits-iq.ind-1); ii>=0; --ii) {
		res += (1 & (iq.literalvalue >> ii));
	    }
	}
	// copy the remaining whole words
	++ (iq.it);
	while (iq.it < m_vec.end()) {
	    res.appendWord(*(iq.it));
	    ++ (iq.it);
	}
	// copy the active word
	for (long ii = ((long)active.nbits-1); ii >= 0; -- ii) {
	    res += (int) ((active.val >> ii) & 1);
	}
    }
    else if (j < nbits+active.nbits) { // only something from active word
	for (long ii = (long)(active.nbits-j+nbits-1); ii >= 0; -- ii) {
	    res += (int) ((active.val >> ii) & 1);
	}
    }
    if (size() != res.size()+(j-i)) {
	LOGGER(ibis::gVerbose >= 0)
	    << "Warning -- bitvector::erase(" << i << ", " << j
	    << ") res.size(" << res.size() << ") is expected to be "
	    << size()-(j-i) << ", but is not";
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 2)
	<< "DEBUG -- bitvector::erase(" << i << ", " << j
	<< ") ...\nInput\n" << *this << "\nOutput\n" << res;
#endif
    swap(res);
} // ibis::bitvector::erase

/// Count the number of bits that are 1 that also marked as 1 in mask.  A
/// straightforward implement of this is to perform a bitwise AND and then
/// count the number of bits that are 1.  However, such an approach will
/// generate a bitvector that is only used for counting.  This is an
/// attempt to do better.
ibis::bitvector::word_t
ibis::bitvector::count(const ibis::bitvector& mask) const {
    word_t cnt = 0;
    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (mask.m_vec.size()*MAXBITS == mask.nbits && mask.nbits > 0);
    if (ca && cb) {
	array_t<word_t>::const_iterator j = m_vec.begin();
	array_t<word_t>::const_iterator k = mask.m_vec.begin();
	while (j < m_vec.end()) {
	    cnt += cnt_ones(*j & *k); ++j; ++k;
	}
	cnt += cnt_ones(active.val & mask.active.val);
    }
    else if (ca) {
	cnt = mask.count_c1(*this);
    }
    else if (cb) {
	cnt = count_c1(mask);
    }
    else if (all0s() || mask.all0s()) { // no 1s
	cnt = cnt_ones(active.val & mask.active.val);
    }
    else if (all1s()) { // m_vec contain only a sinle 1-fill
	if (mask.nset == 0 && ! mask.m_vec.empty())
	    mask.nbits = mask.do_cnt();
	cnt = mask.nset + cnt_ones(active.val & mask.active.val);
    }
    else if (mask.all1s()) {
	if (nbits == 0 && ! m_vec.empty())
	    nbits = do_cnt();
	cnt = nset + cnt_ones(active.val & mask.active.val);
    }
    else {
	cnt = count_c2(mask);
    }
    return cnt;
} // ibis::bitvector::count

/// Complement all bits of a bit sequence.
/// Toggle every bit of the bit sequence
void ibis::bitvector::flip() {
    m_vec.nosharing(); // make sure *this is not shared!
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    if (ibis::gVerbose > 30 || (1U << ibis::gVerbose) > bytes()) {
	ibis::util::logger lg(4);
	lg() << "Before flipping:" << *this;
    }
#endif
    // toggle those words in m_vec
    if (nbits > 0) {
	for (array_t<word_t>::iterator i=m_vec.begin(); i!=m_vec.end(); ++i) {
	    if (*i > ALLONES) {
		*i ^= FILLBIT;
	    }
	    else {
		*i ^= ALLONES;
	    }
	}
    }
    else { /// If nbits is not set, set it while flipping the bits.
	nbits = 0;
	for (array_t<word_t>::iterator i=m_vec.begin(); i!=m_vec.end(); ++i) {
	    if (*i > ALLONES) {
		*i ^= FILLBIT;
		nbits += MAXBITS * (*i & MAXCNT);
	    }
	    else {
		*i ^= ALLONES;
		nbits += MAXBITS;
	    }
	}
    }
    if (nset > 0)
	nset = nbits - nset;

    if (active.nbits > 0) { // also need to toggle active_word
	active.val ^= ((1<<active.nbits) - 1);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = do_cnt();
    LOGGER(nb != nbits && ibis::gVerbose > 0)
	<< "Warning -- bitvector::flip expects to have " << nbits
	<< " bits but got " << nb;
    LOGGER(ibis::gVerbose > 30 || (1U << ibis::gVerbose) > bytes())
	<< "After flipping:" << *this;
#endif
} // ibis::bitvector::flip

/// Compare two bitvectors.
/// Return 1 if two bit sequences have the same content, 0 otherwise.
int ibis::bitvector::operator==(const ibis::bitvector& rhs) const {
    if (nbits != rhs.nbits) return 0;
    if (m_vec.size() != rhs.m_vec.size()) return 0;
    if (active.val != rhs.active.val) return 0;
    for (word_t i=0; i<m_vec.size(); i++)
	if (m_vec[i] != rhs.m_vec[i]) return 0;

    return 1;
} // ibis::bitvector::operator==

/// The in-place version of the bitwise logical AND operator.  It performs
/// the bitwise logical AND operation between this bitvector and @c rhs,
/// then stores the result back to this bitvector.
///
///@note If the two bit vectors are not of the same length, the shorter one
/// is implicitly padded with 0 bits so the two are of the same length.
void ibis::bitvector::operator&=(const ibis::bitvector& rhs) {
#if defined(WAH_CHECK_SIZE)
    if (nbits == 0)
	nbits = do_cnt();
    LOGGER((rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator&= is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator&=: A=" << *this << "B=" << rhs;
#endif
    m_vec.nosharing(); // make sure the memory is not shared
    if (size() > rhs.size()) { // make a copy of RHS and extend its size
	ibis::bitvector tmp(rhs);
	tmp.adjustSize(0, size());
	operator&=(tmp);
	return;
    }
    else if (size() < rhs.size()) {
	adjustSize(0, rhs.size());
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca) { // *this is not compressed
	if (cb) // rhs is not compressed
	    and_c0(rhs);
	else
	    and_d1(rhs);
    }
    else if (cb) { // rhs is not compressed
	bitvector tmp;
	tmp.copy(rhs);
	swap(tmp);
	and_d1(tmp);
    }
    else if (all0s() || rhs.all1s()) { // deal with active words
	if (active.nbits == rhs.active.nbits) {
	    active.val &= rhs.active.val;
	}
	else if (active.nbits > rhs.active.nbits) {
	    active.val &= (rhs.active.val << (active.nbits - rhs.active.nbits));
	}
	else {
	    active.val = (active.val << (rhs.active.nbits - active.nbits))
		& rhs.active.val;
	    active.nbits = rhs.active.nbits;
	}
    }
    else if (rhs.all0s() || all1s()) { // copy rhs
	nset = rhs.nset;
	m_vec.copy(rhs.m_vec);
	if (active.nbits == rhs.active.nbits) {
	    active.val &= rhs.active.val;
	}
	else if (active.nbits > rhs.active.nbits) {
	    active.val &= (rhs.active.val << (active.nbits - rhs.active.nbits));
	}
	else {
	    active.val = (active.val << (rhs.active.nbits - active.nbits))
		& rhs.active.val;
	    active.nbits = rhs.active.nbits;
	}
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS >= rhs.nbits) {
	// if the total size of the two operands are large, generate an
	// decompressed solution
	bitvector res;
	and_d2(rhs, res);
	swap(res);
    }
    else {
	bitvector res;
	and_c2(rhs, res);
	swap(res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = do_cnt();
    if (nbits == 0)
	nbits = nb;
    LOGGER(nb != rhs.nbits && rhs.nbits > 0 && ibis::gVerbose > 0)
	<< "Warning -- bitvector::operator&= expects to have " << rhs.nbits
	<< " bits but got " << nb;
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator&=: (A&B)=" << *this;
#endif
} // ibis::bitvector::operator&=

/// This version of bitwise logical operator produces a new bitvector as
/// the result and return a pointer to the new object.
///
/// @note The caller is responsible for deleting the bitvector returned.
///
///@sa ibis::bitvector::operator&=
ibis::bitvector* ibis::bitvector::operator&(const ibis::bitvector& rhs)
    const {
#if defined(WAH_CHECK_SIZE)
    LOGGER((nbits > 0 && rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator& is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
    ibis::bitvector *res = new ibis::bitvector;
    if (size() > rhs.size()) {
	res->copy(rhs);
	res->adjustSize(0, size());
	*res &= *this;
	return res;
    }
    else if (size() < rhs.size()) {
	res->copy(*this);
	res->adjustSize(0, rhs.size());
	*res &= rhs;
	return res;
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca && cb) {
	const word_t nw = (m_vec.size() >= rhs.m_vec.size() ?
			   m_vec.size() : rhs.m_vec.size());
	res->m_vec.resize(nw);
	if (m_vec.size() == rhs.m_vec.size()) {
	    array_t<word_t>::iterator i = res->m_vec.begin();
	    array_t<word_t>::const_iterator j = m_vec.begin();
	    array_t<word_t>::const_iterator k = rhs.m_vec.begin();
	    while (i != res->m_vec.end()) {
		*i = *j & *k; ++i; ++j; ++k;
	    }
	    res->nbits = nbits;
	    if (active.nbits == rhs.active.nbits) {
		res->active.val = active.val & rhs.active.val;
		res->active.nbits = active.nbits;
	    }
	    else if (active.nbits > rhs.active.nbits) {
		res->active.val = active.val &
		    (rhs.active.val << (active.nbits - rhs.active.nbits));
		res->active.nbits = active.nbits;
	    }
	    else {
		res->active.val = rhs.active.val &
		    (active.val << (rhs.active.nbits - active.nbits));
		res->active.nbits = rhs.active.nbits;
	    }
	}
	else if (m_vec.size() > rhs.m_vec.size()) {
	    word_t j = 0;
	    while (j < rhs.m_vec.size()) {
		res->m_vec[j] = m_vec[j] & rhs.m_vec[j];
		++ j;
	    }
	    if (rhs.active.nbits > 0) {
		res->m_vec[j] = m_vec[j] &
		    (rhs.active.val << (MAXBITS - rhs.active.nbits));
		++ j;
	    }
	    while (j < nw) {
		res->m_vec[j] = 0;
		++ j;
	    }
	    res->active.nbits = active.nbits;
	    res->active.val = 0;
	}
	else {
	    word_t j = 0;
	    while (j < m_vec.size()) {
		res->m_vec[j] = m_vec[j] & rhs.m_vec[j];
		++ j;
	    }
	    if (active.nbits > 0) {
		res->m_vec[j] = (active.val << (MAXBITS - active.nbits))
		    & rhs.m_vec[j];
		++ j;
	    }
	    while (j < nw) {
		res->m_vec[j] = 0;
		++ j;
	    }
	    res->active.nbits = rhs.active.nbits;
	    res->active.val = 0;
	}
    }
    else if (ca) {
	rhs.and_c1(*this, *res);
    }
    else if (cb) {
	and_c1(rhs, *res);
    }
    else if (all0s() || rhs.all1s()) { // copy *this
	res->copy(*this);
	res->active.val &= rhs.active.val;
    }
    else if (all1s() || rhs.all0s()) { // copy rhs
	res->copy(rhs);
	res->active.val &= active.val;
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS > nbits) {
	and_d2(rhs, *res);
    }
    else {
	and_c2(rhs, *res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = res->do_cnt();
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator& expects to have " << rhs.nbits
	<< " bits but got " << nb;
#endif
    return res;
} // ibis::bitvector::operator&

/// The is the in-place version of the bitwise OR (|) operator.  This
/// bitvector is modified to store the result of the operation.
///
///@sa ibis::bitvector::operator&=
void ibis::bitvector::operator|=(const ibis::bitvector& rhs) {
#if defined(WAH_CHECK_SIZE)
    if (nbits == 0)
	nbits = do_cnt();
    LOGGER((rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator|= is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator|=: A=" << *this << "B=" << rhs;
#endif
    m_vec.nosharing();
    if (size() > rhs.size()) {
	ibis::bitvector tmp(rhs);
	tmp.adjustSize(0, size());
	operator|=(tmp);
	return;
    }
    else if (size() < rhs.size()) {
	adjustSize(0, rhs.size());
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca) { // *this is not compressed
	if (cb) // rhs is not compressed
	    or_c0(rhs);
	else
	    or_d1(rhs);
    }
    else if (cb) {
	bitvector tmp;
	tmp.copy(rhs);
	swap(tmp);
	or_d1(tmp);
    }
    else if (all1s() || rhs.all0s()) {
	active.val |= rhs.active.val;
    }
    else if (all0s() || rhs.all1s()) {
	nset = rhs.nset;
	m_vec.copy(rhs.m_vec);
	active.val |= rhs.active.val;
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS >= rhs.nbits) {
	// if the total size of the two operands are large, generate an
	// uncompressed result
	bitvector res;
	or_d2(rhs, res);
	swap(res);
    }
    else {
	bitvector res;
	or_c2(rhs, res);
	swap(res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = do_cnt();
    if (nbits == 0)
	nbits = nb;
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator|= expects to have " << rhs.nbits
	<< " bits but got " << nb;
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator|=: (A|B)=" << *this;
#endif
} // ibis::bitvector::operator|=

/// This bitvector is not modified, instead a new bitvector is generated.
///
///@sa ibis::bitvector::operator&
ibis::bitvector* ibis::bitvector::operator|(const ibis::bitvector& rhs)
    const {
#if defined(WAH_CHECK_SIZE)
    LOGGER((nbits > 0 && rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator| is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
    ibis::bitvector *res = new ibis::bitvector;
    if (size() > rhs.size()) {
	res->copy(rhs);
	res->adjustSize(0, size());
	*res |= *this;
	return res;
    }
    else if (size() < rhs.size()) {
	res->copy(*this);
	res->adjustSize(0, rhs.size());
	*res |= rhs;
	return res;
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca && cb) {
	res->m_vec.resize(m_vec.size());
	array_t<word_t>::iterator i = res->m_vec.begin();
	array_t<word_t>::const_iterator j = m_vec.begin();
	array_t<word_t>::const_iterator k = rhs.m_vec.begin();
	while (i != res->m_vec.end()) {
	    *i = *j | *k; ++i; ++j; ++k;
	}
	res->active.val = active.val | rhs.active.val;
	res->active.nbits = active.nbits;
	res->nbits = nbits;
    }
    else if (ca) {
	rhs.or_c1(*this, *res);
    }
    else if (cb) {
	or_c1(rhs, *res);
    }
    else if (all1s() || rhs.all0s()) {
	res->copy(*this);
	res->active.val |= rhs.active.val;
    }
    else if (all0s() || rhs.all1s()) {
	res->copy(rhs);
	res->active.val |= active.val;
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS > nbits) {
	or_d2(rhs, *res);
    }
    else {
	or_c2(rhs, *res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = res->do_cnt();
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator| expects to have " << rhs.nbits
	<< " bits but got " << nb;
#endif
    return res;
} // ibis::bitvector::operator|

/// The in-place version of the bitwise XOR (^) operator.  This bitvector
/// is modified to store the result.
///
///@sa ibis::bitvector::operator&=
void ibis::bitvector::operator^=(const ibis::bitvector& rhs) {
#if defined(WAH_CHECK_SIZE)
    if (nbits == 0)
	nbits = do_cnt();
    LOGGER((rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator^= is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator^=: A=" << *this << "B=" << rhs;
#endif
    m_vec.nosharing();
    if (size() > rhs.size()) {
	ibis::bitvector tmp(rhs);
	tmp.adjustSize(0, size());
	operator^=(tmp);
	return;
    }
    else if (size() < rhs.size()) {
	adjustSize(0, rhs.size());
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca) {
	if (cb)
	    xor_c0(rhs);
	else
	    xor_d1(rhs);
    }
    else if (cb) {
	bitvector res;
	xor_c1(rhs, res);
	swap(res);
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS >= rhs.nbits) {
	// if the total size of the two operands are large, generate an
	// uncompressed result
	bitvector res;
	xor_d2(rhs, res);
	swap(res);
    }
    else {
	bitvector res;
	xor_c2(rhs, res);
	swap(res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = do_cnt();
    if (nbits == 0)
	nbits = nb;
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator^= expects to have " << rhs.nbits
	<< " bits but got " << nb;
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator^=: (A^B)=" << *this;
#endif
} // ibis::bitvector::operator^=

/// This bitvector is not modified, instead a new bitvector object is
/// generated to store the result.
///
///@sa ibis::bitvector::operator&
ibis::bitvector* ibis::bitvector::operator^(const ibis::bitvector& rhs)
    const {
#if defined(WAH_CHECK_SIZE)
    LOGGER((nbits > 0 && rhs.nbits > 0 && nbits != rhs.nbits) ||
	active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator^ is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
    ibis::bitvector *res = new ibis::bitvector;
    if (size() > rhs.size()) {
	res->copy(rhs);
	res->adjustSize(0, size());
	*res ^= *this;
	return res;
    }
    else if (size() < rhs.size()) {
	res->copy(*this);
	res->adjustSize(0, rhs.size());
	*res ^= rhs;
	return res;
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca && cb) {
	res->m_vec.resize(m_vec.size());
	array_t<word_t>::iterator i = res->m_vec.begin();
	array_t<word_t>::const_iterator j = m_vec.begin();
	array_t<word_t>::const_iterator k = rhs.m_vec.begin();
	while (i != res->m_vec.end()) {
	    *i = *j ^ *k; ++i; ++j; ++k;
	}
	res->active.val = active.val ^ rhs.active.val;
	res->active.nbits = active.nbits;
	res->nbits = nbits;
    }
    else if (ca) {
	rhs.xor_c1(*this, *res);
    }
    else if (cb) {
	xor_c1(rhs, *res);
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS > nbits) {
	xor_d2(rhs, *res);
    }
    else {
	xor_c2(rhs, *res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = res->do_cnt();
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator^ expects to have " << rhs.nbits
	<< " bits but got " << nb;
#endif
    return res;
} // ibis::bitvector::operator^

/// The in-place version of the bitwise minus (-) operator.  This bitvector
///is modified to store the result of the operation.
///
///@sa ibis::bitvector::operator&=
void ibis::bitvector::operator-=(const ibis::bitvector& rhs) {
#if defined(WAH_CHECK_SIZE)
    if (nbits == 0)
	nbits = do_cnt();
    LOGGER((rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator-= is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator-=: A=" << *this << "B=" << rhs;
#endif
    m_vec.nosharing();
    if (size() > rhs.size()) {
	ibis::bitvector tmp(rhs);
	tmp.adjustSize(0, size());
	operator-=(tmp);
	return;
    }
    else if (size() < rhs.size()) {
	adjustSize(0, rhs.size());
    }

    const bool ca = (m_vec.size()*MAXBITS == nbits && nbits > 0);
    const bool cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits && rhs.nbits > 0);
    if (ca) {
	if (cb)
	    minus_c0(rhs);
	else
	    minus_d1(rhs);
    }
    else if (cb) {
	bitvector res;
	minus_c1(rhs, res);
	swap(res);
    }
    else if (all0s() || rhs.all0s()) { // keep *this
	active.val &= ~(rhs.active.val);
    }
    else if (rhs.all1s()) { // zero out m_vec
	nset = 0;
	nbits = 0;
	m_vec.clear();
	active.val &= ~(rhs.active.val);
	append_counter(0, rhs.m_vec[0]&MAXCNT);
    }
    else if (all1s()) { // ~rhs
	word_t tmp = active.val;
	copy(rhs);
	flip();
	active.val &= tmp;
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS >= rhs.nbits) {
	// if the total size of the two operands are large, generate an
	// uncompressed result
	bitvector res;
	minus_d2(rhs, res);
	swap(res);
    }
    else {
	bitvector res;
	minus_c2(rhs, res);
	swap(res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = do_cnt();
    if (nbits == 0)
	nbits = nb;
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator-= expects to have " << rhs.nbits
	<< " bits but got " << nb;
    LOGGER(ibis::gVerbose > 30 || ((1U << ibis::gVerbose) >= bytes() &&
				   (1U << ibis::gVerbose) >= rhs.bytes()))
	<< "operator-=: (A-B)=" << *this;
#endif
} // ibis::bitvector::operator-=

/// The operands of the bitwise minus operation are not modified, instead a
/// new bitvector object is generated.
///
///@sa ibis::bitvector::operator&
ibis::bitvector* ibis::bitvector::operator-(const ibis::bitvector& rhs)
    const {
#if defined(WAH_CHECK_SIZE)
    LOGGER((nbits > 0 && rhs.nbits > 0 && nbits != rhs.nbits) ||
	   active.nbits != rhs.active.nbits)
	<< "Warning -- bitvector::operator- is to operate on two bitvectors "
	"of different sizes (" << size() << " != " << rhs.size() << ')';
#endif
    ibis::bitvector *res = new ibis::bitvector;
    if (size() > rhs.size()) {
	bitvector tmp(rhs);
	tmp.adjustSize(0, size());
	res->copy(*this);
	*res -= tmp;
	return res;
    }
    else if (size() < rhs.size()) {
	res->copy(*this);
	res->adjustSize(0, rhs.size());
	*res -= rhs;
	return res;
    }

    int ca = (m_vec.size()*MAXBITS == nbits);
    int cb = (rhs.m_vec.size()*MAXBITS == rhs.nbits);
    if (ca && cb) {
	res->m_vec.resize(m_vec.size());
	array_t<word_t>::iterator i = res->m_vec.begin();
	array_t<word_t>::const_iterator j = m_vec.begin();
	array_t<word_t>::const_iterator k = rhs.m_vec.begin();
	while (i != res->m_vec.end()) {
	    *i = *j & ~(*k); ++i; ++j; ++k;
	}
	res->active.val = active.val & ~(rhs.active.val);
	res->active.nbits = active.nbits;
	res->nbits = nbits;
    }
    else if (ca) {
	minus_c1x(rhs, *res);
    }
    else if (cb) {
	minus_c1(rhs, *res);
    }
    else if (all0s() || rhs.all0s()) { // copy *this
	res->copy(*this);
	res->active.val &= ~(rhs.active.val);
    }
    else if (rhs.all1s()) { // generate 0
	res->append_counter(0, rhs.m_vec[0]&MAXCNT);
	res->active.nbits = active.nbits;
	res->active.val = active.val & ~(rhs.active.val);
    }
    else if (all1s()) { // ~rhs
	res->copy(rhs);
	res->flip();
	res->active.val &= active.val;
    }
    else if ((m_vec.size()+rhs.m_vec.size())*MAXBITS > nbits) {
	minus_d2(rhs, *res);
    }
    else {
	minus_c2(rhs, *res);
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = res->do_cnt();
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::operator- expects to have " << rhs.nbits
	<< " bits but got " << nb;
#endif
    return res;
} // ibis::bitvector::operator-

/// Provide an ordering among the bit vectors.  The comparison proceeds in
/// three stages:
/// - the bit vector with fewer total number of bits, as represented by the
///   function size, will be declared "smaller";
/// - for two bit vectors with the same number of bits, the one with fewer
///   1s is declared as "smaller";
/// - for two bit vectors with the same number of bits and the same number
///   of 1s, the actual bit values are compared one bit at a time, in which
///   case, a bit of 0 is considered as smaller than a bit of 1.
///
/// Note that it is fine to compare two bit vectors that are compressed
/// differently.  However, it is generally more efficient to compare bit
/// vectors that have been compressed properly.
bool ibis::bitvector::operator<(const ibis::bitvector &rhs) const {
    // compare the number of bits in the two bit vectors
    word_t nl = size();
    word_t nr = rhs.size();
    if (nl < nr) return true;
    else if (nl > nr) return false;

    // compare the number of set bits in the two bit vectors
    nl = cnt();
    nr = rhs.cnt();
    if (nl < nr) return true;
    else if (nl > nr) return false;

    // compare the actual bit values through struct run
    run x, y;
    x.it = m_vec.begin();
    y.it = rhs.m_vec.begin();
    while (x.it < m_vec.end() && y.it < rhs.m_vec.end()) {
	if (x.nWords == 0)
	    x.decode();
	if (y.nWords == 0)
	    y.decode();

	if (x.isFill != 0) {
	    if (y.isFill != 0) {
		if (x.fillBit < y.fillBit) {
		    return true;
		}
		else if (x.fillBit > y.fillBit) {
		    return false;
		}
		else if (x.nWords <= y.nWords) {
		    y -= x.nWords;
		    x.nWords = 0;
		    ++ x.it;
		}
		else {
		    x -= y.nWords;
		    y.nWords = 0;
		    ++ y.it;
		}
	    }
	    else if (x.fillBit > 0) {
		if (*y.it < ALLONES) {
		    return false;
		}
		else {
		    -- x;
		    y.nWords = 0;
		    ++ y.it;
		}
	    }
	    else if (*y.it > 0) {
		return true;
	    }
	    else {
		-- x;
		y.nWords = 0;
		++ y.it;
	    }
	}
	else if (y.isFill != 0) {
	    if (y.fillBit > 0) {
		if (*x.it < ALLONES) {
		    return true;
		}
		else {
		    -- y;
		    x.nWords = 0;
		    ++ x.it;
		}
	    }
	    else if (*x.it > 0) {
		return false;
	    }
	    else {
		-- y;
		x.nWords = 0;
		++ x.it;
	    }
	}
	else {
	    if (*x.it < *y.it) return true;
	    else if (*y.it < *x.it) return false;
	    x.nWords = 0;
	    y.nWords = 0;
	    ++ x.it;
	    ++ y.it;
	}
    }

    if (x.it != m_vec.end()) return false;
    if (y.it != rhs.m_vec.end()) return true;
    return (active.val < rhs.active.val);
} // ibis::bitvector::operator<

/// Print each word in bitvector on a line.
std::ostream& ibis::bitvector::print(std::ostream& o) const {
    if (! m_vec.empty()) {
	if (nbits == 0) {
	    nbits = do_cnt();
	}
	else if (nset == 0) {
	    word_t nb = do_cnt();
	    LOGGER(nbits != nb && nbits > 0 && ibis::gVerbose >= 0)
		<< "Warning -- bitvector::print detected nbits ("
		<< nbits << ") mismatching return value of do_cnt ("
		<< nb << "), use the return value of do_cnt";
	}
    }
    if (nbits == 0 && ! m_vec.empty())
	nbits = do_cnt();
    o << "\nThis bitvector stores " << nbits << " bits of a " << size()
      << "-bit (" << nset+cnt_ones(active.val) << " set) sequence in a "
      << m_vec.size() << "-word array and ";
    if (active.nbits==0)
	o << "zero bit in the active word" << std::endl;
    else if (active.nbits==1)
	o << "one bit in the active word" << std::endl;
    else
	o << static_cast<int>(active.nbits) << " bits in the active word"
	  << std::endl;
    if (size() == 0)
	return o;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    if (ibis::gVerbose > 6)
	m_vec.printStatus(o);
#else
    if (ibis::gVerbose > 16)
	m_vec.printStatus(o);
#endif

    // print header
    o << "\t\t\t     0    1    1    2    2    3" << std::endl;
    o << "\t\t\t0123456789012345678901234567890" << std::endl;
    o << "\t\t\t-------------------------------" << std::endl;

    // print all words in m_vec
    array_t<word_t>::const_iterator i;
    word_t j, k;
    for (i=m_vec.begin(), k=0; i!=m_vec.end(); ++i,++k) {
	o << k << "\t" << std::hex << std::setw(8) << std::setfill('0')
	  << (*i) << std::dec << "\t";
	if (*i > ALLONES) {
	    o << (*i & MAXCNT)*MAXBITS << "*" << ((*i)>=HEADER1);
	}
	else {
	    for (j=0; j<MAXBITS; j++)
		o << ((*i>>(SECONDBIT-j))&1);
	}
	o << std::endl;
    }

    if (active.nbits>0) {    // print the active_word
	o << "\t" << std::hex << std::setw(8) << std::setfill('0')
	  << (active.val << (MAXBITS-active.nbits))
	  << std::dec << "\t";
	for (j=0; j<active.nbits; j++)
	    o << (1 & (active.val>>(active.nbits-j-1)));
	//for (; j<MAXBITS; j++) o << ' ';
    }
    o << std::endl;

    return o;
} // ibis::bitvector::print

std::ostream& operator<<(std::ostream& o, const ibis::bitvector& b) {
    return b.print(o);
}

/// Read a bit vector from the file.  Purge current contents before read.
/// It purges the current contents first.  If the name file does not exist
/// or the reading operation fails for any reason, the existing content is
/// lost.
void ibis::bitvector::read(const char * fn) {
    if (fn == 0 || *fn == 0) return;
    // let the file manager handle the read operation to avoid extra copying
    int ierr = ibis::fileManager::instance().getFile
	(fn, m_vec, ibis::fileManager::PREFER_READ);
    if (ierr != 0) {
	LOGGER(ibis::gVerbose > 5)
	    << "Warning -- failed to read the content of " << fn
	    << ", fileManager::getFile returned " << ierr;
	return;
    }

    if (m_vec.size() > 1) { // read a file correctly
	if (m_vec.back() > 0) { // has active bits
	    active.nbits = m_vec.back();
	    m_vec.pop_back();
	    active.val = m_vec.back();
	}
	else {
	    active.reset();
	}
	m_vec.pop_back();
    }

#if defined(WAH_CHECK_SIZE)
    nbits = do_cnt();
    // some integrity check here
    if (nbits % MAXBITS != 0) {
	ibis::util::logger lg(4);
	lg() << "Warning -- bitvector::nbits(" << nbits
	     << ") is expected to be multiples of "
	     << MAXBITS << ", but it is not.";
	ierr ++;
    }
    if (nset > nbits+active.nbits) {
	ibis::util::logger lg(4);
	lg() << "Warning -- bitvector::nset (" << nset
	     << ") is expected to be not greater than "
	     << nbits+active.nbits << ", but it is.";
	ierr ++;
    }
    if (active.nbits >= MAXBITS) {
	ibis::util::logger lg(4);
	lg() << "Warning -- bitvector::active::nbits ("
	     << active.nbits << ") is expected to be less than "
	     << MAXBITS << ", but it is not.";
	ierr ++;
    }
#else
    nbits = 0;
    nset = 0;
#endif
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    if (nbits == 0 && ! m_vec.empty())
	nbits = do_cnt();
    if (size() > 0) {
	ibis::util::logger lg(4);
	lg() << "bitvector::read(" << fn << ") --\n";
	(void)print(lg());
    }
    else {
	ibis::util::logger lg(4);
	lg() << "empty file";
    }
#endif
    if (ierr) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::read(" << fn << ") found "
	    << ierr << " error" << (ierr>1?"s":"") << " in three sanity checks";
	throw "bitvector::read failed integrity check";
    }
} // ibis::bitvector::read

/// Write the bit vector to a file.
/// The existing content of the file will be overwritten.
void ibis::bitvector::write(const char * fn)  {
    if (fn == 0 || *fn == 0) return;

    FILE *out = fopen(fn, "wb");
    if (out == 0) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write failed to open \""
	    << fn << "\" to write the bit vector ... "
	    << (errno ? strerror(errno) : "no free stdio stream");
	throw "bitvector::write failed to open file";
    }

    int ierr;
    IBIS_BLOCK_GUARD(fclose, out);
#if defined(WAH_CHECK_SIZE)
    word_t nb = (nbits > 0 ? do_cnt() : nbits);
    if (nb != nbits) {
	ibis::util::logger lg(4);
	print(lg());
	lg() << "Warning -- bitvector::write failed to match the return value "
	     << "of do_cnt (" << nb << ") with nbits (" << nbits << ").  "
	     << "Reset nbits to " << nb;
    }
#endif
//	compress_compax(); 
    ierr = fwrite((const void*)m_vec.begin(), sizeof(word_t), m_vec.size(),
		  out);
    if (ierr != (long)(m_vec.size())) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write only wrote " << ierr
	    << " out of " << m_vec.size() << " words to " << fn;
	throw "bitvector::write failed to write all bytes";
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    active_word tmp(active);
    if (active.nbits >= MAXBITS) {
	tmp.nbits = active.nbits % MAXBITS;
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write detects larger than "
	    << "expected active.nbits (" << active.nbits << ", MAX="
	    << MAXBITS << "), setting it to " << tmp.nbits;
    }
    const word_t avmax = (1 << tmp.nbits) - 1;
    if (active.val > avmax) {
	tmp.val &= avmax;
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write detects larger than "
	    << "expected active.val (" << active.val << ", MAX=" << avmax
	    << "), setting it to " << tmp.val;
    }
    if (tmp.nbits > 0) {
	ierr = fwrite((const void*)&(tmp.val), sizeof(word_t), 1, out);
	LOGGER(ierr < 1 && ibis::gVerbose > 0)
	    << "Warning -- bitvector::write failed to write the active word ("
	    << tmp.val << ") to " << fn;
    }
    ierr = fwrite((const void*)&(tmp.nbits), sizeof(word_t), 1, out);
    LOGGER(ierr < 1 && ibis::gVerbose > 0)
	<< "Warning -- bitvector::write failed to write the number of bits "
	"in the active word (" << tmp.nbits << ") to " << fn;
#else
    if (active.nbits > 0) {
	ierr = fwrite((const void*)&(active.val), sizeof(word_t), 1, out);
	LOGGER(ierr < 1 && ibis::gVerbose > 0)
	    << "Warning -- bitvector::write failed to write the active word ("
	    << active.val << ") to " << fn;
    }
    ierr = fwrite((const void*)&(active.nbits), sizeof(word_t), 1, out);
    LOGGER(ierr < 1 && ibis::gVerbose > 0)
	<< "Warning -- bitvector::write failed to write the number of bits "
	"in the active word (" << active.nbits << ") to " << fn;
#endif
} // ibis::bitvector::write

/// Write to a file that is opened by the caller.  It starts writing at the
/// current file pointer position and overwrites existing content if there
/// is any.  The caller is responsible for openning the file and closing
/// the file.
void ibis::bitvector::write(int out) {
    if (out < 0)
	return;

#if defined(WAH_CHECK_SIZE)
    word_t nb = (nbits > 0 ? do_cnt() : nbits);
    if (nb != nbits) {
	ibis::util::logger lg(4);
	lg() << "Warning -- bitvector::write failed to match the return value "
	     << "of do_cnt(" << nb << ") with nbits (" << nbits
	     << ").  Reset nbits to " << nb;
    }
#endif
	long ierr;
	word_t tmp_size = m_vec.size();
	ierr = UnixWrite(out,(const void*)&tmp_size,sizeof(word_t));
	compress_compax();
    const word_t n = sizeof(word_t) * m_vec.size();
    ierr = UnixWrite(out, (const void*)m_vec.begin(), n);
    if (ierr != (long) n) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write only wrote " << ierr << " out of "
	    << n << " bytes to open file " << out;
	throw "bitvector::write failed to write all bytes";
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    active_word tmp(active);
    if (active.nbits >= MAXBITS) {
	tmp.nbits = active.nbits % MAXBITS;
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write detects a larger than expected "
	    "active.nbits (" << active.nbits << ", MAX=" << MAXBITS
	    << "), setting it to " << tmp.nbits;
    }
    const word_t avmax = (1 << tmp.nbits) - 1;
    if (active.val > avmax) {
	tmp.val &= avmax;
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::write detects a larger than expected "
	    "active.val (" << active.val << ", MAX=" << avmax
	    << "), setting it to " << tmp.val;
    }
    if (tmp.nbits > 0) {
	ierr = UnixWrite(out, (const void*)&(tmp.val), sizeof(word_t));
	LOGGER(ibis::gVerbose > 0 && ierr != (int)sizeof(word_t))
	    << "Warning -- bitvector::write failed to write avtive.val";
    }
    ierr = UnixWrite(out, (const void*)&(tmp.nbits), sizeof(word_t));
    LOGGER(ibis::gVerbose > 0 && ierr != (int)sizeof(word_t))
	<< "Warning -- bitvector::write failed to write avtive.nbits";
#else
    if (active.nbits > 0) {
	ierr = UnixWrite(out, (const void*)&(active.val), sizeof(word_t));
	LOGGER(ibis::gVerbose > 0 && ierr != (int)sizeof(word_t))
	    << "Warning -- bitvector::write failed to write avtive.val";
    }
    ierr = UnixWrite(out, (const void*)&(active.nbits), sizeof(word_t));
    LOGGER(ibis::gVerbose > 0 && ierr != (int)sizeof(word_t))
	<< "Warning -- bitvector::write failed to write avtive.nbits";
#endif

#ifdef FASTBIT_WRITE_WAH_RUNS
    // conditional code for writing run information
    if (ibis::gVerbose > 0) {
	ibis::util::logger lg;
	lg() << "\nrun information of bitvector " << this << "("
	     << nset << ", " << nbits << ")\n";
	for (size_t j = 0; j < m_vec.size(); ++ j) {
	    if (j+1 < m_vec.size()) {
		if (m_vec[j] > ALLONES) { // fill word
		    lg() << "\t" << (m_vec[j] & MAXCNT) << ", ";
		    if (m_vec[j+1] <= ALLONES) {
			lg() << cnt_ones(m_vec[j+1]) << "\n";
			++ j;
		    }
		    else {
			lg() << "0\n";
		    }
		}
		else if (m_vec[j] > 0) { // literal word
		    lg() << "\t0, " << cnt_ones(m_vec[j]) << "\n";
		}
		else if (m_vec[j+1] <= ALLONES) {
		    lg() << "\t1, " << cnt_ones(m_vec[j+1]) << "\n";
		    ++ j;
		}
		else {
		    lg() << "\t1, 0\n";
		}
	    }
	    else if (m_vec[j] > ALLONES) { // last word is a fill word
		lg() << "\t" << (m_vec[j] & MAXCNT) << ", 0\n";
	    }
	    else if (m_vec[j] > 0) {
		lg() << "\t0, " << cnt_ones(m_vec[j]) << "\n";
	    }
	    else {
		lg() << "\t1, 0\n";
	    }
	}
    }
#endif
	word_t vacant = 0x00000000;
	appendWord(vacant); // simply add m_vec.size() by one. 
} // ibis::bitvector::write

/// Write the bit vector to an array_t<word_t>.  The serialized version
/// of this bit vector may be passed to another I/O function or sent
/// through networks.
void ibis::bitvector::write(array_t<ibis::bitvector::word_t>& arr) const {
    arr.reserve(m_vec.size()+1+(active.nbits>0));
    arr.resize(m_vec.size());
    (void) memcpy(arr.begin(), m_vec.begin(), sizeof(word_t)*m_vec.size());
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(active.nbits >= MAXBITS)
	<< "Warning -- bitvector::write detects a larger than expected "
	"active.nbits (" << active.nbits << ", MAX=" << MAXBITS
	<< "), setting it to " << tmp.nbits;
    active_word tmp(active);
    if (active.nbits >= MAXBITS)
	tmp.nbits = MAXBITS-1;

    const word_t avmax = (1 << tmp.nbits) - 1;
    tmp.val &= avmax;
    LOGGER(active.val > avmax)
	<< "Warning -- bitvector::write detects a larger than expected "
	"active.val (" << active.val << ", MAX=" << avmax
	<< "), setting it to " << tmp.val;

    if (tmp.nbits > 0) {
	arr.push_back(tmp.val);
    }
    arr.push_back(tmp.nbits);
#else
    if (active.nbits > 0) {
	arr.push_back(active.val);
    }
    arr.push_back(active.nbits);
#endif
} // ibis::bitvector::write

/// Count the number of bits that are 1 in both this bitvector and mask.
/// This function assumes that both of them are compressed.
ibis::bitvector::word_t
ibis::bitvector::count_c2(const ibis::bitvector& mask) const {
    word_t cnt = cnt_ones(active.val & mask.active.val);
    run x, y;
    x.it = m_vec.begin();
    y.it = mask.m_vec.begin();
    while (x.it < m_vec.end() && y.it < mask.m_vec.end()) {
	if (x.nWords == 0)
	    x.decode();
	if (y.nWords == 0)
	    y.decode();

	if (x.isFill != 0) { // x is a fill
	    if (y.isFill != 0) { // y is a fill too
		if (x.fillBit != 0 && y.fillBit != 0) {
		    if (x.nWords <= y.nWords) {
			cnt += MAXBITS * x.nWords;
			y.nWords -= x.nWords;
			x.nWords = 0;
			++ x.it;
			y.it += (y.nWords == 0);
		    }
		    else {
			cnt += MAXBITS * y.nWords;
			x.nWords -= y.nWords;
			y.nWords = 0;
			++ y.it;
		    }
		}
		else if (x.nWords <= y.nWords) {
		    y.nWords -= x.nWords;
		    y.it += (y.nWords == 0);
		    x.nWords = 0;
		    ++ x.it;
		}
		else {
		    x.nWords -= y.nWords;
		    y.nWords = 0;
		    ++ y.it;
		}
	    }
	    else { // y is a literal word
		if (x.fillBit != 0)
		    cnt += cnt_ones(*y.it);
		++ y.it;
		-- x.nWords;
		y.nWords = 0;
		x.it += (x.nWords == 0);
	    }
	}
	else if (y.isFill != 0) { // x is a literal word, but y is a fill
	    if (y.fillBit != 0)
		cnt += cnt_ones(*x.it);
	    x.nWords = 0;
	    -- y.nWords;
	    ++ x.it;
	    y.it += (y.nWords == 0);
	}
	else { // both are literal words
	    cnt += cnt_ones(*x.it & *y.it);
	    x.nWords = 0;
	    y.nWords = 0;
	    ++ x.it;
	    ++ y.it;
	}
    }
    return cnt;
} // ibis::bitvector::count_c2

/// Count the number of bits that are 1 in both this bitvector and mask.
/// This function assumes mask is uncompressed and does not check this
/// fact.  The caller is responsible for ensuring this precondition is met.
ibis::bitvector::word_t
ibis::bitvector::count_c1(const ibis::bitvector& mask) const {
    run x;
    word_t cnt = cnt_ones(active.val & mask.active.val);
    x.it = m_vec.begin();
    array_t<word_t>::const_iterator it = mask.m_vec.begin();
    while (x.it < m_vec.end() && it < mask.m_vec.end()) {
	x.decode();
	if (x.isFill != 0) { // is a fill
	    if (x.fillBit != 0) {
		while (x.nWords > 0) {
		    cnt += cnt_ones(*it);
		    ++ it;
		    -- x.nWords;
		}
	    }
	    else {
		it += x.nWords;
	    }
	}
	else {
	    cnt += cnt_ones(*it & *x.it);
	    ++ it;
	}
	++ x.it;
    }
    return cnt;
} // ibis::bitvector::count_c1

// bitwise and (&) operation -- both operands may contain compressed words
void ibis::bitvector::and_c2(const ibis::bitvector& rhs,
			     ibis::bitvector& res) const {
    res.clear();
    if (m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.deepCopy(rhs.m_vec);
	    res.nbits = rhs.nbits;
	    res.nset = rhs.nset;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = 0;
	}
	else {
	    res.m_vec.push_back(*it & *(rhs.m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = nset;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(rhs.m_vec);
	    res.nbits = rhs.nbits;
	    res.nset = 0;
	}
	else {
	    res.m_vec.push_back(*it & *(m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (m_vec.size() > 1) {
	run x, y;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	while (x.it < m_vec.end()) { // go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
	    if (x.isFill != 0) {	    // x points to a fill
		// if both x and y point to fills, use the long one
		if (y.isFill != 0) {
		    if (y.fillBit == 0) {
			res.append_counter(0, y.nWords);
			x -= y.nWords;
			y.nWords = 0;
			++ y.it;
		    }
		    else if (y.nWords >= x.nWords) {
			res.copy_runs(x, y.nWords);
			y.it += (y.nWords == 0);
		    }
		    else {
			res.append_counter(x.fillBit, y.nWords);
			x.nWords -= y.nWords;
			y.nWords = 0;
			++ y.it;
		    }
		}
		else if (x.fillBit == 0) { // generate a 0-fill as the result
		    res.append_counter(0, x.nWords);
		    y -= x.nWords;
		    x.nWords = 0;
		    ++ x.it;
		}
		else { // copy the content of y
		    res.copy_runs(y, x.nWords);
		    x.it += (x.nWords == 0);
		}
	    }
	    else if (y.isFill != 0) {	    // i1 is compressed
		if (y.fillBit == 0) { // generate a 0-fill as the result
		    res.append_counter(0, y.nWords);
		    x -= y.nWords;
		    y.nWords = 0;
		    ++ y.it;
		}
		else { // copy the content of x
		    res.copy_runs(x, y.nWords);
		    y.it += (y.nWords == 0);
		}
	    }
	    else { // both words are not compressed
		res.active.val = *(x.it) & *(y.it);
		res.append_active();
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_c2 expects to exhaust i0 "
		"but there are " << (m_vec.end() - x.it) << " word(s) left";
	    throw "and_c2 iternal error";
	}

	if (y.it != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_c2 expects to exhaust i1 "
		"but there are " << (rhs.m_vec.end() - y.it) << " word(s) left";
	    throw "and_c2 iternal error";
	}
    }

    // the last thing -- work with the two active_words
    if (active.nbits) {
	res.active.val = active.val & rhs.active.val;
	res.active.nbits = active.nbits;
    }
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result of AND " << res;
#endif
} // bitvector& ibis::bitvector::and_c2

// and operation where rhs is not compressed (not one word is a counter)
void ibis::bitvector::and_c1(const ibis::bitvector& rhs,
			     ibis::bitvector& res) const {
    res.clear();
    if (m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.deepCopy(rhs.m_vec);
	    res.nbits = rhs.nbits;
	    res.nset = rhs.nset;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = 0;
	}
	else {
	    res.m_vec.push_back(*it & *(rhs.m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (m_vec.size() > 1) {
	array_t<word_t>::const_iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin(), i2;
	word_t s0;
	res.m_vec.reserve(rhs.m_vec.size());
	while (i0 != m_vec.end()) {	// go through all words in m_vec
	    if (*i0 > ALLONES) { // i0 is compressed
		s0 = ((*i0) & MAXCNT);
		if ((*i0)<HEADER1) { // the result is all zero
		    if (s0 > 1)
			res.append_counter(0, s0);
		    else
			res.append_active();
		    i1 += s0;
		}
		else { // the result is *i1
		    i2 = i1 + s0;
		    for (; i1<i2; i1++)
			res.m_vec.push_back(*i1);
		    res.nbits += s0 * MAXBITS;
		}
	    }
	    else { // both words are not compressed
		res.active.val = *i0 & *i1;
		res.append_active();
		i1++;
	    }
	    i0++;
	} // while (i0 != m_vec.end())

	if (i1 != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_c1 expects to exhaust i1 "
		"but there are " << (rhs.m_vec.end() - i1) << " word(s) left";
	    throw "and_c1 iternal error";
	}
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val & rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result of AND " << res;
#endif
} // ibis::bitvector::and_c1

// and operation on two compressed bitvectors, generates uncompressed result
void ibis::bitvector::and_d2(const ibis::bitvector& rhs,
			     ibis::bitvector& res) const {
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose > 2)
	<< "DEBUG -- bitvector::and_d2 -- starting with \nOperand 1\n"
	<< *this << "\nOperand 2\n" << rhs;
#endif
    // establish a uncompressed bitvector with the right size
    res.nbits = ((nbits==0 && m_vec.size()>0) ?
		 (rhs.nbits == 0 && rhs.m_vec.size()>0) ? 
		 (m_vec.size() <= rhs.m_vec.size() ? do_cnt() : rhs.do_cnt())
		 : rhs.nbits : nbits);
    res.m_vec.resize(res.nbits/MAXBITS);

    // fill res with the right numbers
    if (m_vec.size() == 1) { // only one word in *this
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) { // copy rhs
	    rhs.decompress(res.m_vec);
	    res.nset = rhs.nset;
	}
	else if (*it > ALLONES) { // all zeros
	    decompress(res.m_vec);
	    res.nset = 0;
	}
	else {
	    res.m_vec[0] = (*it & *(rhs.m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() == 1) { // only one word in rhs
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // copy *this
	    decompress(res.m_vec);
	    res.nset = nset;
	}
	else if (*it > ALLONES) { // all zero
	    rhs.decompress(res.m_vec);
	    res.nset = 0;
	}
	else {
	    res.m_vec[0] = (*it & *(m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (m_vec.size() > 1) { // more than one word in *this
	run x, y;
	res.nset = 0;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	array_t<word_t>::iterator ir = res.m_vec.begin();
	while (x.it < m_vec.end()) {	// go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
	    if (x.isFill != 0) {
		if (y.isFill != 0) {
		    if (y.fillBit == 0) {
			x -= y.nWords;
			res.copy_fill(ir, y);
		    }
		    else if (y.nWords < x.nWords) {
			x.nWords -= y.nWords;
			y.fillBit = x.fillBit;
			res.copy_fill(ir, y);
		    }
		    else {
			res.copy_runs(ir, x, y.nWords);
			y.it += (y.nWords == 0);
		    }
		}
		else if (x.fillBit == 0) {
		    y -= x.nWords;
		    res.copy_fill(ir, x);
		}
		else {
		    res.copy_runs(ir, y, x.nWords);
		    x.it += (x.nWords == 0);
		}
	    }
	    else if (y.isFill != 0) {
		if (y.fillBit == 0) {
		    x -= y.nWords;
		    res.copy_fill(ir, y);
		}
		else {
		    res.copy_runs(ir, x, y.nWords);
		    y.it += (y.nWords == 0);
		}
	    }
	    else { // both words are not compressed
		*ir = *x.it & *y.it;
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
		++ ir;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_d2 expects to exhaust i0 "
		"but there are " << (m_vec.end() - x.it) << " word(s) left";
	    throw "and_d2 internal error";
	}

	if (y.it != rhs.m_vec.end()) {
	    word_t nb0 = do_cnt() + active.nbits;
	    word_t nb1 = rhs.do_cnt() + rhs.active.nbits;
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_d2 between two bit vectors of "
		"sizes " << nb0 << ':' << bytes() << " and "
		<< nb1 << ':' << rhs.bytes() << "expects to exhaust i1 "
		"but there are " << (rhs.m_vec.end()-y.it) << " word(s) left";
	    throw "and_d2 internal error";
	}

	if (ir != res.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_d2 expects to exhaust ir "
		"but there are " << (res.m_vec.end() - ir) << " word(s) left";
	    throw "and_d2 internal error";
	}
    }

    // work with the two active_words
    res.active.val = active.val & rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "operand 1 of AND" << *this << std::endl;
    lg() << "operand 2 of AND" << rhs << std::endl;
    lg() << "result of AND " << res;
#endif
} // ibis::bitvector::and_d2

// assuming *this is uncompressed but rhs is not, this function performs the
// AND operation and overwrites *this with the result
void ibis::bitvector::and_d1(const ibis::bitvector& rhs) {
    m_vec.nosharing(); // make sure *this is not shared!
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "operand 1 of AND" << *this << std::endl;
	lg() << "operand 2 of AND" << rhs << std::endl;
    }
#endif
    if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it < HEADER1) { // nothing to do for *it >= HEADER1
	    if (*it > ALLONES) { // all zero
		memset(m_vec.begin(), 0, sizeof(word_t)*m_vec.size());
		nset = 0;
	    }
	    else { // one literal word
		m_vec[0] = (*it & *(rhs.m_vec.begin()));
		nset = cnt_ones(m_vec[0]);
	    }
	}
    }
    else if (rhs.m_vec.size() > 1) {
	array_t<word_t>::iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
	word_t s0;
	nset = 0;
	while (i1 != rhs.m_vec.end()) {	// go through all words in m_vec
	    if (*i1 > ALLONES) { // i1 is compressed
		s0 = ((*i1) & MAXCNT);
		if ((*i1) < HEADER1) { // set literal words to zero
		    memset(i0, 0, sizeof(word_t)*s0);
		}
		i0 += s0;
	    }
	    else { // both words are not compressed
		*i0 &= *i1;
		++ i0;
	    }
	    ++ i1;
	} // while (i1 != rhs.m_vec.end())

	if (i0 != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::and_d1 expects to exhaust i0 "
		"but there are " << (m_vec.end() - i0) << " word(s) left";
	    throw "and_d1 internal error";
	}
    }

    // the last thing -- work with the two active_words
    active.val &= rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "result of AND" << *this;
    }
#endif
} // ibis::bitvector::and_d1

// both operands of the 'and' operation are not compressed
void ibis::bitvector::and_c0(const ibis::bitvector& rhs) {
    nset = 0;
    m_vec.nosharing(); // make sure *this is not shared!
    array_t<word_t>::iterator i0 = m_vec.begin();
    array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
    while (i0 != m_vec.end()) {	// go through all words in m_vec
	*i0 &= *i1;
	i0++; i1++;
    } // while (i0 != m_vec.end())

    // the last thing -- work with the two active_words
    active.val &= rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result of AND " << *this;
#endif
} // ibis::bitvector::and_c0

// or operation on two compressed bitvectors
void ibis::bitvector::or_c2(const ibis::bitvector& rhs,
			    ibis::bitvector& res) const {
    res.clear();
    if (m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = nbits;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(rhs.m_vec);
	    res.nbits = rhs.nbits;
	    res.nset = rhs.nset;
	}
	else {
	    res.m_vec.push_back(*it | *(rhs.m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.deepCopy(rhs.m_vec);
	    res.nbits = rhs.nbits;
	    res.nset = rhs.nbits;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = nset;
	}
	else {
	    res.m_vec.push_back(*it | *(m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (m_vec.size() > 1) {
	run x, y;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	while (x.it < m_vec.end()) {	// go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
#if defined(_DEBUG) || defined(DEBUG)
	    LOGGER((x.nWords == 0 || y.nWords == 0) && ibis::gVerbose >= 0)
		<< " Error -- bitvector::or_c2 serious problem here ...";
#endif
	    if (x.isFill != 0) { // x points to a fill
		// if both x and y point to fills, use the longer one
		if (y.isFill != 0) {
		    if (y.fillBit != 0) {
			res.append_counter(y.fillBit, y.nWords);
			x -= y.nWords;
			y.nWords = 0;
			++ y.it;
		    }
		    else if (y.nWords < x.nWords) {
			res.append_counter(x.fillBit, y.nWords);
			x.nWords -= y.nWords;
			y.nWords = 0;
			++ y.it;
		    }
		    else {
			res.copy_runs(x, y.nWords);
			y.it += (y.nWords == 0);
		    }
		}
		else if (x.fillBit) { // the result is all ones
		    res.append_counter(x.fillBit, x.nWords);
		    y -= x.nWords; // advance the pointer in y
		    x.nWords = 0;
		    ++ x.it;
		}
		else { // copy the content of y
		    res.copy_runs(y, x.nWords);
		    x.it += (x.nWords == 0);
		}
	    }
	    else if (y.isFill != 0) { // y points to a fill
		if (y.fillBit) {
		    res.append_counter(y.fillBit, y.nWords);
		    x -= y.nWords;
		    y.nWords = 0;
		    ++ y.it;
		}
		else {
		    res.copy_runs(x, y.nWords);
		    y.it += (y.nWords == 0);
		}
	    }
	    else { // both words are not compressed
		res.active.val = *x.it | *y.it;
		res.append_active();
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::or_c2 expects to exhaust i0 "
		"but there are " << (m_vec.end() - x.it) << " word(s) left";
#if DEBUG+0 > 1 || _DEBUG+0 > 1
	    {
		ibis::util::logger lg(4);
		lg() << "*this: " << *this << std::endl;
		lg() << "rhs: " << rhs << std::endl;
		lg() << "res: " << res;
	    }
#else
	    throw "or_c2 internal error";
#endif
	}

	if (y.it != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::or_c2 expects to exhaust i1 "
		"but there are " << (rhs.m_vec.end() - y.it) << " word(s) left";
#if DEBUG+0 > 1 || _DEBUG+0 > 1
	    {
		ibis::util::logger lg(4);
		lg() << "*this: " << *this << std::endl;
		lg() << "rhs: " << rhs << std::endl;
		lg() << "res: " << res;
	    }
#else
	    throw "or_c2 internal error";
#endif
	}
    }

    // work with the two active_words
    res.active.val = active.val | rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "operand 1 of OR" << *this << std::endl;
    lg() << "operand 2 of OR" << rhs << std::endl;
    lg() << "result of OR " << res;
#endif
} // ibis::bitvector::or_c2

// or operation where rhs is not compressed (not one word is a counter)
void ibis::bitvector::or_c1(const ibis::bitvector& rhs,
			    ibis::bitvector& res) const {
    res.clear();
    if (m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = nbits;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(rhs.m_vec);
	    res.nbits = rhs.nbits;
	    res.nset = rhs.nset;
	}
	else {
	    res.m_vec.push_back(*it | *(rhs.m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (m_vec.size() > 1) {
	array_t<word_t>::const_iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin(), i2;
	word_t s0;
	res.m_vec.reserve(rhs.m_vec.size());
	while (i0 != m_vec.end()) {	// go through all words in m_vec
	    if (*i0 > ALLONES) { // i0 is compressed
		s0 = ((*i0) & MAXCNT);
		if ((*i0)>=HEADER1) { // the result is all ones
		    if (s0 > 1)
			res.append_counter(1, s0);
		    else {
			res.active.val = ALLONES;
			res.append_active();
		    }
		    i1 += s0;
		}
		else { // the result is *i1
		    i2 = i1 + s0;
		    for (; i1<i2; i1++)
			res.m_vec.push_back(*i1);
		    res.nbits += s0 * MAXBITS;
		}
	    }
	    else { // both words are not compressed
		res.active.val = *i0 | *i1;
		res.append_active();
		i1++;
	    }
	    i0++;
	} // while (i0 != m_vec.end())

	if (i1 != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::or_c1 expects to exhaust i1 but "
		"there are " << (rhs.m_vec.end() - i1) << " word(s) left";
	    throw "or_c1 internal error";
	}
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val | rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "operand 1 of OR" << *this << std::endl;
    lg() << "operand 2 of OR" << rhs << std::endl;
    lg() << "result or OR " << res;
#endif
} // ibis::bitvector::or_c1

// or operation on two compressed bitvectors, generates uncompressed result
void ibis::bitvector::or_d2(const ibis::bitvector& rhs,
			    ibis::bitvector& res) const {
    // establish a uncompressed bitvector with the right size
    res.nbits = ((nbits==0 && m_vec.size()>0) ?
		 (rhs.nbits == 0 && rhs.m_vec.size()>0) ? 
		 (m_vec.size() <= rhs.m_vec.size() ? do_cnt() : rhs.do_cnt())
		 : rhs.nbits : nbits);
    res.m_vec.resize(res.nbits/MAXBITS);

    // fill res with the right numbers
    if (m_vec.size() == 1) { // only one word in *this
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) { // all ones
	    decompress(res.m_vec);
	    res.nset = nbits;
	}
	else if (*it > ALLONES) { // copy rhs
	    rhs.decompress(res.m_vec);
	    res.nset = rhs.nset;
	}
	else {
	    res.m_vec[0] = (*it | *(rhs.m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() == 1) { // only one word in rhs
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // all ones
	    rhs.decompress(res.m_vec);
	    res.nset = rhs.nbits;
	}
	else if (*it > ALLONES) { // copy *this
	    decompress(res.m_vec);
	    res.nset = nset;
	}
	else {
	    res.m_vec[0] = (*it | *(m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (m_vec.size() > 1) { // more than one word in *this
	run x, y;
	res.nset = 0;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	array_t<word_t>::iterator ir = res.m_vec.begin();
	while (x.it < m_vec.end()) {	// go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
	    if (x.isFill != 0) {
		if (y.isFill != 0 && y.nWords >= x.nWords) {
		    if (y.fillBit == 0) {
			res.copy_runs(ir, x, y.nWords);
			y.it += (y.nWords == 0);
		    }
		    else {
			x -= y.nWords;
			res.copy_fill(ir, y);
		    }
		}
		else if (x.fillBit == 0) {
		    res.copy_runs(ir, y, x.nWords);
		    x.it += (x.nWords == 0);
		}
		else {
		    y -= x.nWords;
		    res.copy_fill(ir, x);
		}
	    }
	    else if (y.isFill != 0) {
		if (y.fillBit == 0) {
		    res.copy_runs(ir, x, y.nWords);
		    y.it += (y.nWords == 0);
		}
		else {
		    x -= y.nWords;
		    res.copy_fill(ir, y);
		}
	    }
	    else { // both words are not compressed
		*ir = *x.it | *y.it;
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
		++ ir;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::or_d2 expects to exhaust i0 but "
		"there are " << (m_vec.end() - x.it) << " word(s) left\n"
		<< "Operand 1 or or_d2 " << *this << "\nOperand 2 or or_d2 "
		<< rhs << "\nResult of or_d2 " << res;
	    throw "or_d2 internal error";
	}

	if (y.it != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::or_d2 expects to exhaust i1 but "
		"there are " << (rhs.m_vec.end() - y.it) << " word(s) left\n"
		<< "Operand 1 or or_d2 " << *this << "\nOperand 2 or or_d2 "
		<< rhs << "\nResult of or_d2 " << res;
	    throw "or_d2 internal error";
	}

	if (ir != res.m_vec.end()) {
	    LOGGER(ibis::gVerbose >= 0)
		<< "Warning -- bitvector::or_d2 expects to exhaust ir but "
		"there are " << (res.m_vec.end() - ir) << " word(s) left\n"
		<< "Operand 1 or or_d2 " << *this << "\nOperand 2 or or_d2 "
		<< rhs << "\nResult of or_d2 " << res;
	    throw "or_d2 internal error";
	}
    }

    // work with the two active_words
    res.active.val = active.val | rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    LOGGER(ibis::gVerbose >= 0)
	<< "Operand 1 or or_d2 " << *this
	<< "\nOperand 2 or or_d2 " << rhs
	<< "\nResult of or_d2 " << res;
#endif
} // ibis::bitvector::or_d2

// assuming *this is uncompressed but rhs is not, this function performs
// the OR operation and overwrites *this with the result
void ibis::bitvector::or_d1(const ibis::bitvector& rhs) {
    m_vec.nosharing(); // make sure *this is not shared!
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "operand 1 of OR" << *this << std::endl;
	lg() << "operand 2 of OR" << rhs;
    }
#endif
    if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // all ones
	    rhs.decompress(m_vec);
	    nset = nbits;
	}
	else if (*it <= ALLONES) { // one literal word
	    m_vec[0] = (*it | *(rhs.m_vec.begin()));
	    nset = cnt_ones(m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() > 1) {
	array_t<word_t>::iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
	word_t s0;
	nset = 0;
	while (i1 != rhs.m_vec.end()) {	// go through all words in m_vec
	    if (*i1 > ALLONES) { // i1 is compressed
		s0 = ((*i1) & MAXCNT);
		if ((*i1) >= HEADER1) { // the result is all ones
		    array_t<word_t>::const_iterator stp = i0 + s0;
		    while (i0 < stp) {
			*i0 = ALLONES;
			++ i0;
		    }
		}
		else { // the result is *i0
		    i0 += s0;
		}
	    }
	    else { // both words are not compressed
		*i0 |= *i1;
		++ i0;
	    }
	    ++ i1;
	} // while (i1 != rhs.m_vec.end())

	if (i0 != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::or_d1 expects to exhaust i0 but "
		"there are " << (m_vec.end() - i0) << " word(s) left";
	    throw "or_d1 internal error";
	}
    }

    // the last thing -- work with the two active_words
    active.val |= rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "result of OR" << *this;
    }
#endif
} // ibis::bitvector::or_d1

// both operands of the 'or' operation are not compressed
void ibis::bitvector::or_c0(const ibis::bitvector& rhs) {
    m_vec.nosharing(); // make sure *this is not shared!
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "operand 1 of OR" << *this << std::endl;
	lg() << "operand 2 of OR" << rhs;
    }
#endif
    nset = 0;
    array_t<word_t>::iterator i0 = m_vec.begin();
    array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
    while (i0 != m_vec.end()) {	// go through all words in m_vec
	*i0 |= *i1;
	i0++; i1++;
    } // while (i0 != m_vec.end())

    // the last thing -- work with the two active_words
    active.val |= rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    word_t nb = do_cnt();
    if (nbits == 0)
	nbits = nb;
    LOGGER(nb != rhs.nbits && rhs.nbits > 0)
	<< "Warning -- bitvector::or_c0= expects to have " << rhs.nbits
	<< " bits but got " << nb;
    LOGGER(ibis::gVerbose > 4) << "result of OR " << *this;
#endif
} // ibis::bitvector::or_c0

// bitwise xor (^) operation -- both operands may contain compressed words
void ibis::bitvector::xor_c2(const ibis::bitvector& rhs,
			     ibis::bitvector& res) const {
    run x, y;
    res.clear();
    x.it = m_vec.begin();
    y.it = rhs.m_vec.begin();
    while (x.it < m_vec.end()) {	// go through all words in m_vec
	if (x.nWords == 0)
	    x.decode();
	if (y.nWords == 0)
	    y.decode();
	if (x.isFill != 0) { // x points to a fill
	    // if both x and y point to a fill, use the longer fill
	    if (y.isFill != 0 && y.nWords >= x.nWords) {
		if (y.fillBit == 0)
		    res.copy_runs(x, y.nWords);
		else
		    res.copy_runsn(x, y.nWords);
		y.it += (y.nWords == 0);
	    }
	    else if (x.fillBit == 0) {
		res.copy_runs(y, x.nWords);
		x.it += (x.nWords == 0);
	    }
	    else {
		res.copy_runsn(y, x.nWords);
		x.it += (x.nWords == 0);
	    }
	}
	else if (y.isFill != 0) {	// y points to a fill
	    if (y.fillBit == 0)
		res.copy_runs(x, y.nWords);
	    else
		res.copy_runsn(x, y.nWords);
	    y.it += (y.nWords == 0);
	}
	else { // both words are not compressed
	    res.active.val = *x.it ^ *y.it;
	    res.append_active();
	    x.nWords = 0;
	    y.nWords = 0;
	    ++ x.it;
	    ++ y.it;
	}
    } // while (x.it < m_vec.end())

    if (x.it != m_vec.end()) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::xor_c2 expects to exhaust i0 but "
	    "there are " << (m_vec.end() - x.it) << " word(s) left";
	throw "xor_c2 interal error";
    }

    if (y.it != rhs.m_vec.end()) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::xor_c2 expects to exhaust i1 but "
	    "there are " << (rhs.m_vec.end() - y.it) << " word(s) left";
	LOGGER(ibis::gVerbose > 4)
	    << "Bitvector 1\n" << *this << "\n Bitvector 2\n"
	    << rhs << "\nXOR result so far\n" << res;
	throw "xor_c2 internal error";
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val ^ rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result of XOR " << res << std::endl;
#endif
} // bitvector& ibis::bitvector::xor_c2

// xor operation where rhs is not compressed (not one word is a counter)
void ibis::bitvector::xor_c1(const ibis::bitvector& rhs,
			     ibis::bitvector& res) const {
    array_t<word_t>::const_iterator i0 = m_vec.begin();
    array_t<word_t>::const_iterator i1 = rhs.m_vec.begin(), i2;
    word_t s0;
    res.clear();
    res.m_vec.reserve(rhs.m_vec.size());
    while (i0 != m_vec.end()) {	// go through all words in m_vec
	if (*i0 > ALLONES) { // i0 is compressed
	    s0 = ((*i0) & MAXCNT);
	    i2 = i1 + s0;
	    res.nbits += s0*MAXBITS;
	    if ((*i0)>=HEADER1) { // the result is the compliment of i1
		for (; i1!=i2; i1++)
		    res.m_vec.push_back((*i1) ^ ALLONES);
	    }
	    else { // the result is *i1
		for (; i1!=i2; i1++)
		    res.m_vec.push_back(*i1);
	    }
	}
	else { // both words are not compressed
	    res.active.val = *i0 ^ *i1;
	    res.append_active();
	    i1++;
	}
	i0++;
    } // while (i0 != m_vec.end())

    if (i1 != rhs.m_vec.end()) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::xor_c1 expects to exhaust i1 but "
	    "there are " << (rhs.m_vec.end() - i1) << " word(s) left";
	throw "xor_c1 iternal error";
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val ^ rhs.active.val;
    res.active.nbits = active.nbits;

#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result XOR " << res;
#endif
} // ibis::bitvector::xor_c1

// xor operation on two compressed bitvectors, generates uncompressed result
void ibis::bitvector::xor_d2(const ibis::bitvector& rhs,
			     ibis::bitvector& res) const {
    // establish a uncompressed bitvector with the right size
    res.nbits = ((nbits==0 && m_vec.size()>0) ?
		 (rhs.nbits == 0 && rhs.m_vec.size()>0) ? 
		 (m_vec.size() <= rhs.m_vec.size() ? do_cnt() : rhs.do_cnt())
		 : rhs.nbits : nbits);
    res.m_vec.resize(res.nbits/MAXBITS);

    // fill res with the right numbers
    if (m_vec.size() == 1) { // only one word in *this
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) { // complement of rhs
	    rhs.copy_comp(res.m_vec);
	    if (rhs.nset > 0)
		res.nset = nbits - rhs.nset;
	}
	else if (*it > ALLONES) { // copy rhs
	    rhs.decompress(res.m_vec);
	    res.nset = rhs.nset;
	}
	else {
	    res.m_vec[0] = (*it ^ *(rhs.m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() == 1) { // only one word in rhs
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // complement of *this
	    copy_comp(res.m_vec);
	    if (nset > 0) res.nset = nbits - nset;
	}
	else if (*it > ALLONES) { // copy *this
	    decompress(res.m_vec);
	    res.nset = nset;
	}
	else {
	    res.m_vec[0] = (*it ^ *(m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (m_vec.size() > 1) { // more than one word in *this
	run x, y;
	res.nset = 0;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	array_t<word_t>::iterator ir = res.m_vec.begin();
	while (x.it < m_vec.end()) {	// go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
	    if (x.isFill != 0) {
		if (y.isFill != 0 && y.nWords >= x.nWords) {
		    if (y.fillBit == 0) {
			res.copy_runs(ir, x, y.nWords);
		    }
		    else {
			res.copy_runsn(ir, x, y.nWords);
		    }
		    y.it += (y.nWords == 0);
		}
		else {
		    if (x.fillBit == 0) {
			res.copy_runs(ir, y, x.nWords);
		    }
		    else {
			res.copy_runsn(ir, y, x.nWords);
		    }
		    x.it += (x.nWords == 0);
		}
	    }
	    else if (y.isFill != 0) {
		if (y.fillBit == 0) {
		    res.copy_runs(ir, x, y.nWords);
		}
		else {
		    res.copy_runsn(ir, x, y.nWords);
		}
		y.it += (y.nWords == 0);
	    }
	    else { // both words are not compressed
		*ir = *x.it ^ *y.it;
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
		++ ir;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::xor_d2 expects to exhaust i0 but "
		"there are " << (m_vec.end() - x.it) << " word(s) left";
	    throw "xor_d2 internal error";
	}

	if (y.it != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::xor_d2 expects to exhaust i1 but "
		"there are " << (rhs.m_vec.end() - y.it) << " word(s) left";
	    throw "xor_d2 internal error";
	}

	if (ir != res.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::xor_d2 expects to exhaust ir but "
		"there are " << (res.m_vec.end() - ir) << " word(s) left";
	    throw "xor_d2 internal error";
	}
    }

    // work with the two active_words
    res.active.val = active.val ^ rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "operand 1 of XOR" << *this << std::endl;
    lg() << "operand 2 of XOR" << rhs << std::endl;
    lg() << "result of XOR " << res;
#endif
} // ibis::bitvector::xor_d2

// assuming *this is uncompressed but rhs is compressed, this function
// performs the XOR operation and overwrites *this with the result
void ibis::bitvector::xor_d1(const ibis::bitvector& rhs) {
    m_vec.nosharing(); // make sure *this is not shared!
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "operand 1 of XOR" << *this << std::endl;
	lg() << "operand 2 of XOR" << rhs;
    }
#endif
    if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // complement every bit
	    for (array_t<word_t>::iterator i=m_vec.begin(); i!=m_vec.end();
		 ++i) {
		if (*i > ALLONES)
		    *i ^= FILLBIT;
		else
		    *i ^= ALLONES;
	    }
	    if (nset > 0)
		nset = nbits - nset;
	}
	else if (*it <= ALLONES) {
	    m_vec[0] = (*it ^ *(rhs.m_vec.begin()));
	    nset = cnt_ones(m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() > 1) {
	nset = 0;
	word_t s0;
	array_t<word_t>::iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
	while (i1 != rhs.m_vec.end()) {	// go through all words in m_vec
	    if (*i1 > ALLONES) { // i1 is compressed
		s0 = ((*i1) & MAXCNT);
		if ((*i1) >= HEADER1) { // the result is the complement of i0
		    array_t<word_t>::const_iterator stp = i0 + s0;
		    while (i0 < stp) {
			*i0 ^= ALLONES;
			++ i0;
		    }
		}
		else { // the result is *i0
		    i0 += s0;
		}
	    }
	    else { // both words are not compressed
		*i0 ^= *i1;
		++ i0;
	    }
	    ++ i1;
	} // while (i1 != rhs.m_vec.end())

	if (i0 != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::xor_d1 expects to exhaust i0 but "
		"there are " << (m_vec.end() - i0) << " word(s) left";
	    throw "xor_d1 internal error";
	}
    }

    // the last thing -- work with the two active_words
    active.val ^= rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "result of XOR" << *this;
    }
#endif
} // ibis::bitvector::xor_d1

// both operands of the 'xor' operation are not compressed
void ibis::bitvector::xor_c0(const ibis::bitvector& rhs) {
    m_vec.nosharing(); // make sure *this is not shared!
    nset = 0;
    array_t<word_t>::iterator i0 = m_vec.begin();
    array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
    while (i0 != m_vec.end()) {	// go through all words in m_vec
	*i0 ^= *i1;
	i0++; i1++;
    } // while (i0 != m_vec.end())

    // the last thing -- work with the two active_words
    active.val ^= rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result XOR " << *this << std::endl;
    /*
      if (m_vec.size()*(MAXBITS<<1) >= nbits)
      decompress();
    */
#endif
} // ibis::bitvector::xor_c0

// bitwise minus (&!) operation -- both operands may contain compressed words
void ibis::bitvector::minus_c2(const ibis::bitvector& rhs,
			       ibis::bitvector& res) const {
    res.clear();
    if (m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.resize(rhs.m_vec.size());
	    for (word_t i=0; i<rhs.m_vec.size(); ++i) {
		if (rhs.m_vec[i] > ALLONES)
		    res.m_vec[i] = (rhs.m_vec[i] ^ FILLBIT);
		else
		    res.m_vec[i] = (rhs.m_vec[i] ^ ALLONES);
	    }
	    res.nbits = rhs.nbits;
	    if (rhs.nset > 0)
		res.nset = rhs.nbits - rhs.nset;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = 0;
	}
	else {
	    res.m_vec.push_back(*it & ~(*(rhs.m_vec.begin())));
	    res.nbits = nbits;
	}
    }
    else if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) {
	    res.appendFill(0, rhs.nbits);
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = nset;
	}
	else {
	    res.m_vec.push_back(*it & *(m_vec.begin()));
	    res.nbits = nbits;
	}
    }
    else if (m_vec.size() > 1) {
	run x, y;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	while (x.it < m_vec.end()) {	// go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
	    if (x.isFill != 0) {
		if (y.isFill != 0 && y.nWords >= x.nWords) {
		    if (y.fillBit == 0) {
			res.copy_runs(x, y.nWords);
			y.it += (y.nWords == 0);
		    }
		    else {
			res.append_counter(0, y.nWords);
			x -= y.nWords;
			y.nWords = 0;
			++ y.it;
		    }
		}
		else if (x.fillBit == 0) {
		    res.append_counter(0, x.nWords);
		    y -= x.nWords;
		    x.nWords = 0;
		    ++ x.it;
		}
		else {
		    res.copy_runsn(y, x.nWords);
		    x.it += (x.nWords == 0);
		}
	    }
	    else if (y.isFill != 0) {	    // y is compressed but not x
		if (y.fillBit == 0) {
		    res.copy_runs(x, y.nWords);
		    y.it += (y.nWords == 0);
		}
		else {
		    res.append_counter(0, y.nWords);
		    x -= y.nWords;
		    y.nWords = 0;
		    ++ y.it;
		}
	    }
	    else { // both words are not compressed
		res.active.val = *x.it & ~(*y.it);
		res.append_active();
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_c2 expects to exhaust i0 but "
		"there are " << (m_vec.end() - x.it) << " word(s) left";
	    throw "minus_c2 internal error";
	}

	if (y.it != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_c2 expects to exhaust i1 but "
		"there are " << (rhs.m_vec.end() - y.it) << " word(s) left";
	    throw "minus_c2 internal error";
	}
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val & ~(rhs.active.val);
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result MINUS " << res;
    /*
      if (res.m_vec.size()*(MAXBITS<<1) >= res.nbits)
      res.decompress();
    */
#endif
} // bitvector& ibis::bitvector::minus_c2

// minus operation where rhs is not compressed (not one word is a counter)
void ibis::bitvector::minus_c1(const ibis::bitvector& rhs,
			       ibis::bitvector& res) const {
    res.clear();
    if (m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) {
	    res.m_vec.resize(rhs.m_vec.size());
	    for (word_t i=0; i<rhs.m_vec.size(); ++i)
		res.m_vec[i] = (rhs.m_vec[i] ^ ALLONES);
	    res.nbits = rhs.nbits;
	    if (rhs.nset > 0)
		res.nset = rhs.nbits - rhs.nset;
	}
	else if (*it > ALLONES) {
	    res.m_vec.deepCopy(m_vec);
	    res.nbits = nbits;
	    res.nset = 0;
	}
	else {
	    res.m_vec.push_back(*it & ~(*(rhs.m_vec.begin())));
	    res.nbits = nbits;
	}
    }
    else if (m_vec.size() > 1) {
	array_t<word_t>::const_iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin(), i2;
	word_t s0;
	res.clear();
	res.m_vec.reserve(rhs.m_vec.size());
	while (i0 != m_vec.end()) {	// go through all words in m_vec
	    if (*i0 > ALLONES) { // i0 is compressed
		s0 = ((*i0) & MAXCNT);
		i2 = i1 + s0;
		if ((*i0)>=HEADER1) { // the result is the compliment of i1
		    for (; i1 < i2; ++i1)
			res.m_vec.push_back((*i1) ^ ALLONES);
		    res.nbits += s0*MAXBITS;
		}
		else { // the result is a fill of zero bits
		    i1 = i2;
		    if (s0 > 1)
			res.append_counter(0, s0);
		    else
			res.append_active();
		}
	    }
	    else { // both words are not compressed
		res.active.val = *i0 & ~(*i1);
		res.append_active();
		i1++;
	    }
	    i0++;
	} // while (i0 != m_vec.end())

	if (i1 != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_c1 expects to exhaust i1 but "
		"there are " << (rhs.m_vec.end() - i1) << " word(s) left";
	    throw "minus_c1 internal error";
	}
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val & ~(rhs.active.val);
    res.active.nbits = active.nbits;

#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result MINUS " << res;
#endif
} // ibis::bitvector::minus_c1

// minus operation where *this is not compressed (not one word is a counter)
void ibis::bitvector::minus_c1x(const ibis::bitvector& rhs,
				ibis::bitvector& res) const {
    array_t<word_t>::const_iterator i0 = m_vec.begin();
    array_t<word_t>::const_iterator i1 = rhs.m_vec.begin(), i2;
    word_t s0;
    res.clear();
    res.m_vec.reserve(rhs.m_vec.size());
    while (i1 != rhs.m_vec.end()) {	// go through all words in m_vec
	if (*i1 > ALLONES) { // i1 is compressed
	    s0 = ((*i1) & MAXCNT);
	    i2 = i0 + s0;
	    if ((*i1) >= HEADER1) {	// the result is a fill of zero bits
		i0 = i2;
		if (s0 > 1)
		    res.append_counter(0, s0);
		else
		    res.append_active();
	    }
	    else {	// the result is i0
		for (; i0 < i2; ++i0)
		    res.m_vec.push_back(*i0);
		res.nbits += s0*MAXBITS;
	    }
	}
	else {	// both words are not compressed
	    res.active.val = *i0 & ~(*i1);
	    res.append_active();
	    i0++;
	}
	i1++;
    } // while (i1 != rhs.m_vec.end())

    if (i0 != m_vec.end()) {
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::minus_c1x expects to exhaust i0 but "
	    "there are " << (m_vec.end() - i0) << " word(s) left";
	throw "minus_c1x internal error";
    }

    // the last thing -- work with the two active_words
    res.active.val = active.val & ~(rhs.active.val);
    res.active.nbits = active.nbits;

#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result MINUS " << res;
#endif
} // ibis::bitvector::minus_c1x

// minus operation on two compressed bitvectors, it differs from minus_c2 in
// that this one generates a uncompressed result
void ibis::bitvector::minus_d2(const ibis::bitvector& rhs,
			       ibis::bitvector& res) const {
    // establish a uncompressed bitvector with the correct size
    res.nbits = ((nbits==0 && m_vec.size()>0) ?
		 (rhs.nbits == 0 && rhs.m_vec.size()>0) ? 
		 (m_vec.size() <= rhs.m_vec.size() ? do_cnt() : rhs.do_cnt())
		 : rhs.nbits : nbits);
    res.m_vec.resize(res.nbits/MAXBITS);

    // fill res with the right numbers
    if (m_vec.size() == 1) { // only one word in *this
	array_t<word_t>::const_iterator it = m_vec.begin();
	if (*it > HEADER1) { // complement of rhs
	    rhs.copy_comp(res.m_vec);
	    if (rhs.nset > 0)
		res.nset = nbits - rhs.nset;
	}
	else if (*it > ALLONES) { // all zero
	    decompress(res.m_vec);
	    res.nset = 0;
	}
	else {
	    res.m_vec[0] = (*it & ~*(rhs.m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() == 1) { // only one word in rhs
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // all zero
	    (void) memset(res.m_vec.begin(), 0,
			  res.m_vec.size()*sizeof(word_t));
	    res.nset = 0;
	}
	else if (*it > ALLONES) { // copy *this
	    res.m_vec.deepCopy(m_vec);
	    res.nset = nset;
	}
	else {
	    res.m_vec[0] = (*it & ~*(m_vec.begin()));
	    res.nset = cnt_ones(res.m_vec[0]);
	}
    }
    else if (m_vec.size() > 1) { // more than one word in *this
	run x, y;
	res.nset = 0;
	x.it = m_vec.begin();
	y.it = rhs.m_vec.begin();
	array_t<word_t>::iterator ir = res.m_vec.begin();
	while (x.it < m_vec.end()) {	// go through all words in m_vec
	    if (x.nWords == 0)
		x.decode();
	    if (y.nWords == 0)
		y.decode();
	    if (x.isFill != 0) {
		if (y.isFill != 0 && y.nWords >= x.nWords) {
		    if (y.fillBit == 0) {
			res.copy_runs(ir, x, y.nWords);
			y.it += (y.nWords == 0);
		    }
		    else {
			x -= y.nWords;
			y.fillBit = 0;
			res.copy_fill(ir, y);
		    }
		}
		else if (x.fillBit == 0) {
		    y -= x.nWords;
		    res.copy_fill(ir, x);
		}
		else {
		    res.copy_runsn(ir, y, x.nWords);
		    x.it += (x.nWords == 0);
		}
	    }
	    else if (y.isFill != 0) {
		if (y.fillBit == 0) {
		    res.copy_runs(ir, x, y.nWords);
		    y.it += (y.nWords == 0);
		}
		else {
		    x -= y.nWords;
		    y.fillBit = 0;
		    res.copy_fill(ir, y);
		}
	    }
	    else { // both words are not compressed
		*ir = *x.it & ~*y.it;
		x.nWords = 0;
		y.nWords = 0;
		++ x.it;
		++ y.it;
		++ ir;
	    }
	} // while (x.it < m_vec.end())

	if (x.it != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_d2 expects to exhaust i0 but "
		"there are " << (m_vec.end() - x.it) << " word(s) left";
	    throw "minus_d2 internal error";
	}

	if (y.it != rhs.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_d2 expects to exhaust i1 but "
		"there are " << (rhs.m_vec.end() - y.it) << " word(s) left";
	    throw "minus_d2 internal error";
	}

	if (ir != res.m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_d2 expects to exhaust ir but "
		"there are " << (res.m_vec.end() - ir) << " word(s) left";
	    throw "minus_d2 internal error";
	}
    }

    // work with the two active_words
    res.active.val = active.val & ~rhs.active.val;
    res.active.nbits = active.nbits;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "operand 1 of MINUS" << *this << std::endl;
    lg() << "operand 2 of MINUS" << rhs << std::endl;
    lg() << "result of MINUS " << res;
#endif
} // ibis::bitvector::minus_d2

// assuming *this is uncompressed but rhs is not, this function performs
// the MINUS operation and overwrites *this with the result
void ibis::bitvector::minus_d1(const ibis::bitvector& rhs) {
    m_vec.nosharing(); // make sure *this is not shared!
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "operand 1 of MINUS" << *this << std::endl;
	lg() << "operand 2 of MINUS" << rhs << std::endl;
    }
#endif
    if (rhs.m_vec.size() == 1) {
	array_t<word_t>::const_iterator it = rhs.m_vec.begin();
	if (*it > HEADER1) { // 0-fill
	    (void) memset(m_vec.begin(), 0,
			  m_vec.size()*sizeof(word_t));
	    nset = 0;
	}
	else if (*it <= ALLONES) {
	    m_vec[0] = (*it & ~*(rhs.m_vec.begin()));
	    nset = cnt_ones(m_vec[0]);
	}
    }
    else if (rhs.m_vec.size() > 1) {
	nset = 0;
	word_t s0;
	array_t<word_t>::iterator i0 = m_vec.begin();
	array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
	while (i1 != rhs.m_vec.end()) {	// go through all words in m_vec
	    if (*i1 > ALLONES) { // i1 is compressed
		s0 = ((*i1) & MAXCNT);
		if ((*i1) >= HEADER1) { // the result is 0
		    memset(i0, 0, sizeof(word_t)*s0);
		}
		i0 += s0;
	    }
	    else { // both words are not compressed
		*i0 &= ~*i1;
		++ i0;
	    }
	    ++ i1;
	} // while (i1 != rhs.m_vec.end())

	if (i0 != m_vec.end()) {
	    LOGGER(ibis::gVerbose > 0)
		<< "Warning -- bitvector::minus_d1 expects to exhaust i0 but "
		"there are " << (m_vec.end() - i0) << " word(s) left";
	    throw "minus_d1 internal error";
	}
    }

    // the last thing -- work with the two active_words
    active.val &= ~rhs.active.val;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    {
	ibis::util::logger lg(4);
	lg() << "result of MINUS" << *this;
    }
#endif
} // ibis::bitvector::minus_d1

// both operands of the 'minus' operation are not compressed
void ibis::bitvector::minus_c0(const ibis::bitvector& rhs) {
    nset = 0;
    m_vec.nosharing(); // make sure *this is not shared!
    array_t<word_t>::iterator i0 = m_vec.begin();
    array_t<word_t>::const_iterator i1 = rhs.m_vec.begin();
    while (i0 != m_vec.end()) {	// go through all words in m_vec
	*i0 &= ~(*i1);
	i0++;
	i1++;
    } // while (i0 != m_vec.end())

    // the last thing -- work with the two active_words
    active.val &= ~(rhs.active.val);
#if DEBUG+0 > 1 || _DEBUG+0 > 1
    ibis::util::logger lg(4);
    lg() << "result MINUS " << *this;
#endif
} // ibis::bitvector::minus_c0

/// Adjust the size of the bit sequence.  If current size is less than @c
/// nv, append enough 1s so that it has @c nv bits.  If the resulting total
/// number of bits is less than @c nt, append 0 bits so that there are @c
/// nt total bits.  If there are more than @c nt bits, only the first @c nt
/// bits are kept.  The final result always contains @c nt bits.
void ibis::bitvector::adjustSize(word_t nv, word_t nt) {
    if (nbits == 0 || nbits < m_vec.size() * MAXBITS)
	nbits = do_cnt();
    const word_t sz = nbits + active.nbits;
    if (sz == nt) return;
    m_vec.nosharing();

#if DEBUG+0 > 0 || _DEBUG+0 > 0
    LOGGER(ibis::gVerbose > 5)
	<< "DEBUG -- bitvector::adjustSize(" << nv << ", " << nt
	<< ") on bitvector with size " << sz;
#endif
    if (nt > sz) { // add some bits to the end
	if (nv > nt)
	    nv = nt;
	if (nv > sz) {
	    appendFill(1, nv - sz);
	    if (nt > nv)
		appendFill(0, nt - nv);
	}
	else {
	    appendFill(0, nt - sz);
	}
    }
    else { // truncate
	erase(nt, sz);
    }
} // ibis::bitvector::adjustSize

/// Reserve enough space for a bit vector.  The caller needs to specify the
/// number of total bits, nb, and the number of set bits, nc.  The caller
/// may additional specify the clustering factor, cf, if there is a
/// reasonable estimate for it.
void ibis::bitvector::reserve(unsigned nb, unsigned nc, double cf) {
    if (nb >= nc && nc > 0 && nb > MAXBITS) {
	double sz = 0.0;
	const double den = static_cast<double>(nc) / nb;
	const word_t nw = nb / MAXBITS;
	if ((den <= 0.5 && cf > 1.00001) || (den > 0.5 && (1.0-den)*cf > den))
	    sz = ((1.0-den) * pow(1.0-den/((1.0-den)*cf),
				  static_cast<int>(2*MAXBITS-3)) +
		  den * pow(1.0-1.0/cf, static_cast<int>(2*MAXBITS-3)));
	else
	    sz = (pow(1.0-den, static_cast<int>(2*MAXBITS)) +
		  pow(den, static_cast<int>(2*MAXBITS)));
	sz = ceil(nw * (1.0 - sz));
	LOGGER(ibis::gVerbose > 7)
	    << "bitvector::reserve -- attempting to reserve "
	    << 3+static_cast<uint32_t>(sz) << " words";
	m_vec.reserve(3+static_cast<uint32_t>(sz));
    }
} // ibis::bitvector::reserve

/// Estimate clustering factor based on the size.  The size is measured
/// as the number of bytes.
///@sa markovSize.
double ibis::bitvector::clusteringFactor(word_t nb, word_t nc,
					 word_t sz) {
    double f = 1.0;
    sz /= sizeof(word_t); // internally use the number words as size measure
    if (sz <= 3 || nc >= nb) {
	f = nc;
    }
    else if (nb > MAXBITS && nc > 0 && nb > nc && nb > MAXBITS * sz) {
	const int tw3 = MAXBITS + MAXBITS - 3;
	const double den = static_cast<double>(nc) /
	    static_cast<double>(nb);
	const word_t nw = nb / MAXBITS;
	const double f0 = (den > 0.5 ? den / (1 - den) : 1.0); // lower bound
	const double sz1 = 3.0 + nw - sz;
	double ds = 0.0;
	f = f0;
#if DEBUG+0 > 1 || _DEBUG+0 > 1
	LOGGER(ibis::gVerbose >= 0)
	    << "DEBUG -- bitvector:clusteringFactor(" << nb << ", " << nc
	    << ", " << sz << "): sz=" << sz << ", den = "
	    << den << ", nw = " << nw;
#endif
	do {
	    // This is a simple combination of the Newton's method and the
	    // secant method for finding a root.  It use the Newton's method
	    // to find the second point and then use the two point to
	    // perform an extrapolation (secant method).
	    double f2, ds2;
	    ds = sz1 - nw *
		((1.0-den) * pow(1.0-den/((1.0-den)*f), tw3) +
		 den * pow(1.0-1.0/f, tw3));
	    double deri = (tw3 * nw * den / (f*f)) *
		(pow(1.0-den/((1.0-den)*f), tw3-1) +
		 pow(1.0-1.0/f, tw3-1));
	    if (deri != 0.0) {
		ds2 = ds / deri;
		f2 = f + ds2;
		if (f2 < f0) { // undershot
		    f2 = sqrt(f0 * f);
		}
		else if (f2 > nc) { // overshot
		    f2 = sqrt(nc * f);
		}
	    }
	    else { // zero derivative, try something smaller
		f2 = sqrt(f0 * f);
	    }
	    ds2 = sz1 - nw *
		((1.0-den) * pow(1.0-den/((1.0-den)*f2), tw3) +
		 den * pow(1.0-1.0/f2, tw3));
#if DEBUG+0 > 1 || _DEBUG+0 > 1
	    LOGGER(ibis::gVerbose >= 0)
		<< "DEBUG -- bitvector:clusteringFactor(" << nb
		<< ", " << nc << ", " << sz << "): computed size="
		<< (ds + sz) << ", ds = "
		<< ds << ", deri = " << deri << ", f = "
		<< f << ", ds2 = " << ds2 << ", f2 = " << f2;
#endif
#if defined(QUARDRATIC_INTERPOLATION_FOR_CLUSTERING_FACTOR)
	    // quardratic extrapolation does not work well, likely because
	    // (1) have not found a strategy to decide which one of the two
	    // solutions to use
	    // (2) it relies on the first point more than the second point,
	    // because it uses the function value and the derivative of the
	    // first point but only use the function value of the second
	    // point.  This biases the extrapolation too much to the first
	    // point and reduces its effectiveness.
	    if (f != f2) { // quardratic extrapolation
		double tmp, a, b, c;
		c = (f - f2);
		a = - deri - (ds - ds2) / c;
		if (a != 0) {
		    a /= c;
		    b = - deri - 2.0 * a * f;
		    c = ds - (a*f + b) * f;
		    if (b*b > 4.0*a*c) { // quardratic formula has solutions
			c = 0.5 * sqrt(b*b - 4.0*a*c) / a;
			b = -0.5 * b / a;
			a = b - c;
			b += c;
			if (a > b) {
			    c = a;
			    a = b;
			    b = c;
			}
#if DEBUG+0 > 1 || _DEBUG+0 > 1
			LOGGER(1) << "a = " << a << ", b = " << b
				  << ", linear extrapolation = "
				  << f - (f - f2) * ds / (ds - ds2)
				  << std::endl;
#endif
			//if (a < f0) tmp = b;
			//else tmp = a;
			tmp = b;
		    }
		    else { // use linear interpolation
			tmp = f - (f - f2) * ds / (ds - ds2);
		    }
		    if (tmp > f0) f2 = tmp;
		    else f2 = sqrt(f0 * f2);
		}
	    }
#else
	    if (ds != ds2) { // use linear interpolation
		double tmp = (f*ds2 - f2*ds) / (ds2 - ds);
		if (tmp < f0) // undershot
		    f2 = sqrt(f * f0);
		else if (tmp > nc) // overshot
		    f2 = sqrt(f * nc);
		else
		    f2 = tmp;
	    }
	    else {
		f2 = 0.5 *(f + f2);
	    }
#endif
	    ds = f2 - f;
	    f = f2;
	} while (fabs(ds) > 1e-4*f);
    }
    return f;
} // ibis::bitvector::clusteringFactor

// assignment operator for ibis::bitvector::iterator
// ********************IMPORTANT********************
// operator= modifies the content of the bitvector it points to and it can
// invalidate other iterator and const_iterator referring to the same
// bitvector.
const ibis::bitvector::iterator&
ibis::bitvector::iterator::operator=(int val) {
    if (it > vec->end()) { // end
	LOGGER(ibis::gVerbose > 0)
	    << "Warning -- bitvector::iterator::operator= cannot assign value "
	    "to an invalid iterator";
	return *this;
    }
    if ((val!=0) == operator*()) {
	return *this; // no change
    }
    if (it == vec->end()) { // modify the active bit
	if (val != 0) {
	    active->val |= (1 << (active->nbits - ind - 1));
	}
	else {
	    active->val &= ~(1 << (active->nbits - ind - 1));
	}
	return *this;
    }

    /////////////////////////////////////
    // the bit to be modified is in m_vec
    //
    if (compressed == 0) { // toggle a single bit of a literal word
	*it ^= (1 << (ibis::bitvector::SECONDBIT - ind));
    }
    else if (ind < ibis::bitvector::MAXBITS) {
	// bit to be modified is in the first word, two pieces
	-- (*it);
	if ((*it & ibis::bitvector::MAXCNT) == 1)
	    *it = (val != 0)?0:ibis::bitvector::ALLONES;
	word_t w = (1 << (ibis::bitvector::SECONDBIT-ind));
	if (val == 0) w ^= ibis::bitvector::ALLONES;
	it = vec->insert(it, w);
    }
    else if (nbits - ind <= ibis::bitvector::MAXBITS) {
	// bit to be modified is in the last word, two pieces
	-- (*it);
	if ((*it & ibis::bitvector::MAXCNT) == 1)
	    *it = (val != 0)?0:ibis::bitvector::ALLONES;
	word_t w = 1 << (nbits-ind-1);
	if (val == 0) w ^= ibis::bitvector::ALLONES;
	++ it;
	it = vec->insert(it, w);
    }
    else { // the counter breaks into three pieces
	word_t u[2], w;
	u[0] = ind / MAXBITS;
	w = (*it & MAXCNT) - u[0] - 1;
	u[1] = 1 << (SECONDBIT - ind + u[0]*MAXBITS);
	if (val==0) {
	    u[0] = (u[0]>1)?(HEADER1|u[0]):(ALLONES);
	    u[1] ^= ibis::bitvector::ALLONES;
	    w = (w>1)?(HEADER1|w):(ALLONES);
	}
	else {
	    u[0] = (*u>1)?(HEADER0|u[0]):static_cast<word_t>(0);
	    w = (w>1)?(HEADER0|w):static_cast<word_t>(0);
	}
	*it = w;
	// NOTE: std::vector::iterator can not be subtracted like this
	w = it - vec->begin();
	vec->insert(it, u, u+2);
	++ w;
	it = vec->begin() + w;//std::vector::iterator can't be added like this
    }

    // restore the current iterator and the referred bitvector to the correct
    // states
    ind = ind % ibis::bitvector::MAXBITS;
    nbits = ibis::bitvector::MAXBITS;
    literalvalue = *it;
    compressed = 0;
    if (bitv->nset) bitv->nset += val?1:-1;
    return *this;
} // ibis::bitvector::iterator::operator=(int val)

// advance position with a longer stride
ibis::bitvector::iterator& ibis::bitvector::iterator::operator+=(int incr) {
    if (incr < 0) { // advance backword
	if (ind >= static_cast<word_t>(-incr)) {
	    ind += incr;
	}
	else { // need to move on the previous word
	    int incr0 = incr + ind;
	    while (incr0 < 0 && it > vec->begin()) {
		--it;
		decodeWord();
		if (nbits >= static_cast<word_t>(-incr0)) {
		    ind = nbits + incr0;
		    incr0 = 0;
		}
		else {
		    incr0 += nbits;
		}
	    }
	    LOGGER(incr0 < 0)
		<< "Warning -- bitvector::iterator::operator+=("
		<< incr << ") passes the beginning of the bit sequence";
	}
    }
    else if (incr > 0) { // advance forward
	if (ind+incr < nbits) {
	    ind += incr;
	}
	else { // need to move on to the next word
	    int incr1 = incr + ind - nbits;
	    while (incr1 >= 0 && it < vec->end()) {
		++ it;
		decodeWord();
		if (nbits > (word_t)incr1) {
		    ind   = incr1;
		    incr1 = INT_MIN;
		}
		else {
		    incr1 -= nbits;
		}
	    }
	    LOGGER(incr1 > 0)
		<< "Warning -- bitvector::iterator::operator+=("
		<< incr << ") passes the end of the bit sequence";
	}
    }

    return *this;
} // ibis::bitvector::iterator::operator+=

// decode the word pointed by it;
// when it is out of designated range, it returns end()
void ibis::bitvector::iterator::decodeWord() {
    if (it < vec->end() && it >= vec->begin()) {
	// deal with the normal case first
	if (*it > ibis::bitvector::HEADER1) {
	    fillbit = 1;
	    compressed = 1;
	    nbits = ((*it) & MAXCNT) * MAXBITS;
	}
	else if (*it > ibis::bitvector::HEADER0) {
	    fillbit = 0;
	    compressed = 1;
	    nbits = ((*it) & MAXCNT) * MAXBITS;
	}
	else {
	    compressed = 0;
	    nbits = MAXBITS;
	    literalvalue = *it;
	}
    }
    else if (it == vec->end()) { // return active word
	compressed = 0;
	nbits = active->nbits;
	literalvalue = (active->val << (MAXBITS - nbits));
	it += (nbits == 0);
    }
    else { // it is out of valid range -- treat it as the end
	it = vec->end() + 1;
	compressed = 0;
	nbits = 0;
	literalvalue = 0;
	fillbit = 0;
    }
    ind = 0;
} // ibis::bitvector::iterator::decodeWord()

// advance position with a longer stride
ibis::bitvector::const_iterator&
ibis::bitvector::const_iterator::operator+=(int incr) {
    if (incr < 0) { // advance backword
	if (ind >= static_cast<word_t>(-incr)) {
	    ind += incr;
	}
	else { // need to move on the previous word
	    int incr0 = incr + ind;
	    while (incr0 < 0 && it > begin) {
		--it;
		decodeWord();
		if (nbits >= static_cast<word_t>(-incr0)) {
		    ind = nbits + incr0;
		    incr0 = 0;
		}
		else {
		    incr0 += nbits;
		}
	    }
	    LOGGER(incr0 < 0)
		<< "Warning -- bitvector::const_iterator::"
		<< "operator+=(" << incr
		<< ") passes the beginning of the bit sequence";
	}
    }
    else if (incr > 0) { // advance forward
	if (ind+incr < nbits) {
	    ind += incr;
	}
	else { // need to move on to the next word
	    int incr1 = incr + ind - nbits;
	    while (incr1 >= 0 && it < end) {
		++ it;
		decodeWord();
		if (nbits > (word_t)incr1) {
		    ind   = incr1;
		    incr1 = INT_MIN;
		}
		else {
		    incr1 -= nbits;
		}
	    }
	    LOGGER(incr1 > 0)
		<< "Warning -- bitvector::const_iterator::operator+=("
		<< incr << ") passes the end of the bit sequence";
	}
    }

    return *this;
} // ibis::bitvector::const_iterator::operator+=

// decode the word pointed by it;
// when it is out of designated range, it returns end()
void ibis::bitvector::const_iterator::decodeWord() {
    if (it < end && it >= begin) { // deal with the normal case first
	if (*it > ibis::bitvector::HEADER1) {
	    fillbit = 1;
	    compressed = 1;
	    nbits = ((*it) & MAXCNT) * MAXBITS;
	}
	else if (*it > ibis::bitvector::HEADER0) {
	    fillbit = 0;
	    compressed = 1;
	    nbits = ((*it) & MAXCNT) * MAXBITS;
	}
	else {
	    compressed = 0;
	    nbits = MAXBITS;
	    literalvalue = *it;
	}
    }
    else if (it == end) { // return active word
	compressed = 0;
	nbits = active->nbits;
	literalvalue = (active->val << (MAXBITS - nbits));
	it += (nbits == 0);
    }
    else { // it is out of valid range -- treat it as the end
	it = end + 1;
	compressed = 0; nbits = 0; literalvalue = 0; fillbit = 0;
    }
    ind = 0;
} // ibis::bitvector::const_iterator::decodeWord()

/// Advance to the next code word that is not zero.
///
/// If the current position is already at the end of the bitvector, nothing
/// will be done by this function.
ibis::bitvector::indexSet& ibis::bitvector::indexSet::operator++() {
    if (it > end) { // already at the end
	nind = 0;
	return *this;
    }
    //     if (it >= end) { // reaching the end
    // 	++ it;
    // 	nind = 0;
    // 	return *this;
    //     }

    // the index of the next position
    word_t index0 = ((ind[0]+(nind>MAXBITS?nind:MAXBITS)) / MAXBITS)
	* MAXBITS;

    // skip to the next code word containing any ones
    ++ it; // examining the next word
    nind = 0;
    while (it < end) {
	if (*it >= HEADER1) { // 1-fill
	    nind = ((*it) & MAXCNT) * MAXBITS;
	    ind[1] = index0 + nind;
	    ind[0] = index0;
	    return *this;
	}
	else if (*it >= HEADER0) { // 0-fill
	    index0 += ((*it) & MAXCNT) * MAXBITS;
	    ++ it;
	}
	else if (*it > 0) { // non-zero literal word
	    if (*it < ALLONES) { // a mixture of 0 and 1
		word_t i, j = (*it<<1);
		for (i=0; j>0; ++i, j <<= 1) {
		    if (j > ALLONES) {
			ind[nind] = index0 + i;
			++ nind;
		    }
		}
	    }
	    else { // all 1s
		nind = MAXBITS;
		ind[0] = index0;
		ind[1] = index0 + nind;
		// for (int i=0; i<MAXBITS; ++i) ind[i] = index0+i;
	    }
	    return *this;
	}
	else { // zero word
	    index0 += MAXBITS;
	    ++ it;
	}
    } // while (it < end)

    // deal with the active word
    if (active->nbits > 0 && active->val > 0) {
	// a non-zero active word
	word_t i, j = (active->val << (MAXBITS + 1 - active->nbits));
	for (i=0; j>0; ++i, j <<= 1) {
	    if (j > ALLONES) {
		ind[nind] = index0 + i;
		++ nind;
	    }
	}
    }
    it = end + 1;
    return *this;
} // ibis::bitvector::indexSet::operator++

/// \code
/// res[jj*bits2.size()+ii] = bits1[jj] & bits2[ii]
/// \endcode
long ibis::util::intersect(const std::vector<ibis::bitvector> &bits1,
			   const std::vector<ibis::bitvector> &bits2,
			   std::vector<ibis::bitvector> &res) {
    if (bits1.empty() || bits2.empty())
	return 0;
    res.resize(bits1.size() * bits2.size());
    for (uint32_t jj = 0; jj < bits1.size(); ++ jj) {
	const uint32_t joff = jj * bits2.size();
	for (uint32_t ii = 0; ii < bits2.size(); ++ ii) {
	    ibis::bitvector *tmp = bits1[jj] & bits2[ii];
	    if (tmp != 0) {
		tmp->compress();
		res[joff+ii].copy(*tmp);
		delete tmp;
	    }
	    else {
		LOGGER(ibis::gVerbose > 0)
		    << "util::intersect(" << bits1.size() << ", "
		    << bits2.size() << ") failed to compute the intersection "
		    << "of bitmaps bits1[" << jj << "] and bits2[" << ii << "]";
	    }
	}
#if defined(_DEBUG) || defined(DEBUG)
	LOGGER(ibis::gVerbose > 5)
	    << "util::intersect -- completed (" << jj
	    << ", ...), memory in use = "
	    << ibis::fileManager::instance().bytesInUse();
#endif
    }
    return res.size();
} // ibis::util::intersect

/// \code
/// res[(kk*bits2.size()+jj)*bits3.size()+ii] = bits1[kk] & bits2[jj] & bits3[ii]
/// \endcode
long ibis::util::intersect(const std::vector<ibis::bitvector> &bits1,
			   const std::vector<ibis::bitvector> &bits2,
			   const std::vector<ibis::bitvector> &bits3,
			   std::vector<ibis::bitvector> &res) {
    if (bits1.empty() || bits2.empty() || bits3.empty())
	return 0;
    res.resize(bits1.size() * bits2.size() * bits3.size());
    for (uint32_t kk = 0; kk < bits1.size(); ++ kk) {
	const uint32_t koff = kk * bits2.size();
	for (uint32_t jj = 0; jj < bits2.size(); ++ jj) {
	    const uint32_t joff = (koff + jj) * bits3.size();
	    ibis::bitvector bjk(bits2[jj]);
	    bjk &= bits1[kk];
	    bjk.compress();
	    for (uint32_t ii = 0; ii < bits3.size(); ++ ii) {
		ibis::bitvector tmp(bits3[ii]);
		tmp &= bjk;
		tmp.compress();
		res[joff+ii].copy(tmp);
	    }
#if defined(_DEBUG) || defined(DEBUG)
	    LOGGER(ibis::gVerbose > 5)
		<< "util::intersect -- completed (" << kk << ", " << jj
		<< ", ...), memory in use = "
		<< ibis::fileManager::instance().bytesInUse();
#endif
	}
    }
    return res.size();
} // ibis::util::intersect

/// Clear an array of bit vectors.
void ibis::util::clear(ibis::array_t<ibis::bitvector*> &bv) throw() {
    const uint32_t nbv = bv.size();
    for (uint32_t i = 0; i < nbv; ++ i)
	delete bv[i];
    bv.clear();
} // ibis::util::clear