One

this One as an Every

the string "One"

the string "One" followed by the result of invoking toString on this One's lone element, surrounded by parentheses.

element

the element to prepend to this Every

a new Every consisting of element followed by all elements of this Every.

sb

the string builder to which elements will be appended

sep

the separator string

start

the ending string

the string builder, sb, to which elements were appended.

sb

the string builder to which elements will be appended

sep

the separator string

the string builder, sb, to which elements were appended.

sb

the string builder to which elements will be appended

the string builder, sb, to which elements were appended.

the element of this Every at index idx, where 0 indicates the first element.

pf

the partial function

an Option containing pf applied to the first element for which it is defined, or None if the partial function was not defined for any element.

elem

the element to look for

true if this Every has an element that is equal (as determined by ==) to elem, false otherwise.

that

the Every slice to look for

true if this Every contains a slice with the same elements as that, otherwise false.

that

the GenSeq slice to look for

true if this Every contains a slice with the same elements as that, otherwise false.

arr

the array to fill

len

the maximum number of elements to copy

start

the starting index

arr

the array to fill

start

the starting index

arr

the array to fill

buf

the buffer to which elements are copied

B

the type of the elements of that

p

the predicate, which relates elements from this and the passed Every

that

the Every to compare for correspondence

true if this and the passed Every have the same length and p(x, y) is true for all corresponding elements x of this Every and y of that, otherwise false.

B

the type of the elements of that

p

the predicate, which relates elements from this Every and the passed GenSeq

that

the GenSeq to compare for correspondence

true if this Every and the passed GenSeq have the same length and p(x, y) is true for all corresponding elements x of this Every and y of that, otherwise false.

p

the predicate used to test elements.

the number of elements satisfying the predicate p.

A new Every that contains the first occurrence of every element of this Every.

the

sequence to test

true if this Every has that as a suffix, false otherwise.

the

sequence to test

true if this Every has that as a suffix, false otherwise.

the

predicate used to test elements.

true if the given predicate p holds for some of the elements of this Every, otherwise false.

p

the predicate used to test elements

an Some containing the first element in this Every that satisfies p, or None if none exists.

U

the element type of the returned Every

f

the function to apply to each element.

a new Every containing elements obtained by applying the given function f to each element of this Every and concatenating the elements of resulting Everys.

a new Every resulting from concatenating all nested Everys.

U

a type parameter for the binary operator, a supertype of T.

op

a binary operator that must be associative

z

a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)

the result of applying fold operator op between all the elements and z

B

the result type of the binary operator.

op

the binary operator.

z

the start value.

the result of inserting op between consecutive elements of this Every, going left to right, with the start value, z, on the left:

op(...op(op(z, x_1), x_2), ..., x_n)

where x₁, ..., x_n are the elements of this Every.

B

the result of the binary operator

op

the binary operator

z

the start value

the result of inserting op between consecutive elements of this Every, going right to left, with the start value, z, on the right:

op(x_1, op(x_2, ... op(x_n, z)...))

where x₁, ..., x_n are the elements of this Every.

p

the predicate used to test elements.

true if the given predicate p holds for all elements of this Every, otherwise false.

f

the function that is applied for its side-effect to every element. The result of function f is discarded.

K

the type of keys returned by the discriminator function.

f

the discriminator function.

A map from keys to Everys such that the following invariant holds:

(every.toVector partition f)(k) = xs filter (x => f(x) == k)

That is, every key k is bound to an Every of those elements x for which f(x) equals k.

size

the number of elements per group

An iterator producing Everys of size size, except the last will be truncated if the elements don't divide evenly.

the first element of this Every.

the first element of this Every, wrapped in a Some.

elem

the element value to search for.

from

the start index

the index >= from of the first element of this Every that is equal (as determined by ==) to elem, or -1, if none exists.

elem

the element value to search for.

the index of the first element of this Every that is equal (as determined by ==) to elem, or -1, if none exists.

from

the start index

that

the Every defining the slice to look for

the first index >= from such that the elements of this Every starting at this index match the elements of Every that, or -1 of no such subsequence exists.

that

the Every defining the slice to look for

the first index such that the elements of this Every starting at this index match the elements of Every that, or -1 of no such subsequence exists.

from

the start index

that

the GenSeq defining the slice to look for

the first index >= from at which the elements of this Every starting at that index match the elements of GenSeq that, or -1 of no such subsequence exists.

that

the GenSeq defining the slice to look for

