Home
last modified time | relevance | path

Searched refs:LeafSize (Results 1 – 25 of 74) sorted by relevance

123

/dports/math/vtk8/VTK-8.2.0/Filters/Points/
H A DvtkVoxelGrid.cxx141 this->LeafSize[0] = this->LeafSize[1] = this->LeafSize[2] = 1.0; in vtkVoxelGrid()
191 if ( this->LeafSize[0] <= 0.0 || this->LeafSize[1] <= 0.0 || this->LeafSize[2] <= 0.0 || in RequestData()
209 divs[0] = (bounds[1]-bounds[0]) / this->LeafSize[0]; in RequestData()
210 divs[1] = (bounds[3]-bounds[2]) / this->LeafSize[1]; in RequestData()
211 divs[2] = (bounds[5]-bounds[4]) / this->LeafSize[2]; in RequestData()
293 << this->LeafSize[0] << "," in PrintSelf()
294 << this->LeafSize[1] << "," in PrintSelf()
295 << this->LeafSize[2] << ")\n"; in PrintSelf()
H A DvtkVoxelGrid.h117 vtkSetVector3Macro(LeafSize,double);
118 vtkGetVectorMacro(LeafSize,double,3);
150 double LeafSize[3]; variable
/dports/math/vtk9/VTK-9.1.0/Filters/Points/
H A DvtkVoxelGrid.cxx139 this->LeafSize[0] = this->LeafSize[1] = this->LeafSize[2] = 1.0; in vtkVoxelGrid()
185 if (this->LeafSize[0] <= 0.0 || this->LeafSize[1] <= 0.0 || this->LeafSize[2] <= 0.0 || in RequestData()
203 divs[0] = (bounds[1] - bounds[0]) / this->LeafSize[0]; in RequestData()
204 divs[1] = (bounds[3] - bounds[2]) / this->LeafSize[1]; in RequestData()
205 divs[2] = (bounds[5] - bounds[4]) / this->LeafSize[2]; in RequestData()
283 os << indent << "Leaf Size: (" << this->LeafSize[0] << "," << this->LeafSize[1] << "," in PrintSelf()
284 << this->LeafSize[2] << ")\n"; in PrintSelf()
H A DvtkVoxelGrid.h113 vtkSetVector3Macro(LeafSize, double);
114 vtkGetVectorMacro(LeafSize, double, 3);
146 double LeafSize[3]; variable
/dports/devel/judy/judy-1.0.5/src/JudyCommon/
H A DJudyTables.c60 int LeafSize, // number elements in object in GenTable() argument
77 MaxWords = ROUNDUP((IndexBytes + ValueBytes) * LeafSize, BPW, OffsetWords); in GenTable()
107 if (Index == LeafSize) in GenTable()
131 for (ii = LeafSize; ii > 0; ii--) in GenTable()
140 fprintf(fd,"//\t%s = %d\n", TableSize, LeafSize); in GenTable()
146 for (ii = 1; ii <= LeafSize; ii++) in GenTable()
157 if (ii != LeafSize) fprintf(fd,", "); in GenTable()
170 for (ii = 1; ii <= LeafSize; ii++) in GenTable()
176 if (ii != LeafSize) fprintf(fd,", "); in GenTable()
/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/klib/judy/
H A DJudyTablesGen.c54 int LeafSize, // number elements in object in GenTable() argument
71 MaxWords = ROUNDUP((IndexBytes + ValueBytes) * LeafSize, BPW, OffsetWords); in GenTable()
101 if (Index == LeafSize) in GenTable()
125 for (ii = LeafSize; ii > 0; ii--) in GenTable()
134 fprintf(fd,"//\t%s = %d\n", TableSize, LeafSize); in GenTable()
140 for (ii = 1; ii <= LeafSize; ii++) in GenTable()
151 if (ii != LeafSize) fprintf(fd,", "); in GenTable()
164 for (ii = 1; ii <= LeafSize; ii++) in GenTable()
170 if (ii != LeafSize) fprintf(fd,", "); in GenTable()
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/klib/judy/
H A DJudyTablesGen.c54 int LeafSize, // number elements in object in GenTable() argument
71 MaxWords = ROUNDUP((IndexBytes + ValueBytes) * LeafSize, BPW, OffsetWords); in GenTable()
101 if (Index == LeafSize) in GenTable()
125 for (ii = LeafSize; ii > 0; ii--) in GenTable()
134 fprintf(fd,"//\t%s = %d\n", TableSize, LeafSize); in GenTable()
140 for (ii = 1; ii <= LeafSize; ii++) in GenTable()
151 if (ii != LeafSize) fprintf(fd,", "); in GenTable()
164 for (ii = 1; ii <= LeafSize; ii++) in GenTable()
170 if (ii != LeafSize) fprintf(fd,", "); in GenTable()
/dports/sysutils/b2sum/BLAKE2-20190724/csharp/Blake2Sharp/
H A DBlake2BTreeConfig.cs20 public long LeafSize { get; set; } property in Blake2Sharp.Blake2BTreeConfig
33 result.LeafSize = LeafSize; in Clone()
H A DBlake2IvBuilder.cs18 …uentialTreeConfig = new Blake2BTreeConfig() { IntermediateHashSize = 0, LeafSize = 0, FanOut = 1, …
45 rawConfig[0] |= ((ulong)(uint)treeConfig.LeafSize) << 32; in ConfigB()
/dports/security/softether5/SoftEtherVPN-5.02.5180/3rdparty/BLAKE2/csharp/Blake2Sharp/
H A DBlake2BTreeConfig.cs20 public long LeafSize { get; set; } property in Blake2Sharp.Blake2BTreeConfig
33 result.LeafSize = LeafSize; in Clone()
H A DBlake2IvBuilder.cs18 …uentialTreeConfig = new Blake2BTreeConfig() { IntermediateHashSize = 0, LeafSize = 0, FanOut = 1, …
45 rawConfig[0] |= ((ulong)(uint)treeConfig.LeafSize) << 32; in ConfigB()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/cont/openmp/internal/
H A DParallelScanOpenMP.h83 vtkm::Id LeafSize; member
140 bool IsLeaf(const vtkm::Id2& range) const { return (range[1] - range[0]) <= this->LeafSize; } in IsLeaf()
147 const vtkm::Id np = this->LeafSize; in ComputeMidpoint()
160 numVals, numThreads, chunksPerThread, sizeof(ValueType), numChunks, this->LeafSize); in Prepare()
H A DFunctorsOpenMP.h642 vtkm::Id LeafSize;
650 , LeafSize(0)
684 this->NumValues, numThreads, chunksPerThread, sizeof(ValueType), numChunks, this->LeafSize);
718 bool IsLeaf(const vtkm::Id2& range) { return (range[1] - range[0]) <= this->LeafSize; }
725 const vtkm::Id np = this->LeafSize;
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/cont/openmp/internal/
H A DParallelScanOpenMP.h93 vtkm::Id LeafSize; member
150 bool IsLeaf(const vtkm::Id2& range) const { return (range[1] - range[0]) <= this->LeafSize; } in IsLeaf()
157 const vtkm::Id np = this->LeafSize; in ComputeMidpoint()
170 numVals, numThreads, chunksPerThread, sizeof(ValueType), numChunks, this->LeafSize); in Prepare()
H A DFunctorsOpenMP.h533 vtkm::Id LeafSize;
541 , LeafSize(0)
575 this->NumValues, numThreads, chunksPerThread, sizeof(ValueType), numChunks, this->LeafSize);
609 bool IsLeaf(const vtkm::Id2& range) { return (range[1] - range[0]) <= this->LeafSize; }
616 const vtkm::Id np = this->LeafSize;
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/range_search/
H A Drs_model.hpp319 size_t LeafSize() const { return leafSize; } in LeafSize() function in mlpack::range::RSModel
321 size_t& LeafSize() { return leafSize; } in LeafSize() function in mlpack::range::RSModel
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/rann/
H A Dra_model.hpp396 size_t LeafSize() const;
398 size_t& LeafSize();
H A Dkrann_main.cpp231 rann->LeafSize() = size_t(lsInt); in mlpackMain()
H A Dra_model_impl.hpp444 size_t RAModel<SortPolicy>::LeafSize() const in LeafSize() function in mlpack::neighbor::RAModel
450 size_t& RAModel<SortPolicy>::LeafSize() in LeafSize() function in mlpack::neighbor::RAModel
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/neighbor_search/
H A Dns_model.hpp367 size_t LeafSize() const { return leafSize; } in LeafSize() function in mlpack::neighbor::NSModel
368 size_t& LeafSize() { return leafSize; } in LeafSize() function in mlpack::neighbor::NSModel
H A Dknn_main.cpp255 knn->LeafSize() = size_t(lsInt); in mlpackMain()
280 knn->LeafSize() = size_t(lsInt); in mlpackMain()
/dports/devel/app-builder/app-builder-3.4.2/vendor/github.com/minio/blake2b-simd/
H A Dblake2b.go61 LeafSize uint32 // leaf maximal byte length (0 for unlimited) member
138 binary.LittleEndian.PutUint32(p[4:], c.Tree.LeafSize)
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/minio/blake2b-simd/
H A Dblake2b.go61 LeafSize uint32 // leaf maximal byte length (0 for unlimited) member
138 binary.LittleEndian.PutUint32(p[4:], c.Tree.LeafSize)
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/tests/main_tests/
H A Dkrann_test.cpp343 CHECK(output_model->LeafSize() == (int) 1);
344 CHECK(IO::GetParam<RANNModel*>("output_model")->LeafSize() == (int) 10);
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/
H A Dbenchmark_filters.rst34 * VoxelGrid: *LeafSize*;

123