Cons<A> class final

The non-empty case of IList, containing a head element and a tail.

Inheritance

Object
IList<A>
Cons

Available extensions

Constructors

Cons(A head, IList<A> next)

Properties

hashCode → int: The hash code for this object.
no setterinherited
head → A: Returns the first element of this collection, or throws if it is empty.
final
headOption → Option<A>: Returns the first element of this collection as a Some if non-empty. If this collction is empty, None is returned.
no setteroverride
init → IList<A>: Returns all elements from this collection except the last. If this collection is empty, an empty collection is returned.
no setterinherited
inits → RIterator<IList<A>>: Returns an iterator of all potential tails of this collection, starting with the entire collection and ending with an empty one.
no setterinherited
isEmpty → bool: Whether this collection contains no elements.
no setterinherited
isNotEmpty → bool: Whether this collection contains at least one element.
no setterinherited
isTraversableAgain → bool: Whether this collection can be traversed more than once.
no setterinherited
iterator → RIterator<A>: Returns an RIterator over the elements of this collection.
no setterinherited
knownSize → int: Returns the number of elements in this collection, if that number is already known. If not, -1 is returned.
no setterinherited
last → A: Returns the last element of this collection, or throws if it is empty.
no setterinherited
lastOption → Option<A>: Returns the last element of this collection as a Some, or None if this collection is empty.
no setterinherited
length → int: The number of elements in this sequence.
no setterinherited
nonEmpty → bool: Whether this collection contains at least one element.
no setterinherited
runtimeType → Type: A representation of the runtime type of the object.
no setterinherited
size → int: Returns the number of elements in this collection.
no setterinherited
tail → IList<A>: Returns a new collection with the first element removed. If this collection is empty, an empty collection is returned.
no setteroverride
tails → RIterator<IList<A>>: Returns an iterator of all potential tails of this collection, starting with the entire collection and ending with an empty one.
no setterinherited

Methods

appended(A elem) → IList<A>: Returns a new Seq, with the given elem added to the end.
inherited
appendedAll(RIterableOnce<A> suffix) → IList<A>: Returns a new Seq, with elems added to the end.
inherited
canEqual(Object other) → bool: inherited
collect(Function1<A, Option> f) → IList: Returns a new collection by applying f to each element an only keeping results of type Some.
inherited
collectFirst(Function1<A, Option> f) → Option: Applies f to each element of this collection, returning the first element that results in a Some, if any.
inherited
combinations(int n) → RIterator<IList<A>>: Returns an Iterator that will produce all combinations of elements from this sequence of size n in order.
inherited
concat(covariant RIterableOnce<A> suffix) → IList<A>: Returns a copy of this collection, with elems added to the end.
inherited
contains(A elem) → bool: Returns true, if any element of this collection equals elem.
inherited
containsSlice(RSeq<A> that) → bool: Returns true if that is contained in this collection, in order.
inherited
copyToArray(Array<A> xs, [int start = 0, int? n]) → int: Copies elements into xs starting at start, writing at most n elements (or all remaining capacity when n is omitted).
inherited
corresponds(covariant RSeq that, Function2<A, B, bool> p) → bool: Returns true if this collection has the same size as that and each corresponding element from this and that satisfies the given predicate p.
inherited
count(Function1<A, bool> p) → int: Return the number of elements in this collection that satisfy the given predicate.
inherited
deleteFirst(Function1<A, bool> p) → Option<(A, IList<A>)>: Removes the first element satisfying p and returns it paired with the remaining list. Returns None if no element matches.
inherited
diff(RSeq<A> that) → IList<A>: Returns a new collection with the difference of this and that, i.e. all elements that appear in only this collection.
inherited
distinct() → IList<A>: Returns a new collection where every element is distinct according to equality.
inherited
distinctBy(Function1<A, B> f) → IList<A>: Returns a new collection where every element is distinct according to the application of f to each element.
inherited
drop(int n) → IList<A>: Returns a new collection with the first n elements removed.
inherited
dropRight(int n) → IList<A>: Return a new collection with the last n elements removed.
inherited
dropWhile(Function1<A, bool> p) → IList<A>: Returns a new collection with leading elements satisfying p removed.
inherited
dropWhileN(Function5<T1, T2, T3, T4, T5, bool> p) → IList<(T1, T2, T3, T4, T5)>: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
dropWhileN(Function4<T1, T2, T3, T4, bool> p) → IList<(T1, T2, T3, T4)>: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
dropWhileN(Function3<T1, T2, T3, bool> p) → IList<(T1, T2, T3)>: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
dropWhileN(Function2<T1, T2, bool> p) → IList<(T1, T2)>: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
endsWith(RIterable<A> that) → bool: Returns true if the end of this collection has the same elements in order as that. Otherwise, false is returned.
inherited
exists(Function1<A, bool> p) → bool: Returns true if any element of this collection satisfies the given predicate, false if no elements satisfy it.
inherited
filter(Function1<A, bool> p) → IList<A>: Returns a new collection containing only elements that satisfy p.
inherited
filterN(Function5<T1, T2, T3, T4, T5, bool> p) → IList<(T1, T2, T3, T4, T5)>: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
filterN(Function4<T1, T2, T3, T4, bool> p) → IList<(T1, T2, T3, T4)>: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
filterN(Function3<T1, T2, T3, bool> p) → IList<(T1, T2, T3)>: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
filterN(Function2<T1, T2, bool> p) → IList<(T1, T2)>: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
filterNot(Function1<A, bool> p) → IList<A>: Returns a new collection containing only elements that do not satisfy p.
inherited
filterNotN(Function5<T1, T2, T3, T4, T5, bool> p) → IList<(T1, T2, T3, T4, T5)>: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
filterNotN(Function4<T1, T2, T3, T4, bool> p) → IList<(T1, T2, T3, T4)>: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
filterNotN(Function3<T1, T2, T3, bool> p) → IList<(T1, T2, T3)>: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
filterNotN(Function2<T1, T2, bool> p) → IList<(T1, T2)>: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
find(Function1<A, bool> p) → Option<A>: Returns the first element from this collection that satisfies the given predicate p. If no element satisfies p, None is returned.
inherited
findLast(Function1<A, bool> p) → Option<A>: Returns the last element satisfying p as Some, or None if none.
inherited
flatMap(covariant Function1<A, RIterableOnce> f) → IList: Returns a new collection by applying f to each element and concatenating the results.
inherited
flatMapN<T6>(Function5<T1, T2, T3, T4, T5, IList<T6>> f) → IList<T6>: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
flatMapN<T5>(Function4<T1, T2, T3, T4, IList<T5>> f) → IList<T5>: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
flatMapN<T4>(Function3<T1, T2, T3, IList<T4>> f) → IList<T4>: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
flatMapN<T3>(Function2<T1, T2, IList<T3>> f) → IList<T3>: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
flatten() → RIterable<A>: Available on RIterable<RIterable<A>>, provided by the RIterableNested2Ops extension
Concatenates all inner iterables into a single IList.
flatten() → IList<A>: Available on IList<IList<A>>, provided by the IListNestedOps extension
Combines all nested lists into one list using concatenation.
fold(A init, Function2<A, A, A> op) → A: Alias for foldLeft with a same-type accumulator.
inherited
foldLeft(B z, Function2<B, A, B> op) → B: Returns a summary value by applying op to all elements of this collection, moving from left to right. The fold uses a seed value of z.
inherited
foldRight(B z, Function2<A, B, B> op) → B: Returns a summary value by applying op to all elements of this collection, moving from right to left. The fold uses a seed value of z.
inherited
forall(Function1<A, bool> p) → bool: Returns true if all elements of this collection satisfy the given predicate, false if any elements do not.
inherited
foreach(Function1<A, U> f) → void: Applies f to each element of this collection, discarding any resulting values.
inherited
foreachN(Function3<T1, T2, T3, void> f) → void: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
foreachN(Function5<T1, T2, T3, T4, T5, void> f) → void: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
foreachN(Function4<T1, T2, T3, T4, void> f) → void: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
foreachN(Function2<T1, T2, void> f) → void: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
groupBy<K>(Function1<A, K> f) → IMap<K, IList<A>>: Partitions all elements of this collection by applying f to each element and accumulating duplicate keys in the returned IMap.
inherited
grouped(int size) → RIterator<IList<A>>: Returns a new iterator where each element is a collection of size elements from the original collection. The last element may contain less than size elements.
inherited
groupMap<K, B>(Function1<A, K> key, Function1<A, B> f) → IMap<K, IList>: Creates a new map by generating a key-value pair for each elements of this collection using key and f. Any elements that generate the same key will have the resulting values accumulated in the returned map.
inherited
groupMapReduce<K, B>(Function1<A, K> key, Function1<A, B> f, Function2<B, B, B> reduce) → IMap<K, B>: Partitions all elements of this collection by applying key to each element. Additionally f is applied to each element to generate a value. If multiple values are generating for the same key, those values will be combined using reduce.
inherited
indexOf(A elem, [int from = 0]) → Option<int>: Returns the first index, if any, where the element at that index equals elem. If no index contains elem, None is returned.
inherited
indexOfSlice(RSeq<A> that, [int from = 0]) → Option<int>: Finds the first index in this collection where the next sequence of elements is equal to that. If that cannot be found in this collection, None is returned.
inherited
indexWhere(Function1<A, bool> p, [int from = 0]) → Option<int>: Returns the index of the first element that satisfies the predicate p. If no element satisfies, None is returned.
inherited
indices() → Range: Returns a range of all indices of this sequence
inherited
insertAt(int idx, A elem) → IList<A>: Returns a new list with elem inserted at idx.
inherited
intersect(RSeq<A> that) → IList<A>: Returns a new collection with the intersection of this and that, i.e. all elements that appear in both collections.
inherited
intersperse(A x) → IList<A>: Returns a new collection with sep inserted between each element.
inherited
isDefinedAt(int idx) → bool: Returns true if this collection has an element at the given idx.
inherited
lastIndexOf(A elem, [int end = 2147483647]) → Option<int>: Returns the last index, if any, where the element at that index equals elem. If no index contains elem, None is returned.
inherited
lastIndexOfSlice(RSeq<A> that, [int end = 2147483647]) → Option<int>: Finds the last index in this collection where the next sequence of elements is equal to that. If that cannot be found in this collection, None is returned.
inherited
lastIndexWhere(Function1<A, bool> p, [int end = 2147483647]) → Option<int>: Returns the index of the last element that satisfies the predicate p. If no element satisfies, None is returned.
inherited
lift(int ix) → Option<A>: Returns the element at index ix as a Some. If ix is outside the range of this collection, None is returned.
inherited
map(Function1<A, B> f) → IList: Returns a new collection by applying f to each element.
inherited
mapN<T6>(Function5<T1, T2, T3, T4, T5, T6> f) → IList<T6>: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
mapN<T3>(Function2<T1, T2, T3> f) → IList<T3>: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
mapN<T5>(Function4<T1, T2, T3, T4, T5> f) → IList<T5>: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
mapN<T4>(Function3<T1, T2, T3, T4> f) → IList<T4>: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
maxByOption(Function1<A, B> f, Order order) → Option<A>: Finds the largest element in this collection by applying f to each element and using the given Order to find the greatest.
inherited
maxOption(Order<A> order) → Option<A>: Finds the largest element in this collection according to the given Order.
inherited
minByOption(Function1<A, B> f, Order order) → Option<A>: Finds the smallest element in this collection by applying f to each element and using the given Order to find the greatest.
inherited
minOption(Order<A> order) → Option<A>: Finds the largest element in this collection according to the given Order.
inherited
mkString({String? start, String? sep, String? end}) → String: Returns a String by using each elements toString(), adding sep between each element. If start is defined, it will be prepended to the resulting string. If end is defined, it will be appended to the resulting string.
inherited
noNulls() → IList<A>: Available on IList<A?>, provided by the IListNullableOps extension
Returns a new list with all null elements removed.
noSuchMethod(Invocation invocation) → dynamic: Invoked when a nonexistent method or property is accessed.
inherited
padTo(int len, A elem) → IList<A>: Returns a new collection with a length of at least len.
inherited
partition(Function1<A, bool> p) → (IList<A>, IList<A>): Returns 2 collections as a tuple where the first tuple element will be a collection of elements that satisfy the given predicate p. The second item of the returned tuple will be elements that do not satisfy p.
inherited
partitionMap<A1, A2>(Function1<A, Either<A1, A2>> f) → (IList<A1>, IList<A2>): Applies f to each element of this collection and returns a separate collection for all applications resulting in a Left and Right respectively.
inherited
patch(int from, RIterableOnce<A> other, int replaced) → IList<A>: Returns a new collection with replaced elements starting at from replaced by the elements of other.
inherited
permutations() → RIterator<IList<A>>: Returns an Iterator that will emit all possible permutations of the elements in this collection.
inherited
prepended(A elem) → IList<A>: Returns a new collection with elem added to the beginning.
inherited
prependedAll(RIterableOnce<A> prefix) → IList<A>: Returns a new collection with all elems added to the beginning.
inherited
product() → int: Available on RIterableOnce<int>, provided by the RIterableIntOps extension
Returns the product of all elements in this list
product() → double: Available on RIterableOnce<double>, provided by the RIterableDoubleOps extension
Returns the product of all elements in this list
reduce(Function2<A, A, A> op) → A: Reduces this collection to a single value by applying op left to right.
inherited
reduceLeft(Function2<A, A, A> op) → A: Reduces from left to right. Throws if empty.
inherited
reduceLeftOption(Function2<A, A, A> op) → Option<A>: Returns a summary values of all elements of this collection by applying f to each element, moving left to right.
inherited
reduceOption(Function2<A, A, A> op) → Option<A>: Returns a summary values of all elements of this collection by applying f to each element, moving left to right.
inherited
reduceRight(Function2<A, A, A> op) → A: Reduces from right to left. Throws if empty.
inherited
reduceRightOption(Function2<A, A, A> op) → Option<A>: Returns a summary values of all elements of this collection by applying f to each element, moving right to left.
inherited
removeAt(int idx) → IList<A>: Returns a new collection with the element at idx removed.
inherited
removeFirst(Function1<A, bool> p) → IList<A>: Returns a new list with the first element satisfying p removed.
inherited
reverse() → IList<A>: Returns a new collection with the order of the elements reversed.
inherited
reverseIterator() → RIterator<A>: Returns an iterator that will emit all elements in this collection, in reverse order.
inherited
sameElements(RIterable<A> that) → bool: Returns true if this collection has the same elements, in the same order, as that.
inherited
scan(B z, Function2<B, A, B> op) → IList: Alias for scanLeft.
inherited
scanLeft(B z, Function2<B, A, B> op) → IList: Returns a new collection of running totals starting with z.
inherited
scanRight(B z, Function2<A, B, B> op) → IList: Returns a new collection of running totals starting with z, traversing from right to left.
inherited
segmentLength(Function1<A, bool> p, [int from = 0]) → int: Returns the length of the longest prefix starting at from where every element satisfies p.
inherited
sequence() → Option<IList<A>>: Available on IList<Option<A>>, provided by the IListOptionOps extension
Accumulates all elements in this list as one Option. If any element is a None, None will be returned. If all elements are Some, then the entire list is returned, wrapped in a Some.
sequence() → Either<A, IList>: Available on IList<Either<A, B>>, provided by the IListEitherOps extension
Accumulates all elements in this list as one Either. If any element is a Left, that Left is returned immediately. If all elements are Right, the entire list of right values is returned wrapped in a Right.
slice(int from, int until) → IList<A>: Returns a new collection containing elements in the range [from, until).
inherited
sliding(int size, [int step = 1]) → RIterator<IList<A>>: Returns an iterator where elements are fixed size chunks of size n of the original collection. Each chunk is calculated by sliding a 'window' of size n over the original collection, moving the window step elements at a time.
inherited
sortBy(Order order, Function1<A, B> f) → IList<A>: Returns a new collection that is sorted according to order after applying f to each element in this collection.
inherited
sorted(Order<A> order) → IList<A>: Returns a new collection that is sorted according to order.
inherited
sortWith(Function2<A, A, bool> lt) → IList<A>: Returns a new collection sorted using the provided function lt which is used to determine if one element is less than the other.
inherited
span(Function1<A, bool> p) → (IList<A>, IList<A>): Returns two collections: elements before and starting from the first element that does not satisfy p.
inherited
splitAt(int n) → (IList<A>, IList<A>): Returns two collections: the first n elements and the remainder.
inherited
startsWith(RIterableOnce<A> that, [int offset = 0]) → bool: Returns true if the beginning of this collection corresponds with that.
inherited
sum() → int: Available on RIterableOnce<int>, provided by the RIterableIntOps extension
Returns the sum of all elements in this list
sum() → double: Available on RIterableOnce<double>, provided by the RIterableDoubleOps extension
Returns the sum of all elements in this list
take(int n) → IList<A>: Returns a new collection containing only the first n elements.
inherited
takeRight(int n) → IList<A>: Returns a new collection with the last n elements of this collection. If n is greater than the size of this collection, the original collection is returned.
inherited
takeWhile(Function1<A, bool> p) → IList<A>: Returns a new collection of leading elements that satisfy p.
inherited
takeWhileN(Function2<T1, T2, bool> p) → IList<(T1, T2)>: Available on IList<(T1, T2)>, provided by the IListTuple2Ops extension
takeWhileN(Function4<T1, T2, T3, T4, bool> p) → IList<(T1, T2, T3, T4)>: Available on IList<(T1, T2, T3, T4)>, provided by the IListTuple4Ops extension
takeWhileN(Function5<T1, T2, T3, T4, T5, bool> p) → IList<(T1, T2, T3, T4, T5)>: Available on IList<(T1, T2, T3, T4, T5)>, provided by the IListTuple5Ops extension
takeWhileN(Function3<T1, T2, T3, bool> p) → IList<(T1, T2, T3)>: Available on IList<(T1, T2, T3)>, provided by the IListTuple3Ops extension
tapEach(Function1<A, U> f) → IList<A>: Applies f to each element in this collection, discarding any results and returns this collection.
inherited
toIList() → IList<A>: Returns an IList with the same elements as this collection.
inherited
toIMap() → IMap<A, B>: Available on RIterable<(A, B)>, provided by the RIterableTuple2Ops extension
Creates a new IMap where each tuple element of this list is used to create a key and value respectively.
toIndexedSeq() → IndexedSeq<A>: Returns an IndexedSeq with the same elements as this collection.
inherited
toISet() → ISet<A>: Returns an ISet with the same elements as this collection, duplicates removed.
inherited
toIVector() → IVector<A>: Returns an IVector with the same elements as this collection.
inherited
toList({bool growable = true}) → List<A>: Returns a new List with the same elements as this collection.
inherited
toNel() → Option<NonEmptyIList<A>>: Converts this list to a NonEmptyIList, returning None if it is empty.
inherited
toSeq() → RSeq<A>: Returns a RSeq with the same elements as this collection.
inherited
toString() → String: A string representation of this object.
inherited
traverseEither<B, C>(Function1<A, Either<B, C>> f) → Either<B, IList<C>>: Applies f to each element of this RSeq and collects the results into a new collection. If Left is encountered for any element, that result is returned and any additional elements will not be evaluated.
inherited
traverseOption(Function1<A, Option> f) → Option<IList>: Applies f to each element of this RSeq and collects the results into a new collection. If None is encountered for any element, that result is returned and any additional elements will not be evaluated.
inherited
uncons(Function1<Option<(A, IList<A>)>, B> f) → B: Deconstructs the list by passing Some((head, tail)) to f when non-empty, or None when empty.
inherited
unNone() → IList<A>: Available on IList<Option<A>>, provided by the IListOptionOps extension
Returns a new list with all None elements removed.
unzip() → (IList<A>, IList, IList<C>): Available on IList<(A, B, C)>, provided by the IListTuple3UnzipOps extension
Returns 3 new lists as a tuple. The first list is all the first items from each tuple element of this list. The second list is all the second items from each tuple element of this list. The third list is all the third items from each tuple element of this list.
unzip() → (IList<A>, IList): Available on IList<Either<A, B>>, provided by the IListEitherOps extension
Returns 2 new lists as a tuple. The first list is all the Left items from each element of this list. The second list is all the Right items from each element of this list.
unzip() → (RIterable<A>, RIterable): Available on RIterable<(A, B)>, provided by the RibsIterableTuple2Ops extension
Splits a collection of pairs into two separate collections.
unzip() → (IList<A>, IList): Available on IList<(A, B)>, provided by the IListTuple2UnzipOps extension
Returns 2 new lists as a tuple. The first list is all the first items from each tuple element of this list. The second list is all the second items from each tuple element of this list.
updated(int index, A elem) → IList<A>: Returns a new collection with the element at index replaced by elem.
inherited
zip(RIterableOnce that) → IList<(A, B)>: Returns a new collection that combines corresponding elements from this collection and that as a tuple. The length of the returned collection will be the minimum of this collections size and the size of that.
inherited
zipAll(RIterableOnce that, A thisElem, B thatElem) → IList<(A, B)>: Returns a new collection that combines corresponding elements from this collection and that as a tuple. The length of the returned collection will be the maximum of this collections size and thes size of that. If this collection is shorter than that, thisElem will be used to fill in the resulting collection. If that is shorter, thatElem will be used to will in the resulting collection.
inherited
zipWithIndex() → IList<(A, int)>: Return a new collection with each element of this collection paired with it's respective index.
inherited

Operators

operator ==(Object other) → bool: The equality operator.
inherited
operator [](int idx) → A: Returns the element at index idx.
inherited

Cons<A> class final

Constructors

Properties

Methods

Operators

ribs_core library