```
public abstract class RankedSlice
extends Object
```
type/wrapper of ranked slices, which are just tuples of disjoint sets, with entries that are additionally to the index order also ranked by some extra total order (i.e. numbers). Properties: - all n bitsets should be pw. disjoint and non-empty (if not a pre-slice). - all rank values should be distinct numbers. - the rank values should be 0 <= p < n (unless it is just a component of a set of such slices). This class provides only functions that return a new slice, i.e. do not modify the original one.

All Methods Static Methods Instance Methods Abstract Methods Concrete Methods
Modifier and Type	Method	Description
`static RankedSlice`	`copy(List<Pair<BitSet,Integer>> slice)`	Performs an actual copy (i.e.
`static RankedSlice`	`empty()`
`RankedSlice`	`leftNormalized()`	Returns copy with only leftmost occurrence of each state.
`RankedSlice`	`map(Function<Pair<BitSet,Integer>,Pair<BitSet,Integer>> fun)`	This is to avoid general stream API, but still have convenience.
`static RankedSlice`	`of(List<Pair<BitSet,Integer>> slice)`	Wraps a slice (no deep copy).
`RankedSlice`	`prunedWithSim(owl.translations.nbadet.SubsumedStatesMap incl)`
`static RankedSlice`	`singleton(Pair<BitSet,Integer> entry)`	Wraps a single ranked set into a slice.
`abstract List<Pair<BitSet,Integer>>`	`slice()`
`String`	`toString()`
`String`	`toString(IntFunction<?> stateMap)`
`RankedSlice`	`withoutEmptySets()`	Returns copy without empty sets.

public abstract List<Pair<BitSet,Integer>> slice()

public static RankedSlice of(List<Pair<BitSet,Integer>> slice)

Wraps a slice (no deep copy).

public static RankedSlice copy(List<Pair<BitSet,Integer>> slice)

Performs an actual copy (i.e. with copied BitSets) of the slice.

public static RankedSlice singleton(Pair<BitSet,Integer> entry)

Wraps a single ranked set into a slice.

public RankedSlice map(Function<Pair<BitSet,Integer>,Pair<BitSet,Integer>> fun)

This is to avoid general stream API, but still have convenience.

leftNormalized
```
public RankedSlice leftNormalized()
```
Returns copy with only leftmost occurrence of each state.

withoutEmptySets
```
public RankedSlice withoutEmptySets()
```
Returns copy without empty sets.

public RankedSlice prunedWithSim(owl.translations.nbadet.SubsumedStatesMap incl)

public final String toString(IntFunction<?> stateMap)

Class RankedSlice