| /dports/biology/mothur/mothur-1.46.1/source/commands/ |
| H A D | unifracweightedcommand.cpp | 679 int numPairs = remainingPairs; //case for last processor in createProcesses() local
680 if (remainingProcessors != 1) { numPairs = ceil(remainingPairs / remainingProcessors); } in createProcesses()
681 lines.push_back(linePair(startIndex, numPairs)); //startIndex, numPairs in createProcesses()
682 startIndex = startIndex + numPairs; in createProcesses()
683 remainingPairs = remainingPairs - numPairs; in createProcesses()
|
| /dports/games/stonesoup/crawl-0.27.1/crawl-ref/source/ |
| H A D | mapmark.cc | 529 short numPairs = unmarshallShort(inf); in read() local
530 for (short i = 0; i < numPairs; i++) in read()
|
| /dports/games/retroarch/RetroArch-1.9.7/deps/7zip/ |
| H A D | LzmaEnc.c | 310 unsigned numPairs; member
987 unsigned numPairs; in ReadMatchDistances() local
1004 if (numPairs == 0) in ReadMatchDistances()
1142 numPairs = p->numPairs; in GetOptimum()
1384 p->numPairs = numPairs; in GetOptimum()
1733 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1735 numPairs += 2; in GetOptimum()
1879 numPairs = p->numPairs; in GetOptimumFast()
1925 while (numPairs > 2) in GetOptimumFast()
1933 numPairs -= 2; in GetOptimumFast()
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/ |
| H A D | ClassReader.java | 2394 int numPairs = readInt(currentOffset + 4); in readCode()
2396 int[] keys = new int[numPairs]; in readCode()
2397 Label[] values = new Label[numPairs]; in readCode()
2398 for (int i = 0; i < numPairs; ++i) { in readCode()
|
| /dports/archivers/7-zip/7-zip-21.07/CPP/7zip/Compress/ |
| H A D | DeflateEncoder.cpp | 268 const UInt32 numPairs = (UInt32)((_btMode ? in GetMatches() local
272 *m_MatchDistances = (UInt16)numPairs; in GetMatches()
274 if (numPairs != 0) in GetMatches()
277 for (i = 0; i < numPairs; i += 2) in GetMatches()
282 UInt32 len = distanceTmp[(size_t)numPairs - 2]; in GetMatches()
287 const Byte *pby2 = pby - (distanceTmp[(size_t)numPairs - 1] + 1); in GetMatches()
295 m_Pos += numPairs + 1; in GetMatches()
|
| /dports/emulators/mgba/mgba-0.9.2/src/third-party/lzma/ |
| H A D | LzmaEnc.c | 308 unsigned numPairs; member
984 unsigned numPairs; in ReadMatchDistances() local
1001 if (numPairs == 0) in ReadMatchDistances()
1139 numPairs = p->numPairs; in GetOptimum()
1381 p->numPairs = numPairs; in GetOptimum()
1730 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1732 numPairs += 2; in GetOptimum()
1876 numPairs = p->numPairs; in GetOptimumFast()
1922 while (numPairs > 2) in GetOptimumFast()
1930 numPairs -= 2; in GetOptimumFast()
[all …]
|
| /dports/graphics/opencv/opencv-4.5.3/modules/dnn/src/torch/ |
| H A D | torch_importer.cpp | 308 int numPairs = readInt(); in readTorchTable() local
310 for (int i = 0; i < numPairs; i++) in readTorchTable()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/lldb/source/Target/ |
| H A D | PathMappingList.cpp | 124 unsigned int numPairs = m_pairs.size(); in Dump() local
128 for (index = 0; index < numPairs; ++index) in Dump()
133 if (static_cast<unsigned int>(pair_index) < numPairs) in Dump()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lldb/source/Target/ |
| H A D | PathMappingList.cpp | 124 unsigned int numPairs = m_pairs.size(); in Dump() local
128 for (index = 0; index < numPairs; ++index) in Dump()
133 if (static_cast<unsigned int>(pair_index) < numPairs) in Dump()
|
| /dports/security/keybase/client-v5.7.1/go/merkletree2/ |
| H A D | util_for_test.go | 266 numPairs := numPairs1 + numPairs2
268 if keysByteLength < 8 && numPairs > 1<<(keysByteLength*8) {
272 keyMap := make(map[string]bool, numPairs)
273 for len(keyMap) < numPairs {
|
| /dports/games/NBlood/NBlood-a1689a4/source/duke3d/src/ |
| H A D | game.cpp | 5280 size_t numPairs = 0, allocSize = 4; in parsedefinitions_game_animsounds() local
5334 if (numPairs >= allocSize) in parsedefinitions_game_animsounds()
5342 animsound_t & sound = animPtr->sounds[numPairs]; in parsedefinitions_game_animsounds()
5346 ++numPairs; in parsedefinitions_game_animsounds()
5351 animPtr->numsounds = numPairs; in parsedefinitions_game_animsounds()
|
| /dports/games/NBlood/NBlood-a1689a4/source/blood/src/ |
| H A D | blood.cpp | 2032 size_t numPairs = 0, allocSize = 4;
2086 if (numPairs >= allocSize)
2094 animsound_t & sound = animPtr->sounds[numPairs];
2098 ++numPairs;
2103 animPtr->numsounds = numPairs;
|
| /dports/games/NBlood/NBlood-a1689a4/source/rr/src/ |
| H A D | game.cpp | 7039 size_t numPairs = 0, allocSize = 4; in parsedefinitions_game_animsounds() local
7093 if (numPairs >= allocSize) in parsedefinitions_game_animsounds()
7101 animsound_t & sound = animPtr->sounds[numPairs]; in parsedefinitions_game_animsounds()
7105 ++numPairs; in parsedefinitions_game_animsounds()
7110 animPtr->numsounds = numPairs; in parsedefinitions_game_animsounds()
|
| /dports/games/libretro-beetle_saturn/beetle-saturn-libretro-ee5b214/deps/lzma-19.00/src/ |
| H A D | LzmaEnc.c | 308 unsigned numPairs; member
|
| /dports/emulators/qemu60/qemu-6.0.0/roms/edk2/BaseTools/Source/C/LzmaCompress/Sdk/C/ |
| H A D | LzmaEnc.c | 295 unsigned numPairs; member
925 unsigned numPairs; in ReadMatchDistances() local
942 if (numPairs == 0) in ReadMatchDistances()
1079 numPairs = p->numPairs; in GetOptimum()
1295 p->numPairs = numPairs; in GetOptimum()
1608 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1610 numPairs += 2; in GetOptimum()
1731 numPairs = p->numPairs; in GetOptimumFast()
1775 while (numPairs > 2) in GetOptimumFast()
1783 numPairs -= 2; in GetOptimumFast()
[all …]
|
| /dports/biology/abyss/abyss-2.3.1/DistanceEst/ |
| H A D | DistanceEst.cpp | 165 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/biology/abyss/abyss-2.3.1/Scaffold/ |
| H A D | longseqdist.cpp | 111 ep.numPairs++; in processQuery()
|
| H A D | scaffold.cc | 213 return m_g[e].numPairs < m_minEdgeWeight; in operator ()()
489 unsigned n = g[u1v2].numPairs; in removeWeakEdges()
490 if (n < g[u1v1].numPairs && n < g[u2v2].numPairs) in removeWeakEdges()
|
| /dports/biology/abyss/abyss-2.3.1/Common/ |
| H A D | Estimate.h | 29 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/biology/abyss/abyss-2.3.1/SimpleGraph/ |
| H A D | SimpleGraph.cpp | 479 minNumPairs = min(minNumPairs, ep.numPairs); in handleEstimate()
550 << " n: " << ep.numPairs in handleEstimate()
654 return estimate.second.numPairs < m_minEdgeWeight; in operator ()()
|
| /dports/biology/abyss/abyss-2.3.1/ParseAligns/ |
| H A D | ParseAligns.cpp | 154 estIt->second.numPairs++; in addEstimate()
200 est.second.numPairs = 1; in doReadIntegrity()
211 est.second.numPairs = 1; in doReadIntegrity()
224 est.second.numPairs = 1; in doReadIntegrity()
249 est.numPairs = 1; in doReadIntegrity()
278 (int)round((double)vecIt->second.distance / (double)vecIt->second.numPairs); in generateDistFile()
279 if (vecIt->second.numPairs >= opt::c && vecIt->second.numPairs != 0 in generateDistFile()
|
| /dports/games/el/Eternal-Lands-1.9.5.9-1/xz/ |
| H A D | LzmaEnc.c | 277 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()
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/science/qmcpack/qmcpack-3.11.0/src/QMCHamiltonians/ |
| H A D | NLPP.cu | 190 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 …]
|
| H A D | NLPP.h | 27 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 D | NonLocalECPotential_CUDA.cpp | 240 int numPairs = 0; in addEnergy() local
251 numPairs++; in addEnergy()
268 if (numPairs != NumPairs_host[iw]) in addEnergy()
270 std::cerr << "numPairs = " << numPairs << std::endl; in addEnergy()
|