protected TrieInfo getInfo(){
        TrieInfo val = new TrieInfo();

        val.next = this.getBranchSize();
        val.nhop = this.getBranchSize();
        val.lhop = (this.lhop!=null)?this.getLessBranchSize():0;
        val.bitSet = this.getBranchSize() >>> 5; //2^6 = 64; a long, which consists of 64 bits, and a int which consists of 32 bits

        val.entry = 0;
        if( this.lhop!=null) {
            for (int i = 0; i < this.getLessBranchSize(); i++) {
                if( this.lhop[i]!=0 ) val.entry++;
            }
        }
        for(int i=0;i<this.getBranchSize();i++){
            if( this.isRib.get(i) ) val.entry++;
        }
        return val;
    }