Home
last modified time | relevance | path

Searched refs:leafSize (Results 1 – 25 of 164) sorted by relevance

1234567

/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/rann/
H A Dra_model_impl.hpp43 leafSize(leafSize) in BiSearchVisitor()
88 leafSize); in SearchLeaf()
117 leafSize(leafSize) in TrainVisitor()
165 leafSize); in TrainLeaf()
257 leafSize(20), in RAModel()
267 leafSize(other.leafSize), in RAModel()
279 leafSize(other.leafSize), in RAModel()
299 leafSize = other.leafSize; in operator =()
313 leafSize = other.leafSize; in operator =()
495 this->leafSize = leafSize; in BuildModel()
[all …]
H A Dra_model.hpp87 const size_t leafSize; member in mlpack::neighbor::BiSearchVisitor
117 const size_t leafSize);
133 size_t leafSize; member in mlpack::neighbor::TrainVisitor
161 const size_t leafSize);
296 size_t leafSize; member in mlpack::neighbor::RAModel
413 const size_t leafSize,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/neighbor_search/
H A Dns_model_impl.hpp48 leafSize(leafSize), in BiSearchVisitor()
122 leafSize); in SearchLeaf()
148 leafSize(leafSize), in TrainVisitor()
270 leafSize(20), in NSModel()
281 leafSize(other.leafSize), in NSModel()
294 leafSize(other.leafSize), in NSModel()
303 other.leafSize = 20; in NSModel()
316 leafSize = other.leafSize; in operator =()
332 leafSize = other.leafSize; in operator =()
342 other.leafSize = 20; in operator =()
[all …]
H A Dns_model.hpp92 const size_t leafSize; member in mlpack::neighbor::BiSearchVisitor
132 const size_t leafSize,
150 size_t leafSize; member in mlpack::neighbor::TrainVisitor
188 const size_t leafSize,
276 size_t leafSize; member in mlpack::neighbor::NSModel
367 size_t LeafSize() const { return leafSize; } in LeafSize()
368 size_t& LeafSize() { return leafSize; } in LeafSize()
388 const size_t leafSize,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/range_search/
H A Drs_model_impl.hpp30 leafSize(0), in RSModel()
39 leafSize(other.leafSize), in RSModel()
50 leafSize(other.leafSize), in RSModel()
57 other.leafSize = 0; in RSModel()
67 leafSize = other.leafSize; in operator =()
93 this->leafSize = leafSize; in BuildModel()
198 leafSize); in Search()
284 leafSize(leafSize) in BiSearchVisitor()
333 leafSize); in SearchLeaf()
358 leafSize(leafSize) in TrainVisitor()
[all …]
H A Drs_model.hpp83 const size_t leafSize; member in mlpack::range::BiSearchVisitor
116 const size_t leafSize);
131 size_t leafSize; member in mlpack::range::TrainVisitor
160 const size_t leafSize);
235 size_t leafSize; member in mlpack::range::RSModel
319 size_t LeafSize() const { return leafSize; } in LeafSize()
321 size_t& LeafSize() { return leafSize; } in LeafSize()
344 const size_t leafSize,
/dports/devel/itext/itext-4.2.0/core/com/lowagie/text/pdf/
H A DPdfNameTree.java59 private static final int leafSize = 64; field in PdfNameTree
79 if (names.length <= leafSize) { in writeTree()
89 int skip = leafSize; in writeTree()
90 … PdfIndirectReference kids[] = new PdfIndirectReference[(names.length + leafSize - 1) / leafSize]; in writeTree()
92 int offset = k * leafSize; in writeTree()
93 int end = Math.min(offset + leafSize, names.length); in writeTree()
109 if (top <= leafSize) { in writeTree()
117 skip *= leafSize; in writeTree()
120 int offset = k * leafSize; in writeTree()
121 int end = Math.min(offset + leafSize, top); in writeTree()
H A DPdfNumberTree.java59 private static final int leafSize = 64; field in PdfNumberTree
75 if (numbers.length <= leafSize) { in writeTree()
85 int skip = leafSize; in writeTree()
86 …PdfIndirectReference kids[] = new PdfIndirectReference[(numbers.length + leafSize - 1) / leafSize]; in writeTree()
88 int offset = k * leafSize; in writeTree()
89 int end = Math.min(offset + leafSize, numbers.length); in writeTree()
105 if (top <= leafSize) { in writeTree()
113 skip *= leafSize; in writeTree()
116 int offset = k * leafSize; in writeTree()
117 int end = Math.min(offset + leafSize, top); in writeTree()
H A DPdfPages.java75 private int leafSize = 10; field in PdfPages
91 if ((pages.size() % leafSize) == 0) in addPage()
106 if ((pages.size() % leafSize) == 0) in addPageRef()
125 leaf *= leafSize; in writePageTree()
126 int stdCount = leafSize; in writePageTree()
127 int rightCount = tPages.size() % leafSize; in writePageTree()
129 rightCount = leafSize; in writePageTree()
148 if ((p % leafSize) == 0) in writePageTree()
150 top.put(PdfName.PARENT, (PdfIndirectReference)nextParents.get(p / leafSize)); in writePageTree()
179 leafSize = 10000000; in setLinearMode()
/dports/print/pdftk/pdftk-7d2ac3c1fa858f2c247c809fc6ef43f71f241098/java/com/gitlab/pdftk_java/com/lowagie/text/pdf/
H A DPdfNumberTree.java66 private static final int leafSize = 64; field in PdfNumberTree
82 if (numbers.length <= leafSize) { in writeTree()
92 int skip = leafSize; in writeTree()
93 …PdfIndirectReference kids[] = new PdfIndirectReference[(numbers.length + leafSize - 1) / leafSize]; in writeTree()
95 int offset = k * leafSize; in writeTree()
96 int end = Math.min(offset + leafSize, numbers.length); in writeTree()
112 if (top <= leafSize) { in writeTree()
120 skip *= leafSize; in writeTree()
123 int offset = k * leafSize; in writeTree()
124 int end = Math.min(offset + leafSize, top); in writeTree()
H A DPdfPages.java81 private int leafSize = 10; field in PdfPages
97 if ((pages.size() % leafSize) == 0) in addPage()
112 if ((pages.size() % leafSize) == 0) in addPageRef()
131 leaf *= leafSize; in writePageTree()
132 int stdCount = leafSize; in writePageTree()
133 int rightCount = tPages.size() % leafSize; in writePageTree()
135 rightCount = leafSize; in writePageTree()
154 if ((p % leafSize) == 0) in writePageTree()
156 top.put(PdfName.PARENT, (PdfIndirectReference)nextParents.get(p / leafSize)); in writePageTree()
182 leafSize = 10000000; in setLinearMode()
H A DPdfNameTree.java67 private static final int leafSize = 64; field in PdfNameTree
88 if (names.length <= leafSize) { in writeTree()
102 int skip = leafSize; in writeTree()
103 … PdfIndirectReference kids[] = new PdfIndirectReference[(names.length + leafSize - 1) / leafSize]; in writeTree()
105 int offset = k * leafSize; in writeTree()
106 int end = Math.min(offset + leafSize, names.length); in writeTree()
125 if (top <= leafSize) { in writeTree()
133 skip *= leafSize; in writeTree()
136 int offset = k * leafSize; in writeTree()
137 int end = Math.min(offset + leafSize, top); in writeTree()
/dports/lang/gcc6-aux/gcc-6-20180516/libgo/go/math/big/
H A Dnatconv.go356 for len(q) > leafSize {
421 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
442 if leafSize == 0 || m <= leafSize {
448 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
468 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
469 table[0].ndigits = ndigits * leafSize
/dports/lang/gcc12-devel/gcc-12-20211205/libgo/go/math/big/
H A Dnatconv.go376 for len(q) > leafSize {
441 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
462 if leafSize == 0 || m <= leafSize {
468 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
488 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
489 table[0].ndigits = ndigits * leafSize
/dports/lang/gcc8/gcc-8.5.0/libgo/go/math/big/
H A Dnatconv.go367 for len(q) > leafSize {
432 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
453 if leafSize == 0 || m <= leafSize {
459 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
479 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
480 table[0].ndigits = ndigits * leafSize
/dports/lang/gcc10/gcc-10.3.0/libgo/go/math/big/
H A Dnatconv.go376 for len(q) > leafSize {
441 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block
462 if leafSize == 0 || m <= leafSize {
468 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
488 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
489 table[0].ndigits = ndigits * leafSize
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libgo/go/math/big/
H A Dnatconv.go367 for len(q) > leafSize {
432 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
453 if leafSize == 0 || m <= leafSize {
459 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
479 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
480 table[0].ndigits = ndigits * leafSize
/dports/lang/go-devel/go-dragonfly-amd64-bootstrap/src/math/big/
H A Dnatconv.go376 for len(q) > leafSize {
441 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
462 if leafSize == 0 || m <= leafSize {
468 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
488 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
489 table[0].ndigits = ndigits * leafSize
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/math/big/
H A Dnatconv.go376 for len(q) > leafSize {
441 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
462 if leafSize == 0 || m <= leafSize {
468 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
488 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
489 table[0].ndigits = ndigits * leafSize
/dports/lang/gcc11-devel/gcc-11-20211009/libgo/go/math/big/
H A Dnatconv.go376 for len(q) > leafSize {
441 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
462 if leafSize == 0 || m <= leafSize {
468 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
488 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
489 table[0].ndigits = ndigits * leafSize
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libgo/go/math/big/
H A Dnatconv.go367 for len(q) > leafSize {
432 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
453 if leafSize == 0 || m <= leafSize {
459 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
479 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
480 table[0].ndigits = ndigits * leafSize
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libgo/go/math/big/
H A Dnatconv.go367 for len(q) > leafSize {
432 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
453 if leafSize == 0 || m <= leafSize {
459 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
479 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
480 table[0].ndigits = ndigits * leafSize
/dports/lang/gcc9-devel/gcc-9-20211007/libgo/go/math/big/
H A Dnatconv.go367 for len(q) > leafSize {
432 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
453 if leafSize == 0 || m <= leafSize {
459 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
479 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
480 table[0].ndigits = ndigits * leafSize
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libgo/go/math/big/
H A Dnatconv.go367 for len(q) > leafSize {
432 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
453 if leafSize == 0 || m <= leafSize {
459 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
479 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
480 table[0].ndigits = ndigits * leafSize
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libgo/go/math/big/
H A Dnatconv.go376 for len(q) > leafSize {
441 var leafSize int = 8 // number of Word-size binary values treat as a monolithic block var
462 if leafSize == 0 || m <= leafSize {
468 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
488 table[0].bbb = nat(nil).expWW(bb, Word(leafSize))
489 table[0].ndigits = ndigits * leafSize

1234567