Home
last modified time | relevance | path

Searched refs:numPairs (Results 1 – 25 of 312) sorted by relevance

12345678910>>...13

/dports/biology/abyss/abyss-2.3.1/Common/
H A DEstimate.h29 unsigned numPairs; member
38 : distance(distance), numPairs(numPairs), stdDev(stdDev) { } in DistanceEst()
43 && numPairs == o.numPairs
55 if (o.stdDev > 0 || o.numPairs > 0)
57 << '\t' << "FC:i:" << o.numPairs;
66 << " n=" << o.numPairs;
78 o.stdDev = o.numPairs = 0;
85 >> expect(" n =") >> o.numPairs;
91 >> o.numPairs >> expect(",")
132 x.numPairs = a.numPairs + b.numPairs; in operator()
[all …]
/dports/misc/usd/USD-21.11/pxr/usd/pcp/
H A DmapFunction.h197 : numPairs(end-begin) in _Data()
199 if (numPairs == 0) in _Data()
201 if (numPairs <= _MaxLocalPairs) { in _Data()
212 : numPairs(other.numPairs) in _Data()
214 if (numPairs <= _MaxLocalPairs) { in _Data()
224 : numPairs(other.numPairs) in _Data()
226 if (numPairs <= _MaxLocalPairs) { in _Data()
255 if (numPairs <= _MaxLocalPairs) { in ~_Data()
274 return begin() + numPairs; in end()
278 return numPairs == other.numPairs &&
[all …]
H A DmapFunction.cpp275 const int numPairs, in _Map() argument
293 for (int i=0; i < numPairs; ++i) { in _Map()
361 for (int i=0; i < numPairs; ++i) { in _Map()
378 return _Map(path, _data.begin(), _data.numPairs, _data.hasRootIdentity, in MapSourceToTarget()
385 return _Map(path, _data.begin(), _data.numPairs, _data.hasRootIdentity, in MapTargetToSource()
411 inner._data.numPairs + int(inner._data.hasRootIdentity) + in Compose()
412 _data.numPairs + int(_data.hasRootIdentity); in Compose()
487 targetToSource.reserve(_data.numPairs); in GetInverse()
533 boost::hash_combine(hash, _data.numPairs); in Hash()
/dports/science/qmcpack/qmcpack-3.11.0/src/QMCHamiltonians/
H A DNLPP.h27 int numPairs[],
39 int numPairs[],
56 int numPairs[],
73 int numPairs[],
85 int numPairs[],
97 int numPairs[],
112 int numPairs[],
127 int numPairs[],
H A DNLPP.cu190 numPairs[blockIdx.x] = npairs; in find_core_electrons_PBC_kernel()
204 int numPairs[], in find_core_electrons_PBC() argument
226 int numPairs[], in find_core_electrons_PBC() argument
402 numPairs[blockIdx.x] = npairs; in find_core_electrons_PBC_kernel()
559 numPairs[blockIdx.x] = npairs; in find_core_electrons_kernel()
571 int numPairs[], in find_core_electrons() argument
591 int numPairs[], in find_core_electrons() argument
758 numPairs[blockIdx.x] = npairs; in find_core_electrons_kernel()
774 int numPairs[], in find_core_electrons() argument
800 int numPairs[], in find_core_electrons() argument
[all …]
/dports/www/trafficserver/trafficserver-9.1.1/proxy/logging/
H A DLogFieldAliasMap.cc36 LogFieldAliasTable::init(size_t numPairs, ...) in init() argument
38 ink_assert(numPairs > 0); in init()
46 va_start(ap, numPairs); in init()
56 for (n = 1; n < numPairs; n++) { in init()
67 va_start(ap, numPairs); in init()
72 for (n = 0; n < numPairs; n++) { in init()
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake3/q3data/
H A Dp3dlib.c42 int numPairs; member
159 if ( s_curpair < p3d.numPairs ) in P3DGetNextPair()
230 p3d.shaders[p3d.numPairs][k] = '/'; in P3DProcess()
234 p3d.shaders[p3d.numPairs][k] = s_token[j]; in P3DProcess()
239 p3d.shaders[p3d.numPairs][k] = 0; in P3DProcess()
244 if ( ( p = strrchr( p3d.shaders[p3d.numPairs], '/' ) ) != 0 ) in P3DProcess()
267 strcpy( p3d.polysetNames[p3d.numPairs], s_token + strlen( "Obj_" ) ); in P3DProcess()
269 strcpy( p3d.polysetNames[p3d.numPairs], s_token ); in P3DProcess()
275 p3d.numPairs++; in P3DProcess()
/dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3data/
H A Dp3dlib.c42 int numPairs; member
155 if ( s_curpair < p3d.numPairs ) { in P3DGetNextPair()
223 p3d.shaders[p3d.numPairs][k] = '/'; in P3DProcess()
227 p3d.shaders[p3d.numPairs][k] = s_token[j]; in P3DProcess()
232 p3d.shaders[p3d.numPairs][k] = 0; in P3DProcess()
237 if ( ( p = strrchr( p3d.shaders[p3d.numPairs], '/' ) ) != 0 ) { in P3DProcess()
258 strcpy( p3d.polysetNames[p3d.numPairs], s_token + strlen( "Obj_" ) ); in P3DProcess()
261 strcpy( p3d.polysetNames[p3d.numPairs], s_token ); in P3DProcess()
268 p3d.numPairs++; in P3DProcess()
/dports/devel/spark/spark-2.1.1/R/pkg/inst/tests/testthat/
H A Dtest_parallelize_collect.R32 numPairs <- list(list(1, 1), list(1, 2), list(2, 2), list(2, 3)) list
99 numPairsRDDD1 <- parallelize(jsc, numPairs, 1)
100 numPairsRDDD2 <- parallelize(jsc, numPairs, 2)
101 numPairsRDDD3 <- parallelize(jsc, numPairs, 3)
102 expect_equal(collectRDD(numPairsRDDD1), numPairs)
103 expect_equal(collectRDD(numPairsRDDD2), numPairs)
104 expect_equal(collectRDD(numPairsRDDD3), numPairs)
/dports/textproc/zorba/zorba-2.7.0/src/runtime/json/
H A Djson_constructors.cpp251 csize numPairs = values.size(); in JSONDirectObjectIterator() local
253 theChildren.resize(2 * numPairs); in JSONDirectObjectIterator()
255 theCopyInputs.resize(numPairs); in JSONDirectObjectIterator()
257 for (csize i = 0; i < numPairs; ++i) in JSONDirectObjectIterator()
268 theChildren[numPairs + i].transfer(values[i]); in JSONDirectObjectIterator()
289 csize numPairs = theChildren.size() / 2; in nextImpl() local
291 std::vector<store::Item_t> names(numPairs); in nextImpl()
292 std::vector<store::Item_t> values(numPairs); in nextImpl()
302 for (csize i = 0; i < numPairs; ++i) in nextImpl()
305 consumeNext(value, theChildren[numPairs + i], planState); in nextImpl()
/dports/biology/abyss/abyss-2.3.1/DistanceEst/
H A DDistanceEst.cpp165 unsigned& numPairs) in estimateDistanceUsingMean() argument
177 numPairs = n; in estimateDistanceUsingMean()
189 unsigned& numPairs) in estimateDistanceUsingMedian() argument
200 numPairs = n; in estimateDistanceUsingMedian()
221 unsigned& numPairs) in estimateDistance() argument
246 numPairs = fragments.size(); in estimateDistance()
251 if (numPairs < opt::npairs) in estimateDistance()
285 fragmentSizes, pmf, numPairs); in estimateDistance()
290 fragmentSizes, pmf, numPairs); in estimateDistance()
307 pairs, pmf, est.numPairs); in writeEstimate()
[all …]
/dports/devel/bullet/bullet3-3.21/src/Bullet3OpenCL/BroadphaseCollision/
H A Db3GpuGridBroadphase.cpp162 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
164 if (numPairs > maxPairs) in calculateOverlappingPairs()
166 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
167 numPairs = maxPairs; in calculateOverlappingPairs()
232 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
233 if (numPairs > maxPairs) in calculateOverlappingPairs()
235 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
236 numPairs = maxPairs; in calculateOverlappingPairs()
239 m_gpuPairs.resize(numPairs); in calculateOverlappingPairs()
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3OpenCL/BroadphaseCollision/
H A Db3GpuGridBroadphase.cpp162 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
164 if (numPairs > maxPairs) in calculateOverlappingPairs()
166 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
167 numPairs = maxPairs; in calculateOverlappingPairs()
232 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
233 if (numPairs > maxPairs) in calculateOverlappingPairs()
235 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
236 numPairs = maxPairs; in calculateOverlappingPairs()
239 m_gpuPairs.resize(numPairs); in calculateOverlappingPairs()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3OpenCL/BroadphaseCollision/
H A Db3GpuGridBroadphase.cpp162 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
164 if (numPairs > maxPairs) in calculateOverlappingPairs()
166 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
167 numPairs = maxPairs; in calculateOverlappingPairs()
232 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
233 if (numPairs > maxPairs) in calculateOverlappingPairs()
235 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
236 numPairs = maxPairs; in calculateOverlappingPairs()
239 m_gpuPairs.resize(numPairs); in calculateOverlappingPairs()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3OpenCL/BroadphaseCollision/
H A Db3GpuGridBroadphase.cpp162 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
164 if (numPairs > maxPairs) in calculateOverlappingPairs()
166 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
167 numPairs = maxPairs; in calculateOverlappingPairs()
232 int numPairs = pairCount.at(0); in calculateOverlappingPairs() local
233 if (numPairs > maxPairs) in calculateOverlappingPairs()
235 b3Error("Error running out of pairs: numPairs = %d, maxPairs = %d.\n", numPairs, maxPairs); in calculateOverlappingPairs()
236 numPairs = maxPairs; in calculateOverlappingPairs()
239 m_gpuPairs.resize(numPairs); in calculateOverlappingPairs()
/dports/biology/mothur/mothur-1.46.1/source/calculators/
H A Dparsimony.cpp108 int numPairs = remainingPairs; //case for last processor in createProcesses() local
109 if (remainingProcessors != 1) { numPairs = ceil(remainingPairs / remainingProcessors); } in createProcesses()
110 lines.push_back(linePair(startIndex, numPairs)); //startIndex, numPairs in createProcesses()
111 startIndex = startIndex + numPairs; in createProcesses()
112 remainingPairs = remainingPairs - numPairs; in createProcesses()
/dports/biology/mothur/mothur-1.46.1/source/commands/
H A Dmetastatscommand.cpp350 int numPairs = remainingPairs; //case for last processor in process() local
351 if (remainingProcessors != 1) { numPairs = ceil(remainingPairs / remainingProcessors); } in process()
352 lines.push_back(linePair(startIndex, numPairs)); //startIndex, numPairs in process()
354 for (int i = startIndex; i < startIndex+numPairs; i++) { in process()
369 startIndex = startIndex + numPairs; in process()
370 remainingPairs = remainingPairs - numPairs; in process()
471 int numPairs = remainingPairs; //case for last processor in process() local
473 lines.push_back(linePair(startIndex, numPairs)); //startIndex, numPairs in process()
475 for (int i = startIndex; i < startIndex+numPairs; i++) { in process()
490 startIndex = startIndex + numPairs; in process()
[all …]
/dports/archivers/ppmd-7z/p7zip_9.04/C/
H A DLzmaEnc.c277 UInt32 numPairs; member
830 if (numPairs > 0) in ReadMatchDistances()
952 numPairs = p->numPairs; in GetOptimum()
1106 if (offs == numPairs) in GetOptimum()
1141 p->numPairs = numPairs; in GetOptimum()
1393 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1395 numPairs += 2; in GetOptimum()
1500 numPairs = p->numPairs; in GetOptimumFast()
1544 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1548 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/graphics/blender/blender-2.91.0/extern/lzma/
H A DLzmaEnc.c297 UInt32 numPairs; member
851 if (numPairs > 0) in ReadMatchDistances()
973 numPairs = p->numPairs; in GetOptimum()
1127 if (offs == numPairs) in GetOptimum()
1162 p->numPairs = numPairs; in GetOptimum()
1414 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1416 numPairs += 2; in GetOptimum()
1521 numPairs = p->numPairs; in GetOptimumFast()
1565 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1569 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/archivers/lrzip/lrzip-0.631/lzma/C/
H A DLzmaEnc.c279 UInt32 numPairs; member
832 if (numPairs > 0) in ReadMatchDistances()
954 numPairs = p->numPairs; in GetOptimum()
1108 if (offs == numPairs) in GetOptimum()
1143 p->numPairs = numPairs; in GetOptimum()
1395 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1397 numPairs += 2; in GetOptimum()
1502 numPairs = p->numPairs; in GetOptimumFast()
1546 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1550 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/cad/openctm/OpenCTM-1.0.3/lib/liblzma/
H A DLzmaEnc.c297 UInt32 numPairs; member
851 if (numPairs > 0) in ReadMatchDistances()
973 numPairs = p->numPairs; in GetOptimum()
1127 if (offs == numPairs) in GetOptimum()
1162 p->numPairs = numPairs; in GetOptimum()
1414 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1416 numPairs += 2; in GetOptimum()
1521 numPairs = p->numPairs; in GetOptimumFast()
1565 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1569 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/sysutils/UEFITool/UEFITool-A59/common/LZMA/SDK/C/
H A DLzmaEnc.c273 UInt32 numPairs; member
802 UInt32 lenRes = 0, numPairs; in ReadMatchDistances() local
814 if (numPairs > 0) in ReadMatchDistances()
934 numPairs = p->numPairs; in GetOptimum()
1122 p->numPairs = numPairs; in GetOptimum()
1373 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1375 numPairs += 2; in GetOptimum()
1480 numPairs = p->numPairs; in GetOptimumFast()
1524 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1528 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/sysutils/wiimms/wiimms-iso-tools/src/lzma/
H A DLzmaEnc.c277 UInt32 numPairs; member
830 if (numPairs > 0) in ReadMatchDistances()
952 numPairs = p->numPairs; in GetOptimum()
1106 if (offs == numPairs) in GetOptimum()
1141 p->numPairs = numPairs; in GetOptimum()
1393 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1395 numPairs += 2; in GetOptimum()
1500 numPairs = p->numPairs; in GetOptimumFast()
1544 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1548 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/comms/flamp/flamp-2.2.07/src/lzma/
H A DLzmaEnc.c297 LZ_UInt32 numPairs; member
851 if (numPairs > 0) in ReadMatchDistances()
973 numPairs = p->numPairs; in GetOptimum()
1127 if (offs == numPairs) in GetOptimum()
1162 p->numPairs = numPairs; in GetOptimum()
1414 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1416 numPairs += 2; in GetOptimum()
1521 numPairs = p->numPairs; in GetOptimumFast()
1565 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1569 numPairs -= 2; in GetOptimumFast()
[all …]
/dports/comms/flwrap/flwrap-1.3.5/src/lzma/
H A DLzmaEnc.c297 UInt32 numPairs; member
851 if (numPairs > 0) in ReadMatchDistances()
973 numPairs = p->numPairs; in GetOptimum()
1127 if (offs == numPairs) in GetOptimum()
1162 p->numPairs = numPairs; in GetOptimum()
1414 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1416 numPairs += 2; in GetOptimum()
1521 numPairs = p->numPairs; in GetOptimumFast()
1565 while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1) in GetOptimumFast()
1569 numPairs -= 2; in GetOptimumFast()
[all …]

12345678910>>...13