public class SemanticClass
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
int[] |
CenterPoint |
java.util.ArrayList<int[]> |
ClassPartitions |
private double |
Compactness |
double[] |
concentrationmix |
java.util.ArrayList |
ConnectedClasses |
private java.util.ArrayList<SemanticNode> |
EdgeNodes |
int |
index |
int |
MemberCount |
java.util.ArrayList |
QMIntersectionClassArrayListMAX |
java.util.ArrayList |
QMIntersectionClassArrayListMIN |
int[] |
regionmix |
java.lang.String |
Report |
java.util.ArrayList<SemanticNode> |
SemanticNodes |
int |
SharedClasses |
private java.util.ArrayList<int[]> |
UnitswithClassList |
Constructor and Description |
---|
SemanticClass(int index,
java.util.ArrayList<int[]> UnitswithClassList) |
Modifier and Type | Method and Description |
---|---|
void |
addConcentrationMix(double[] conc) |
void |
addNode(SemanticNode s) |
void |
addRegionMix(int[] regions) |
void |
calculateClassPartitions()
Lists all different partitions of the class (a Partition is consicered a connected Area of units with no more
than 1 as distance between each unit)
|
void |
calculateCompactness()
Calculates How much of the class units lie in a radius around the middle point ( this radius is the mean over all
distances from the middle point to other class points)
|
double |
getCompactness() |
java.util.ArrayList<SemanticNode> |
getEdgeNodes() |
int[] |
getFurthestMember()
calculates the point with the most distance to the class centre
|
java.util.ArrayList<java.lang.String> |
getIntersectionDirections(java.util.ArrayList l)
Returns an ArrayList containing directions of the Units given in the ArrayList, measured to the Center of the
Class
|
private java.util.ArrayList<java.lang.Integer> |
getTrail(int i,
java.util.ArrayList<java.lang.Integer> trail)
Finds a Trail for unit i through the class (all units with distance 1 will be added to one trail)
|
boolean |
matchesCompactnessRequirements(EditableReportProperties EP)
Return true, if the Class matches the wanted compactness in the region index
|
void |
setClassEdges(java.util.ArrayList<SemanticNode> edges)
Sets the Semantic Nodes that were found to be on the edges of the class
|
void |
setMeanPoint(int[] mp) |
void |
setQMIntersectionClassArrayListMAX(java.util.ArrayList QMIntersectionClassArrayList)
Sets the setQMIntersectionClassArrayList, containing the Name of the QM on uneven places, and the
IntersectionNodes-ArrayList on even Places for Maximum Units of the QM
|
void |
setQMIntersectionClassArrayListMIN(java.util.ArrayList QMIntersectionClassArrayList)
Sets the setQMIntersectionClassArrayList, containing the Name of the QM on uneven places, and the
IntersectionNodes-ArrayList on even Places for Minimum Units of the QM
|
void |
setReport(java.lang.String rep) |
void |
setSharedClasses(int classes) |
public int index
public java.lang.String Report
public int[] CenterPoint
public int SharedClasses
public java.util.ArrayList<SemanticNode> SemanticNodes
private java.util.ArrayList<int[]> UnitswithClassList
public java.util.ArrayList<int[]> ClassPartitions
public java.util.ArrayList ConnectedClasses
public int[] regionmix
public double[] concentrationmix
public int MemberCount
private java.util.ArrayList<SemanticNode> EdgeNodes
private double Compactness
public java.util.ArrayList QMIntersectionClassArrayListMAX
public java.util.ArrayList QMIntersectionClassArrayListMIN
public SemanticClass(int index, java.util.ArrayList<int[]> UnitswithClassList)
public void setMeanPoint(int[] mp)
public void calculateClassPartitions()
private java.util.ArrayList<java.lang.Integer> getTrail(int i, java.util.ArrayList<java.lang.Integer> trail)
public void calculateCompactness()
public int[] getFurthestMember()
public void setReport(java.lang.String rep)
public java.util.ArrayList<java.lang.String> getIntersectionDirections(java.util.ArrayList l)
public void addRegionMix(int[] regions)
public void addConcentrationMix(double[] conc)
public void addNode(SemanticNode s)
public void setSharedClasses(int classes)
public double getCompactness()
public boolean matchesCompactnessRequirements(EditableReportProperties EP)
public void setClassEdges(java.util.ArrayList<SemanticNode> edges)
public java.util.ArrayList<SemanticNode> getEdgeNodes()
public void setQMIntersectionClassArrayListMAX(java.util.ArrayList QMIntersectionClassArrayList)
public void setQMIntersectionClassArrayListMIN(java.util.ArrayList QMIntersectionClassArrayList)