org.jjoost.collections.base
Interface OrderedStore<N,S extends OrderedStore<N,S>>
public interface OrderedStore<N,S extends OrderedStore<N,S>>
|
Method Summary |
<C,V> java.util.Iterator<V> |
|
all(boolean asc,
C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
<C,V> java.util.Iterator<V> |
|
all(boolean asc,
FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
boundaries(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
|
|
boundaries(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
ceil(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
|
|
ceil(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
int |
clear()
|
<V> java.util.Iterator<V> |
|
clearAndReturn(Function<? super N,? extends V> f)
|
|
contains(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
|
contains(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
|
copy(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
int |
count()
|
|
count(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
|
count(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
|
ensureAndGet(C put,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
Function<? super C,N> factory,
Function<? super N,? extends V> ret)
|
|
first(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
first(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
floor(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
|
|
floor(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
greater(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
|
|
greater(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
boolean |
isEmpty()
|
<V> java.util.Iterator<V> |
|
iterator(boolean asc,
Function<? super N,V> ret)
|
|
last(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
last(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
lesser(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
|
|
lesser(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
put(C find,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
Function<? super C,N> factory,
Function<? super N,? extends V> ret)
|
|
put(N put,
Function<? super N,? extends V> ret)
|
|
putIfAbsent(C put,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
Function<? super C,N> factory,
Function<? super N,? extends V> ret)
|
|
putIfAbsent(N put,
Function<? super N,? extends V> ret)
|
|
remove(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
|
remove(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
<C,V> java.lang.Iterable<V> |
|
removeAndReturn(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
removeAndReturn(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
|
|
removeAndReturnFirst(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
|
removeAndReturnFirst(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
|
boolean |
removeExistingNode(N n)
|
count
int count()
isEmpty
boolean isEmpty()
clear
int clear()
clearAndReturn
<V> java.util.Iterator<V> clearAndReturn(Function<? super N,? extends V> f)
iterator
<V> java.util.Iterator<V> iterator(boolean asc,
Function<? super N,V> ret)
copy
<C> S copy(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
removeExistingNode
boolean removeExistingNode(N n)
put
<V> V put(N put,
Function<? super N,? extends V> ret)
put
<C,V> V put(C find,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
Function<? super C,N> factory,
Function<? super N,? extends V> ret)
putIfAbsent
<V> V putIfAbsent(N put,
Function<? super N,? extends V> ret)
putIfAbsent
<C,V> V putIfAbsent(C put,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
Function<? super C,N> factory,
Function<? super N,? extends V> ret)
ensureAndGet
<C,V> V ensureAndGet(C put,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
Function<? super C,N> factory,
Function<? super N,? extends V> ret)
contains
<C> boolean contains(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
count
<C> int count(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
first
<C,V> V first(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
last
<C,V> V last(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
all
<C,V> java.util.Iterator<V> all(boolean asc,
C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
boundaries
<C,F,V> Pair<V,V> boundaries(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
ceil
<C,V> V ceil(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
floor
<C,V> V floor(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
lesser
<C,V> V lesser(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
greater
<C,V> V greater(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
remove
<C> int remove(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
removeAndReturn
<C,V> java.lang.Iterable<V> removeAndReturn(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
removeAndReturnFirst
<C,V> V removeAndReturnFirst(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
boundaries
<C,F,V> Pair<V,V> boundaries(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
ceil
<C,F,V> V ceil(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
floor
<C,F,V> V floor(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
lesser
<C,F,V> V lesser(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
greater
<C,F,V> V greater(C c,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends F> filterF,
java.util.Comparator<? super F> filterCmp,
boolean filterCmpIsTotalOrder,
FilterPartialOrder<F> filter,
Function<? super N,? extends V> ret)
contains
<C> boolean contains(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
count
<C> int count(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
first
<C,V> V first(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
last
<C,V> V last(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
all
<C,V> java.util.Iterator<V> all(boolean asc,
FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)
remove
<C> int remove(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
removeAndReturn
<C> S removeAndReturn(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder)
removeAndReturnFirst
<C,V> V removeAndReturnFirst(FilterPartialOrder<C> filter,
Function<? super N,? extends C> cmpF,
java.util.Comparator<? super C> cmp,
boolean cmpIsTotalOrder,
Function<? super N,? extends V> ret)