Interface DistributionStrategy
-
- All Known Implementing Classes:
BalancedDistribution
,FarthestBalancedDistribution
,GeneralizedHyperplaneDistribution
public interface DistributionStrategy
M-tree entry distribution strategies. These are used by many split strategies to distribute the remaining entries.- Since:
- 0.7.5
- Author:
- Erich Schubert
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description <E extends MTreeEntry>
Assignments<E>distribute(AbstractNode<E> node, int routing1, double[] dis1, int routing2, double[] dis2)
Creates a balanced partition of the entries of the specified node.
-
-
-
Method Detail
-
distribute
<E extends MTreeEntry> Assignments<E> distribute(AbstractNode<E> node, int routing1, double[] dis1, int routing2, double[] dis2)
Creates a balanced partition of the entries of the specified node.- Type Parameters:
E
- entry type- Parameters:
node
- the node to be splitrouting1
- the entry number of the first routing objectdis1
- Distances from first routing objectrouting2
- the entry number of the second routing objectdis2
- Distances from second routing object- Returns:
- an assignment that holds a balanced partition of the entries of the specified node
-
-