org.bdgenomics.utils.intervalrdd

IntervalPartition

class IntervalPartition[K <: Interval, V] extends Serializable with Logging

Attributes
protected
Linear Supertypes
Logging, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IntervalPartition
  2. Logging
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IntervalPartition()(implicit arg0: ClassTag[V])

  2. new IntervalPartition(iTree: IntervalTree[K, V])(implicit arg0: ClassTag[V])

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  5. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  8. def filter(pred: (K, V) ⇒ Boolean): IntervalPartition[K, V]

    Return a new IntervalPartition filtered by some predicate

  9. def filterByInterval(r: K): IntervalPartition[K, V]

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def get(): Iterator[(K, V)]

    Gets all (k,v) data from partition

    Gets all (k,v) data from partition

    returns

    Iterator of searched interval and the corresponding (K,V) pairs

  12. def get(r: K): Iterator[(K, V)]

    Gets all (k,v) data from partition within the specificed interval

    Gets all (k,v) data from partition within the specificed interval

    returns

    Iterator of searched interval and the corresponding (K,V) pairs

  13. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  14. def getTree(): IntervalTree[K, V]

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  16. val iTree: IntervalTree[K, V]

    Attributes
    protected
  17. def intervalOverlap(r1: K, r2: K): Boolean

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  19. def isTraceEnabled(): Boolean

    Attributes
    protected
    Definition Classes
    Logging
  20. def log: Logger

    Attributes
    protected
    Definition Classes
    Logging
  21. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  22. def logDebug(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  23. def logError(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  24. def logError(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  25. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  26. def logInfo(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  27. def logName: String

    Attributes
    protected
    Definition Classes
    Logging
  28. def logTrace(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  29. def logTrace(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  30. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  31. def logWarning(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  32. def mapValues[V2](f: (V) ⇒ V2)(implicit arg0: ClassTag[V2]): IntervalPartition[K, V2]

    Applies a map function over the interval tree

  33. def mergePartitions(p: IntervalPartition[K, V]): IntervalPartition[K, V]

    Merges trees of this partition with a specified partition

    Merges trees of this partition with a specified partition

    returns

    Iterator of searched interval and the corresponding (K,V) pairs

  34. def multiput(r: K, vs: Iterator[V]): IntervalPartition[K, V]

    Puts all (k,v) data from partition within the specificed interval

    Puts all (k,v) data from partition within the specificed interval

    returns

    IntervalPartition with new data

  35. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  36. final def notify(): Unit

    Definition Classes
    AnyRef
  37. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  38. def put(r: K, v: V): IntervalPartition[K, V]

    Puts all (k,v) data from partition within the specificed interval

    Puts all (k,v) data from partition within the specificed interval

    returns

    IntervalPartition with new data

  39. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  40. def toString(): String

    Definition Classes
    AnyRef → Any
  41. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. def withMap(map: IntervalTree[K, V]): IntervalPartition[K, V]

    Attributes
    protected

Inherited from Logging

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped