Methods
-
all(bool f(A a))
→ bool
-
override
-
andThen<B>(covariant IList<B> next)
→ IList<B>
-
override
-
any(bool f(A a))
→ bool
-
override
-
ap<B>(covariant IList<Function1<A, B>> ff)
→ IList<B>
-
override
-
appendElement(A a)
→ IList<A>
-
override
-
asCons()
→ Option<Cons<A>>
-
-
bind<B>(covariant Function1<A, IList<B>> f)
→ IList<B>
-
override
-
concatenate(Monoid<A> mi)
→ A
-
override
-
concatenateO(Semigroup<A> si)
→ Option<A>
-
override
-
every(bool f(A a))
→ bool
-
override
-
filter(bool predicate(A a))
→ IList<A>
-
override
-
find(bool predicate(A a))
→ Option<A>
-
-
flatMap<B>(covariant Function1<A, IList<B>> f)
→ IList<B>
-
override
-
foldLeft<B>(B z, B f(B previous, A a))
→ B
-
override
-
foldLeftWithIndex<B>(B z, B f(B previous, int i, A a))
→ B
-
override
-
foldMap<B>(Monoid<B> bMonoid, B f(A a))
→ B
-
override
-
foldMapO<B>(Semigroup<B> si, B f(A a))
→ Option<B>
-
override
-
foldRight<B>(B z, B f(A a, B previous))
→ B
-
override
-
foldRightWithIndex<B>(B z, B f(int i, A a, B previous))
→ B
-
override
-
forEach(void sideEffect(A a))
→ void
-
-
intercalate(Monoid<A> mi, A a)
→ A
-
override
-
iterator()
→ Iterator<A>
-
-
length()
→ int
-
override
-
map<B>(B f(A a))
→ IList<B>
-
override
-
mapWithIndex<B>(B f(int i, A a))
→ IList<B>
-
override
-
maximum(Order<A> oa)
→ Option<A>
-
override
-
minimum(Order<A> oa)
→ Option<A>
-
override
-
noSuchMethod(Invocation invocation)
→ dynamic
-
Invoked when a nonexistent method or property is accessed.
inherited
-
partition(bool f(A a))
→ Tuple2<IList<A>, IList<A>>
-
-
plus(covariant IList<A> l2)
→ IList<A>
-
override
-
prependElement(A a)
→ IList<A>
-
override
-
replace<B>(B replacement)
→ IList<B>
-
override
-
reverse()
→ IList<A>
-
-
sort(Order<A> oa)
→ IList<A>
-
-
strengthL<B>(B b)
→ IList<Tuple2<B, A>>
-
override
-
strengthR<B>(B b)
→ IList<Tuple2<A, B>>
-
override
-
toIterable()
→ Iterable<A>
-
-
toList()
→ List<A>
-
-
toString()
→ String
-
A string representation of this object.
override
-
traverseEither<B, L>(Either<L, B> f(A a))
→ Either<L, IList<B>>
-
-
traverseEvaluation<B, E, R, W, S>(Monoid<W> WMi, Evaluation<E, R, W, S, B> f(A a))
→ Evaluation<E, R, W, S, IList<B>>
-
-
traverseFree<F, B>(Free<F, B> f(A a))
→ Free<F, IList<B>>
-
-
traverseFuture<B>(Future<B> f(A a))
→ Future<IList<B>>
-
-
traverseOption<B>(Option<B> f(A a))
→ Option<IList<B>>
-
-
traverseOptionM<B>(Option<IList<B>> f(A a))
→ Option<IList<B>>
-
-
traverseState<B, S>(State<S, B> f(A a))
→ State<S, IList<B>>
-
-
traverseTask<B>(Task<B> f(A a))
→ Task<IList<B>>
-
-
uncons<B>(B z(), B f(A head, IList<A> tail))
→ B
-
-
unconsO<B>(B f(A head, IList<A> tail))
→ Option<B>
-
-
where(bool predicate(A a))
→ IList<A>
-
override
-
zip<B>(IList<B> bs)
→ IList<Tuple2<A, B>>
-
-
zipWithIndex()
→ IList<Tuple2<int, A>>
-
override
