Relation

abstract def +(a: A, bs: Traversable[B]): Relation[A, B]

Includes in the relation (a, b) for all b in bs.

abstract def +(a: A, b: B): Relation[A, B]

Includes (a, b) in the relation.

abstract def +(pair: (A, B)): Relation[A, B]

Includes pair in the relation.

abstract def ++(rs: Traversable[(A, B)]): Relation[A, B]

Includes the given pairs in this relation.

abstract def ++(r: Relation[A, B]): Relation[A, B]

Returns the union of the relation r with this relation.

abstract def -(pair: (A, B)): Relation[A, B]

Removes pair from this relation.

abstract def -(_1: A): Relation[A, B]

Removes all pairs (_1, _2) from this relation.

abstract def --(relations: Relation[A, B]): Relation[A, B]

Removes all relations from this relation.

abstract def --(pairs: TraversableOnce[(A, B)]): Relation[A, B]

Removes all pairs from this relation.

abstract def --(_1s: Traversable[A]): Relation[A, B]

Removes all elements (_1, _2) for all _1 in _1s from this relation.

abstract def _1s: Set[A]

Returns the set of all _1s such that (_1, _2) is in this relation.

abstract def _2s: Set[B]

Returns the set of all _2s such that (_1, _2) is in this relation.

abstract def all: Traversable[(A, B)]

Returns all pairs in this relation.

abstract def contains(a: A, b: B): Boolean

Returns true iff (a,b) is in this relation

abstract def filter(f: (A, B) ⇒ Boolean): Relation[A, B]

Returns a relation with only pairs (a,b) for which f(a,b) is true.

abstract def forward(_1: A): Set[B]

Returns the set of all _2s such that (_1, _2) is in this relation.

abstract def forwardMap: Map[A, Set[B]]

Represents this relation as a Map from a _1 to the set of _2s such that (_1, _2) is in this relation.

abstract def groupBy[K](discriminator: ((A, B)) ⇒ K): Map[K, Relation[A, B]]

Partitions this relation into a map of relations according to some discriminator function.

abstract def partition(f: (A, B) ⇒ Boolean): (Relation[A, B], Relation[A, B])

Returns a pair of relations: the first contains only pairs (a,b) for which f(a,b) is true and the other only pairs (a,b) for which f(a,b) is false.

abstract def reverse(_2: B): Set[A]

Returns the set of all _1s such that (_1, _2) is in this relation.

abstract def reverseMap: Map[B, Set[A]]

Represents this relation as a Map from a _2 to the set of _1s such that (_1, _2) is in this relation.

abstract def size: Int

Returns the number of pairs in this relation

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit