Home
last modified time | relevance | path

Searched refs:minEntries (Results 1 – 25 of 32) sorted by relevance

12

/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-rtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/spatial/rstarvariants/strategies/split/
H A DTopologicalSplitter.java73 split.chooseSplitAxis(minEntries); in split()
74 split.chooseSplitPoint(minEntries); in split()
152 void chooseSplitAxis(int minEntries) {
172 for(int k = 1; k < size - minEntries; k++) {
177 if(k >= minEntries - 1) {
233 void chooseSplitPoint(int minEntries) {
244 … assert (size - 2 * minEntries >= 0) : "Cannot split nodes (" + size + " < 2*" + minEntries + ")";
248 for(int i = 0; i <= size - 2 * minEntries; i++) {
257 splitPoint = minEntries + i;
266 for(int i = 0; i <= size - 2 * minEntries; i++) {
[all …]
H A DRTreeQuadraticSplit.java55 … extends SpatialComparable, A> long[] split(A entries, ArrayAdapter<E, A> getter, int minEntries) { in split() argument
106 if(in1 + remaining <= minEntries) { in split()
110 if(in2 + remaining <= minEntries) { in split()
H A DRTreeLinearSplit.java55 … extends SpatialComparable, A> long[] split(A entries, ArrayAdapter<E, A> getter, int minEntries) { in split() argument
154 if(in1 + remaining <= minEntries) { in split()
158 if(in2 + remaining <= minEntries) { in split()
H A DSplitStrategy.java41 …E extends SpatialComparable, A> long[] split(A entries, ArrayAdapter<E, A> getter, int minEntries); in split() argument
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-rtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/spatial/rstarvariants/strategies/bulk/
H A DAbstractBulkSplit.java47 protected int chooseBulkSplitPoint(int numEntries, int minEntries, int maxEntries) { in chooseBulkSplitPoint() argument
48 if(numEntries < minEntries) { in chooseBulkSplitPoint()
55 else if(numEntries < maxEntries + minEntries) { in chooseBulkSplitPoint()
56 return (numEntries - minEntries); in chooseBulkSplitPoint()
71 protected <T> List<List<T>> trivialPartition(List<T> objects, int minEntries, int maxEntries) { in trivialPartition() argument
82 assert ((end - start) >= minEntries && (end - start) <= maxEntries); in trivialPartition()
H A DFileOrderBulkSplit.java49 …SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int maxEntries)… in partition() argument
50 return trivialPartition(spatialObjects, minEntries, maxEntries); in partition()
H A DOneDimSortBulkSplit.java62 …SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int maxEntries)… in partition() argument
65 return trivialPartition(spatialObjects, minEntries, maxEntries); in partition()
H A DSpatialSortBulkSplit.java70 …SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int maxEntries)… in partition() argument
72 return super.trivialPartition(spatialObjects, minEntries, maxEntries); in partition()
H A DMaxExtensionBulkSplit.java72 …SpatialComparable> List<List<N>> partition(List<N> spatialObjects, int minEntries, int maxEntries)… in partition() argument
81 int splitPoint = chooseBulkSplitPoint(objects.size(), minEntries, maxEntries); in partition()
H A DBulkSplit.java43 …<T extends SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int … in partition() argument
H A DSortTileRecursiveBulkSplit.java60 …SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int maxEntries)… in partition() argument
H A DMaxExtensionSortTileRecursiveBulkSplit.java52 …SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int maxEntries)… in partition() argument
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/addons/xtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/spatial/rstarvariants/xtree/util/
H A DXSplitter.java124 double surfaceSum = getSurfaceSums4Sorting(minEntries, maxEntries, entriesByLB, dim); in generateDistributionsAndSurfaceSums()
126 surfaceSum += getSurfaceSums4Sorting(minEntries, maxEntries, entriesByUB, dim); in generateDistributionsAndSurfaceSums()
164 for(int index = 0; index < minEntries; index++) { in getSurfaceSums4Sorting()
175 assert entrySorting.length - maxEntries == minEntries; in getSurfaceSums4Sorting()
186 for(int index = minEntries; index < maxEntries; index++) { in getSurfaceSums4Sorting()
197 for(int limit = minEntries; limit < maxEntries; limit++) { in getSurfaceSums4Sorting()
411 private int chooseSplitAxis(IntIterator dimensionIterator, int minEntries, int maxEntries) { in chooseSplitAxis() argument
419 assert minEntries >= 1 && minEntries <= maxEntries && maxEntries <= numOfEntries; in chooseSplitAxis() local
520 for(int limit = minEntries; limit <= maxEntries; limit++) { in chooseMinimumOverlapSplit()
721 maxEntries = maxEntries + 1 - minEntries; in topologicalSplit()
[all …]
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/Ylib/
H A Dhash.c315 INT Yhash_table_size( minEntries ) in Yhash_table_size() argument
316 INT minEntries; in Yhash_table_size()
344 if (minEntries <= MINPRIMESIZE){
347 testPrime = minEntries;
/dports/cad/digital/Digital-0.27/src/main/java/de/neemann/digital/gui/components/
H A DElementOrderer.java109 public ElementOrderer<T> addDeleteButton(final int minEntries) { in addDeleteButton() argument
116 if (data.size() - del >= minEntries && del > 0) in addDeleteButton()
119 if (data.size() <= minEntries) in addDeleteButton()
122 …}.setToolTip(Lang.get("tt_deleteItem")).setEnabledChain(data.size() > minEntries).createJButton()); in addDeleteButton()
/dports/deskutils/egroupware/egroupware/vendor/egroupware/z-push-dev/tools/gab-sync/lib/
H A Dsyncworker.php159 $minEntries = $minSize = 99999999999;
171 if ($minEntries > $amountEntries)
172 $minEntries = $amountEntries;
209 …: \t%d\n\tMax. of items per chunk: \t%d\n\n", ($entries/count($chunks)), $minEntries, $maxEntries);
/dports/cad/ngspice_rework/ngspice-35/src/misc/
H A Dhash.c804 int nghash_table_size(int minEntries) in nghash_table_size() argument
833 if (minEntries <= MINPRIMESIZE) { in nghash_table_size()
836 testPrime = minEntries; in nghash_table_size()
861 int nghash_table_size2(int minEntries) in nghash_table_size2() argument
866 while( minEntries > 0 ) { in nghash_table_size2()
867 minEntries = minEntries >> 1 ; in nghash_table_size2()
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-rtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/spatial/rstarvariants/
H A DNonFlatRStarTree.java180 int minEntries = dirMinimum; in createBulkDirectoryNodes() local
184 List<List<E>> partitions = settings.bulkSplitter.partition(nodes, minEntries, maxEntries); in createBulkDirectoryNodes()
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/emirpasic/gods/gods-1.12.0/trees/btree/
H A Dbtree.go255 func (tree *Tree) minEntries() int { func
486 if node == nil || len(node.Entries) >= tree.minEntries() {
492 if leftSibling != nil && len(leftSibling.Entries) > tree.minEntries() {
508 if rightSibling != nil && len(rightSibling.Entries) > tree.minEntries() {
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go255 func (tree *Tree) minEntries() int { func
486 if node == nil || len(node.Entries) >= tree.minEntries() {
492 if leftSibling != nil && len(leftSibling.Entries) > tree.minEntries() {
508 if rightSibling != nil && len(rightSibling.Entries) > tree.minEntries() {
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go255 func (tree *Tree) minEntries() int { func
486 if node == nil || len(node.Entries) >= tree.minEntries() {
492 if leftSibling != nil && len(leftSibling.Entries) > tree.minEntries() {
508 if rightSibling != nil && len(rightSibling.Entries) > tree.minEntries() {
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go255 func (tree *Tree) minEntries() int { func
486 if node == nil || len(node.Entries) >= tree.minEntries() {
492 if leftSibling != nil && len(leftSibling.Entries) > tree.minEntries() {
508 if rightSibling != nil && len(rightSibling.Entries) > tree.minEntries() {
/dports/devel/gitty/gitty-0.3.0/vendor/github.com/emirpasic/gods/trees/btree/
H A Dbtree.go255 func (tree *Tree) minEntries() int { func
486 if node == nil || len(node.Entries) >= tree.minEntries() {
492 if leftSibling != nil && len(leftSibling.Entries) > tree.minEntries() {
508 if rightSibling != nil && len(rightSibling.Entries) > tree.minEntries() {
/dports/databases/tile38/tile38-1.12.0/index/rtreebase/
H A Dload.go33 if len(items) < tr.minEntries {
/dports/irc/ergo/ergo-2.8.0/vendor/github.com/tidwall/rtred/base/
H A Dload.go7 if len(items) < tr.minEntries {

12