de.sciss.collection.txn.Ancestor

Map

sealed trait Map[S <: Sys[S], Version, A] extends Writer with Disposable[Tx]

Linear Supertypes
Disposable[Tx], Writer, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Map
  2. Disposable
  3. Writer
  4. AnyRef
  5. Any
Visibility
  1. Public
  2. All

Type Members

  1. type K = Vertex[S, Version]

Abstract Value Members

  1. abstract def +=(entry: (K, A))(implicit tx: Tx): Map.this.type

  2. abstract def -=(vertex: K)(implicit tx: Tx): Map.this.type

  3. abstract def add(entry: (K, A))(implicit tx: Tx): Boolean

    Marks a given key with a given value.

    Marks a given key with a given value.

    entry

    the key-value pair (where the key is a vertex in the full tree)

    returns

    true if the mark is new, false if there had been a mark for the given vertex.

  4. abstract def dispose()(implicit tx: Tx): Unit

    Definition Classes
    Disposable

  5. abstract def full: Tree[S, Version]

  6. abstract def get(vertex: K)(implicit tx: Tx): Option[A]

    Queries for a mark at a given version vertex.

    Queries for a mark at a given version vertex. Unlike nearest, this does not search in the map, but merely tests if the given vertex has been marked or not.

    vertex

    the version vertex to look up

    returns

    the value associated with that vertex, or None if the vertex is unmarked.

  7. abstract def nearest(vertex: K)(implicit tx: Tx): (K, A)

    Finds the nearest marked ancestor of a given version key.

    Finds the nearest marked ancestor of a given version key. Since the map is constructed with a defined root value, this method is guaranteed to succeed—if there are no other marks in the map, it will return the root value (unless the version argument is illegal, i.e. has a version lower than the root vertex' version).

    vertex

    the key to look for. The algorithm searches for the nearest ancestor in the marked map with a version less than or equal to the given version

    returns

    a pair consisting of the tree vertex found and the value with which it has been marked. If the query version vertex was marked, it will be that vertex which is returned, and not an ancestor.

  8. abstract def remove(vertex: K)(implicit tx: Tx): Boolean

  9. abstract def valueSerializer: TxnSerializer[Tx, Acc, A]

  10. abstract def write(out: DataOutput): Unit

    Definition Classes
    Writer

Concrete Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  11. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  18. def toString(): String

    Definition Classes
    AnyRef → Any

  19. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  21. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Disposable[Tx]

Inherited from Writer

Inherited from AnyRef

Inherited from Any