|
|
|||||||||||||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||||||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MTreeSplit<O,D,N,E>
public abstract class MTreeSplit<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Encapsulates the required parameters for a split of a node in a M-Tree.
Field Summary | |
---|---|
(package private) Assignments<D,E> |
assignments
Encapsulates the two promotion objects and their assignments. |
Constructor Summary | |
---|---|
MTreeSplit()
Creates a new split object. |
Method Summary | |
---|---|
private D |
assignNN(Set<E> assigned1,
Set<E> assigned2,
List<DistanceEntry<D,E>> list,
D currentCR,
boolean isLeaf)
Assigns the first object of the specified list to the first assignment that it is not yet assigned to the second assignment. |
(package private) Assignments<D,E> |
balancedPartition(N node,
Integer routingObject1,
Integer routingObject2,
DistanceFunction<O,D> distanceFunction)
Creates a balanced partition of the entries of the specified node. |
Assignments<D,E> |
getAssignments()
Returns the assignments of this split. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
Assignments<D extends Distance<D>,E extends MTreeEntry<D>> assignments
Constructor Detail |
---|
public MTreeSplit()
Method Detail |
---|
Assignments<D,E> balancedPartition(N node, Integer routingObject1, Integer routingObject2, DistanceFunction<O,D> distanceFunction)
node
- the node to be splittedroutingObject1
- the id of the first routing objectroutingObject2
- the id of the second routing objectdistanceFunction
- the distance function to compute the distances
private D assignNN(Set<E> assigned1, Set<E> assigned2, List<DistanceEntry<D,E>> list, D currentCR, boolean isLeaf)
assigned1
- the first assignmentassigned2
- the second assignmentlist
- the list, the first object should be assignedcurrentCR
- the current covering radiusisLeaf
- true, if the node of the entries to be assigned is a leaf, false othwerwise
public Assignments<D,E> getAssignments()
|
|
||||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |