object AccumuloUtils
- Alphabetic
- By Inheritance
- AccumuloUtils
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addSplits[K](tableName: String, accumuloInstance: AccumuloInstance, keyBounds: KeyBounds[K], keyIndexer: KeyIndex[K], count: Int): Unit
Split the given Accumulo table into the given number of tablets.
Split the given Accumulo table into the given number of tablets. This should improve the ingest performance, as it will allow more than one tablet server to participate in the ingestion.
- tableName
The name of the table to be split
- accumuloInstance
The Accumulo instance associated with the ingest
- keyBounds
The KeyBounds of the RDD that is being stored in the table
- keyIndexer
The indexing scheme used to turn keys K into Accumulo keys
- count
The number of tablets to split the table into
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getSplits[K](kb: KeyBounds[K], ki: KeyIndex[K], count: Int): Seq[BigInt]
Mapping KeyBounds of Extent to SFC ranges will often result in a set of non-contigrious ranges.
Mapping KeyBounds of Extent to SFC ranges will often result in a set of non-contigrious ranges. The indices exluded by these ranges should not be included in split calculation as they will never be seen.
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()