Examples of PrimaryTreeMap

Primary HashMap which persist data in storage. Behavior is very similar to

java.util.HashMap/code>, this map also uses b-tree index to lookup keys But it adds some methods to create secondary views  Performance note: keys and values are stored as part of index nodes. They are deserialized on each index lookup. This may lead to performance degradation and OutOfMemoryExceptions. If your values are big (>500 bytes) you may consider using PrimaryStoreMap or  to minimalize size of index.
@author Jan Kotek
@param < K> key type
@param < V> value type

Examples of jdbm.PrimaryTreeMap


  
  public void testDefragBtree() throws IOException{
    String file = newTestFile();
    BaseRecordManager m = new BaseRecordManager(file);
    PrimaryTreeMap t = m.treeMap("aa");
    TreeMap t2 = new TreeMap();
    for(int i =0;i<10000;i ++ ){
      t.put(i, ""+i);
      t2.put(i, ""+i);
    }
          
    m.defrag();    
    m.close();

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.