org.key_project.util.collection

Class ImmutableSLList.Cons<S>

java.lang.Object

org.key_project.util.collection.ImmutableSLList<S>

org.key_project.util.collection.ImmutableSLList.Cons<S>

All Implemented Interfaces:

java.io.Serializable, java.lang.Iterable<S>, ImmutableList<S>

Enclosing class:

ImmutableSLList<T>

private static class ImmutableSLList.Cons<S>
extends ImmutableSLList<S>

Field Summary

Fields

Modifier and Type	Field and Description
private ImmutableSLList<S>	cons reference to the next element (equiv.to the tail of list)
private S	element the first element
private static long	serialVersionUID
private int	size size of the list

Constructor Summary

Constructors

Constructor and Description
Cons(S element) new list with only one element
Cons(S element, ImmutableSLList<S> cons) constructs a new list with element as head and cons as tail

Method Summary

Modifier and Type	Method and Description
ImmutableList<S>	append(ImmutableList<S> list) appends element at end (non-destructive) (O(n))
ImmutableList<S>	append(S... array) appends element at end (non-destructive) (O(n))
ImmutableList<S>	append(S e) appends element at end (non-destructive) (O(n))
boolean	contains(S obj)
boolean	equals(java.lang.Object o)
boolean	exists(java.util.function.Predicate<S> predicate) return true if predicate is fullfilled for at least one element
int	hashCode() hashcode for collections, implemented similar (just reverse) algorithm as java.util.Collections use
S	head()
boolean	isEmpty()
java.util.Iterator<S>	iterator()
ImmutableList<S>	prepend(ImmutableList<S> list) prepends list (O(n)+O(m))
ImmutableList<S>	prepend(S e) creates a new list with element as head and the momentan list as tail (O(1))
ImmutableList<S>	prependReverse(ImmutableList<S> list) prepends list (O(n)+O(m)) in reversed order
ImmutableList<S>	removeAll(S obj) removes all occurrences of obj (O(n))
ImmutableList<S>	removeFirst(S obj) removes first occurrences of obj (O(n))
int	size()
ImmutableList<S>	tail()
java.lang.String	toString()

Methods inherited from class org.key_project.util.collection.ImmutableSLList

append, nil, prepend, prepend, prependReverse, reverse, take, toArray, toArray

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.key_project.util.collection.ImmutableList

stream

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

serialVersionUID

private static final long serialVersionUID

See Also:

Constant Field Values

element

private final S element

the first element

cons

private final ImmutableSLList<S> cons

reference to the next element (equiv.to the tail of list)

size

private final int size

size of the list

Constructor Detail

Cons

Cons(S element)

new list with only one element

Parameters:

element - the only element in list

Cons

Cons(S element,
     ImmutableSLList<S> cons)

constructs a new list with element as head and cons as tail

Parameters:

element - a stored in the head element of the list

cons - tail of the list

Method Detail

prepend

public ImmutableList<S> prepend(S e)

creates a new list with element as head and the momentan list as tail (O(1))

Parameters:

e - the to be prepended

Returns:

IList the new list

prepend

public ImmutableList<S> prepend(ImmutableList<S> list)

prepends list (O(n)+O(m))

Parameters:

list - the IList to be prepended

Returns:

IList the new list

prependReverse

public ImmutableList<S> prependReverse(ImmutableList<S> list)

prepends list (O(n)+O(m)) in reversed order

Parameters:

list - the IList to be prepended

Returns:

IList the new list

exists

public boolean exists(java.util.function.Predicate<S> predicate)

return true if predicate is fullfilled for at least one element

Parameters:

predicate - the predicate

Returns:

true if predicate is fullfilled for at least one element

append

public ImmutableList<S> append(S e)

appends element at end (non-destructive) (O(n))

Parameters:

e - the to be prepended

Returns:

IList the new list

append

public ImmutableList<S> append(ImmutableList<S> list)

appends element at end (non-destructive) (O(n))

Parameters:

list - the IList to be appended

Returns:

IList the new list

append

public ImmutableList<S> append(S... array)

appends element at end (non-destructive) (O(n))

Parameters:

array - the array to be appended

Returns:

IList the new list

head

public S head()

Returns:

first element in list

tail

public ImmutableList<S> tail()

Returns:

IList tail of the list

hashCode

public int hashCode()

hashcode for collections, implemented similar (just reverse) algorithm as java.util.Collections use

Overrides:

hashCode in class java.lang.Object

Returns:

the hashcode of the list

iterator

public java.util.Iterator<S> iterator()

Returns:

iterator through list

size

public int size()

Returns:

int the number of elements in list

contains

public boolean contains(S obj)

Returns:

boolean true iff. obj in list

isEmpty

public boolean isEmpty()

Returns:

true iff the list is empty

removeFirst

public ImmutableList<S> removeFirst(S obj)

removes first occurrences of obj (O(n))

Returns:

new list

removeAll

public ImmutableList<S> removeAll(S obj)

removes all occurrences of obj (O(n))

Returns:

new list

equals

public boolean equals(java.lang.Object o)

Overrides:

equals in class java.lang.Object

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object