phelps.io
public class KeyStore extends Object
long
(8 bytes), which is used by DiskHash as an offset into a DataStore.
Nodes of the B-tree are read on demand and cached in memory in java.lang.ref.SoftReferences.
Nodes written to are kept in memory and not written to disk until a flush or a close.
Field Summary | |
---|---|
static int | VERSION Data format version. |
Constructor Summary | |
---|---|
KeyStore(String filename) | |
KeyStore(String filename, int blocksize) |
Method Summary | |
---|---|
void | close() |
void | flush() |
long | get(String key) Return data offset for given key. |
void | insert(String key, long dataoffset) Add key of given name and data offset to B-tree. |
Iterator<String> | iterator() Iterator over keys, in sorted order. |
Iterator<String> | iterator(String key1, String key2)
Iterator over range from key1 to key2, inclusive.
|
void | remove(String key) |
void | set(String key, long dataoffset) Replace data offset for key. |
Parameters: blocksize size of tree nodes, mimimum of 1K bytes. If KeyStore already exists, the passed value is ignored and the value is retrieved from its storage on disk.