blob: 999fa019f53a0b13f64d0e23d55630319cca01fc (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
package de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.bulk;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2011
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import de.lmu.ifi.dbs.elki.utilities.optionhandling.Parameterizable;
/**
* Encapsulates the required parameters for a bulk split of a spatial index.
*
* @author Elke Achtert
*/
public abstract class AbstractBulkSplit implements BulkSplit, Parameterizable {
/**
* Constructor
*/
public AbstractBulkSplit() {
// Nothing to do
}
/**
* Computes and returns the best split point.
*
* @param numEntries the number of entries to be split
* @param minEntries the number of minimum entries in the node to be split
* @param maxEntries number of maximum entries in the node to be split
* @return the best split point
*/
protected int chooseBulkSplitPoint(int numEntries, int minEntries, int maxEntries) {
if(numEntries < minEntries) {
throw new IllegalArgumentException("numEntries < minEntries!");
}
if(numEntries <= maxEntries) {
return numEntries;
}
else if(numEntries < maxEntries + minEntries) {
return (numEntries - minEntries);
}
else {
return maxEntries;
}
}
}
|