the first index at which the elements of this Every starting at that index match the elements of GenSeq that, or -1 of no such subsequence exists.

from

the start index

p

the predicate used to test elements.

the index >= from of the first element of this Every that satisfies the predicate p, or -1, if none exists.

p

the predicate used to test elements.

the index of the first element of this Every that satisfies the predicate p, or -1, if none exists.

a Range value from 0 to one less than the length of this Every.

idx

the index to test

true if this Every contains an element at position idx, false otherwise.

false

true

the new iterator

the last element of this Every.

elem

the element value to search for.

end

the end index.

the index >= end of the last element of this Every that is equal (as determined by ==) to elem, or -1, if none exists.

elem

the element value to search for.

the index of the last element of this Every that is equal (as determined by ==) to elem, or -1, if none exists.

end

the end index

that

the Every defining the slice to look for

the last index >= end at which the elements of this Every starting at that index match the elements of Every that, or -1 of no such subsequence exists.

that

the Every defining the slice to look for

the last index at which the elements of this Every starting at that index match the elements of Every that, or -1 of no such subsequence exists.

end

the end index

that

the GenSeq defining the slice to look for

the last index >= end at which the elements of this Every starting at that index match the elements of GenSeq that, or -1 of no such subsequence exists.

that

the GenSeq defining the slice to look for

the last index at which the elements of this Every starting at that index match the elements of GenSeq that, or -1 of no such subsequence exists.

end

the end index

p

the predicate used to test elements.

the index >= end of the last element of this Every that satisfies the predicate p, or -1, if none exists.

p

the predicate used to test elements.

the index of the last element of this Every that satisfies the predicate p, or -1, if none exists.

the last element, wrapped in a Some.

the number of elements in this Every.

len

the test value that gets compared with the length.

a value x where

x < 0 if this.length < len
x == 0 if this.length == len
x > 0 if this.length > len

U

the element type of the returned Every.

f

the function to apply to each element.

a new Every resulting from applying the given function f to each element of this Every and collecting the results.

the largest element of this Every.

the largest result of applying the given function to every element of this Every.

the smallest element of this Every.

the smallest result of applying the given function to every element of this Every.

end

the ending string.

sep

the separator string.

start

the starting string.

a string representation of this Every. The resulting string begins with the string start and ends with the string end. Inside, In the resulting string, the result of invoking toString on all elements of this Every are separated by the string sep.

sep

the separator string

a string representation of this Every. In the resulting string, the result of invoking toString on all elements of this Every are separated by the string sep.

a string representation of this Every. In the resulting string, the result of invoking toString on all elements of this Every follow each other without any separator string.

true

elem

he padding value

len

the target length

a new Every consisting of all elements of this Every followed by the minimal number of occurrences of elem so that the resulting Every has a length of at least len.

from

the index of the first replaced element

replaced

the number of elements to drop in the original Every

that

the Every whose elements should replace a slice in this Every

an iterator which traverses the distinct permutations of this Every.

p

the predicate used to test elements.

the length of the longest prefix of this Every such that every element of the segment satisfies the predicate p.

the product of all elements

U

a type parameter for the binary operator, a supertype of T.

op

a binary operator that must be associative.

the result of applying reduce operator op between all the elements of this Every.

U

the result type of the binary operator.

op

the binary operator.

the result of inserting op between consecutive elements of this Every, going left to right:

op(...op(op(x_1, x_2), x_3), ..., x_n)

where x₁, ..., x_n are the elements of this Every.

U

the result type of the binary operator.

op

the binary operator.

a Some containing the result of reduceLeft(op)

U

the result of the binary operator

op

the binary operator

the result of inserting op between consecutive elements of this Every, going right to left:

op(x_1, op(x_2, ... op(x_{n-1}, x_n)...))

where x₁, ..., x_n are the elements of this Every.

U

the result of the binary operator

op

the binary operator

a Some containing the result of reduceRight(op)

a new Every with all elements of this Every in reversed order.

an iterator yielding the elements of this Every in reversed order

U

the element type of the returned Every.

f

the function to apply to each element.

a new Every resulting from applying the given function f to each element of this Every and collecting the results in reverse order.

that

the Every with which to compare

true, if both this and the given Every contain the same elements in the same order, false otherwise.

that

the GenIterable with which to compare

true, if both this Every and the given GenIterable contain the same elements in the same order, false otherwise.

U

a type parameter for the binary operator, a supertype of T, and the type of the resulting Every.

op

a binary operator that must be associative

z

