Home
last modified time | relevance | path

Searched refs:binIndex (Results 1 – 25 of 71) sorted by relevance

123

/dports/science/py-paida/paida-3.2.1_2.10.1/paida/paida_core/
H A DIAxis.py19 def _binEdges(self, binIndex): argument
20 if binIndex == self.OVERFLOW_BIN:
22 elif binIndex == self.UNDERFLOW_BIN:
25 return self._edgeList[binIndex], self._edgeList[binIndex + 1]
27 def binLowerEdge(self, binIndex): argument
28 if binIndex == self.OVERFLOW_BIN:
33 return self._edgeList[binIndex]
35 def binUpperEdge(self, binIndex): argument
36 if binIndex == self.OVERFLOW_BIN:
46 def binWidth(self, binIndex): argument
[all …]
/dports/devel/libhoard/Hoard/src/include/hoard/
H A Dhoardmanager.h87 int binIndex; in malloc() local
90 binIndex = _cachedSizeClass; in malloc()
93 binIndex = binType::getSizeClass(sz); in malloc()
96 _cachedSizeClass = binIndex; in malloc()
122 auto& stats = _stats(binIndex); in put()
146 decStatsSuperblock (s, binIndex); in get()
175 auto& stats = _stats(binIndex); in free()
185 slowPathFree (binIndex, u, a); in free()
245 auto& stats = _stats(binIndex); in slowPathFree()
271 _otherBins(binIndex).put (s); in unlocked_put()
[all …]
/dports/devel/libhoard/Hoard/src/Heap-Layers/utility/
H A Dmyhashmap.h57 unsigned int binIndex = (unsigned int) (Hash<Key>::hash(k) % _numBins); in set() local
58 ListNode * l = _bins[binIndex]; in set()
71 unsigned int binIndex = (unsigned int) (Hash<Key>::hash(k) % _numBins); in get() local
72 ListNode * l = _bins[binIndex]; in get()
85 ListNode * curr = _bins[binIndex]; in erase()
90 if (curr != _bins[binIndex]) { in erase()
95 ListNode * n = _bins[binIndex]->next; in erase()
96 _allocator.free (_bins[binIndex]); in erase()
97 _bins[binIndex] = n; in erase()
116 l->next = _bins[binIndex]; in insert()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java333 final int binIndex = binIndex(newBins, key); in rehash() local
335 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
351 final int binIndex = binIndex(bins, key); in findElement() local
676 final int binIndex = binIndex(qbins, key); in find() local
709 final int binIndex = binIndex(newBins, key); in cloneAndMergeBins() local
711 newBins[binIndex] = new Element(newBins[binIndex], property); in cloneAndMergeBins()
763 final int binIndex = binIndex(bins, key); in addProperty() local
766 bins[binIndex] = removeExistingElement(bins[binIndex], key); in addProperty()
771 bins[binIndex] = new Element(bins[binIndex], property); in addProperty()
795 final int binIndex = binIndex(bins, key); in replaceProperty() local
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java333 final int binIndex = binIndex(newBins, key); in rehash() local
335 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
351 final int binIndex = binIndex(bins, key); in findElement() local
676 final int binIndex = binIndex(qbins, key); in find() local
709 final int binIndex = binIndex(newBins, key); in cloneAndMergeBins() local
711 newBins[binIndex] = new Element(newBins[binIndex], property); in cloneAndMergeBins()
763 final int binIndex = binIndex(bins, key); in addProperty() local
766 bins[binIndex] = removeExistingElement(bins[binIndex], key); in addProperty()
771 bins[binIndex] = new Element(bins[binIndex], property); in addProperty()
795 final int binIndex = binIndex(bins, key); in replaceProperty() local
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java333 final int binIndex = binIndex(newBins, key); in rehash() local
335 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
351 final int binIndex = binIndex(bins, key); in findElement() local
676 final int binIndex = binIndex(qbins, key); in find() local
709 final int binIndex = binIndex(newBins, key); in cloneAndMergeBins() local
711 newBins[binIndex] = new Element(newBins[binIndex], property); in cloneAndMergeBins()
763 final int binIndex = binIndex(bins, key); in addProperty() local
766 bins[binIndex] = removeExistingElement(bins[binIndex], key); in addProperty()
771 bins[binIndex] = new Element(bins[binIndex], property); in addProperty()
795 final int binIndex = binIndex(bins, key); in replaceProperty() local
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java333 final int binIndex = binIndex(newBins, key); in rehash() local
335 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
351 final int binIndex = binIndex(bins, key); in findElement() local
676 final int binIndex = binIndex(qbins, key); in find() local
709 final int binIndex = binIndex(newBins, key); in cloneAndMergeBins() local
711 newBins[binIndex] = new Element(newBins[binIndex], property); in cloneAndMergeBins()
763 final int binIndex = binIndex(bins, key); in addProperty() local
766 bins[binIndex] = removeExistingElement(bins[binIndex], key); in addProperty()
771 bins[binIndex] = new Element(bins[binIndex], property); in addProperty()
795 final int binIndex = binIndex(bins, key); in replaceProperty() local
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java333 final int binIndex = binIndex(newBins, key); in rehash() local
335 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
351 final int binIndex = binIndex(bins, key); in findElement() local
676 final int binIndex = binIndex(qbins, key); in find() local
709 final int binIndex = binIndex(newBins, key); in cloneAndMergeBins() local
711 newBins[binIndex] = new Element(newBins[binIndex], property); in cloneAndMergeBins()
763 final int binIndex = binIndex(bins, key); in addProperty() local
766 bins[binIndex] = removeExistingElement(bins[binIndex], key); in addProperty()
771 bins[binIndex] = new Element(bins[binIndex], property); in addProperty()
795 final int binIndex = binIndex(bins, key); in replaceProperty() local
[all …]
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/worklet/
H A DFieldHistogram.h61 using ControlSignature = void(FieldIn value, FieldOut binIndex);
78 void operator()(const FieldType& value, vtkm::Id& binIndex) const in operator()
80 binIndex = static_cast<vtkm::Id>((value - minValue) / delta); in operator()
81 if (binIndex < 0) in operator()
82 binIndex = 0; in operator()
83 else if (binIndex >= numberOfBins) in operator()
84 binIndex = numberOfBins - 1; in operator()
148 vtkm::cont::ArrayHandle<vtkm::Id> binIndex; in Run() local
149 binIndex.Allocate(numberOfValues); in Run()
155 setHistogramBinDispatcher.Invoke(fieldArray, binIndex); in Run()
[all …]
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/worklet/
H A DFieldHistogram.h87 void operator()(const FieldType& value, vtkm::Id& binIndex) const in operator()
89 binIndex = static_cast<vtkm::Id>((value - minValue) / delta); in operator()
90 if (binIndex < 0) in operator()
91 binIndex = 0; in operator()
92 else if (binIndex >= numberOfBins) in operator()
93 binIndex = numberOfBins - 1; in operator()
164 vtkm::cont::ArrayHandle<vtkm::Id> binIndex; in Run() local
165 binIndex.Allocate(numberOfValues); in Run()
172 setHistogramBinDispatcher.Invoke(fieldArray, binIndex); in Run()
175 DeviceAlgorithms::Sort(binIndex); in Run()
[all …]
/dports/graphics/opengv/opengv-91f4b19/src/sac_problems/relative_pose/
H A DMultiNoncentralRelativePoseSacProblem.cpp91 while( tempIndices[binIndex] >= (int) indices[binIndex].size() ) in computeModelCoefficients()
93 binIndex++; in computeModelCoefficients()
95 binIndex = 0; in computeModelCoefficients()
99 binIndex, indices[binIndex][tempIndices[binIndex]] ) ); in computeModelCoefficients()
100 (tempIndices[binIndex])++; in computeModelCoefficients()
102 binIndex++; in computeModelCoefficients()
104 binIndex = 0; in computeModelCoefficients()
385 sampleSizes[binIndex]++; in getSampleSizes()
386 binIndex++; in getSampleSizes()
387 if(binIndex >= sampleSizes.size()) in getSampleSizes()
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java248 final int binIndex = binIndex(bins, key); in immutableRemove() local
249 final Element bin = bins[binIndex]; in immutableRemove()
344 final int binIndex = binIndex(newBins, key); in rehash() local
346 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
360 final int binIndex = binIndex(bins, key); in findElement() local
361 return findElement(bins[binIndex], key); in findElement()
422 final int binIndex = binIndex(bins, key); in addNoClone() local
423 Element bin = bins[binIndex]; in addNoClone()
442 final int binIndex = binIndex(bins, key); in replaceNoClone() local
443 Element bin = bins[binIndex]; in replaceNoClone()
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/runtime/
H A DPropertyHashMap.java248 final int binIndex = binIndex(bins, key); in immutableRemove() local
249 final Element bin = bins[binIndex]; in immutableRemove()
344 final int binIndex = binIndex(newBins, key); in rehash() local
346 newBins[binIndex] = new Element(newBins[binIndex], property); in rehash()
360 final int binIndex = binIndex(bins, key); in findElement() local
361 return findElement(bins[binIndex], key); in findElement()
422 final int binIndex = binIndex(bins, key); in addNoClone() local
423 Element bin = bins[binIndex]; in addNoClone()
442 final int binIndex = binIndex(bins, key); in replaceNoClone() local
443 Element bin = bins[binIndex]; in replaceNoClone()
[all …]
/dports/devel/spark/spark-2.1.1/mllib/src/main/scala/org/apache/spark/ml/tree/impl/
H A DDTStatsAggregator.scala93 def getImpurityCalculator(featureOffset: Int, binIndex: Int): ImpurityCalculator = {
94 impurityAggregator.getCalculator(allStats, featureOffset + binIndex * statsSize)
107 def update(featureIndex: Int, binIndex: Int, label: Double, instanceWeight: Double): Unit = {
108 val i = featureOffsets(featureIndex) + binIndex * statsSize
128 binIndex: Int,
131 impurityAggregator.update(allStats, featureOffset + binIndex * statsSize,
149 def mergeForFeature(featureOffset: Int, binIndex: Int, otherBinIndex: Int): Unit = {
150 impurityAggregator.merge(allStats, featureOffset + binIndex * statsSize,
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/random/
H A DEmpiricalDistribution.java616 final int binIndex = findBin(x); in density() local
618 return kernel.density(x) * pB(binIndex) / kB(binIndex); in density()
642 final int binIndex = findBin(x); in cumulativeProbability() local
643 final double pBminus = pBminus(binIndex); in cumulativeProbability()
644 final double pB = pB(binIndex); in cumulativeProbability()
654 final double kB = kB(binIndex); in cumulativeProbability()
655 final double lower = binIndex == 0 ? min : binBounds[binIndex - 1]; in cumulativeProbability()
822 final int binIndex = findBin(x); in k() local
823 return getKernel(binStats.get(binIndex)); in k()
832 private double cumBinP(int binIndex) { in cumBinP() argument
[all …]
/dports/math/sprng/sprng5/TESTS/
H A Dserial.cpp74 long binIndex; \
76 binIndex = static_cast<long int>(get_rn() * numDiv); \
77 binIndex *= numDiv; \
78 binIndex += static_cast<long int>(get_rn() * numDiv); \
79 bins[binIndex]++; \
H A Dequidist.cpp79 long binIndex; \
81 binIndex = get_rn() * numDiv; \
82 bins[binIndex]++; \
/dports/math/sprng/sprng5/TESTS/mpitests/
H A Dserial.cpp74 long binIndex; \
76 binIndex = static_cast<long int>(get_rn() * numDiv); \
77 binIndex *= numDiv; \
78 binIndex += static_cast<long int>(get_rn() * numDiv); \
79 bins[binIndex]++; \
H A Dequidist.cpp79 long binIndex; \
81 binIndex = get_rn() * numDiv; \
82 bins[binIndex]++; \
/dports/science/colt/colt/src/cern/jet/stat/quantile/
H A DEquiDepthHistogram.java70 public float endOfBin(int binIndex) { in endOfBin() argument
71 return binBoundaries[binIndex+1]; in endOfBin()
120 public float startOfBin(int binIndex) { in startOfBin() argument
121 return binBoundaries[binIndex]; in startOfBin()
/dports/graphics/opengv/opengv-91f4b19/src/sac_problems/absolute_pose/
H A DMultiNoncentralAbsolutePoseSacProblem.cpp177 size_t binIndex = floor(((double) _adapter.getNumberFrames()) * in getSampleSizes() local
181 sampleSizes[binIndex]++; in getSampleSizes()
182 binIndex++; in getSampleSizes()
183 if(binIndex >= sampleSizes.size()) in getSampleSizes()
184 binIndex = 0; in getSampleSizes()
/dports/biology/mothur/mothur-1.46.1/source/datastructures/
H A Dsharedclrvector.cpp141 vector<float> newData; int binIndex = 0; in remove() local
145 if (i != bins[binIndex]) { in remove()
147 }else if (i == bins[binIndex]) { in remove()
148 binIndex++; in remove()
150 if (binIndex > bins.size()) { //removed all bins in remove()
/dports/biology/bamutil/bamUtil-1.0.15/libStatGen/general/
H A DTabix.cpp156 for(int binIndex = 0; binIndex < ref->n_bin; binIndex++) in readIndex() local
170 Bin* binPtr = &(ref->bins[binIndex]); in readIndex()
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/bam_io/
H A Dbam_index_bai.h561 TBinIndex const & binIndex = index._binIndices[i]; in save() local
565 __int32 numBins = binIndex.size(); in save()
567 for (TBinIndexIter itB = binIndex.begin(), itBEnd = binIndex.end(); itB != itBEnd; ++itB) in save()
686 BamIndex<Bai>::TBinIndex_ binIndex; in build() local
687 appendValue(index._binIndices, binIndex); in build()
704 BamIndex<Bai>::TBinIndex_ binIndex; in build() local
705 appendValue(index._binIndices, binIndex); in build()
782 BamIndex<Bai>::TBinIndex_ binIndex; in build() local
783 …resize(index._binIndices, numRefSeqs, binIndex); // TODO(holtgrew): binIndex is unnecessary if re… in build()
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/phase_unwrapping/src/
H A Dhistogramphaseunwrapping.cpp146 void addEdgeInBin( Edge e, int binIndex);
151 std::vector<Edge> getEdgesFromBin( int binIndex );
352 void HistogramPhaseUnwrapping_Impl::Histogram::addEdgeInBin( Edge e, int binIndex ) in addEdgeInBin() argument
354 bins[binIndex].addEdge(e); in addEdgeInBin()
377 Histogram::getEdgesFromBin( int binIndex ) in getEdgesFromBin() argument
380 temp = bins[binIndex].getEdges(); in getEdgesFromBin()
560 if( binIndex == -1 ) in createAndSortEdge()
562 binIndex = 0; in createAndSortEdge()
564 histogram.addEdgeInBin(e, binIndex); in createAndSortEdge()
568 int binIndex = params.nbrOfSmallBins + in createAndSortEdge() local
[all …]

123