void fillEntryTree(Set<PageLeafEntry> entries,Row row){
  int ptr=_rowHead;
  byte[] buffer=_buffer;
  while (ptr < BLOCK_SIZE) {
    int code=buffer[ptr] & CODE_MASK;
    int len=getLength(code,row);
    if (code == INSERT || code == REMOVE) {
      PageLeafEntry entry=new PageLeafEntry(this,row,ptr,len,code);
      entries.add(entry);
    }
    ptr+=len;
  }
}

void fillEntryTree ( Set < PageLeafEntry > entries , Row row ) { int ptr = _rowHead ; byte [ ] buffer = _buffer ; while ( ptr < BLOCK_SIZE ) { int code = buffer [ ptr ] & CODE_MASK ; int len = getLength ( code , row ) ; if ( code == INSERT || code == REMOVE ) { PageLeafEntry entry = new PageLeafEntry ( this , row , ptr , len , code ) ; entries . add ( entry ) ; } ptr += len ; } }
fills the entry tree map with entries from the block .
