public class JaccardCoeficient extends DuplicityCheckingFileElement
Modifier and Type | Field and Description |
---|---|
static Comparator<JaccardCoeficient> |
comp
Comparator using first and then second unit id of the similarUnitPair field
for the class JaccardCoeficient.
|
static Comparator<JaccardCoeficient> |
compJaccard
Comparator using
jaccard field for the class JaccardCoeficient. |
Constructor and Description |
---|
JaccardCoeficient() |
JaccardCoeficient(TextUnitID first,
TextUnitID second,
int jaccard) |
JaccardCoeficient(UnitPair similarUnitPair,
int jaccard) |
Modifier and Type | Method and Description |
---|---|
boolean |
equals(Object obj) |
int |
getJaccard() |
UnitPair |
getSimilarUnitPair() |
int |
hashCode() |
boolean |
isRelatedTo(Set<DocumentUnitID> set)
Returns true, if one of the documents related to this Jaccard coeficient
is present in the given set of documents.
|
void |
load(DataInputStream dis) |
void |
set(UnitPair similarUnitPair,
int jaccard) |
void |
setJaccard(int jaccard) |
void |
setSimilarUnitPair(UnitPair similarUnitPair) |
void |
store(DataOutputStream dos) |
String |
toString() |
public static Comparator<JaccardCoeficient> comp
public static Comparator<JaccardCoeficient> compJaccard
jaccard
field for the class JaccardCoeficient.public JaccardCoeficient()
public JaccardCoeficient(UnitPair similarUnitPair, int jaccard)
public JaccardCoeficient(TextUnitID first, TextUnitID second, int jaccard)
public int getJaccard()
public UnitPair getSimilarUnitPair()
public void setJaccard(int jaccard)
public void setSimilarUnitPair(UnitPair similarUnitPair)
public void set(UnitPair similarUnitPair, int jaccard)
public void store(DataOutputStream dos) throws IOException
store
in class DuplicityCheckingFileElement
IOException
public void load(DataInputStream dis) throws IOException
load
in class DuplicityCheckingFileElement
IOException
public boolean isRelatedTo(Set<DocumentUnitID> set)
isRelatedTo
in class DuplicityCheckingFileElement
set
- set of document identificatorsCopyright © 2016 Egothor. All Rights Reserved.