Object

de.sciss.lucre.confluent

Hashing

Related Doc: package confluent

Permalink

object Hashing

A utility object implementing the prefix calculation for the randomized hash approach to storing access paths.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Hashing
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

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

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

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

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def foreachPrefix(s: PathLike, contains: (Long) ⇒ Boolean)(fun: (Long, Long) ⇒ Unit): Unit

    Permalink

    Iterates over all the hash prefixes of a given path (excluding the full prefix itself).

    Iterates over all the hash prefixes of a given path (excluding the full prefix itself). The caller would typically test whether the returned element's sub path is empty or not, and store an appropriate empty or partial tag in its representation.

    After the method returns, the caller will typically add an entry for the full hash (s.sum), an entry which is not provided by the iterator itself.

    The reason why s.sum is not automatically added is that the caller might want to store a special values for this "full" entry.

    s

    the path for which to calculate the prefixes

    contains

    a test function whether a given hash is already stored in the caller's representation. only prefixes are provided for hashes which are not already present according to this function

    returns

    an iterator over the prefixes.

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  13. def maxPrefixKey(s: PathLike, sz: Int, contains: (Long) ⇒ Boolean): Long

    Permalink
  14. def maxPrefixKey(s: PathLike, contains: (Long) ⇒ Boolean): Long

    Permalink
  15. def maxPrefixLength(s: PathLike, contains: (Long) ⇒ Boolean): Int

    Permalink

    Searches for the maximum prefix of a path s that is also a prefix of this path.

    Searches for the maximum prefix of a path s that is also a prefix of this path. Assumes that s _extends_ this path.

    s

    the extension of this path

    contains

    a function to check the hash map built before using foreachPrefix

    returns

    the length of the prefix

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

    Permalink
    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  20. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped