Modifier and Type | Field and Description |
---|---|
int |
ID |
java.util.TreeSet<java.lang.Integer> |
optimalSubSetIDs |
Constructor and Description |
---|
SymbolSet(de.jstacs.data.alphabets.DiscreteAlphabet alph,
boolean filled)
Creates an empty symbol set or one that contains all elements of the alphabet
|
SymbolSet(de.jstacs.data.alphabets.DiscreteAlphabet alph,
java.lang.String... strings)
Creates arbitrary sets of symbols
|
Modifier and Type | Method and Description |
---|---|
protected void |
add(java.lang.String str) |
protected void |
add(java.lang.String[] strarr) |
int |
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 |
contains(java.lang.String str) |
protected boolean |
containsAtLeastOneElementOf(SymbolSet t)
Checks whether at least one Symbol of t is already contained in the Partition
|
java.util.TreeSet<SymbolSet> |
createSymbolMinimalSubSets() |
java.util.TreeSet<java.lang.String> |
createSymbolMinimalSubSetsAsStrings() |
protected static java.util.TreeSet<SymbolSet> |
createSymbolSets(de.jstacs.data.alphabets.DiscreteAlphabet alph) |
java.util.TreeSet<SymbolSet> |
createSymbolSubSets() |
protected boolean |
equals(SymbolSet t) |
protected de.jstacs.data.alphabets.DiscreteAlphabet |
getAlphabet() |
protected java.lang.String[] |
getElements() |
protected int |
getNumberOfElements() |
double |
getScore() |
protected java.lang.String |
getSetDifferenceAsString(SymbolSet t) |
protected boolean |
isSubsetOf(SymbolSet t) |
protected void |
remove(java.lang.String str) |
void |
setScore(double score) |
int |
size() |
java.lang.String |
toSparseString() |
java.lang.String |
toString() |
protected SymbolSet |
union(SymbolSet... t) |
public int ID
public java.util.TreeSet<java.lang.Integer> optimalSubSetIDs
public SymbolSet(de.jstacs.data.alphabets.DiscreteAlphabet alph, java.lang.String... strings)
alph
- the alphabetstrings
- the symbols that are contained in the setpublic SymbolSet(de.jstacs.data.alphabets.DiscreteAlphabet alph, boolean filled)
alph
- the alphabetfilled
- if true, the set will contain all symbol of the alphabet.
if false, the set will be emptyprotected boolean isSubsetOf(SymbolSet t)
protected java.lang.String getSetDifferenceAsString(SymbolSet t)
protected boolean equals(SymbolSet t)
protected java.lang.String[] getElements()
protected void add(java.lang.String str)
protected void add(java.lang.String[] strarr)
protected void remove(java.lang.String str)
protected SymbolSet union(SymbolSet... t) throws java.lang.Exception
t
- an arbitrary number of SymbolSet Objectsjava.lang.Exception
- if the alphabets do not matchprotected de.jstacs.data.alphabets.DiscreteAlphabet getAlphabet()
public java.lang.String toString()
toString
in class java.lang.Object
protected int getNumberOfElements()
public int compareTo(SymbolSet s)
compareTo
in interface java.lang.Comparable<SymbolSet>
protected boolean containsAtLeastOneElementOf(SymbolSet t)
t
- an arbitrary SymbolSetprotected boolean contains(java.lang.String str)
str
- an arbitrary Symbolprotected static java.util.TreeSet<SymbolSet> createSymbolSets(de.jstacs.data.alphabets.DiscreteAlphabet alph) throws java.lang.Exception
java.lang.Exception
public java.util.TreeSet<SymbolSet> createSymbolSubSets() throws java.lang.Exception
java.lang.Exception
public java.util.TreeSet<SymbolSet> createSymbolMinimalSubSets() throws java.lang.Exception
java.lang.Exception
public java.util.TreeSet<java.lang.String> createSymbolMinimalSubSetsAsStrings() throws java.lang.Exception
java.lang.Exception
public double getScore()
public void setScore(double score)
public java.lang.String toSparseString()
public int size()