Home
last modified time | relevance | path

Searched refs:nBins (Results 1 – 25 of 141) sorted by relevance

123456

/dports/science/clhep/2.4.1.0/CLHEP/Random/src/
H A DRandGeneral.cc70 nBins(theProbSize), in RandGeneral()
82 nBins(theProbSize), in RandGeneral()
94 nBins(theProbSize), in RandGeneral()
104 if (nBins < 1) { in prepareTable()
111 theIntegralPdf.resize(nBins+1); in prepareTable()
116 for ( ptn = 0; ptn<nBins; ++ptn ) { in prepareTable()
130 if ( theIntegralPdf[nBins] <= 0 ) { in prepareTable()
143 oneOverNbins = 1.0 / nBins; in prepareTable()
160 nBins = 1; in useFlatDistribution()
292 theIntegralPdf.resize(nBins+1); in get()
[all …]
/dports/biology/star/STAR-2.7.9a/source/
H A DBAMoutput.cpp11 nBins=P.outBAMcoordNbins; in BAMoutput()
12 binSize=P.chunkOutBAMsizeBytes/nBins; in BAMoutput()
13 bamArraySize=binSize*nBins; in BAMoutput()
19 binStart=new char* [nBins]; in BAMoutput()
20 binBytes=new uint64 [nBins]; in BAMoutput()
21 binStream=new ofstream* [nBins]; in BAMoutput()
22 binTotalN=new uint [nBins]; in BAMoutput()
23 binTotalBytes=new uint [nBins]; in BAMoutput()
24 for (uint ii=0;ii<nBins;ii++) { in BAMoutput()
49 nBins=0; in BAMoutput()
[all …]
H A DbamSortByCoordinate.cpp12 uint32 nBins=P.outBAMcoordNbins; in bamSortByCoordinate() local
16 for (uint32 ibin=0; ibin<nBins-1; ibin++) {//check all bins in bamSortByCoordinate()
45 for (uint32 ibin1=0; ibin1<nBins; ibin1++) { in bamSortByCoordinate()
46 … uint32 ibin=nBins-1-ibin1;//reverse order to start with the last bin - unmapped reads in bamSortByCoordinate()
56 if (ibin == nBins-1) {//last bin for unmapped reads in bamSortByCoordinate()
76 char **bamBinNames = new char* [nBins]; in bamSortByCoordinate()
78 for (uint32 ibin=0; ibin<nBins; ibin++) { in bamSortByCoordinate()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/hash/
H A DhashGen.h59 int nBins; member
99 return (unsigned)h % nBins; in Hash_DefaultHashFuncStr()
120 return (long)key % nBins; in Hash_DefaultHashFuncInt()
151 int nBins, in Hash_GenAlloc() argument
157 assert(nBins > 0); in Hash_GenAlloc()
159 p->nBins = nBins; in Hash_GenAlloc()
185 bin = (*(p->fHash))(key, p->nBins); in Hash_GenExists()
216 bin = (*(p->fHash))(key, p->nBins); in Hash_GenWriteEntry()
259 bin = (*(p->fHash))(key, p->nBins); in Hash_GenEntry()
303 bin = (*(p->fHash))(key, p->nBins); in Hash_GenRemove()
[all …]
H A DhashFlt.h58 int nBins; member
59 int (* fHash)(int key, int nBins);
92 assert(nBins > 0); in Hash_FltAlloc()
94 p->nBins = nBins; in Hash_FltAlloc()
98 for(i=0; i<nBins; i++) in Hash_FltAlloc()
121 bin = (*(p->fHash))(key, p->nBins); in Hash_FltExists()
154 bin = (*(p->fHash))(key, p->nBins); in Hash_FltWriteEntry()
197 bin = (*(p->fHash))(key, p->nBins); in Hash_FltEntry()
241 bin = (*(p->fHash))(key, p->nBins); in Hash_FltEntryPtr()
281 bin = (*(p->fHash))(key, p->nBins); in Hash_FltRemove()
[all …]
H A DhashPtr.h58 int nBins; member
59 int (* fHash)(int key, int nBins);
92 assert(nBins > 0); in Hash_PtrAlloc()
94 p->nBins = nBins; in Hash_PtrAlloc()
98 for(i=0; i<nBins; i++) in Hash_PtrAlloc()
121 bin = (*(p->fHash))(key, p->nBins); in Hash_PtrExists()
152 bin = (*(p->fHash))(key, p->nBins); in Hash_PtrWriteEntry()
195 bin = (*(p->fHash))(key, p->nBins); in Hash_PtrEntry()
239 bin = (*(p->fHash))(key, p->nBins); in Hash_PtrEntryPtr()
280 bin = (*(p->fHash))(key, p->nBins); in Hash_PtrRemove()
[all …]
H A DhashInt.h35 extern int Hash_DefaultHashFunc(int key, int nBins);
58 int nBins; member
59 int (* fHash)(int key, int nBins);
92 assert(nBins > 0); in Hash_IntAlloc()
94 p->nBins = nBins; in Hash_IntAlloc()
98 for(i=0; i<nBins; i++) in Hash_IntAlloc()
121 bin = (*(p->fHash))(key, p->nBins); in Hash_IntExists()
154 bin = (*(p->fHash))(key, p->nBins); in Hash_IntWriteEntry()
197 bin = (*(p->fHash))(key, p->nBins); in Hash_IntEntry()
241 bin = (*(p->fHash))(key, p->nBins); in Hash_IntEntryPtr()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/fraig/
H A DfraigTable.c53 p->nBins = Abc_PrimeCudd(nSize); in Fraig_HashTableCreate()
108 if ( p->nEntries >= 2 * p->nBins ) in Fraig_HashTableLookupS()
143 Key = pNode->uHashR % p->nBins; in Fraig_HashTableLookupF()
167 if ( p->nEntries >= 2 * p->nBins ) in Fraig_HashTableLookupF()
200 Key = pNode->uHashD % p->nBins; in Fraig_HashTableLookupF0()
211 if ( p->nEntries >= 2 * p->nBins ) in Fraig_HashTableLookupF0()
275 for ( i = 0; i < p->nBins; i++ ) in Fraig_TableResizeS()
289 p->nBins = nBinsNew; in Fraig_TableResizeS()
319 for ( i = 0; i < p->nBins; i++ ) in Fraig_TableResizeF()
336 p->nBins = nBinsNew; in Fraig_TableResizeF()
[all …]
/dports/science/colt/colt/src/cern/jet/random/
H A DEmpirical.java87 int nBins = cdf.length-1; in nextDouble() local
89 int nabove = nBins; // largest k such that I[k] is known to be > rand in nextDouble()
99 return ((double)nbelow) / nBins; in nextDouble()
110 return (nbelow + 0.5) / nBins; in nextDouble()
114 return (nbelow + binFraction) / nBins; in nextDouble()
159 int nBins = pdf.length; in setState() local
160 this.cdf = new double[nBins+1]; in setState()
163 for (int ptn = 0; ptn<nBins; ++ptn ) { in setState()
168 if (cdf[nBins] <=0.0) throw new IllegalArgumentException("At leat one probability must be > 0.0"); in setState()
169 for (int ptn = 0; ptn < nBins+1; ++ptn ) { in setState()
[all …]
H A DEmpiricalWalker.java241 int nBins = pdf.length; in setState() local
242 this.cdf = new double[nBins+1]; in setState()
245 for (int i = 0; i<nBins; i++ ) { in setState()
249 if (cdf[nBins] <= 0.0) throw new IllegalArgumentException("At leat one probability must be > 0.0"); in setState()
251 for (int i = 0; i < nBins+1; i++ ) { in setState()
252 cdf[i] /= cdf[nBins]; in setState()
/dports/misc/openmvg/openMVG-2.0/src/third_party/histogram/
H A Dhistogram.hpp52 const size_t& nBins = 10): in Histogram() argument
55 nBins_by_interval(nBins/(End-Start)), in Histogram()
56 nBins(nBins), in Histogram()
60 freq.resize(nBins, 0); in Histogram()
83 if( i < nBins ) ++freq[i]; in Add()
107 std::vector<T> vec_XbinValue(nBins, T(0)); in GetXbinsValue()
108 double val = (End-Start)/static_cast<double>(nBins-1); in GetXbinsValue()
109 for (size_t i = 0; i < nBins; ++i) in GetXbinsValue()
138 size_t nBins; // number of bins member in __anone01f32090111::Histogram
/dports/misc/glow/glow-f24d960e3cc80db95ac0bc17b1900dbf60ca044a/lib/Quantization/Base/
H A DProfile.cpp26 static size_t getBin(size_t nBins, float binWidth, float minValue, in getBin() argument
32 nBins - 1); in getBin()
48 size_t nBins = existingHistogram.size(); in generateTensorHistogram() local
55 float destBinWidth = (newMax - newMin) / nBins; in generateTensorHistogram()
56 float srcBinWidth = (max - min) / nBins; in generateTensorHistogram()
58 std::vector<float> scaledHistogram(nBins, 0); in generateTensorHistogram()
60 for (size_t i = 0; i < nBins; ++i) { in generateTensorHistogram()
81 size_t newBin = getBin(nBins, destBinWidth, newMin, srcBinBegin); in generateTensorHistogram()
86 getBin(nBins, destBinWidth, newMin, srcBinBegin + destBinWidth); in generateTensorHistogram()
101 float binWidth = (max - min) / nBins; in generateTensorHistogram()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/nm/
H A DnmTable.c75 if ( p->nEntries > p->nBins * p->nSizeFactor ) in Nm_ManTableAdd()
79 ppSpot = p->pBinsI2N + Nm_HashNumber(pEntry->ObjId, p->nBins); in Nm_ManTableAdd()
92 ppSpot = p->pBinsN2I + Nm_HashString(pEntry->Name, p->nBins); in Nm_ManTableAdd()
119 ppSpot = p->pBinsI2N + Nm_HashNumber(ObjId, p->nBins); in Nm_ManTableDelete()
125 ppSpot = p->pBinsN2I + Nm_HashString(pEntry->Name, p->nBins); in Nm_ManTableDelete()
226 for ( e = 0; e < p->nBins; e++ ) in Nm_ManProfile()
235 for ( e = 0; e < p->nBins; e++ ) in Nm_ManProfile()
264 nBinsNew = Abc_PrimeCudd( p->nGrowthFactor * p->nBins ); in Nm_ManResize()
272 for ( e = 0; e < p->nBins; e++ ) in Nm_ManResize()
282 for ( e = 0; e < p->nBins; e++ ) in Nm_ManResize()
[all …]
H A DnmApi.c55 p->nBins = Abc_PrimeCudd(nSize); in Nm_ManCreate()
56 p->pBinsI2N = ABC_ALLOC( Nm_Entry_t *, p->nBins ); in Nm_ManCreate()
57 p->pBinsN2I = ABC_ALLOC( Nm_Entry_t *, p->nBins ); in Nm_ManCreate()
58 memset( p->pBinsI2N, 0, sizeof(Nm_Entry_t *) * p->nBins ); in Nm_ManCreate()
59 memset( p->pBinsN2I, 0, sizeof(Nm_Entry_t *) * p->nBins ); in Nm_ManCreate()
266 for ( i = 0; i < p->nBins; i++ ) in Nm_ManReturnNameIds()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/mapper/
H A DmapperTable.c56 p->nBins = Abc_PrimeCudd(20000); in Map_SuperTableCreate()
57 p->pBins = ABC_ALLOC( Map_HashEntry_t *, p->nBins ); in Map_SuperTableCreate()
97 if ( p->nEntries >= 2 * p->nBins ) in Map_SuperTableInsertC()
142 if ( p->nEntries >= 2 * p->nBins ) in Map_SuperTableInsert()
145 Key = MAP_TABLE_HASH( uTruth[0], uTruth[1], p->nBins ); in Map_SuperTableInsert()
212 Key = MAP_TABLE_HASH( uTruth[0], uTruth[1], p->nBins ); in Map_SuperTableLookup()
240 nBinsNew = Abc_PrimeCudd(2 * p->nBins); in Map_SuperTableResize()
246 for ( i = 0; i < p->nBins; i++ ) in Map_SuperTableResize()
259 p->nBins = nBinsNew; in Map_SuperTableResize()
325 for ( i = 0; i < p->nBins; i++ ) in Map_SuperTableSortSupergates()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/fsim/
H A DfsimTsim.c214 int Fsim_ManTerStateLookup( unsigned * pState, int nWords, unsigned ** pBins, int nBins ) in Fsim_ManTerStateLookup() argument
218 Hash = Fsim_ManTerStateHash( pState, nWords, nBins ); in Fsim_ManTerStateLookup()
238 int Hash = Fsim_ManTerStateHash( pState, nWords, nBins ); in Fsim_ManTerStateInsert()
239 assert( !Fsim_ManTerStateLookup( pState, nWords, pBins, nBins ) ); in Fsim_ManTerStateInsert()
344 int i, nWords, nBins; in Fsim_ManTerSimulate() local
371 nBins = Abc_PrimeCudd( 500 ); in Fsim_ManTerSimulate()
372 pBins = ABC_ALLOC( unsigned *, nBins ); in Fsim_ManTerSimulate()
373 memset( pBins, 0, sizeof(unsigned *) * nBins ); in Fsim_ManTerSimulate()
383 Fsim_ManTerStateInsert( pState, nWords, pBins, nBins ); in Fsim_ManTerSimulate()
392 if ( Fsim_ManTerStateLookup(pState, nWords, pBins, nBins) ) in Fsim_ManTerSimulate()
[all …]
/dports/graphics/lightzone/LightZone-4.1.8-3-g36e87773/lightcrafts/extsrc/com/lightcrafts/mediax/jai/
H A DHistogram.java551 int nBins = numBins[i]; in getMean() local
993 int nBins = numBins[band]; in getMoment() local
1088 int nBins = numBins[band]; in getEntropy() local
1093 for(int b = 0; b < nBins; b++) { in getEntropy()
1340 int nBins = numBins[band]; in getPTileThreshold() local
1383 int nBins = numBins[band]; in getModeThreshold() local
1442 int nBins = numBins[band]; in getIterativeThreshold() local
1531 int nBins = numBins[band]; in getMaxVarianceThreshold() local
1631 int nBins = numBins[band]; in getMaxEntropyThreshold() local
1718 int nBins = numBins[band]; in getMinErrorThreshold() local
[all …]
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/components/variant/
H A DGraphPanel.java95 int nBins = Math.round((send-sbeg+1.f)/windowSize); in paintComponent() local
103 int plot[][] = new int[readers.length][nBins]; in paintComponent()
105 for (int j = 0; j < nBins; j++) in paintComponent()
117 int plot[] = new int[nBins]; in paintComponent()
122 max = countAll(i, readers[i], sbeg, send, windowSize, nBins, features, plot, max); in paintComponent()
217 int nBins, FeatureVector features, int plot[], int max) in countAll() argument
249 int nBins, FeatureVector features, int plot[], int max) in count() argument
261 max = calc(vcfIndex, record, features, reader, windowSize, nBins, plot, max); in count()
281 max = calc(vcfIndex, record, features, reader, windowSize, nBins, plot, max); in count()
293 AbstractVCFReader reader, int windowSize, int nBins, int plot[], int max) in calc() argument
[all …]
/dports/editors/libreoffice/libreoffice-7.2.6.2/include/comphelper/
H A Dparallelsort.hxx172 Binner(const ValueType* pSamples, size_t nSamples, size_t nBins, bool bThreaded) in Binner() argument
173 : mnTreeArraySize(lcl_round_down_pow2(nBins)) in Binner()
217 const size_t nBins = mnTreeArraySize; in label() local
218 for (size_t nTIdx = 0; nTIdx < nBins; ++nTIdx) in label()
225 for (size_t nIdx = nTIdx; nIdx < nLen; nIdx += nBins) in label()
301 const size_t nBins = lcl_round_down_pow2(nThreadCount); in s3sort() local
303 const size_t nSamples = nOverSamplingFactor * nBins; in s3sort()
307 Sampler<RandItr>::sample(aBegin, aEnd, aSamples.get(), nSamples, nBins); in s3sort()
320 Binner<RandItr, Compare> aBinner(aSamples.get(), nSamples, nBins, bThreaded); in s3sort()
331 for (size_t nBinIdx = 0, nBinStart = 0; nBinIdx < nBins; ++nBinIdx) in s3sort()
[all …]
/dports/editors/libreoffice6/libreoffice-6.4.7.2/include/comphelper/
H A Dparallelsort.hxx173 Binner(const ValueType* pSamples, size_t nSamples, size_t nBins, bool bThreaded) in Binner() argument
174 : mnTreeArraySize(lcl_round_down_pow2(nBins)) in Binner()
218 const size_t nBins = mnTreeArraySize; in label() local
219 for (size_t nTIdx = 0; nTIdx < nBins; ++nTIdx) in label()
226 for (size_t nIdx = nTIdx; nIdx < nLen; nIdx += nBins) in label()
302 const size_t nBins = lcl_round_down_pow2(nThreadCount); in s3sort() local
304 const size_t nSamples = nOverSamplingFactor * nBins; in s3sort()
308 Sampler<RandItr>::sample(aBegin, aEnd, aSamples.get(), nSamples, nBins); in s3sort()
321 Binner<RandItr, Compare> aBinner(aSamples.get(), nSamples, nBins, bThreaded); in s3sort()
332 for (size_t nBinIdx = 0, nBinStart = 0; nBinIdx < nBins; ++nBinIdx) in s3sort()
[all …]
/dports/sysutils/frand/frand-0.1/lib/StreamSampler/
H A DStreamSamplerTest.cpp143 const uint64_t nBins = 100; // vnCounts supposed to be splitted uniformally among bins
150 …vector<uint64_t> vnCounts1(nBins); // count sum(instances per bin) for all trails. (sum(vnCounts) …
151 vector<uint64_t> vnCounts2(nBins);
162 i1 += 1 + Sampler1.AddElement(i1 % nBins);
173 i2 += 1 + Sampler2.AddElement(i2 / (nVals / nBins));
184 …ounts1), end(vnCounts1), begin(vnCounts1), 0.) / (nTrails * nSampleSize / nBins) - (nTrails * nSam…
185 …ounts2), end(vnCounts2), begin(vnCounts2), 0.) / (nTrails * nSampleSize / nBins) - (nTrails * nSam…
186 uint64_t nDF = nBins - 1; // degrees of freedom
/dports/science/kst2/kst-plot-38eddb5322a1d557f9d86ea95d456d76272941e3/old_tests/
H A Dtesthistogram.cpp43 doTest(h1->nBins() == 10); in doTests()
58 doTest(h1->nBins() == 11); in doTests()
70 doTest(h1->nBins() == 9); in doTests()
83 doTest(h1->nBins() == 10); in doTests()
91 doTest(h1->nBins() == 2); in doTests()
99 doTest(h1->nBins() == 2); in doTests()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/util/
H A DutilNam.c52 int nBins; // the number of bins member
88 p->nBins = Abc_PrimeCudd( nObjs ); in Abc_NamStart()
89 p->pBins = ABC_CALLOC( int, p->nBins ); in Abc_NamStart()
212 return sizeof(Abc_Nam_t) + p->iHandle + sizeof(int) * p->nBins + in Abc_NamMemUsed()
231 return sizeof(Abc_Nam_t) + p->nStore + sizeof(int) * p->nBins + in Abc_NamMemAlloc()
330 int * pPlace = (int *)(p->pBins + Abc_NamStrHash( pStr, pLim, p->nBins )); in Abc_NamStrHashFind()
359 p->nBins = Abc_PrimeCudd( 3 * p->nBins ); in Abc_NamStrHashResize()
360 p->pBins = ABC_CALLOC( int, p->nBins ); in Abc_NamStrHashResize()
449 if ( Vec_IntSize(&p->vInt2Handle) > 2 * p->nBins ) in Abc_NamStrFindOrAdd()
485 if ( Vec_IntSize(&p->vInt2Handle) > 2 * p->nBins ) in Abc_NamStrFindOrAddLim()
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/tools/spark/utils/
H A DIntHistogram.java100 int nBins = counts.length; in trim() local
102 if ( nBins * nUntrackedObservations >= totalObservations ) { in trim()
107 nUntrackedObservations += counts[nBins - 2]; in trim()
108 nBins -= 1; in trim()
109 } while ( nBins * nUntrackedObservations < totalObservations ); in trim()
111 nBins += 1; in trim()
112 nUntrackedObservations -= counts[nBins - 2]; in trim()
113 final long[] newCounts = Arrays.copyOfRange(counts, 0, nBins); in trim()
114 newCounts[nBins - 1] = nUntrackedObservations; in trim()
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/xfeatures2d/src/
H A Dmsd.cpp528 int nBins = 36; in computeOrientation() local
529 float step = float((2 * CV_PI) / nBins); in computeOrientation()
530 std::vector<float> hist(nBins, 0); in computeOrientation()
570 CV_Assert(bin >= 0 && bin < nBins); in computeOrientation()
578 hist[(bin + nBins - 1) % nBins] += weightB; in computeOrientation()
580 hist[(bin + 1) % nBins] += weightB; in computeOrientation()
587 for (int i = 0; i < nBins; i++) in computeOrientation()
597 int r = (bestBin + 1) % nBins; in computeOrientation()
599 …bestAngle2 = (bestAngle2 < 0) ? nBins + bestAngle2 : (bestAngle2 >= nBins) ? bestAngle2 - nBins : … in computeOrientation()
613 int nBins = 36; in nonMaximaSuppression() local
[all …]

123456