Pivot

Pivot is useful in moving from a 1D space of K to a 2D mapping space of K1 x K2. If the elements within the K space have many repeated elements -- imagine the "time" component of a Key in a timeseries key-value store -- pivoting the changing component into an inner K2 while leaving the repeated component in an outer K1 can assist in compressing a datastore's space requirements.

Type Parameters:

K: Original Key K1: Outer Key K2: Inner Key

Trivial: Pivot[(Event, Timestamp), Event, Timestamp] would pivot the timestamp component out of a compound key.

Linear Supertypes

Bijection[Iterable[K], Map[K1, Iterable[K2]]], Serializable, (Iterable[K]) ⇒ Map[K1, Iterable[K2]], AnyRef, Any

Known Subclasses

PivotImpl

Abstract Value Members

abstract def pivot: Bijection[K, (K1, K2)]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
def andThen[C](g: Injection[Map[K1, Iterable[K2]], C]): Injection[Iterable[K], C]

Definition Classes
Bijection
def andThen[C](g: Bijection[Map[K1, Iterable[K2]], C]): Bijection[Iterable[K], C]

Composes two instances of Bijection in a new Bijection, with this one applied first.
Composes two instances of Bijection in a new Bijection, with this one applied first.

Definition Classes
Bijection
def andThen[A](g: (Map[K1, Iterable[K2]]) ⇒ A): (Iterable[K]) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
def andThenPivot[K3, K4](after: Bijection[(K1, K2), (K3, K4)]): Pivot[K, K3, K4]
def apply(pairs: Iterable[K]): Map[K1, Iterable[K2]]

Definition Classes
Pivot → Bijection → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def compose[T](g: Injection[T, Iterable[K]]): Injection[T, Map[K1, Iterable[K2]]]

Definition Classes
Bijection
def compose[T](g: Bijection[T, Iterable[K]]): Bijection[T, Map[K1, Iterable[K2]]]

Composes two instances of Bijection in a new Bijection, with this one applied last.
Composes two instances of Bijection in a new Bijection, with this one applied last.

Definition Classes
Bijection
def compose[A](g: (A) ⇒ Iterable[K]): (A) ⇒ Map[K1, Iterable[K2]]

Definition Classes
Function1
Annotations
@unspecialized()
def composePivot[T](before: Bijection[T, K]): Pivot[T, K1, K2]
lazy val decoder: PivotDecoder[K, K1, K2]
lazy val encoder: PivotEncoder[K, K1, K2]
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def inverse: Bijection[Map[K1, Iterable[K2]], Iterable[K]]

Definition Classes
Bijection
def invert(m: Map[K1, Iterable[K2]]): Iterable[K]

Definition Classes
Pivot → Bijection
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def split[V](fn: (K) ⇒ V): (K1) ⇒ (K2) ⇒ V
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Function1 → AnyRef → Any
def unsplit[V](fn: (K1) ⇒ (K2) ⇒ V): (K) ⇒ V
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()
def withValue[V]: Pivot[(K, V), K1, (K2, V)]

Returns a new pivot that converts an Iterable of (K, V) to an Iterable of (K1, Iterable[(K2, V)]).
Returns a new pivot that converts an Iterable of (K, V) to an Iterable of (K1, Iterable[(K2, V)]). This is useful for pivoting multiple (K, V) pairs into a single key in some KV store.
def wrapOuter[T]: Pivot[(K, T), (K1, T), K2]

Returns a new Pivot that converts an Iterable of (K, T) to an Iterable of ((K1, T), Iterable[K2]).
Returns a new Pivot that converts an Iterable of (K, T) to an Iterable of ((K1, T), Iterable[K2]). This is useful for applying a new pivoting scheme on top of this one while maintaining some outer key component.

trait Pivot[K, K1, K2] extends Bijection[Iterable[K], Map[K1, Iterable[K2]]]

Abstract Value Members

abstract def pivot: Bijection[K, (K1, K2)]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def andThen[C](g: Injection[Map[K1, Iterable[K2]], C]): Injection[Iterable[K], C]

def andThen[C](g: Bijection[Map[K1, Iterable[K2]], C]): Bijection[Iterable[K], C]

def andThen[A](g: (Map[K1, Iterable[K2]]) ⇒ A): (Iterable[K]) ⇒ A

def andThenPivot[K3, K4](after: Bijection[(K1, K2), (K3, K4)]): Pivot[K, K3, K4]

def apply(pairs: Iterable[K]): Map[K1, Iterable[K2]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[T](g: Injection[T, Iterable[K]]): Injection[T, Map[K1, Iterable[K2]]]

def compose[T](g: Bijection[T, Iterable[K]]): Bijection[T, Map[K1, Iterable[K2]]]

def compose[A](g: (A) ⇒ Iterable[K]): (A) ⇒ Map[K1, Iterable[K2]]

def composePivot[T](before: Bijection[T, K]): Pivot[T, K1, K2]

lazy val decoder: PivotDecoder[K, K1, K2]

lazy val encoder: PivotEncoder[K, K1, K2]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def inverse: Bijection[Map[K1, Iterable[K2]], Iterable[K]]

def invert(m: Map[K1, Iterable[K2]]): Iterable[K]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def split[V](fn: (K) ⇒ V): (K1) ⇒ (K2) ⇒ V

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

def toString(): String

def unsplit[V](fn: (K1) ⇒ (K2) ⇒ V): (K) ⇒ V

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withValue[V]: Pivot[(K, V), K1, (K2, V)]

def wrapOuter[T]: Pivot[(K, T), (K1, T), K2]

Inherited from Bijection[Iterable[K], Map[K1, Iterable[K2]]]

Inherited from Serializable

Inherited from (Iterable[K]) ⇒ Map[K1, Iterable[K2]]

Inherited from AnyRef

Inherited from Any

Ungrouped