public abstract class NonNullSingleBufferColumn<E,C extends NonNullSingleBufferColumn<E,C>> extends AbstractCollection<E>
| Modifier and Type | Field and Description |
|---|---|
protected int |
offset |
protected int |
size |
protected boolean |
sortedSet |
| Modifier | Constructor and Description |
|---|---|
protected |
NonNullSingleBufferColumn(ByteBuffer buffer,
int offset,
int size,
boolean sortedSet) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E e) |
void |
add(int index,
E element) |
boolean |
addAll(Collection<? extends E> c) |
boolean |
addAll(int index,
Collection<? extends E> c) |
Column<E> |
append(Column<E> tail)
Appends two columns with the same element type.
|
protected Column<E> |
append0(Column<E> tail) |
protected C |
appendNonNull(C tail) |
protected abstract Column<E> |
applyFilter0(tech.bitey.bufferstuff.BufferBitSet keep,
int cardinality) |
E |
ceiling(E value) |
protected int |
ceilingIndex(E value) |
protected void |
checkSortedSet() |
protected abstract boolean |
checkType(Object o) |
void |
clear() |
protected abstract int |
compareValuesAt(C rhs,
int l,
int r) |
boolean |
contains(Object o) |
Iterator<E> |
descendingIterator() |
NavigableSet<E> |
descendingSet() |
protected abstract C |
empty() |
boolean |
equals(Object o) |
protected boolean |
equals0(C rhs) |
protected abstract boolean |
equals0(C rhs,
int lStart,
int rStart,
int length) |
E |
first() |
E |
floor(E value) |
protected int |
floorIndex(E value) |
E |
get(int index) |
protected abstract E |
getNoOffset(int index) |
int |
hashCode() |
protected abstract int |
hashCode(int fromIndex,
int toIndex) |
C |
head(E toElement)
Same behavior as
Column.head(Object, boolean), with inclusive set
to false. |
C |
head(E toElement,
boolean inclusive)
Returns a view of the portion of this column whose elements are less than (or
equal to, if
inclusive is true) toElement. |
SortedSet<E> |
headSet(E toElement) |
NavigableSet<E> |
headSet(E toElement,
boolean inclusive) |
E |
higher(E value) |
protected int |
higherIndex(E value) |
int |
indexOf(Object o) |
protected int |
indexOf(Object o,
boolean first) |
protected int |
intersectBothSorted(C rhs,
tech.bitey.bufferstuff.BufferBitSet keepLeft,
tech.bitey.bufferstuff.BufferBitSet keepRight) |
protected int[] |
intersectLeftSorted(C rhs,
tech.bitey.bufferstuff.BufferBitSet keepRight) |
protected abstract void |
intersectLeftSorted(C rhs,
org.eclipse.collections.api.list.primitive.MutableIntList indices,
tech.bitey.bufferstuff.BufferBitSet keepRight) |
boolean |
isNull(int index)
Test if a value is null at a given index.
|
boolean |
isNullable()
Indicates the nullability of this column.
|
boolean |
isNullNoOffset(int index) |
boolean |
isSortedSet()
The array organization of this column: either a free-form heap, or a unique
index.
|
Iterator<E> |
iterator() |
E |
last() |
protected int |
lastIndex() |
int |
lastIndexOf(Object o) |
ListIterator<E> |
listIterator() |
ListIterator<E> |
listIterator(int idx) |
E |
lower(E value) |
protected int |
lowerIndex(E value) |
E |
pollFirst() |
E |
pollLast() |
E |
remove(int index) |
boolean |
remove(Object o) |
boolean |
removeAll(Collection<?> c) |
boolean |
retainAll(Collection<?> c) |
protected abstract int |
search(E value,
boolean first) |
protected Column<E> |
select(int[] indices) |
protected abstract Column<E> |
select0(int[] indices) |
E |
set(int index,
E element) |
int |
size() |
Spliterator<E> |
spliterator()
Creates a
Spliterator over the elements in this list. |
C |
subColumn(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive)
Returns a view of the portion of this column whose elements range from
fromElement to toElement. |
C |
subColumn(E fromElement,
E toElement)
Same behavior as
Column#subColumn(Object, boolean, Object, Boolean),
with fromInclusive set to true and toInclusive set to false. |
C |
subColumn(int fromIndex,
int toIndex)
Returns a view of the portion of this column between the specified
fromIndex, inclusive, and toIndex, exclusive.
|
protected C |
subColumn0(int fromIndex,
int toIndex) |
List<E> |
subList(int fromIndex,
int toIndex) |
NavigableSet<E> |
subSet(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive) |
SortedSet<E> |
subSet(E fromElement,
E toElement) |
C |
tail(E fromElement)
Same behavior as
Column.tail(Object, boolean), with inclusive set
to true. |
C |
tail(E fromElement,
boolean inclusive)
Returns a view of the portion of this column whose elements are greater than
(or equal to, if
inclusive is true) fromElement. |
SortedSet<E> |
tailSet(E fromElement) |
NavigableSet<E> |
tailSet(E fromElement,
boolean inclusive) |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
C |
toHeap()
Converts a unique index into a heap.
|
protected C |
toHeap0() |
containsAll, isEmpty, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitcontainsAll, isEmpty, replaceAll, sortcomparatorparallelStream, removeIf, streamprotected final boolean sortedSet
protected final int offset
protected final int size
protected NonNullSingleBufferColumn(ByteBuffer buffer, int offset, int size, boolean sortedSet)
protected C toHeap0()
protected C subColumn0(int fromIndex, int toIndex)
public boolean isNullable()
ColumnisNullable in interface Column<E>public boolean isSortedSet()
ColumnisSortedSet in interface Column<E>public boolean isNullNoOffset(int index)
protected abstract int search(E value,
boolean first)
public C toHeap()
ColumntoHeap in interface Column<E>Column.isSortedSet() as
falseprotected abstract int hashCode(int fromIndex,
int toIndex)
protected abstract boolean equals0(C rhs,
int lStart,
int rStart,
int length)
protected boolean equals0(C rhs)
protected abstract int compareValuesAt(C rhs,
int l,
int r)
protected int intersectBothSorted(C rhs,
tech.bitey.bufferstuff.BufferBitSet keepLeft,
tech.bitey.bufferstuff.BufferBitSet keepRight)
protected abstract void intersectLeftSorted(C rhs,
org.eclipse.collections.api.list.primitive.MutableIntList indices,
tech.bitey.bufferstuff.BufferBitSet keepRight)
protected int[] intersectLeftSorted(C rhs,
tech.bitey.bufferstuff.BufferBitSet keepRight)
public int hashCode()
public Spliterator<E> spliterator()
ColumnSpliterator over the elements in this list.
spliterator in interface Iterable<E>spliterator in interface Collection<E>spliterator in interface List<E>spliterator in interface Set<E>spliterator in interface SortedSet<E>spliterator in interface Column<E>Spliterator over the elements in this columnpublic int lastIndexOf(Object o)
lastIndexOf in interface List<E>public boolean contains(Object o)
contains in interface Collection<E>contains in interface List<E>contains in interface Set<E>contains in class AbstractCollection<E>public ListIterator<E> listIterator(int idx)
listIterator in interface List<E>protected void checkSortedSet()
public E lower(E value)
lower in interface NavigableSet<E>public E higher(E value)
higher in interface NavigableSet<E>public E floor(E value)
floor in interface NavigableSet<E>public E ceiling(E value)
ceiling in interface NavigableSet<E>protected int lowerIndex(E value)
protected int higherIndex(E value)
protected int floorIndex(E value)
protected int ceilingIndex(E value)
public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
subSet in interface NavigableSet<E>public NavigableSet<E> tailSet(E fromElement, boolean inclusive)
tailSet in interface NavigableSet<E>public NavigableSet<E> headSet(E toElement, boolean inclusive)
headSet in interface NavigableSet<E>public C subColumn(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive)
ColumnfromElement to toElement. If fromElement and
toElement are equal, the returned column is empty unless fromInclusive and toInclusive are both true. The returned column is
backed by this column.
This method is only available when Column.isSortedSet() returns
true.
subColumn in interface Column<E>fromElement - low endpoint of the returned columnfromInclusive - true if the low endpoint is to be included in the
returned viewtoElement - high endpoint of the returned columntoInclusive - true if the high endpoint is to be included in the
returned viewfromElement to toElementpublic C subColumn(E fromElement,
E toElement)
ColumnColumn#subColumn(Object, boolean, Object, Boolean),
with fromInclusive set to true and toInclusive set to false.
This method is only available when Column.isSortedSet() returns
true.
public C head(E toElement,
boolean inclusive)
Columninclusive is true) toElement. The returned
column is backed by this column.
This method is only available when Column.isSortedSet() returns
true.
head in interface Column<E>toElement - high endpoint of the returned columninclusive - true if the high endpoint is to be included in the
returned viewinclusive is true) toElementpublic C head(E toElement)
ColumnColumn.head(Object, boolean), with inclusive set
to false.
This method is only available when Column.isSortedSet() returns
true.
public C tail(E fromElement,
boolean inclusive)
Columninclusive is true) fromElement. The returned
column is backed by this column.
This method is only available when Column.isSortedSet() returns
true.
public C tail(E fromElement)
ColumnColumn.tail(Object, boolean), with inclusive set
to true.
This method is only available when Column.isSortedSet() returns
true.
public SortedSet<E> subSet(E fromElement, E toElement)
subSet in interface NavigableSet<E>subSet in interface SortedSet<E>public SortedSet<E> headSet(E toElement)
headSet in interface NavigableSet<E>headSet in interface SortedSet<E>public SortedSet<E> tailSet(E fromElement)
tailSet in interface NavigableSet<E>tailSet in interface SortedSet<E>public C subColumn(int fromIndex,
int toIndex)
Columnprotected abstract C empty()
protected abstract E getNoOffset(int index)
protected abstract boolean checkType(Object o)
public List<E> subList(int fromIndex, int toIndex)
protected abstract Column<E> applyFilter0(tech.bitey.bufferstuff.BufferBitSet keep, int cardinality)
protected abstract Column<E> select0(int[] indices)
protected Column<E> select(int[] indices)
public Column<E> append(Column<E> tail)
ColumnBoth columns must either be unique indices or not. If they're both unique indices then the first value of the provided column must be greater than the last value of this column.
public int size()
size in interface Collection<E>size in interface List<E>size in interface Set<E>size in class AbstractCollection<E>public boolean isNull(int index)
Columnprotected int lastIndex()
protected int indexOf(Object o, boolean first)
public ListIterator<E> listIterator()
listIterator in interface List<E>public Iterator<E> iterator()
iterator in interface Iterable<E>iterator in interface Collection<E>iterator in interface List<E>iterator in interface NavigableSet<E>iterator in interface Set<E>iterator in class AbstractCollection<E>public boolean equals(Object o)
public Object[] toArray()
toArray in interface Collection<E>toArray in interface List<E>toArray in interface Set<E>toArray in class AbstractCollection<E>public <T> T[] toArray(T[] a)
toArray in interface Collection<E>toArray in interface List<E>toArray in interface Set<E>toArray in class AbstractCollection<E>public Iterator<E> descendingIterator()
descendingIterator in interface NavigableSet<E>public NavigableSet<E> descendingSet()
descendingSet in interface NavigableSet<E>public E pollFirst()
pollFirst in interface NavigableSet<E>public E pollLast()
pollLast in interface NavigableSet<E>public boolean add(E e)
add in interface Collection<E>add in interface List<E>add in interface Set<E>add in class AbstractCollection<E>public boolean remove(Object o)
remove in interface Collection<E>remove in interface List<E>remove in interface Set<E>remove in class AbstractCollection<E>public boolean addAll(Collection<? extends E> c)
addAll in interface Collection<E>addAll in interface List<E>addAll in interface Set<E>addAll in class AbstractCollection<E>public boolean removeAll(Collection<?> c)
removeAll in interface Collection<E>removeAll in interface List<E>removeAll in interface Set<E>removeAll in class AbstractCollection<E>public boolean retainAll(Collection<?> c)
retainAll in interface Collection<E>retainAll in interface List<E>retainAll in interface Set<E>retainAll in class AbstractCollection<E>public void clear()
clear in interface Collection<E>clear in interface List<E>clear in interface Set<E>clear in class AbstractCollection<E>public boolean addAll(int index,
Collection<? extends E> c)
Copyright © 2019. All rights reserved.