returns the map of compound predicates , or null if empty . note : it is not generally considered good api design to return null to represent empty collections , but this collection is very often empty and the the implementation of collections.emptymap . keyset . iterator is slow , so we optimize for the common case . concode_field_sep boolean extendedContext concode_elem_sep int[] columnBitPositions concode_elem_sep boolean unsatisfiable concode_elem_sep BitKey constrainedColumnsBitKey concode_elem_sep RolapStar star concode_elem_sep SortedMap<BitKey,StarPredicate> compoundPredicateMap concode_elem_sep StarColumnPredicate[] sparseColumnPredicateList concode_elem_sep boolean isDirty concode_elem_sep RolapStar.Measure measure concode_elem_sep Object[] singleValues concode_elem_sep RolapStar.Column[] columnsCache concode_elem_sep boolean drillThrough concode_elem_sep int numColumns concode_field_sep void addAggregateList concode_elem_sep RolapStar.Measure getMeasure concode_elem_sep int getNumValues concode_elem_sep Object[] getSingleValues concode_elem_sep RolapStar.Column[] getConstrainedColumns concode_elem_sep StarColumnPredicate getValueAt concode_elem_sep void addConstrainedColumn concode_elem_sep BitKey getConstrainedColumnsBitKey concode_elem_sep void check concode_elem_sep Map<String,Comparable> getMappedCellValues concode_elem_sep boolean isUnsatisfiable
SortedMap < BitKey , StarPredicate > function ( ) { return compoundPredicateMap ; }