a neutral element for the scan operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)

a new Every containing the prefix scan of the elements in this Every

B

the result type of the binary operator and type of the resulting Every

op

the binary operator.

z

the start value.

a new Every containing the intermediate results of inserting op between consecutive elements of this Every, going left to right, with the start value, z, on the left.

B

the result of the binary operator and type of the resulting Every

op

the binary operator

z

the start value

a new Every containing the intermediate results of inserting op between consecutive elements of this Every, going right to left, with the start value, z, on the right.

from

the index where the search starts.

p

the predicate used to test elements.

the

length of the longest segment of this Every starting from index from such that every element of the segment satisfies the predicate p.

the number of elements in this Every.

size

the number of elements per group

step

the distance between the first elements of successive groups

an iterator producing Everys of size size, except the last and the only element will be truncated if there are fewer elements than size.

size

the number of elements per group

an iterator producing Everys of size size, except the last and the only element will be truncated if there are fewer elements than size.

U

the target type of the transformation f, and the type where the Ordering ord is defined.

f

the transformation function mapping elements to some other domain U.

ord

the ordering assumed on domain U.

a Every consisting of the elements of this Every sorted according to the Ordering where x < y if ord.lt(f(x), f(y)).

the

comparison function that tests whether its first argument precedes its second argument in the desired ordering.

an Every consisting of the elements of this Every sorted according to the comparison function lt.

ord

the Ordering to be used to compare elements.

the

comparison function that tests whether its first argument precedes its second argument in the desired ordering.

an Every consisting of the elements of this Every sorted according to the comparison function lt.

offset

the index at which this Every is searched.

that

the Every slice to look for in this Every

true if this Every has that as a slice at the index offset, false otherwise.

that

the Every to test

true if this collection has that as a prefix, false otherwise.

offset

the index at which this Every is searched.

that

the GenSeq slice to look for in this Every

true if this Every has that as a slice at the index offset, false otherwise.

that

the GenSeq slice to look for in this Every

true if this Every has that as a prefix, false otherwise.

the sum of all elements

Col

the collection type to build.

a new collection containing all elements of this Every.

an array containing all elements of this Every. A ClassTag must be available for the element type of this Every.

a buffer containing all elements of this Every.

an immutable IndexedSeq containing all elements of this Every.

an Iterable containing all elements of this Every.

an Iterator containing all elements of this Every.

a list containing all elements of this Every.

a map of type immutable.Map[K, V] containing all key/value pairs of type (K, V) of this Every.

an immutable IndexedSeq containing all elements of this Every.

a set containing all elements of this Every.

a stream containing all elements of this Every.

a Vector containing all elements of this Every.

a Traversable containing all elements of this Every.

that

the GenSeq to add.

a new Every that contains all elements of this Every followed by all elements of that GenSeq.

that

the Every to add.

a new Every that contains all elements of this Every followed by all elements of that.

L

the type of the first half of the element pairs

R

the type of the second half of the element pairs

asPair

an implicit conversion that asserts that the element type of this Every is a pair.

a pair of Everys, containing the first and second half, respectively, of each element pair of this Every.

L

the type of the first member of the element triples

R

the type of the third member of the element triples

asTriple

an implicit conversion that asserts that the element type of this Every is a triple.

a triple of Everys, containing the first, second, and third member, respectively, of each element triple of this Every.

elem

the replacing element

idx

the position of the replacement

a copy of this Every with the element at position idx replaced by elem.

other

the Iterable providing the second half of each result pair

thatElem

the element to be used to fill up the result if that Iterable is shorter than this Every.

thisElem

the element to be used to fill up the result if this Every is shorter than that Iterable.

a new Every containing pairs consisting of corresponding elements of this Every and that. The length of the returned collection is the maximum of the lengths of this Every and that. If this Every is shorter than that, thisElem values are used to pad the result. If that is shorter than this Every, thatElem values are used to pad the result.

A new Every containing pairs consisting of all elements of this Every paired with their index. Indices start at 0.

B

the result of the binary operator

op

the binary operator

z

the start value

the result of inserting op between consecutive elements of this Every, going left to right, with the start value, z, on the left:

op(...op(op(z, x_1), x_2), ..., x_n)

where x₁, ..., x_n are the elements of this Every.

B

the result of the binary operator

op

the binary operator

z

the start value

the result of inserting op between consecutive elements of this Every, going right to left, with the start value, z, on the right:

op(x_1, op(x_2, ... op(x_n, z)...))