/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/Composite/ |
H A D | AdjustComposite.py | 78 bestOrder = list(numpy.argsort(scores)) 79 bestOrder.reverse() 80 print('\tTAKE:', bestOrder[:targetSize]) 83 idx = bestOrder[i]
|
/dports/math/py-brial/BRiAl-1.2.10/cudd/ |
H A D | cuddExact.c | 169 DdHalfWord *bestOrder = NULL; in cuddExact() local 226 bestOrder = ALLOC(DdHalfWord, size); in cuddExact() 227 if (bestOrder == NULL) goto cuddExactOutOfMem; in cuddExact() 244 oldOrder[0][i] = bestOrder[i] = (DdHalfWord) table->invperm[i+lower]; in cuddExact() 272 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 291 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 304 result = ddShuffle(table, bestOrder, lower, upper); in cuddExact() 318 FREE(bestOrder); in cuddExact() 329 if (bestOrder != NULL) FREE(bestOrder); in cuddExact() 657 DdHalfWord * bestOrder, in updateUB() argument [all …]
|
/dports/math/cudd/cudd-3.0.0/cudd/ |
H A D | cuddExact.c | 134 DdHalfWord *bestOrder = NULL; in cuddExact() local 191 bestOrder = ALLOC(DdHalfWord, size); in cuddExact() 192 if (bestOrder == NULL) goto cuddExactOutOfMem; in cuddExact() 209 oldOrder[0][i] = bestOrder[i] = (DdHalfWord) table->invperm[i+lower]; in cuddExact() 237 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 256 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 269 result = ddShuffle(table, bestOrder, lower, upper); in cuddExact() 283 FREE(bestOrder); in cuddExact() 294 if (bestOrder != NULL) FREE(bestOrder); in cuddExact() 591 DdHalfWord * bestOrder, in updateUB() argument [all …]
|
/dports/math/brial/BRiAl-1.2.10/cudd/ |
H A D | cuddExact.c | 169 DdHalfWord *bestOrder = NULL; in cuddExact() local 226 bestOrder = ALLOC(DdHalfWord, size); in cuddExact() 227 if (bestOrder == NULL) goto cuddExactOutOfMem; in cuddExact() 244 oldOrder[0][i] = bestOrder[i] = (DdHalfWord) table->invperm[i+lower]; in cuddExact() 272 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 291 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 304 result = ddShuffle(table, bestOrder, lower, upper); in cuddExact() 318 FREE(bestOrder); in cuddExact() 329 if (bestOrder != NULL) FREE(bestOrder); in cuddExact() 657 DdHalfWord * bestOrder, in updateUB() argument [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/cudd/ |
H A D | cuddExact.c | 173 DdHalfWord *bestOrder = NULL; in cuddExact() local 230 bestOrder = ABC_ALLOC(DdHalfWord, size); in cuddExact() 231 if (bestOrder == NULL) goto cuddExactOutOfMem; in cuddExact() 248 oldOrder[0][i] = bestOrder[i] = (DdHalfWord) table->invperm[i+lower]; in cuddExact() 276 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 295 upperBound = updateUB(table,upperBound,bestOrder,lower,upper); in cuddExact() 308 result = ddShuffle(table, bestOrder, lower, upper); in cuddExact() 322 ABC_FREE(bestOrder); in cuddExact() 333 if (bestOrder != NULL) ABC_FREE(bestOrder); in cuddExact() 661 DdHalfWord * bestOrder, in updateUB() argument [all …]
|
/dports/audio/lsp-plugins-lv2/lsp-plugins-1.1.31/scripts/Octave/wienerHammersteinTests/ |
H A D | visualize.m | 106 [~, bestOrder] = max(Jvalues); 108 Bbests = zeros(size(GFix, 1), bestOrder); 109 Abests = zeros(size(GFix, 1), bestOrder); 117 bestOrder, ... 118 bestOrder ...
|
/dports/audio/exhale/exhale-7688ab502ecbd1203bde1e605676f7440cd9fd5e/src/lib/ |
H A D | specAnalysis.cpp | 59 unsigned bestOrder = MAX_PREDICTION_ORDER, predGainCurr, predGainPrev; in getLinPredCoeffs() local 69 while ((bestOrder > 1) && (predGainPrev >= predGainCurr)) // find lowest-order gain maximum in getLinPredCoeffs() 71 bestOrder--; in getLinPredCoeffs() 73 predGainPrev = (m_tnsPredGains[channelIndex] >> (8 * bestOrder - 16)) & UCHAR_MAX; in getLinPredCoeffs() 75 return ((bestOrder == 1) && (m_parCorCoeffs[channelIndex][0] == 0) ? 0 : bestOrder); in getLinPredCoeffs()
|
H A D | exhaleEnc.cpp | 726 uint32_t predGainCurr, predGainPrev, bestOrder = MAX_PREDICTION_ORDER; in getOptParCorCoeffs() local 728 …oeffs (&signal[grpSO[tnsStartSfb]], grpSO[maxSfb] - grpSO[tnsStartSfb], bestOrder, tnsData.coeffPa… in getOptParCorCoeffs() 733 while ((bestOrder > 1) && (predGainPrev >= predGainCurr)) // lowest-order gain max. in getOptParCorCoeffs() 735 bestOrder--; in getOptParCorCoeffs() 737 predGainPrev = (temp >> (8 * bestOrder - 16)) & UCHAR_MAX; in getOptParCorCoeffs() 739 …tnsData.filterOrder[n] = uint8_t ((bestOrder == 1) && (tnsData.coeffParCor[n] == 0) ? 0 : bestOrde… in getOptParCorCoeffs()
|
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/matrix-org/pinecone/router/ |
H A D | state_tree.go | 389 bestOrder := uint64(math.MaxUint64) 408 bestOrder = ann.receiveOrder 433 case ann.receiveOrder < bestOrder:
|
/dports/games/zdoom/zdoom-2.8.1/src/ |
H A D | p_user.cpp | 840 int bestOrder = INT_MAX; in BestWeapon() local 854 if (weap->SelectionOrder > bestOrder) in BestWeapon() 883 bestOrder = weap->SelectionOrder; in BestWeapon()
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 613 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5695 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 5942 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6739 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm10/llvm-10.0.1.src/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 613 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5695 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 5942 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6739 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 613 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5695 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 5942 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6739 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 626 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5873 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 6132 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6948 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 614 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5770 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 6029 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6865 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 632 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5978 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 6238 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6892 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm11/llvm-11.0.1.src/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 614 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5770 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 6029 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6865 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 632 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5978 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 6238 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6892 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm90/llvm-9.0.1.src/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 573 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 5364 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 6195 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm80/llvm-8.0.1.src/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 560 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 4938 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 5766 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/llvm70/llvm-7.0.1.src/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 560 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 4935 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 5755 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 678 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 6887 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 7187 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 7842 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 678 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 6887 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 7187 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 7842 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 678 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 6874 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 7174 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 7829 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 678 Optional<ArrayRef<unsigned>> bestOrder() const { in bestOrder() function in llvm::slpvectorizer::BoUpSLP 6887 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in vectorizeStoreChain() 7187 Optional<ArrayRef<unsigned>> Order = R.bestOrder(); in tryToVectorizeList() 7842 Optional<ArrayRef<unsigned>> Order = V.bestOrder(); in tryToReduce()
|