Destroy releases all temporary and permanent resources held by the index. No other method call are allowed after Destroy.

ScanEntries return a full table iterator.

Close will release all temporary resources held by the index. No other method call, except Destroy, are allowed after Close.

Count number of indexed entries.

Scan return a full table iterator.

ID is same as the name supplied while creating the index instance.

Build starts building the tree from iterator, iterator is expected to be a full-table scan over another data-store.

Close instance after building the btree. This will mark disk files as immutable for rest of its life-time. Use OpenSnapshot for reading.

Count return the number of items indexed.

Abort transaction, underlying index won't be touched.

OpenCursor open an active cursor inside the index.

Defaultsettings for llrb instance. "memcapacity" (int64, default: available free-ram) Memory capacity required for keys / values. Default will be r

Add a new sample.

Validate data structure. This is a costly operation, walks through the entire tree and holds a read lock while doing so.

Value return current value under the cursor. Returned byte slice will be a reference to value in index, hence must not be used after transaction is co

Key return current key under the cursor. Returned byte slice will be a reference to index-key, hence must not be used after transaction is commited or

NewBubt create a Bubt instance to build a new bottoms-up btree. If zblocksize == 0, then zblocksize will be same as mblocksize. if vblocksize == 0, th

OpenSnapshot from paths.

Set a key, value pair in the index, if key is already present, its value will be over-written. Make sure key is not nil. Return old value if oldvalue

View start a read only transaction, all read operations will be on a stable snapshot until it is Aborted. Finally all view objects must be Aborted.

Delete key from index. Key should not be nil, if key found return its value. If lsm is true, then don't delete the node instead mark the node as delet

Set a key, value pair in the index, if key is already present, its value will be over-written. Make sure key is not nil. Return old value if oldvalue

Validate data structure. This is a costly operation, walks through the entire tree and holds a read lock while doing so.

Get value for key, if value argument points to valid buffer it will be used to copy the entry's value. Also return entry's cas and whether entry is ma

NewLLRB a new instance of in-memory sorted index.

Scan return a full table iterator, if iteration is stopped before reaching end of table (io.EOF), application should call iterator with fin as true. E

YNext implements Iterator api, to iterate over the index. Typically used for lsm-sort.

addKeyparameter for a single parameter field.

---- indexer api

Delete key from index. Key should not be nil, if key found return its value. If lsm is true, then don't delete the node instead mark the node as delet

NewArena create a new memory arena.

NewMVCC a new instance of in-memory sorted index.

YSort is a iterate combinator that takes two iterator and return a new iterator that handles LSM.

YSortEntries is a iterate combinator that takes two iterator and return a new iterator that handles LSM.

Destroy releases all resources held by the tree. No other method call are allowed after Destroy.

---- Exported Read methods Get value for key, if value argument points to valid buffer it will, be used to copy the entry's value. Also returns entry'

---- Exported Read methods Get value for key, if value argument points to valid buffer, it will be used to copy the entry's value. Also returns entry'

return a valid set of disk levels with newest level in the beginning.

---- operations Alloc implement api.Mallocer{} interface.

Commit transaction, commit will block until all write operations under the transaction are successfully applied. Return ErrorRollback if ACID properti

Set a key, value pair in the index, if key is already present, its value will be over-written. Make sure key is not nil. Return old value if oldvalue

----- seqno and flags

Destroy releases all resources held by the tree. No other method call are allowed after Destroy.

var yGetpool = make(chan *yGet, 1000) type yGet struct { a api.Getter b api.Getter } func SetYGetpool(poolsize int) { yGetpool = make(chan *yGet,

Count return the number of items indexed.

Binarycmp is same as bytes.Compare except for partial matches. For EG: bytes.Compare([]byte("aaa"), []byte("aa")) shall return 1, whereas Binarycmp wi

Mean return the average value of all samples.

NewhistorgramInt64 return a new histogram object.

Samples return total number of samples in the set.

SetCAS a key, value pair in the index, if CAS is ZERO then key should not be present in the index, otherwise existing CAS should match the supplied CA

SetCAS a key, value pair in the index, if CAS is ZERO then key should not be present in the index, otherwise existing CAS should match the supplied CA

GetNext move cursor to next entry in snapshot and return its key and value. Returned byte slices will be a reference to index entry, hence must not be

Info implement api.MemoryPool{} interface.

height of the tree cannot exceed a certain limit. For example if the tree holds 1-million entries, a fully balanced tree shall have a height of 20 lev

Alloc allocate a chunk of `n` bytes from `pool`. Allocated memory is always 8-byte aligned.

Delete key from index. Key should not be nil, if key found return its value. If lsm is true, then don't delete the node instead mark the node as delet

Free chunk from arena/pool.

Sum return the sum of all sample values.