| /dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/Subgraphs/ |
| H A D | test1.cpp | 99 int nUnique = 0; in testSubgraphs2a() local
105 nUnique += tmp.size(); in testSubgraphs2a()
109 CHECK_INVARIANT(nUnique == 21, ""); in testSubgraphs2a()
122 int nUnique = 0; in testSubgraphs2() local
129 nUnique += tmp.size(); in testSubgraphs2()
140 nUnique = 0; in testSubgraphs2()
146 nUnique += tmp.size(); in testSubgraphs2()
370 int nUnique = 0; in testUniqueSubgraphs2() local
378 nUnique += tmp.size(); in testUniqueSubgraphs2()
396 int nUnique = 0; in testLeak() local
[all …]
|
| /dports/science/cdk/cdk-cdk-2.3/tool/hash/src/main/java/org/openscience/cdk/hash/ |
| H A D | BasicAtomHashGenerator.java | 192 int nUnique = 0; in next() local
200 while (i < nUnique && unique[i] != adjInv) { in next()
206 included[i] = (i == nUnique) ? unique[nUnique++] = adjInv : rotate(included[i]); in next()
|
| H A D | SuppressedAtomHashGenerator.java | 195 int nUnique = 0; in next() local
206 while (i < nUnique && unique[i] != adjInv) { in next()
212 included[i] = (i == nUnique) ? unique[nUnique++] = adjInv : rotate(included[i]); in next()
|
| /dports/biology/canu/canu-2.2/src/bogart/ |
| H A D | AS_BAT_SplitTig_AtReadEnds.C | 34 nUnique = 0; in breakDesc()
50 uint32 nUnique; // number of reads moved to this new tig variable
249 else breaks[bp].nUnique++; in splitTigAtReadEnds()
273 if (breaks[bp].nRepeat + breaks[bp].nUnique == 0) { in splitTigAtReadEnds()
281 …breaks[bp].tig->_isRepeat = (breaks[bp].nRepeat > breaks[bp].nUnique); // Assign a new repeat/u… in splitTigAtReadEnds()
283 …6u unique reads, tig %5u created.\n", bp, breaks[bp].nRepeat, breaks[bp].nUnique, breaks[bp].tig->… in splitTigAtReadEnds()
|
| /dports/biology/star/STAR-2.7.9a/source/ |
| H A D | Transcript.cpp | 25 nUnique=nAnchor=0; in reset()
35 nUnique+=trIn->nUnique; in add()
|
| H A D | Transcript.h | 54 …uint nUnique, nAnchor; //number of unique pieces in the alignment, number of anchor pieces in the … variable
|
| H A D | ReadAlign_peOverlapMergeMap.cpp | 260 nUnique=t.nUnique; in peOverlapSEtoPE()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/ |
| H A D | giaIso3.c | 119 int nUnique; in Gia_Iso3Unique() local
122 nUnique = Vec_IntSize(vCopy); in Gia_Iso3Unique()
124 return nUnique; in Gia_Iso3Unique()
|
| H A D | giaSimBase.c | 264 int i, nUnique; in Gia_ManSimPatHashPatterns() local
277 nUnique = Vec_MemEntryNum( vStore ); in Gia_ManSimPatHashPatterns()
280 return nUnique; in Gia_ManSimPatHashPatterns()
404 … int nC0s = 0, nC1s = 0, nUnique = Gia_ManSimPatHashPatterns( pGia, nWords, vSims, &nC0s, &nC1s ); in Gia_ManSimProfile() local
406 nWords, nUnique, 100.0*nUnique/Gia_ManCandNum(pGia), Gia_ManCandNum(pGia), nC0s, nC1s ); in Gia_ManSimProfile()
|
| /dports/security/hs-cryptol/cryptol-2.11.0/src/Cryptol/ModuleSystem/ |
| H A D | Name.hs | 79 data Name = Name { nUnique :: {-# UNPACK #-} !Int function
108 compare a b = compare (nUnique a) (nUnique b)
207 nameUnique = nUnique
326 let (nUnique,s') = nextUnique s
333 let (nUnique,s') = nextUnique s
342 , nUnique = 0x01 function
|
| /dports/biology/canu/canu-2.2/src/pipelines/ |
| H A D | simple-repeat-test.pl | 26 my $nUnique = 4;
57 for (my $r=0; $r < $nUnique; $r++) {
|
| /dports/science/py-pyscf/pyscf-2.0.1/pyscf/pbc/mpicc/ |
| H A D | mpi_kpoint_helper.py | 41 self.nUnique = 0
54 self.nUnique += 1
80 self.uniqueList = self.uniqueList.reshape(self.nUnique,-1)
|
| /dports/science/cdk/cdk-cdk-2.3/base/standard/src/main/java/org/openscience/cdk/stereo/ |
| H A D | Stereocenters.java | 374 int nUnique = 0; in labelTrueCenters() local
380 nUnique++; in labelTrueCenters()
392 if (nUnique == ws.length) in labelTrueCenters()
440 int nUnique = 0; in labelIsolatedPara() local
447 nUnique++; in labelIsolatedPara()
460 if (deg == 3 || (deg == 4 && nUnique == 2)) paraElements.add(element); in labelIsolatedPara()
463 … if (deg == 4 && nUnique == 1 && terminal) stereocenters[element.focus] = Stereocenter.Non; in labelIsolatedPara()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/saig/ |
| H A D | saigIsoFast.c | 289 int i, Number, nUnique = 0; in Saig_IsoDetectFast() local
337 nUnique++; in Saig_IsoDetectFast()
338 printf( " Unique = %d\n", nUnique ); in Saig_IsoDetectFast()
|
| /dports/science/lammps/lammps-stable_29Sep2021/lib/atc/ |
| H A D | SparseMatrix-inl.h | 283 const INDEX nUnique = CountUniqueTriplets(); in compress() local
290 INDEX *ja = new INDEX [nUnique]; in compress()
291 T *val = new T [nUnique]; in compress()
298 ia[nRows] = nUnique; in compress()
310 for (i=0; i<nUnique; i++) in compress()
350 _size = nUnique; in compress()
362 INDEX nUnique=1 + _size; in CountUniqueTriplets() local
373 else nUnique++; in CountUniqueTriplets()
375 return nUnique; in CountUniqueTriplets()
|
| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/atc/ |
| H A D | SparseMatrix-inl.h | 283 const INDEX nUnique = CountUniqueTriplets(); in compress() local
290 INDEX *ja = new INDEX [nUnique]; in compress()
291 T *val = new T [nUnique]; in compress()
298 ia[nRows] = nUnique; in compress()
310 for (i=0; i<nUnique; i++) in compress()
350 _size = nUnique; in compress()
362 INDEX nUnique=1 + _size; in CountUniqueTriplets() local
373 else nUnique++; in CountUniqueTriplets()
375 return nUnique; in CountUniqueTriplets()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/writerfilter/source/dmapper/ |
| H A D | FormControlHelper.cxx | 95 sal_uInt16 nUnique = 0; in getForm() local
99 ++nUnique; in getForm()
100 sFormName = sDOCXForm + OUString::number(nUnique); in getForm()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/writerfilter/source/dmapper/ |
| H A D | FormControlHelper.cxx | 96 sal_uInt16 nUnique = 0; in getForm() local
100 ++nUnique; in getForm()
101 sFormName = sDOCXForm + OUString::number(nUnique); in getForm()
|
| /dports/science/ergo/ergo-3.8/source/integrals/ |
| H A D | integrals_2el_K_prep.cc | 464 int nUnique = 0; in identify_needed_elements() local
466 nUnique++; in identify_needed_elements()
475 nUnique++; in identify_needed_elements()
479 longList[i] = new int[nUnique]; in identify_needed_elements()
480 longListCounterList[i] = nUnique; in identify_needed_elements()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/dau/ |
| H A D | dauNonDsd.c | 374 int nUnique = 0, nShared = 0, nFree = 0; in Dau_DecSortSet() local
379 nUnique++; in Dau_DecSortSet()
386 *pnUnique = nUnique; in Dau_DecSortSet()
393 int nUnique = 0, nShared = 0, nFree = 0; in Dau_DecPrintSet() local
394 Dau_DecSortSet( set, nVars, &nUnique, &nShared, &nFree ); in Dau_DecPrintSet()
395 printf( "S =%2d D =%2d C =%2d ", nShared, nUnique+nShared, nShared+nFree+1 ); in Dau_DecPrintSet()
|
| /dports/lang/ghc/ghc-8.10.7/compiler/nativeGen/RegAlloc/Graph/ |
| H A D | Spill.hs | 298 = do nUnique <- newUnique
305 -> RegVirtual (renameVirtualReg nUnique vr)
|
| /dports/science/dftbplus/dftbplus-19.1/prog/dftb+/lib_math/ |
| H A D | sorting.F90 | 768 function unique_int(array, arraySize) result(nUnique)
778 integer :: nUnique local
799 nUnique = ii
|
| /dports/games/scid/scid/src/ |
| H A D | optable.cpp | 924 uint i, j, nUnique = 0; in SortTableLines() local
936 for (j=0; j < nUnique; j++) { in SortTableLines()
945 moves[nUnique].count = 1; in SortTableLines()
946 moves[nUnique].move = lines[i]->GetMove(depth); in SortTableLines()
948 moves[nUnique].lineList = lines[i]; in SortTableLines()
949 nUnique++; in SortTableLines()
955 for (i=0; i < nUnique-1; i++) { in SortTableLines()
956 for (j=i+1; j < nUnique; j++) { in SortTableLines()
980 for (i=0; i < nUnique; i++) { in SortTableLines()
991 for (i=0; i < nUnique; i++) { in SortTableLines()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/vec/ |
| H A D | vecInt.h | 1572 int i, Key, * pEnt, nUnique = 0; in Vec_IntUniqueCount() local
1580 *pEnt = i, nUnique++; in Vec_IntUniqueCount()
1590 return nUnique; in Vec_IntUniqueCount()
1595 int i, Ent, nUnique = Vec_IntUniqueCount( vData, nIntSize, &vMap ); in Vec_IntUniqifyHash() local
1596 vUnique = Vec_IntAlloc( nUnique * nIntSize ); in Vec_IntUniqifyHash()
1603 assert( Vec_IntSize(vUnique) == nUnique * nIntSize ); in Vec_IntUniqifyHash()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/if/ |
| H A D | ifMan.c | 220 int nUnique = 0, nMemTotal = 0; in If_ManStop() local
222 nUnique += Vec_MemEntryNum(p->vTtMem[i]); in If_ManStop()
225 … printf( "Unique truth tables = %d Memory = %.2f MB ", nUnique, 1.0 * nMemTotal / (1<<20) ); in If_ManStop()
|