| Package | Description |
|---|---|
| com.sleepycat.je.dbi |
INTERNAL: Underlying XxxImpl classes for Environment, Database and Cursor,
plus other misc classes (originally, dbi meant "db internal interface").
|
| com.sleepycat.je.tree |
INTERNAL: Btree data structure (the JE main cache), including persistent
nodes classes, and Btree access methods.
|
| com.sleepycat.je.tree.dupConvert |
INTERNAL: Defunct Btree classes for old duplicate Btrees, only used during
recovery.
|
| com.sleepycat.je.utilint |
INTERNAL: Misc utility classes, including some stat classes.
|
| Modifier and Type | Method and Description |
|---|---|
void |
SortedLSNTreeWalker.TreeNodeProcessor.processLSN(long childLSN,
LogEntryType childType,
Node theNode,
byte[] lnKey,
int lastLoggedSize,
boolean isEmbedded) |
| Modifier and Type | Class and Description |
|---|---|
class |
BIN
A BIN represents a Bottom Internal Node in the JE tree.
|
class |
FileSummaryLN
A FileSummaryLN represents a Leaf Node in the UtilizationProfile database.
|
class |
IN
An IN represents an Internal Node in the JE tree.
|
class |
LN
An LN represents a Leaf Node in the JE tree.
|
class |
MapLN
{@literal
A MapLN represents a Leaf Node in the JE Db Mapping Tree.
|
class |
NameLN
A NameLN represents a Leaf Node in the name->database id mapping
tree.
|
class |
VersionedLN
VersionedLN is used to provide an in-memory representation of an LN that
makes its VLSN available through btree access.
|
| Modifier and Type | Method and Description |
|---|---|
Node |
IN.fetchLNOrDIN(int idx,
CacheMode cacheMode) |
Node |
ChildReference.fetchTarget(DatabaseImpl database,
IN parent)
Fetch the target object that this ChildReference refers to.
|
Node |
INTargetRep.Default.get(int idx) |
Node |
INTargetRep.Sparse.get(int j) |
Node |
INTargetRep.None.get(int idx) |
Node |
ChildReference.getTarget()
Return the target for this ChildReference.
|
Node |
IN.getTarget(int idx)
Return the idx'th target.
|
| Modifier and Type | Method and Description |
|---|---|
void |
IN.attachNode(int idx,
Node node,
byte[] newKey)
Attach the given node as the idx-th child of "this" node.
|
int |
IN.getKnownChildIndex(Node child)
Returns the index of the given child.
|
boolean |
IN.insertEntry(Node child,
byte[] key,
long childLsn)
Inserts a slot with the given key, lsn and child node into this IN, if
a slot with the same key does not exist already.
|
int |
IN.insertEntry1(Node child,
byte[] key,
byte[] data,
long childLsn,
boolean blindInsertion)
Inserts a slot with the given key, lsn and child node into this IN, if
a slot with the same key does not exist already.
|
int |
IN.insertEntry1(Node child,
byte[] key,
byte[] data,
long childLsn,
byte state,
boolean blindInsertion)
Inserts a slot with the given key, lsn, state, and child node into this
IN, if a slot with the same key does not exist already.
|
ChildReference |
Tree.makeRootChildReference(Node target,
byte[] key,
long lsn) |
void |
IN.recoverIN(int idx,
Node node,
long lsn,
int lastLoggedSize)
Update the cached-child and LSN properties of the idx-th slot.
|
INTargetRep |
INTargetRep.Default.set(int idx,
Node node,
IN parent) |
INTargetRep |
INTargetRep.Sparse.set(int j,
Node node,
IN parent) |
INTargetRep |
INTargetRep.None.set(int idx,
Node node,
IN parent) |
void |
ChildReference.setTarget(Node target)
Sets the target for this ChildReference.
|
| Constructor and Description |
|---|
ChildReference(Node target,
byte[] key,
long lsn)
Construct a ChildReference for inserting a new entry.
|
ChildReference(Node target,
byte[] key,
long lsn,
byte existingState)
Construct a ChildReference for inserting an existing entry.
|
| Modifier and Type | Class and Description |
|---|---|
class |
DBIN
A DBIN represents an Duplicate Bottom Internal Node in the JE tree.
|
class |
DIN
An DIN represents an Duplicate Internal Node in the JE tree.
|
class |
DupCountLN
A DupCountLN represents the transactional part of the root of a
duplicate tree, specifically the count of dupes in the tree.
|
| Modifier and Type | Method and Description |
|---|---|
void |
StatsAccumulator.verifyNode(Node node) |
Copyright © 2024. All rights reserved.