| Package | Description |
|---|---|
| org.pentaho.aggdes.algorithm.impl |
Provides a default implementation of the Aggregate Design algorithm,
which is specified in the
org.pentaho.aggdes.algorithm package. |
| org.pentaho.aggdes.util |
| Modifier and Type | Method and Description |
|---|---|
protected BitSetPlus |
LatticeImpl.toBits(long i) |
| Modifier and Type | Method and Description |
|---|---|
protected AggregateImpl |
LatticeImpl.getAggregate(BitSetPlus bits) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
AggregateImpl.hasCompleteAncestors(List<BitSetPlus> ancestorClosure)
Returns whether this Aggregate is closed with respect to ancestors.
|
| Constructor and Description |
|---|
AggregateImpl(Schema schema,
BitSetPlus bits) |
| Modifier and Type | Method and Description |
|---|---|
static BigInteger |
BitSetPlus.countSupersetIntersection_old(int bitCount,
BitSetPlus[] bitSets)
Returns the number of sets which are supersets of at least one of the
members of
bitSets. |
static BigInteger |
BitSetPlus.countSupersetIntersection(int bitCount,
BitSetPlus[] bitSets)
Returns the number of sets which are supersets of every member of
bitSets. |
| Modifier and Type | Method and Description |
|---|---|
BigInteger |
BitSetPlus.countSupersetDiff(List<BitSetPlus> minusBitSets)
Returns the number of bitsets which are supersets of this BitSetPlus
but which are not supersets of any of the sets in
minusBitSets. |
Copyright © 2006–2016 Julian Hyde. All rights reserved.