Scaladoc for scala.collection.mutable.History

Inherits

Iterable
Iterable
IterableLike
Equals
Traversable
Mutable
Traversable
GenericTraversableTemplate
TraversableLike
HasNewBuilder
Subscriber
AnyRef
Any

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations

Value Members

def ++[B >: (Pub, Evt), That](that: Iterator[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

Concatenates this iterable collection with the elements of an iterator

Concatenates this iterable collection with the elements of an iterator.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the iterator to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this iterable collection followed by all elements of that.

definition classes: TraversableLike
def ++[B >: (Pub, Evt), That](that: Traversable[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

Concatenates this iterable collection with the elements of a traversable collection

Concatenates this iterable collection with the elements of a traversable collection.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the traversable to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this iterable collection followed by all elements of that.

definition classes: TraversableLike
def /:[B](z: B)(op: (B, (Pub, Evt)) ⇒ B): B

Applies a binary operator to a start value and all elements of this iterable collection, going left to right

Applies a binary operator to a start value and all elements of this iterable collection, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this iterable collection$, going left to right with the start value z on the left: {{{ op(...op(op(z, x₁), x₂), ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

definition classes: TraversableLike
def :\[B](z: B)(op: ((Pub, Evt), B) ⇒ B): B

Applies a binary operator to all elements of this iterable collection and a start value, going right to left

Applies a binary operator to all elements of this iterable collection and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this iterable collection$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

definition classes: TraversableLike
def addString(b: StringBuilder): StringBuilder

Appends all elements of this iterable collection to a string builder

Appends all elements of this iterable collection to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this iterable collection without any separator string.

b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike
def addString(b: StringBuilder, sep: String): StringBuilder

Appends all elements of this iterable collection to a string builder using a separator string

Appends all elements of this iterable collection to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this iterable collection, separated by the string sep.

b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Appends all elements of this iterable collection to a string builder using start, end, and separator strings

Appends all elements of this iterable collection to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this iterable collection are separated by the string sep.

b
the string builder to which elements are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike
def canEqual(that: Any): Boolean

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

that
The object with which this iterable collection should be compared
returns
true, if this iterable collection can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

definition classes: IterableLike ⇐ Equals
def clear(): Unit
def companion: GenericCompanion[Iterable[A][A]]

The factory companion object that builds instances of class Iterable

The factory companion object that builds instances of class Iterable.

definition classes: Iterable ⇐ Iterable ⇐ Traversable ⇐ Traversable ⇐ GenericTraversableTemplate
def copyToArray[B >: (Pub, Evt)](xs: Array[B], start: Int, len: Int): Unit

Copies elements of this iterable collection to an array

Copies elements of this iterable collection to an array. Fills the given array xs with at most len elements of this iterable collection, starting at position start. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached, or len elements have been copied.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.

definition classes: IterableLike ⇐ TraversableLike
def copyToArray[B >: (Pub, Evt)](xs: Array[B]): Unit

Copies elements of this iterable collection to an array

Copies elements of this iterable collection to an array. Fills the given array xs with all elements of this iterable collection, starting at position 0. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array.
xs
the array to fill.

definition classes: TraversableLike
def copyToArray[B >: (Pub, Evt)](xs: Array[B], start: Int): Unit

Copies elements of this iterable collection to an array

Copies elements of this iterable collection to an array. Fills the given array xs with all elements of this iterable collection, starting at position start. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.

definition classes: TraversableLike
def copyToBuffer[B >: (Pub, Evt)](dest: Buffer[B]): Unit

Copies all elements of this iterable collection to a buffer

Copies all elements of this iterable collection to a buffer.
Note: will not terminate for infinite-sized collections.

dest
The buffer to which elements are copied.

definition classes: TraversableLike
def count(p: ((Pub, Evt)) ⇒ Boolean): Int

Counts the number of elements in the iterable collection which satisfy a predicate

Counts the number of elements in the iterable collection which satisfy a predicate.

p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

definition classes: TraversableLike
def drop(n: Int): Iterable[(Pub, Evt)]

Selects all elements except first n ones

Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
the number of elements to drop from this iterable collection.
returns
a iterable collection consisting of all elements of this iterable collection except the first n ones, or else the empty iterable collection, if this iterable collection has less than n elements.

definition classes: TraversableLike
def dropRight(n: Int): Iterable[(Pub, Evt)]

Selects all elements except first n ones

Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
The number of elements to take
returns
a iterable collection consisting of all elements of this iterable collection except the first n ones, or else the empty iterable collection, if this iterable collection has less than n elements.

definition classes: IterableLike
def dropWhile(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

Drops longest prefix of elements that satisfy a predicate

Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
The predicate used to test elements.
returns
the longest suffix of this iterable collection whose first element does not satisfy the predicate p.

definition classes: TraversableLike
def elements: Iterator[(Pub, Evt)]
def equals(obj: Any): Boolean

Checks if two history objects are structurally identical

Checks if two history objects are structurally identical.
def events: Iterator[Evt]
def exists(p: ((Pub, Evt)) ⇒ Boolean): Boolean

Tests whether a predicate holds for some of the elements of this iterable collection

Tests whether a predicate holds for some of the elements of this iterable collection.
Note: may not terminate for infinite-sized collections.

p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this iterable collection, otherwise false.

definition classes: IterableLike ⇐ TraversableLike
def filter(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

Selects all elements of this iterable collection which satisfy a predicate

Selects all elements of this iterable collection which satisfy a predicate.

p
the predicate used to test elements.
returns
a new iterable collection consisting of all elements of this iterable collection that satisfy the given predicate p. The order of the elements is preserved.

definition classes: TraversableLike
def filterNot(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

Selects all elements of this iterable collection which do not satisfy a predicate

Selects all elements of this iterable collection which do not satisfy a predicate.

p
the predicate used to test elements.
returns
a new iterable collection consisting of all elements of this iterable collection that do not satisfy the given predicate p. The order of the elements is preserved.

definition classes: TraversableLike
def find(p: ((Pub, Evt)) ⇒ Boolean): Option[(Pub, Evt)]

Finds the first element of the iterable collection satisfying a predicate, if any

Finds the first element of the iterable collection satisfying a predicate, if any.
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
the predicate used to test elements.
returns
an option value containing the first element in the iterable collection that satisfies p, or None if none exists.

definition classes: IterableLike ⇐ TraversableLike
def first: (Pub, Evt)
def firstOption: Option[(Pub, Evt)]

None if iterable is empty

None if iterable is empty.

definition classes: IterableLike
def flatMap[B, That](f: ((Pub, Evt)) ⇒ Traversable[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

Builds a new collection by applying a function to all elements of this iterable collection and concatenating the results

Builds a new collection by applying a function to all elements of this iterable collection and concatenating the results.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this iterable collection and concatenating the results.

definition classes: TraversableLike
def flatten[B](asTraversable: ((Pub, Evt)) ⇒ Traversable[B]): Iterable[B]

Converts this iterable collection of traversable collections into a iterable collection in which all element collections are concatenated

Converts this iterable collection of traversable collections into a iterable collection in which all element collections are concatenated.

B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this iterable collection is a Traversable.
returns
a new iterable collection resulting from concatenating all element iterable collections.

definition classes: GenericTraversableTemplate
def foldLeft[B](z: B)(op: (B, (Pub, Evt)) ⇒ B): B

Applies a binary operator to a start value and all elements of this iterable collection, going left to right

Applies a binary operator to a start value and all elements of this iterable collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this iterable collection$, going left to right with the start value z on the left: {{{ op(...op(z, x₁), x₂, ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

definition classes: TraversableLike
def foldRight[B](z: B)(op: ((Pub, Evt), B) ⇒ B): B

Applies a binary operator to all elements of this iterable collection and a start value, going right to left

Applies a binary operator to all elements of this iterable collection and a start value, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this iterable collection$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

definition classes: IterableLike ⇐ TraversableLike
def forall(p: ((Pub, Evt)) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this iterable collection

Tests whether a predicate holds for all elements of this iterable collection.
Note: may not terminate for infinite-sized collections.

p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this iterable collection, otherwise false.

definition classes: IterableLike ⇐ TraversableLike
def foreach[U](f: ((Pub, Evt)) ⇒ U): Unit

Applies a function f to all elements of this iterable collection

Applies a function f to all elements of this iterable collection.
Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

U
the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.

definition classes: IterableLike ⇐ TraversableLike
def genericBuilder[B]: Builder[B, Iterable[B]]

The generic builder that builds instances of Iterable at arbitrary element types

The generic builder that builds instances of Iterable at arbitrary element types.

definition classes: GenericTraversableTemplate
def groupBy[K](f: ((Pub, Evt)) ⇒ K): Map[K, Iterable[(Pub, Evt)]]

Partitions this iterable collection into a map of iterable collections according to some discriminator function

Partitions this iterable collection into a map of iterable collections according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new iterable collection.

K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to iterable collections such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a iterable collection of those elements x for which f(x) equals k.

definition classes: TraversableLike
def hasDefiniteSize: Boolean

Tests whether this iterable collection is known to have a finite size

Tests whether this iterable collection is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.

definition classes: TraversableLike
def hashCode(): Int

Returns a hash code value for the object

Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

definition classes: AnyRef ⇐ Any
def head: (Pub, Evt)

Selects the first element of this iterable collection

Selects the first element of this iterable collection.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: IterableLike ⇐ TraversableLike
def headOption: Option[(Pub, Evt)]

Optionally selects the first element

Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def init: Iterable[(Pub, Evt)]

Selects all elements except the last

Selects all elements except the last.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def isEmpty: Boolean

Tests whether this iterable collection is empty

Tests whether this iterable collection is empty.

definition classes: IterableLike ⇐ TraversableLike
def iterator: Iterator[(Pub, Evt)]

Creates a new iterator over all elements contained in this iterable object

Creates a new iterator over all elements contained in this iterable object.
def last: (Pub, Evt)

Selects the last element

Selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def lastOption: Option[(Pub, Evt)]

Optionally selects the last element

Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def map[B, That](f: ((Pub, Evt)) ⇒ B)(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

Builds a new collection by applying a function to all elements of this iterable collection

Builds a new collection by applying a function to all elements of this iterable collection.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this iterable collection and collecting the results.

definition classes: TraversableLike
def max[B >: (Pub, Evt)](cmp: Ordering[B]): (Pub, Evt)

Finds the largest element

Finds the largest element.

B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the largest element of this iterable collection with respect to the ordering cmp.

definition classes: TraversableLike
val maxHistory: Int
def min[B >: (Pub, Evt)](cmp: Ordering[B]): (Pub, Evt)

Finds the smallest element

Finds the smallest element.

B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the smallest element of this iterable collection with respect to the ordering cmp.

definition classes: TraversableLike
def mkString: String

Displays all elements of this iterable collection in a string

Displays all elements of this iterable collection in a string.

definition classes: TraversableLike
def mkString(sep: String): String

Displays all elements of this iterable collection in a string using a separator string

Displays all elements of this iterable collection in a string using a separator string.

sep
the separator string.
returns
a string representation of this iterable collection. In the resulting string the string representations (w.r.t. the method toString) of all elements of this iterable collection are separated by the string sep.

definition classes: TraversableLike
def mkString(start: String, sep: String, end: String): String

Displays all elements of this iterable collection in a string using start, end, and separator strings

Displays all elements of this iterable collection in a string using start, end, and separator strings.

start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this iterable collection. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this iterable collection are separated by the string sep.

definition classes: TraversableLike
def nonEmpty: Boolean

Tests whether the iterable collection is not empty

Tests whether the iterable collection is not empty.

definition classes: TraversableLike
def notify(pub: Pub, event: Evt): Unit

pub
...
event
...
def partialMap[B, That](pf: PartialFunction[(Pub, Evt), B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

Builds a new collection by applying a partial function to all elements of this iterable collection on which the function is defined

Builds a new collection by applying a partial function to all elements of this iterable collection on which the function is defined.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
pf
the partial function which filters and maps the iterable collection.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

definition classes: TraversableLike
def partition(p: ((Pub, Evt)) ⇒ Boolean): (Iterable[(Pub, Evt)], Iterable[(Pub, Evt)])

Partitions this iterable collection in two iterable collections according to a predicate

Partitions this iterable collection in two iterable collections according to a predicate.

p
the predicate on which to partition.
returns
a pair of iterable collections: the first iterable collection consists of all elements that satisfy the predicate p and the second iterable collection consists of all elements that don't. The relative order of the elements in the resulting iterable collections is the same as in the original iterable collection.

definition classes: TraversableLike
def product[B >: (Pub, Evt)](num: Numeric[B]): B

Multiplies up the elements of this collection

Multiplies up the elements of this collection.

B
the result type of the * operator.
num
an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.
returns
the product of all elements of this iterable collection with respect to the * operator in num.

definition classes: TraversableLike
def projection: IterableView[(Pub, Evt), Iterable[(Pub, Evt)]]

returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection

returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

definition classes: IterableLike
def reduceLeft[B >: (Pub, Evt)](op: (B, (Pub, Evt)) ⇒ B): B

Applies a binary operator to all elements of this iterable collection, going left to right

Applies a binary operator to all elements of this iterable collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this iterable collection$, going left to right: {{{ op(...(op(x₁, x₂), ... ) , x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

definition classes: TraversableLike
def reduceLeftOption[B >: (Pub, Evt)](op: (B, (Pub, Evt)) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this iterable collection, going left to right

Optionally applies a binary operator to all elements of this iterable collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this iterable collection is nonempty, None otherwise.

definition classes: TraversableLike
def reduceRight[B >: (Pub, Evt)](op: ((Pub, Evt), B) ⇒ B): B

Applies a binary operator to all elements of this iterable collection, going right to left

Applies a binary operator to all elements of this iterable collection, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this iterable collection$, going right to left: {{{ op(x₁, op(x₂, ..., op(x_n-1, x_n)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

definition classes: IterableLike ⇐ TraversableLike
def reduceRightOption[B >: (Pub, Evt)](op: ((Pub, Evt), B) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this iterable collection, going right to left

Optionally applies a binary operator to all elements of this iterable collection, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this iterable collection is nonempty, None otherwise.

definition classes: TraversableLike
def repr: Iterable[(Pub, Evt)]

The collection of type iterable collection underlying this TraversableLike object

The collection of type iterable collection underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

definition classes: TraversableLike
def sameElements[B >: (Pub, Evt)](that: Iterable[B]): Boolean

Checks if the other iterable collection contains the same elements in the same order as this iterable collection

Checks if the other iterable collection contains the same elements in the same order as this iterable collection.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of collection that.
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.

definition classes: IterableLike
def size: Int

The size of this iterable collection

The size of this iterable collection.
Note: will not terminate for infinite-sized collections.
def slice(from: Int, until: Int): Iterable[(Pub, Evt)]

Selects an interval of elements

Selects an interval of elements.
Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)
Note: might return different results for different runs, unless the underlying collection type is ordered.

from
the index of the first returned element in this iterable collection.
until
the index one past the last returned element in this iterable collection.
returns
a iterable collection containing the elements starting at index from and extending up to (but not including) index until of this iterable collection.

definition classes: IterableLike ⇐ TraversableLike
def span(p: ((Pub, Evt)) ⇒ Boolean): (Iterable[(Pub, Evt)], Iterable[(Pub, Evt)])

Spits this iterable collection into a prefix/suffix pair according to a predicate

Spits this iterable collection into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
the test predicate
returns
a pair consisting of the longest prefix of this iterable collection whose elements all satisfy p, and the rest of this iterable collection.

definition classes: TraversableLike
def splitAt(n: Int): (Iterable[(Pub, Evt)], Iterable[(Pub, Evt)])

Splits this iterable collection into two at a given position

Splits this iterable collection into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
the position at which to split.
returns
a pair of iterable collections consisting of the first n elements of this iterable collection, and the other elements.

definition classes: TraversableLike
def stringPrefix: String

Defines the prefix of this object's toString representation

Defines the prefix of this object's toString representation.

definition classes: TraversableLike
def sum[B >: (Pub, Evt)](num: Numeric[B]): B

Sums up the elements of this collection

Sums up the elements of this collection.

B
the result type of the + operator.
num
an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.
returns
the sum of all elements of this iterable collection with respect to the + operator in num.

definition classes: TraversableLike
def tail: Iterable[(Pub, Evt)]

Selects all elements except the first

Selects all elements except the first.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def take(n: Int): Iterable[(Pub, Evt)]

Selects first n elements

Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
Tt number of elements to take from this iterable collection.
returns
a iterable collection consisting only of the first n elements of this iterable collection, or else the whole iterable collection, if it has less than n elements.

definition classes: IterableLike ⇐ TraversableLike
def takeRight(n: Int): Iterable[(Pub, Evt)]

Selects last n elements

Selects last n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
the number of elements to take
returns
a iterable collection consisting only of the last n elements of this iterable collection, or else the whole iterable collection, if it has less than n elements.

definition classes: IterableLike
def takeWhile(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

Takes longest prefix of elements that satisfy a predicate

Takes longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
The predicate used to test elements.
returns
the longest prefix of this iterable collection whose elements all satisfy the predicate p.

definition classes: IterableLike ⇐ TraversableLike
def toArray[B >: (Pub, Evt)](arg0: ClassManifest[B]): Array[B]

Converts this iterable collection to an array

Converts this iterable collection to an array.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array. A ClassManifest for this type must be available.
returns
an array containing all elements of this iterable collection.

definition classes: TraversableLike
def toIndexedSeq[B >: (Pub, Evt)]: IndexedSeq[B]

Converts this iterable collection to an indexed sequence

Converts this iterable collection to an indexed sequence.
Note: will not terminate for infinite-sized collections.

definition classes: TraversableLike
def toIterable: Iterable[(Pub, Evt)]

Converts this iterable collection to an iterable collection

Converts this iterable collection to an iterable collection.
Note: Will not terminate for infinite-sized collections.

definition classes: IterableLike ⇐ TraversableLike
def toList: List[(Pub, Evt)]

Converts this iterable collection to a list

Converts this iterable collection to a list.
Note: will not terminate for infinite-sized collections.

definition classes: TraversableLike
def toSeq: Seq[(Pub, Evt)]

Converts this iterable collection to a sequence

Converts this iterable collection to a sequence.
Note: will not terminate for infinite-sized collections.

definition classes: TraversableLike
def toSet[B >: (Pub, Evt)]: Set[B]

Converts this iterable collection to a set

Converts this iterable collection to a set.
Note: will not terminate for infinite-sized collections.

definition classes: TraversableLike
def toStream: Stream[(Pub, Evt)]

Converts this iterable collection to a stream

Converts this iterable collection to a stream.
Note: will not terminate for infinite-sized collections.

definition classes: IterableLike ⇐ TraversableLike
def toString(): String

Converts this iterable collection to a string

Converts this iterable collection to a string

definition classes: TraversableLike ⇐ AnyRef ⇐ Any
def transpose[B](asTraversable: ((Pub, Evt)) ⇒ Traversable[B]): Iterable[Iterable[B]]

Transposes this iterable collection of traversable collections into

Transposes this iterable collection of traversable collections into

definition classes: GenericTraversableTemplate
def unzip[A1, A2](asPair: ((Pub, Evt)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

Converts this iterable collection of pairs into two collections of the first and second halfs of each pair

Converts this iterable collection of pairs into two collections of the first and second halfs of each pair.

asPair
an implicit conversion which asserts that the element type of this iterable collection is a pair.
returns
a pair iterable collections, containing the first, respectively second half of each element pair of this iterable collection.

definition classes: GenericTraversableTemplate
def view(from: Int, until: Int): IterableView[(Pub, Evt), Iterable[(Pub, Evt)]]

Creates a non-strict view of a slice of this iterable collection

Creates a non-strict view of a slice of this iterable collection.
Note: the difference between view and slice is that view produces a view of the current iterable collection, whereas slice produces a new iterable collection.
Note: view(from, to) is equivalent to view.slice(from, to)
Note: might return different results for different runs, unless the underlying collection type is ordered.

from
the index of the first element of the view
until
the index of the element following the view
returns
a non-strict view of a slice of this iterable collection, starting at index from and extending up to (but not including) index until.

definition classes: IterableLike ⇐ TraversableLike
def view: IterableView[(Pub, Evt), Iterable[(Pub, Evt)]]

Creates a non-strict view of this iterable collection

Creates a non-strict view of this iterable collection.

definition classes: IterableLike ⇐ TraversableLike
def withFilter(p: ((Pub, Evt)) ⇒ Boolean): WithFilter

Creates a non-strict filter of this iterable collection

Creates a non-strict filter of this iterable collection.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this iterable collection which satify the predicate p.

definition classes: TraversableLike
def zip[A1 >: (Pub, Evt), B, That](that: Iterable[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], (A1, B), That]): That

Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs

Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
Note: might return different results for different runs, unless the underlying collection type is ordered.

A1
the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).
B
the type of the second half of the returned pairs
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.
that
The iterable providing the second half of each result pair
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).
returns
a new collection of type That containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection$ and that.

definition classes: IterableLike
def zipAll[B, A1 >: (Pub, Evt), That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[Iterable[(Pub, Evt)], (A1, B), That]): That

Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs

Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
Note: might return different results for different runs, unless the underlying collection type is ordered.

that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this iterable collection is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this iterable collection.
returns
a new collection of type That containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the maximum of the lengths of this iterable collection$ and that. If this iterable collection is shorter than that, thisElem values are used to pad the result. If that is shorter than this iterable collection, thatElem values are used to pad the result.

definition classes: IterableLike
def zipWithIndex[A1 >: (Pub, Evt), That](bf: CanBuildFrom[Iterable[(Pub, Evt)], (A1, Int), That]): That

Zips this iterable collection with its indices

Zips this iterable collection with its indices.
Note: might return different results for different runs, unless the underlying collection type is ordered.

A1
the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.
returns
A new collection of type That containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at 0.

definition classes: IterableLike

Instance constructors

new History()

History

class History[Evt, Pub] extends Subscriber[Evt, Pub] with Iterable[(Pub, Evt)]

Inherits

Type Members

class WithFilter extends AnyRef

Value Members

def ++[B >: (Pub, Evt), That](that: Iterator[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

def ++[B >: (Pub, Evt), That](that: Traversable[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

def /:[B](z: B)(op: (B, (Pub, Evt)) ⇒ B): B

def :\[B](z: B)(op: ((Pub, Evt), B) ⇒ B): B

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def canEqual(that: Any): Boolean

def clear(): Unit

def companion: GenericCompanion[Iterable[A][A]]

def copyToArray[B >: (Pub, Evt)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (Pub, Evt)](xs: Array[B]): Unit

def copyToArray[B >: (Pub, Evt)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (Pub, Evt)](dest: Buffer[B]): Unit

def count(p: ((Pub, Evt)) ⇒ Boolean): Int

def drop(n: Int): Iterable[(Pub, Evt)]

def dropRight(n: Int): Iterable[(Pub, Evt)]

def dropWhile(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

def elements: Iterator[(Pub, Evt)]

def equals(obj: Any): Boolean

def events: Iterator[Evt]

def exists(p: ((Pub, Evt)) ⇒ Boolean): Boolean

def filter(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

def filterNot(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

def find(p: ((Pub, Evt)) ⇒ Boolean): Option[(Pub, Evt)]

def first: (Pub, Evt)

def firstOption: Option[(Pub, Evt)]

def flatMap[B, That](f: ((Pub, Evt)) ⇒ Traversable[B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

def flatten[B](asTraversable: ((Pub, Evt)) ⇒ Traversable[B]): Iterable[B]

def foldLeft[B](z: B)(op: (B, (Pub, Evt)) ⇒ B): B

def foldRight[B](z: B)(op: ((Pub, Evt), B) ⇒ B): B

def forall(p: ((Pub, Evt)) ⇒ Boolean): Boolean

def foreach[U](f: ((Pub, Evt)) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

def groupBy[K](f: ((Pub, Evt)) ⇒ K): Map[K, Iterable[(Pub, Evt)]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (Pub, Evt)

def headOption: Option[(Pub, Evt)]

def init: Iterable[(Pub, Evt)]

def isEmpty: Boolean

def iterator: Iterator[(Pub, Evt)]

def last: (Pub, Evt)

def lastOption: Option[(Pub, Evt)]

def map[B, That](f: ((Pub, Evt)) ⇒ B)(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

def max[B >: (Pub, Evt)](cmp: Ordering[B]): (Pub, Evt)

val maxHistory: Int

def min[B >: (Pub, Evt)](cmp: Ordering[B]): (Pub, Evt)

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

def nonEmpty: Boolean

def notify(pub: Pub, event: Evt): Unit

def partialMap[B, That](pf: PartialFunction[(Pub, Evt), B])(bf: CanBuildFrom[Iterable[(Pub, Evt)], B, That]): That

def partition(p: ((Pub, Evt)) ⇒ Boolean): (Iterable[(Pub, Evt)], Iterable[(Pub, Evt)])

def product[B >: (Pub, Evt)](num: Numeric[B]): B

def projection: IterableView[(Pub, Evt), Iterable[(Pub, Evt)]]

def reduceLeft[B >: (Pub, Evt)](op: (B, (Pub, Evt)) ⇒ B): B

def reduceLeftOption[B >: (Pub, Evt)](op: (B, (Pub, Evt)) ⇒ B): Option[B]

def reduceRight[B >: (Pub, Evt)](op: ((Pub, Evt), B) ⇒ B): B

def reduceRightOption[B >: (Pub, Evt)](op: ((Pub, Evt), B) ⇒ B): Option[B]

def repr: Iterable[(Pub, Evt)]

def sameElements[B >: (Pub, Evt)](that: Iterable[B]): Boolean

def size: Int

def slice(from: Int, until: Int): Iterable[(Pub, Evt)]

def span(p: ((Pub, Evt)) ⇒ Boolean): (Iterable[(Pub, Evt)], Iterable[(Pub, Evt)])

def splitAt(n: Int): (Iterable[(Pub, Evt)], Iterable[(Pub, Evt)])

def stringPrefix: String

def sum[B >: (Pub, Evt)](num: Numeric[B]): B

def tail: Iterable[(Pub, Evt)]

def take(n: Int): Iterable[(Pub, Evt)]

def takeRight(n: Int): Iterable[(Pub, Evt)]

def takeWhile(p: ((Pub, Evt)) ⇒ Boolean): Iterable[(Pub, Evt)]

def toArray[B >: (Pub, Evt)](arg0: ClassManifest[B]): Array[B]