| Package | Description |
|---|---|
| com.hazelcast.elastic.tree |
RB Tree implementation
|
| com.hazelcast.elastic.tree.impl |
| Modifier and Type | Method and Description |
|---|---|
OffHeapTreeEntry |
OffHeapTreeStore.getEntry(com.hazelcast.internal.serialization.impl.HeapData key)
Looking for key equal to blob;
|
OffHeapTreeEntry |
OffHeapTreeStore.getEntry(MemoryBlock key)
Looking for key equal to blob;
|
OffHeapTreeEntry |
OffHeapTreeStore.getEntry(MemoryBlock key,
OffHeapComparator comparator)
Looking for key equal to blob using the given comparator;
In case if not-found - if createIfNotExists==true - create new key entry;
if createIfNotExists==false - don't create new key entry - return null;
|
OffHeapTreeEntry |
OffHeapTreeStore.put(MemoryBlock key,
MemoryBlock value)
Looking for key equal to blob;
In case if found - append value represented by value to the chain of key's values;
In case if not-found - adds new key to the corresponding place in the tree and assign value to this 'new' key;
|
OffHeapTreeEntry |
OffHeapTreeStore.searchEntry(MemoryBlock key)
Looking for key equal or closest to blob;
|
| Modifier and Type | Method and Description |
|---|---|
Iterator<OffHeapTreeEntry> |
OffHeapTreeStore.entries() |
Iterator<OffHeapTreeEntry> |
OffHeapTreeStore.entries(OffHeapTreeEntry entry) |
Iterator<OffHeapTreeEntry> |
OffHeapTreeStore.entries(OffHeapTreeEntry entry,
OrderingDirection direction) |
Iterator<OffHeapTreeEntry> |
OffHeapTreeStore.entries(OrderingDirection direction) |
| Modifier and Type | Method and Description |
|---|---|
Iterator<OffHeapTreeEntry> |
OffHeapTreeStore.entries(OffHeapTreeEntry entry) |
Iterator<OffHeapTreeEntry> |
OffHeapTreeStore.entries(OffHeapTreeEntry entry,
OrderingDirection direction) |
void |
OffHeapTreeStore.remove(OffHeapTreeEntry entry)
Removes the entry from the tree and disposes used space associated with that entry
including Key and Value blobs.
|
| Modifier and Type | Method and Description |
|---|---|
OffHeapTreeEntry |
RedBlackTreeStore.getEntry(com.hazelcast.internal.serialization.impl.HeapData key) |
OffHeapTreeEntry |
RedBlackTreeStore.getEntry(MemoryBlock key) |
OffHeapTreeEntry |
RedBlackTreeStore.getEntry(MemoryBlock key,
OffHeapComparator comparator) |
OffHeapTreeEntry |
EntryIterator.next() |
OffHeapTreeEntry |
RedBlackTreeStore.put(MemoryBlock key,
MemoryBlock value) |
OffHeapTreeEntry |
RedBlackTreeStore.put(MemoryBlock key,
MemoryBlock value,
OffHeapComparator comparator) |
OffHeapTreeEntry |
RedBlackTreeStore.searchEntry(MemoryBlock key) |
| Modifier and Type | Method and Description |
|---|---|
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.entries() |
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.entries(OffHeapTreeEntry root) |
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.entries(OffHeapTreeEntry entry,
OrderingDirection direction) |
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.entries(OrderingDirection direction) |
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.iterator() |
| Modifier and Type | Method and Description |
|---|---|
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.entries(OffHeapTreeEntry root) |
Iterator<OffHeapTreeEntry> |
RedBlackTreeStore.entries(OffHeapTreeEntry entry,
OrderingDirection direction) |
void |
RedBlackTreeStore.remove(OffHeapTreeEntry entry) |
Copyright © 2021 Hazelcast, Inc.. All Rights Reserved.