A class supporting filtered operations .
[use case] Concatenates this synchronized stack with the elements of a traversable collection .
Concatenates this synchronized stack with the elements of a traversable collection .
[use case] Prepends an element to this synchronized stack
Prepends an element to this synchronized stack
Applies a binary operator to a start value and all elements of this synchronized stack, going left to right .
[use case] Appends an element to this synchronized stack
Appends an element to this synchronized stack
Applies a binary operator to all elements of this synchronized stack and a start value, going right to left .
Appends all elements of this synchronized stack to a string builder .
Appends all elements of this synchronized stack to a string builder using a separator string .
Appends all elements of this synchronized stack to a string builder using start, end, and separator strings .
Composes this partial function with a transformation function that gets applied to results of this partial function .
Retrieve n'th element from stack, where top of stack has index 0@return the element of this synchronized stack at index idx
, where 0
indicates the first element.
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind .
Removes all elements from the stack .
This method clones the stack .
[use case] Builds a new collection by applying a partial function to all elements of this synchronized stack on which the function is defined .
Builds a new collection by applying a partial function to all elements of this synchronized stack on which the function is defined .
The factory companion object that builds instances of class SynchronizedStack .
(f compose g)(x) == f(g(x))
Tests whether this synchronized stack contains a given value as an element .
Tests whether this synchronized stack contains a given sequence as a slice .
[use case] Copies elements of this synchronized stack to an array .
Copies elements of this synchronized stack to an array .
[use case] Copies values of this synchronized stack to an array .
Copies values of this synchronized stack to an array .
[use case] Copies values of this synchronized stack to an array .
Copies values of this synchronized stack to an array .
Copies all elements of this synchronized stack to a buffer .
Tests whether every element of this synchronized stack relates to the corresponding element of another sequence by satisfying a test predicate .
Counts the number of elements in the synchronized stack which satisfy a predicate .
[use case] Computes the multiset difference between this synchronized stack and another sequence .
Computes the multiset difference between this synchronized stack and another sequence .
Builds a new synchronized stack from this synchronized stack without any duplicate elements .
Selects all elements except first n ones.
Selects all elements except last n ones.
Drops longest prefix of elements that satisfy a predicate .
Tests whether this synchronized stack ends with the given sequence .
The equality method defined in AnyRef
.
Tests whether every element of this synchronized stack relates to the corresponding element of another sequence by satisfying a test predicate .
Tests whether a predicate holds for some of the elements of this synchronized stack .
Selects all elements of this synchronized stack which satisfy a predicate .
Selects all elements of this synchronized stack which do not satisfy a predicate .
Finds the first element of the synchronized stack satisfying a predicate, if any .
Returns index of the first element satisfying a predicate, or -1
.
Returns index of the last element satisfying a predicate, or -1 .
None
if iterable is empty.
[use case] Builds a new collection by applying a function to all elements of this synchronized stack and concatenating the results .
Builds a new collection by applying a function to all elements of this synchronized stack and concatenating the results .
[use case] Converts this synchronized stack of traversable collections into a synchronized stack in which all element collections are concatenated .
Converts this synchronized stack of traversable collections into a synchronized stack in which all element collections are concatenated .
Applies a binary operator to a start value and all elements of this synchronized stack, going left to right .
Applies a binary operator to all elements of this synchronized stack and a start value, going right to left .
Tests whether a predicate holds for all elements of this synchronized stack .
[use case] Applies a function f
to all elements of this synchronized stack.
Applies a function f
to all elements of this synchronized stack.
The generic builder that builds instances of SynchronizedStack at arbitrary element types .
Partitions this synchronized stack into a map of synchronized stacks according to some discriminator function .
Partitions elements in fixed size synchronized stacks .
Tests whether this synchronized stack is known to have a finite size .
Hashcodes for SynchronizedStack produce a value from the hashcodes of all the elements of the synchronized stack .
Selects the first element of this synchronized stack .
Optionally selects the first element .
[use case] Finds index of first occurrence of some value in this synchronized stack after or at some start index .
Finds index of first occurrence of some value in this synchronized stack after or at some start index .
[use case] Finds index of first occurrence of some value in this synchronized stack .
Finds index of first occurrence of some value in this synchronized stack .
Finds first index after or at a start index where this synchronized stack contains a given sequence as a slice .
Finds first index where this synchronized stack contains a given sequence as a slice .
Finds index of the first element satisfying some predicate after or at some start index .
Finds index of first element satisfying some predicate .
Produces the range of all indices of this sequence .
Selects all elements except the last .
[use case] Computes the multiset intersection between this synchronized stack and another sequence .
Computes the multiset intersection between this synchronized stack and another sequence .
Tests whether this synchronized stack contains given index .
Checks if the stack is empty .
Tests whether this synchronized stack can be repeatedly traversed .
Returns an iterator over all elements on the stack .
Selects the last element .
[use case] Finds index of last occurrence of some value in this synchronized stack before or at a given end index .
Finds index of last occurrence of some value in this synchronized stack before or at a given end index .
[use case] Finds index of last occurrence of some value in this synchronized stack .
Finds index of last occurrence of some value in this synchronized stack .
Finds last index before or at a given end index where this synchronized stack contains a given sequence as a slice .
Finds last index where this synchronized stack contains a given sequence as a slice .
Finds index of last element satisfying some predicate before or at given end index .
Finds index of last element satisfying some predicate .
Optionally selects the last element .
The number of elements in the stack@return the number of elements in this synchronized stack .
Compares the length of this synchronized stack to a test value .
Turns this partial function into an plain function returning an Option
result.
[use case] Builds a new collection by applying a function to all elements of this synchronized stack .
Builds a new collection by applying a function to all elements of this synchronized stack .
[use case] Finds the largest element .
Finds the largest element .
[use case] Finds the smallest element .
Finds the smallest element .
Displays all elements of this synchronized stack in a string .
Displays all elements of this synchronized stack in a string using a separator string .
Displays all elements of this synchronized stack in a string using start, end, and separator strings .
Tests whether the synchronized stack is not empty .
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined .
[use case] Appends an element value to this synchronized stack until a given target length is reached .
Appends an element value to this synchronized stack until a given target length is reached .
Partitions this synchronized stack in two synchronized stacks according to a predicate .
[use case] Produces a new synchronized stack where a slice of elements in this synchronized stack is replaced by another sequence .
Produces a new synchronized stack where a slice of elements in this synchronized stack is replaced by another sequence .
Removes the top element from the stack .
Returns the length of the longest prefix whose elements all satisfy some predicate .
[use case] Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection .
Push two or more elements onto the stack .
Pushes a single element on top of the stack .
Pushes all elements provided by a traversable object on top of the stack .
Applies a binary operator to all elements of this synchronized stack, going left to right .
Optionally applies a binary operator to all elements of this synchronized stack, going left to right .
Applies a binary operator to all elements of this synchronized stack, going right to left .
Optionally applies a binary operator to all elements of this synchronized stack, going right to left .
The collection of type synchronized stack underlying this TraversableLike
object.
Returns new synchronized stack wih elements in reversed order .
An iterator yielding elements in reversed order .
[use case] Builds a new collection by applying a function to all elements of this synchronized stack and collecting the results in reversed order .
Builds a new collection by applying a function to all elements of this synchronized stack and collecting the results in reversed order .
[use case] Checks if the other iterable collection contains the same elements in the same order as this synchronized stack .
Checks if the other iterable collection contains the same elements in the same order as this synchronized stack .
Produces a collection containing cummulative results of applying the operator going left to right .
Produces a collection containing cummulative results of applying the operator going right to left .
Computes length of longest segment whose elements all satisfy some predicate .
The size of this synchronized stack, equivalent to length
.
Selects an interval of elements .
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped .
Sorts this SynchronizedStack according to the Ordering which results from transforming an implicitly given Ordering with a transformation function .
Sorts this synchronized stack according to a comparison function .
Sorts this synchronized stack according to an Ordering .
Splits this synchronized stack into a prefix/suffix pair according to a predicate .
Splits this synchronized stack into two at a given position .
Tests whether this synchronized stack starts with the given sequence .
Tests whether this synchronized stack contains the given sequence at a given index .
Defines the prefix of this object's toString
representation.
[use case] Sums up the elements of this collection .
Sums up the elements of this collection .
Selects all elements except the first .
Selects first n elements.
Selects last n elements.
Takes longest prefix of elements that satisfy a predicate .
[use case] Converts this synchronized stack to an array .
Converts this synchronized stack to an array .
Converts this synchronized stack to an indexed sequence .
Converts this synchronized stack to an iterable collection .
Returns an Iterator over the elements in this synchronized stack .
Creates a list of all stack elements in FIFO order .
Converts this synchronized stack to a map .
Converts this synchronized stack to a sequence .
Converts this synchronized stack to a set .
Converts this synchronized stack to a stream .
Returns a textual representation of a stack as a string .
Converts this synchronized stack to an unspecified Traversable .
Returns the top element of the stack .
Transposes this synchronized stack of traversable collections into a synchronized stack of synchronized stacks .
[use case] Produces a new sequence which contains all elements of this synchronized stack and also all elements of a given sequence .
Produces a new sequence which contains all elements of this synchronized stack and also all elements of a given sequence .
Converts this synchronized stack of pairs into two collections of the first and second halfs of each pair .
[use case] A copy of this synchronized stack with one single replaced element .
A copy of this synchronized stack with one single replaced element .
Creates a non-strict view of a slice of this synchronized stack .
Creates a non-strict view of this synchronized stack .
Creates a non-strict filter of this synchronized stack .
[use case] Returns a synchronized stack formed from this synchronized stack and another iterable collection by combining corresponding elements in pairs .
Returns a synchronized stack formed from this synchronized stack and another iterable collection by combining corresponding elements in pairs .
[use case] Returns a synchronized stack formed from this synchronized stack and another iterable collection by combining corresponding elements in pairs .
Returns a synchronized stack formed from this synchronized stack and another iterable collection by combining corresponding elements in pairs .
[use case] Zips this synchronized stack with its indices .
Zips this synchronized stack with its indices .
This is a synchronized version of the
Stack[T]
class. It implements a data structure which allows to store and retrieve objects in a last-in-first-out (LIFO) fashion.type of the elements contained in this stack .
version
1 . 0, 03/05/2004
since
1
authors:
Matthias Zenger