public interface TupleList extends List<List<Member>>, TupleIterable
TupleCalc.evaluateTuple(mondrian.olap.Evaluator)
 and Evaluator.NamedSetEvaluator.currentTuple()
 to List<Member>get(int, int)TupleList.addAll(TupleIterator)?| Modifier and Type | Interface and Description | 
|---|---|
static interface  | 
TupleList.PositionCallback  | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
addCurrent(TupleCursor tupleIter)  | 
void | 
addTuple(Member... members)  | 
TupleList | 
cloneList(int capacity)
Creates a copy of this list that has the same type and has a given
 capacity. 
 | 
TupleList | 
fix()
Fixes the tuples of this list, so that their contents will not change
 even if elements of the list are reordered or removed. 
 | 
Member | 
get(int slice,
   int index)
Returns a particular column of a particular row. 
 | 
TupleList | 
project(int[] destIndices)  | 
List<Member> | 
slice(int column)
Returns a list of the members at a given column. 
 | 
TupleList | 
subList(int fromIndex,
       int toIndex)  | 
TupleList | 
withPositionCallback(TupleList.PositionCallback positionCallback)  | 
add, add, addAll, addAll, clear, contains, containsAll, equals, get, hashCode, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, replaceAll, retainAll, set, size, sort, spliterator, toArray, toArrayparallelStream, removeIf, streamgetArity, tupleCursor, tupleIteratorMember get(int slice, int index)
Note that list.get(row, column)
 is equivalent to list.slice(column).get(row)
 and list.get(row).get(column)
 but is more efficient for most implementations of TupleList.
slice - Column ordinalindex - Row ordinalList<Member> slice(int column)
The list is modifiable if and only if this TupleList is modifiable. Adding an element to a slice will create a tuple whose members in other columns are null. Removing an element from a slicer will remove a tuple.
slice in interface TupleIterablecolumn - Ordinal of the member in each tuple to projectIllegalArgumentException - if column is not less than arityTupleList cloneList(int capacity)
If capacity is negative, populates the list. A deep copy is made, so that it the contents of the list are not affected to changes to any backing collections.
capacity - Capacityvoid addTuple(Member... members)
TupleList project(int[] destIndices)
void addCurrent(TupleCursor tupleIter)
TupleList subList(int fromIndex, int toIndex)
TupleList withPositionCallback(TupleList.PositionCallback positionCallback)
TupleList fix()
Copyright © 2019 Hitachi Vantara. All rights reserved.