BiPinImpl

object BiPinImpl
class Object
trait Matchable
class Any

Type members

Classlikes

abstract class Impl[T <: Txn[T], E <: ([~ <: Txn[~]] =>> Elem[~]), Repr <: Modifiable[T, E[T]]] extends Modifiable[T, E[T]] with SingleEventNode[T, Update[T, E[T], Repr]]

Types

type Tree[T <: Txn[T], A] = Map[T, Long, Leaf[T, A]]

Value members

Concrete methods

final def copyTree[In <: Txn[LazyRef(...)], Out <: Txn[LazyRef(...)], E <: ([~ <: Txn[LazyRef(...)]] =>> Elem[~]), Repr <: Impl[Out, E, LazyRef(...)]](in: Tree[In, E[In]], out: Tree[Out, E[Out]], outImpl: Repr)(implicit txIn: In, txOut: Out, context: Copy[In, Out]): Unit
def entryFormat[T <: Txn[LazyRef(...)], A <: Elem[T]]: TFormat[T, Entry[T, A]]
def format[T <: Txn[LazyRef(...)], A <: Elem[T]]: TFormat[T, BiPin[T, A]]
def modifiableFormat[T <: Txn[LazyRef(...)], A <: Elem[T]]: TFormat[T, Modifiable[T, A]]
def newEntry[T <: Txn[LazyRef(...)], A <: Elem[T]](key: LongObj[T], value: A)(implicit tx: T): Entry[T, A]
def newModifiable[T <: Txn[LazyRef(...)], E <: ([~ <: Txn[LazyRef(...)]] =>> Elem[~])](implicit tx: T): Modifiable[T, E[T]]
def readEntry[T <: Txn[LazyRef(...)], A <: Elem[T]](in: DataInput)(implicit tx: T): Entry[T, A]
def readIdentifiedEntry[T <: Txn[LazyRef(...)]](in: DataInput)(implicit tx: T): Elem[T]
def readIdentifiedObj[T <: Txn[LazyRef(...)]](in: DataInput)(implicit tx: T): Obj[T]