Package | Description |
---|---|
com.exonum.binding.common.proofs | |
com.exonum.binding.common.proofs.map |
Modifier and Type | Method and Description |
---|---|
static Funnel<DbKey> |
DbKeyFunnel.dbKeyFunnel() |
Modifier and Type | Method and Description |
---|---|
void |
DbKeyFunnel.funnel(DbKey from,
PrimitiveSink into) |
Modifier and Type | Method and Description |
---|---|
DbKey |
DbKey.commonPrefix(DbKey other)
Returns new branch DbKey (unless common prefix of two equals DbKeys is requested, in which
case this DbKey itself is returned), which is a common prefix of this and another DbKey.
|
static DbKey |
DbKey.fromBytes(byte[] rawDbKey)
Creates a database key.
|
DbKey |
MapProofEntry.getDbKey()
Returns a database key of this node.
|
static DbKey |
DbKey.newBranchKey(byte[] keySlice,
int numSignificantBits)
Creates a new branch database key.
|
static DbKey |
DbKey.newLeafKey(byte[] keySlice)
Given key as a byte array, returns new leaf DbKey.
|
static DbKey |
DbKey.newLeafKey(com.google.protobuf.ByteString key)
Given key as a ByteString, returns new leaf DbKey.
|
Modifier and Type | Method and Description |
---|---|
DbKey |
DbKey.commonPrefix(DbKey other)
Returns new branch DbKey (unless common prefix of two equals DbKeys is requested, in which
case this DbKey itself is returned), which is a common prefix of this and another DbKey.
|
int |
DbKey.compareTo(DbKey other)
The following algorithm is used for comparison:
Try to find a first bit index at which this key is greater than the other key (i.e., a bit of
this key is 1 and the corresponding bit of the other key is 0), and vice versa.
|
boolean |
DbKey.isPrefixOf(DbKey other)
Returns true if this
DbKey is a prefix of that DbKey . |
Copyright © 2018 Exonum. All rights reserved.