Package | Description |
---|---|
org.apache.hadoop.hbase | |
org.apache.hadoop.hbase.io.encoding | |
org.apache.hadoop.hbase.io.hfile | |
org.apache.hadoop.hbase.io.util | |
org.apache.hadoop.hbase.nio | |
org.apache.hadoop.hbase.types |
This package provides the definition and implementation of HBase's
extensible data type API.
|
org.apache.hadoop.hbase.util |
Class and Description |
---|
ByteRange
Lightweight, reusable class for specifying ranges of byte[]'s.
|
Bytes
Utility class that handles byte arrays, conversions to/from other types,
comparisons, hash code generation, manufacturing keys for HashMaps or
HashSets, and can be used as key in maps or trees.
|
Pair
A generic class for pairs.
|
Class and Description |
---|
Bytes
Utility class that handles byte arrays, conversions to/from other types,
comparisons, hash code generation, manufacturing keys for HashMaps or
HashSets, and can be used as key in maps or trees.
|
ObjectIntPair
A generic class for pair of an Object and and a primitive int value.
|
Class and Description |
---|
ChecksumType
Checksum types.
|
Class and Description |
---|
Pair
A generic class for pairs.
|
Class and Description |
---|
ObjectIntPair
A generic class for pair of an Object and and a primitive int value.
|
Class and Description |
---|
Order
Used to describe or modify the lexicographical sort order of a
byte[] . |
PositionedByteRange
Extends
ByteRange with additional methods to support tracking a
consumers position within the viewport. |
Class and Description |
---|
AbstractByteRange
An abstract implementation of the ByteRange API
|
AbstractPositionedByteRange
Extends the basic
SimpleByteRange implementation with position
support. |
AvlUtil.AvlInsertOrReplace |
AvlUtil.AvlKeyComparator
The AvlTree allows to lookup an object using a custom key.
|
AvlUtil.AvlLinkedNode
This class extends the AvlNode and adds two links that will be used in conjunction
with the AvlIterableList class.
|
AvlUtil.AvlNode
This class represent a node that will be used in an AvlTree.
|
AvlUtil.AvlNodeVisitor
Visitor that allows to traverse a set of AvlNodes.
|
ByteBufferAllocator
Defines the way the ByteBuffers are created
|
ByteRange
Lightweight, reusable class for specifying ranges of byte[]'s.
|
Bytes
Utility class that handles byte arrays, conversions to/from other types,
comparisons, hash code generation, manufacturing keys for HashMaps or
HashSets, and can be used as key in maps or trees.
|
Bytes.ByteArrayComparator
Byte array comparator class.
|
CellHashKey
Extracts the byte for the hash calculation from the given cell
|
ChecksumType
Checksum types.
|
ClassLoaderBase
Base class loader that defines couple shared constants used by sub-classes.
|
CollectionUtils.IOExceptionSupplier
A supplier that throws IOException when get.
|
CoprocessorClassLoader
ClassLoader used to load classes for Coprocessor instances.
|
EnvironmentEdge
Has some basic interaction with the environment.
|
Hash
This class represents a common API for hashing functions.
|
HashKey
Used to calculate the hash
Hash algorithms for Bloomfilters. |
IdLock.Entry
An entry returned to the client as a lock object
|
ImmutableByteArray
Mainly used as keys for HashMap.
|
JSONBean.Writer
Use dumping out mbeans as JSON.
|
ObjectPool
A thread-safe shared object pool in which object creation is expected to be lightweight, and the
objects may be excessively created and discarded.
|
ObjectPool.ObjectFactory
An
ObjectFactory object is used to create
new shared objects on demand. |
Order
Used to describe or modify the lexicographical sort order of a
byte[] . |
Pair
A generic class for pairs.
|
PositionedByteRange
Extends
ByteRange with additional methods to support tracking a
consumers position within the viewport. |
PrettyPrinter.Unit |
RetryCounter
Operation retry accounting.
|
RetryCounter.BackoffPolicy
Policy for calculating sleeping intervals between retry attempts
|
RetryCounter.ExponentialBackoffPolicy |
RetryCounter.RetryConfig
Configuration for a retry counter
|
Triple
Utility class to manage a triple.
|
Copyright © 2007–2018 The Apache Software Foundation. All rights reserved.