public class LabelSet
extends java.lang.Object
implements java.util.Comparator, java.io.Serializable
Modifier and Type | Field and Description |
---|---|
int[] |
indices |
Constructor and Description |
---|
LabelSet() |
LabelSet(int[] indices)
A new LabelSet, given a list of SORTED indices.
|
LabelSet(int[] indices,
boolean sort)
A new LabelSet, indicating sort=true if indices they need to be sorted (i.e., are NOT sorted).
|
LabelSet(java.util.List<java.lang.Integer> list) |
LabelSet(java.util.Set<java.lang.Integer> set) |
Modifier and Type | Method and Description |
---|---|
int |
compare(java.lang.Object o1,
java.lang.Object o2) |
boolean |
contains(int j) |
boolean |
contains(int[] js) |
LabelSet |
deep_copy() |
int |
distance(LabelSet o) |
boolean |
equals(java.lang.Object o) |
int |
hashCode() |
static int[] |
minus(int[] y1,
int[] y2)
Minus aka Set Difference, e.g., [3,4,7,9] \ [3,7] = [4,9].
|
void |
minus(LabelSet l2) |
static int |
subset(int[] y1,
int[] y2)
Subset - returns > 0 if y1 \subsetof y2
|
int |
subsetof(LabelSet y) |
java.lang.String |
toString() |
public LabelSet()
public LabelSet(int[] indices)
public LabelSet(int[] indices, boolean sort)
public LabelSet(java.util.List<java.lang.Integer> list)
public LabelSet(java.util.Set<java.lang.Integer> set)
public final boolean contains(int j)
public final boolean contains(int[] js)
public final int hashCode()
hashCode
in class java.lang.Object
public boolean equals(java.lang.Object o)
equals
in interface java.util.Comparator
equals
in class java.lang.Object
public int compare(java.lang.Object o1, java.lang.Object o2)
compare
in interface java.util.Comparator
public final int subsetof(LabelSet y)
public static final int subset(int[] y1, int[] y2)
public void minus(LabelSet l2)
public static int[] minus(int[] y1, int[] y2)
public int distance(LabelSet o)
public LabelSet deep_copy()
public java.lang.String toString()
toString
in class java.lang.Object