Package | Description |
---|---|
de.jstacs.sequenceScores.statisticalModels.trainable.variableStructure.parsimonious.dataStructures |
Modifier and Type | Method and Description |
---|---|
protected SymbolSet |
SymbolSet.union(SymbolSet... t) |
Modifier and Type | Method and Description |
---|---|
java.util.TreeSet<SymbolSet> |
SymbolSet.createSymbolMinimalSubSets() |
protected static java.util.TreeSet<SymbolSet> |
SymbolSet.createSymbolSets(de.jstacs.data.alphabets.DiscreteAlphabet alph) |
java.util.TreeSet<SymbolSet> |
SymbolSet.createSymbolSubSets() |
protected java.util.TreeSet<SymbolSet> |
PartitionSet.getSymbolSet() |
Modifier and Type | Method and Description |
---|---|
protected void |
Partition.add(SymbolSet s) |
int |
SymbolSet.compareTo(SymbolSet s)
An order among SymbolSets is defined according to following rules:
1. number of elements (a SymbolSet s is smaller than a SymbolSet s' if s contains less elements than s')
2. comparing the elements is ascending order
Two SymbolSets are equal if and only if they contain the same symbols (not necessarily the same objects)
|
protected boolean |
Partition.contains(SymbolSet s) |
protected boolean |
SymbolSet.containsAtLeastOneElementOf(SymbolSet t)
Checks whether at least one Symbol of t is already contained in the Partition
|
protected boolean |
SymbolSet.equals(SymbolSet t) |
protected java.lang.String |
SymbolSet.getSetDifferenceAsString(SymbolSet t) |
protected boolean |
Partition.isExtendableBy(SymbolSet s)
Checks if the Partition could be extended by the given SymbolSet.
|
protected boolean |
SymbolSet.isSubsetOf(SymbolSet t) |
protected SymbolSet |
SymbolSet.union(SymbolSet... t) |
Constructor and Description |
---|
Partition(de.jstacs.data.alphabets.DiscreteAlphabet alph,
SymbolSet... sets) |
Constructor and Description |
---|
PartitionSet(java.util.TreeSet<SymbolSet> symbolset) |
PartitionSet(java.util.TreeSet<SymbolSet> symbolset,
int allowedSubSetSize,
int allowedNumberOfExceptions) |