libref.collection.PairList

PList

sealed abstract class PList[K, V] extends AnyRef

Annotations
@library()
Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PList
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PList()

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. def &(that: PList[K, V]): PList[K, V]

  5. def ++(that: PList[K, V]): PList[K, V]

  6. def -(e: Pair[K, V]): PList[K, V]

    Delete ALL occurrences of e from the list

  7. def --(that: PList[K, V]): PList[K, V]

  8. def :+(t: Pair[K, V]): PList[K, V]

  9. def ::(t: Pair[K, V]): PList[K, V]

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

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

    Definition Classes
    Any
  12. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  13. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. def contains(v: Pair[K, V]): Boolean

  15. def content: Set[Pair[K, V]]

  16. def count(p: (Pair[K, V]) ⇒ Boolean): BigInt

  17. def delete(e: Pair[K, V]): PList[K, V]

  18. def delete(key: K): PList[K, V]

  19. def deleteAll(e: Pair[K, V]): PList[K, V]

  20. def deleteAll(key: K): PList[K, V]

    Obtain a new list by removing all element with the provided key from this list.

  21. def deleteFirst(key: K): PList[K, V]

    Obtain a new list by removing the first element with the provided key from this list.

  22. def deleteFirst(e: Pair[K, V]): PList[K, V]

    Obtain a new list by removing the first occurrence of e from this list.

  23. def deleteLast(key: K): PList[K, V]

    Obtain a new list by removing the last element with the provided key from this list.

  24. def drop(i: BigInt): PList[K, V]

  25. def dropWhile(p: (Pair[K, V]) ⇒ Boolean): PList[K, V]

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

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

    Definition Classes
    AnyRef → Any
  28. def exists(p: (Pair[K, V]) ⇒ Boolean): Boolean

  29. def filter(p: (Pair[K, V]) ⇒ Boolean): PList[K, V]

  30. def filterNot(p: (Pair[K, V]) ⇒ Boolean): PList[K, V]

  31. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  32. def find(p: (Pair[K, V]) ⇒ Boolean): Option[Pair[K, V]]

  33. def foldLeft[V2](z: V2)(f: (V2, Pair[K, V]) ⇒ V2): V2

  34. def foldRight[V2](z: V2)(f: (Pair[K, V], V2) ⇒ V2): V2

  35. def forall(p: (Pair[K, V]) ⇒ Boolean): Boolean

  36. def get: (K) ⇒ Option[Pair[K, V]]

    Get an element from the list with the provided key.

  37. def getAll(key: K): PList[K, V]

    Get all elements in this list with the provided key.

    Get all elements in this list with the provided key. The order in which the elements are stored in the returned list is consistent with the order they are stored in the original list. Note: This version of getAll is easier to verify for Leon than the concise version def getAll (key: K) = this.filter(item => item.key == key).

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

    Definition Classes
    AnyRef → Any
  39. def getFirst(key: K): Option[Pair[K, V]]

    Get the first element in this list with the provided key.

  40. def getLast(key: K): Option[Pair[K, V]]

    Get the last element in this list with the provided key.

  41. def groupBy[K2](f: (Pair[K, V]) ⇒ K2): Map[K2, PList[K, V]]

  42. def hasKey(key: K): Boolean

  43. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  44. def head: Pair[K, V]

  45. def headOption: Option[Pair[K, V]]

  46. def init: PList[K, V]

  47. def isEmpty: Boolean

  48. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  49. def keys: List[K]

  50. def last: Pair[K, V]

  51. def lastOption: Option[Pair[K, V]]

  52. def map[K2, V2](f: (Pair[K, V]) ⇒ Pair[K2, V2]): PList[K2, V2]

  53. def mapList[V2](f: (Pair[K, V]) ⇒ V2): List[V2]

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

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

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

    Definition Classes
    AnyRef
  57. def partition(p: (Pair[K, V]) ⇒ Boolean): (PList[K, V], PList[K, V])

  58. def replace(from: Pair[K, V], to: Pair[K, V]): PList[K, V]

  59. def reverse: PList[K, V]

  60. def rotate(s: BigInt): PList[K, V]

  61. def scanLeft[K2, V2](z: Pair[K2, V2])(f: (Pair[K2, V2], Pair[K, V]) ⇒ Pair[K2, V2]): PList[K2, V2]

  62. def scanRight[K2, V2](z: Pair[K2, V2])(f: (Pair[K, V], Pair[K2, V2]) ⇒ Pair[K2, V2]): PList[K2, V2]

  63. def size: BigInt

  64. def slice(from: BigInt, to: BigInt): PList[K, V]

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

    Definition Classes
    AnyRef
  66. def tail: PList[K, V]

  67. def take(i: BigInt): PList[K, V]

  68. def takeWhile(p: (Pair[K, V]) ⇒ Boolean): PList[K, V]

  69. def toString(): String

    Definition Classes
    AnyRef → Any
  70. def unique: PList[K, V]

  71. def update(data: Pair[K, V]): PList[K, V]

  72. def values: List[V]

  73. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  76. def withFilter(p: (Pair[K, V]) ⇒ Boolean): PList[K, V]

  77. def ~(that: PList[K, V]): Boolean

  78. def ~~(that: PList[K, V]): Boolean

Inherited from AnyRef

Inherited from Any

Ungrouped