| 程序包 | 说明 |
|---|---|
| org.h2.mvstore |
A persistent storage for tree maps.
|
| org.h2.mvstore.rtree |
An R-tree implementation
|
| 限定符和类型 | 字段和说明 |
|---|---|
Page<K,V> |
CursorPos.page
The page at the current level.
|
Page<K,V> |
CursorPos.page
The page at the current level.
|
Page<K,V> |
RootReference.root
The root page.
|
Page<K,V> |
RootReference.root
The root page.
|
| 限定符和类型 | 方法和说明 |
|---|---|
protected Page<K,V> |
Page.clone() |
protected Page<K,V> |
Page.clone() |
Page<K,V> |
Page.copy()
Create a copy of this page.
|
Page<K,V> |
Page.copy()
Create a copy of this page.
|
protected Page<K,V> |
MVMap.createEmptyLeaf()
Create empty leaf node page.
|
protected Page<K,V> |
MVMap.createEmptyLeaf()
Create empty leaf node page.
|
protected Page<K,V> |
MVMap.createEmptyNode()
Create empty internal node page.
|
protected Page<K,V> |
MVMap.createEmptyNode()
Create empty internal node page.
|
static <K,V> Page<K,V> |
Page.createNode(MVMap<K,V> map,
K[] keys,
Page.PageReference<K,V>[] children,
long totalCount,
int memory)
Create a new non-leaf page.
|
static <K,V> Page<K,V> |
Page.createNode(MVMap<K,V> map,
K[] keys,
Page.PageReference<K,V>[] children,
long totalCount,
int memory)
Create a new non-leaf page.
|
abstract Page<K,V> |
Page.getChildPage(int index)
Get the child page at the given index.
|
abstract Page<K,V> |
Page.getChildPage(int index)
Get the child page at the given index.
|
Page<K,V> |
Page.PageReference.getPage() |
Page<K,V> |
Page.PageReference.getPage() |
Page<K,V> |
MVMap.getRootPage()
The current root page (may not be null).
|
Page<K,V> |
MVMap.getRootPage()
The current root page (may not be null).
|
| 限定符和类型 | 方法和说明 |
|---|---|
CacheLongKeyLIRS<Page<?,?>> |
MVStore.getCache()
Get the cache.
|
CacheLongKeyLIRS<Page<?,?>> |
MVStore.getCache()
Get the cache.
|
| 限定符和类型 | 方法和说明 |
|---|---|
V |
MVMap.get(Page<K,V> p,
K key)
Get the value for the given key from a snapshot, or null if not found.
|
V |
MVMap.get(Page<K,V> p,
K key)
Get the value for the given key from a snapshot, or null if not found.
|
protected int |
MVMap.getChildPageCount(Page<K,V> p)
Get the child page count for this page.
|
protected int |
MVMap.getChildPageCount(Page<K,V> p)
Get the child page count for this page.
|
abstract void |
Page.insertNode(int index,
K key,
Page<K,V> childPage)
Insert a child page into this node.
|
abstract void |
Page.insertNode(int index,
K key,
Page<K,V> childPage)
Insert a child page into this node.
|
abstract void |
Page.setChild(int index,
Page<K,V> c)
Replace the child page.
|
abstract void |
Page.setChild(int index,
Page<K,V> c)
Replace the child page.
|
protected RootReference<K,V> |
MVMap.unlockRoot(Page<K,V> newRootPage)
Unlock the root page.
|
protected RootReference<K,V> |
MVMap.unlockRoot(Page<K,V> newRootPage)
Unlock the root page.
|
protected static <K,V> boolean |
MVMap.updateRoot(RootReference<K,V> expectedRootReference,
Page<K,V> newRootPage,
int attemptUpdateCounter)
Use the new root page from now on.
|
protected static <K,V> boolean |
MVMap.updateRoot(RootReference<K,V> expectedRootReference,
Page<K,V> newRootPage,
int attemptUpdateCounter)
Use the new root page from now on.
|
| 构造器和说明 |
|---|
CursorPos(Page<K,V> page,
int index,
CursorPos<K,V> parent) |
CursorPos(Page<K,V> page,
int index,
CursorPos<K,V> parent) |
PageReference(Page<K,V> page) |
PageReference(Page<K,V> page) |
| 限定符和类型 | 方法和说明 |
|---|---|
void |
MVRTreeMap.addNodeKeys(ArrayList<Spatial> list,
Page<Spatial,V> p)
Add all node keys (including internal bounds) to the given list.
|
void |
MVRTreeMap.addNodeKeys(ArrayList<Spatial> list,
Page<Spatial,V> p)
Add all node keys (including internal bounds) to the given list.
|
V |
MVRTreeMap.get(Page<Spatial,V> p,
Spatial key)
Get the object for the given key.
|
V |
MVRTreeMap.get(Page<Spatial,V> p,
Spatial key)
Get the object for the given key.
|
protected int |
MVRTreeMap.getChildPageCount(Page<Spatial,V> p) |
protected int |
MVRTreeMap.getChildPageCount(Page<Spatial,V> p) |
| 构造器和说明 |
|---|
RTreeCursor(Page<Spatial,V> root,
Spatial filter) |
RTreeCursor(Page<Spatial,V> root,
Spatial filter) |
Copyright © 2022. All rights reserved.