| /dports/biology/ugene/ugene-40.1/src/plugins/genome_aligner/src/ |
| H A D | DataBunch.cpp | 43 sortedIndexes.resize(sortedBitValuesV.size()); in prepareSorted()
44 for (int i = 0; i < sortedIndexes.size(); i++) { in prepareSorted()
45 sortedIndexes[i] = i; in prepareSorted()
47 sortedIndexes.squeeze(); in prepareSorted()
51 SyncSort<BMType, int> s(sortedBitValuesV, sortedIndexes); in prepareSorted()
|
| H A D | DataBunch.h | 41 QVector<int> sortedIndexes; member
|
| H A D | GenomeAlignerFindTask.cpp | 238 int currentW = dataBunch->windowSizes.at(dataBunch->sortedIndexes[i]); in run()
243 …binarySearchResults[dataBunch->sortedIndexes[i]] = index->bitMaskBinarySearch(bv, currentBitFilter… in run()
244 binaryFound += binarySearchResults[dataBunch->sortedIndexes[i]] == -1 ? 0 : 1; in run()
|
| /dports/devel/RStudio/rstudio-2021.09.1-372/src/cpp/r/session/ |
| H A D | RConsoleHistory.cpp | 110 std::vector<int> sortedIndexes; in remove() local
113 std::back_inserter(sortedIndexes)); in remove()
114 std::sort(sortedIndexes.begin(), sortedIndexes.end(),std::greater<int>()); in remove()
117 std::for_each(sortedIndexes.begin(), in remove()
118 sortedIndexes.end(), in remove()
|
| /dports/textproc/duncan/Duncan/ |
| H A D | WordContainer.m | 149 int n = [[self sortedIndexes] count];
178 obje = [[self sortedIndexes] objectEnumerator];
249 - (NSMutableArray *)sortedIndexes
251 id sortedIndexes;
252 // NSLog(@"sortedIndexes %@ %d",string,[NSThread currentThread]);
254 sortedIndexes = wordList;
261 // NSLog(@"exit sortedIndexes %@ %d",string,[NSThread currentThread]);
264 return sortedIndexes;
269 return [[self sortedIndexes] objectAtIndex:i];
|
| H A D | WordContainer.h | 23 - (NSMutableArray *)sortedIndexes;
31 - (NSMutableArray *)sortedIndexes;
|
| H A D | WordFileContainer.m | 61 [self sortedIndexes];
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core.tests.model/workspace/Compiler/src/org/eclipse/jdt/internal/compiler/ast/ |
| H A D | SwitchStatement.java | 104 int[] sortedIndexes = new int[caseCount]; in generateCode() local
123 sortedIndexes[i] = i; in generateCode()
131 CodeStream.sort(localKeysCopy, 0, caseCount - 1, sortedIndexes); in generateCode()
148 codeStream.lookupswitch(defaultLabel, constants, sortedIndexes, caseLabels); in generateCode()
156 sortedIndexes, in generateCode()
160 codeStream.lookupswitch(defaultLabel, constants, sortedIndexes, caseLabels); in generateCode()
|
| /dports/java/eclipse-ecj/eclipse-ecj-4.4.2_1/org/eclipse/jdt/internal/compiler/ast/ |
| H A D | SwitchStatement.java | 213 int[] sortedIndexes = new int[uniqHashCount]; // hash code are sorted already anyways. in generateCodeForStringSwitch() local
215 sortedIndexes[i] = i; in generateCodeForStringSwitch()
235 codeStream.lookupswitch(defaultCaseLabel, this.constants, sortedIndexes, hashCodeCaseLabels); in generateCodeForStringSwitch()
357 int[] sortedIndexes = new int[this.caseCount]; in generateCode() local
360 sortedIndexes[i] = i; in generateCode()
364 CodeStream.sort(localKeysCopy, 0, this.caseCount - 1, sortedIndexes); in generateCode()
373 codeStream.lookupswitch(defaultLabel, this.constants, sortedIndexes, caseLabels); in generateCode()
381 sortedIndexes, in generateCode()
385 codeStream.lookupswitch(defaultLabel, this.constants, sortedIndexes, caseLabels); in generateCode()
|
| /dports/misc/parley/parley-21.12.3/src/collection/ |
| H A D | vocabularymodel.cpp | 358 QModelIndexList sortedIndexes = indexes; in mimeData() local
359 std::sort(sortedIndexes.begin(), sortedIndexes.end()); in mimeData()
364 for (const QModelIndex &index : qAsConst(sortedIndexes)) { in mimeData()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/ast/ |
| H A D | SwitchStatement.java | 329 int[] sortedIndexes = new int[uniqHashCount]; // hash code are sorted already anyways. in generateCodeForStringSwitch() local
331 sortedIndexes[i] = i; in generateCodeForStringSwitch()
351 codeStream.lookupswitch(defaultCaseLabel, this.constants, sortedIndexes, hashCodeCaseLabels); in generateCodeForStringSwitch()
500 int[] sortedIndexes = new int[constantCount]; in generateCode() local
503 sortedIndexes[i] = i; in generateCode()
507 CodeStream.sort(localKeysCopy, 0, constantCount - 1, sortedIndexes); in generateCode()
516 codeStream.lookupswitch(defaultLabel, this.constants, sortedIndexes, caseLabels); in generateCode()
524 sortedIndexes, in generateCode()
529 codeStream.lookupswitch(defaultLabel, this.constants, sortedIndexes, caseLabels); in generateCode()
|
| /dports/x11-toolkits/qt5-declarative/kde-qtdeclarative-5.15.2p41/src/quick/items/ |
| H A D | qquicktextnodeengine.cpp | 147 QVarLengthArray<int> *sortedIndexes, int currentIndex) in inOrder() argument
153 inOrder(binaryTree, sortedIndexes, node->leftChildIndex); in inOrder()
155 sortedIndexes->append(currentIndex); in inOrder()
158 inOrder(binaryTree, sortedIndexes, node->rightChildIndex); in inOrder()
232 QVarLengthArray<int> sortedIndexes; // Indexes in tree sorted by x position in processCurrentLine() local
233 BinaryTreeNode::inOrder(m_currentLineTree, &sortedIndexes); in processCurrentLine()
235 Q_ASSERT(sortedIndexes.size() == m_currentLineTree.size()); in processCurrentLine()
258 if (!sortedIndexes.isEmpty()) { in processCurrentLine()
261 for (int i=0; i<=sortedIndexes.size(); ++i) { in processCurrentLine()
263 if (i < sortedIndexes.size()) { in processCurrentLine()
[all …]
|
| H A D | qquicktextnodeengine_p.h | 126 …VarLengthArray<BinaryTreeNode, 16> &binaryTree, QVarLengthArray<int> *sortedIndexes, int currentIn…
|
| /dports/x11-toolkits/qt5-declarative-test/kde-qtdeclarative-5.15.2p41/src/quick/items/ |
| H A D | qquicktextnodeengine.cpp | 147 QVarLengthArray<int> *sortedIndexes, int currentIndex) in inOrder() argument
153 inOrder(binaryTree, sortedIndexes, node->leftChildIndex); in inOrder()
155 sortedIndexes->append(currentIndex); in inOrder()
158 inOrder(binaryTree, sortedIndexes, node->rightChildIndex); in inOrder()
232 QVarLengthArray<int> sortedIndexes; // Indexes in tree sorted by x position in processCurrentLine() local
233 BinaryTreeNode::inOrder(m_currentLineTree, &sortedIndexes); in processCurrentLine()
235 Q_ASSERT(sortedIndexes.size() == m_currentLineTree.size()); in processCurrentLine()
258 if (!sortedIndexes.isEmpty()) { in processCurrentLine()
261 for (int i=0; i<=sortedIndexes.size(); ++i) { in processCurrentLine()
263 if (i < sortedIndexes.size()) { in processCurrentLine()
[all …]
|
| H A D | qquicktextnodeengine_p.h | 126 …VarLengthArray<BinaryTreeNode, 16> &binaryTree, QVarLengthArray<int> *sortedIndexes, int currentIn…
|
| /dports/misc/parley/parley-21.12.3/src/editor/ |
| H A D | vocabularyview.cpp | 268 QModelIndexList sortedIndexes = selectionModel()->selectedIndexes(); in slotEditCopy() local
269 std::sort(sortedIndexes.begin(), sortedIndexes.end()); in slotEditCopy()
270 QMimeData *mimeData = m_model->mimeData(sortedIndexes); in slotEditCopy()
|
| /dports/net/kget/kget-21.12.3/core/ |
| H A D | transfertreemodel.cpp | 580 QModelIndexList sortedIndexes = indexes; in mimeData() local
581 …std::sort(sortedIndexes.begin(), sortedIndexes.end(), [](const QModelIndex &a, const QModelIndex &… in mimeData()
582 foreach (const QModelIndex &index, sortedIndexes) { in mimeData()
|
| /dports/graphics/yacreader/yacreader-9.8.2/common/ |
| H A D | comic.cpp | 474 QVector<quint32> sortedIndexes; in getSections() local
476 sortedIndexes.append(_order.indexOf(name)); in getSections()
485 foreach (quint32 i, sortedIndexes) { in getSections()
|
| /dports/databases/sqlitestudio/sqlitestudio-3.3.3/SQLiteStudio3/guiSQLiteStudio/dbtree/ |
| H A D | dbtreemodel.cpp | 571 QStringList sortedIndexes; in refreshSchemaIndexes() local
574 sortedIndexes = indexes[key]; in refreshSchemaIndexes()
576 sortedIndexes.sort(Qt::CaseInsensitive); in refreshSchemaIndexes()
578 for (const QString& index : sortedIndexes) in refreshSchemaIndexes()
|
| /dports/java/eclipse-ecj/eclipse-ecj-4.4.2_1/org/eclipse/jdt/internal/compiler/codegen/ |
| H A D | CodeStream.java | 2571 int[] sortedIndexes = new int[numberOfHashcodes]; in generateSyntheticBodyForDeserializeLambda() local
2579 sortedIndexes[index] = index; in generateSyntheticBodyForDeserializeLambda()
2584 sort(localKeysCopy, 0, numberOfHashcodes-1, sortedIndexes); in generateSyntheticBodyForDeserializeLambda()
2586 lookupswitch(defaultLabel, keys, sortedIndexes, switchLabels); in generateSyntheticBodyForDeserializeLambda()
2616 sortedIndexes = new int[lambdaCount]; in generateSyntheticBodyForDeserializeLambda()
2623 sortedIndexes[j] = j; in generateSyntheticBodyForDeserializeLambda()
2627 sort(localKeysCopy, 0, lambdaCount-1, sortedIndexes); in generateSyntheticBodyForDeserializeLambda()
2629 lookupswitch(defaultLabel, keys, sortedIndexes, switchLabels); in generateSyntheticBodyForDeserializeLambda()
5824 writeSignedWord(keys[sortedIndexes[i]]); in lookupswitch()
5825 casesLabel[sortedIndexes[i]].branch(); in lookupswitch()
[all …]
|
| /dports/graphics/qgis/qgis-3.22.3/src/core/layertree/ |
| H A D | qgslayertreemodel.cpp | 1039 QModelIndexList sortedIndexes = indexes; in mimeData() local
1040 std::sort( sortedIndexes.begin(), sortedIndexes.end(), std::less<QModelIndex>() ); in mimeData()
1042 QList<QgsLayerTreeNode *> nodesFinal = indexes2nodes( sortedIndexes, true ); in mimeData()
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/src/core/layertree/ |
| H A D | qgslayertreemodel.cpp | 1059 QModelIndexList sortedIndexes = indexes; in mimeData() local
1060 std::sort( sortedIndexes.begin(), sortedIndexes.end(), std::less<QModelIndex>() ); in mimeData()
1062 QList<QgsLayerTreeNode *> nodesFinal = indexes2nodes( sortedIndexes, true ); in mimeData()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/codegen/ |
| H A D | CodeStream.java | 2821 int[] sortedIndexes = new int[numberOfHashcodes]; in generateSyntheticBodyForDeserializeLambda() local
2829 sortedIndexes[index] = index; in generateSyntheticBodyForDeserializeLambda()
2834 sort(localKeysCopy, 0, numberOfHashcodes-1, sortedIndexes); in generateSyntheticBodyForDeserializeLambda()
2836 lookupswitch(defaultLabel, keys, sortedIndexes, switchLabels); in generateSyntheticBodyForDeserializeLambda()
2869 sortedIndexes = new int[syntheticsCount]; in generateSyntheticBodyForDeserializeLambda()
2876 sortedIndexes[j] = j; in generateSyntheticBodyForDeserializeLambda()
2880 sort(localKeysCopy, 0, syntheticsCount-1, sortedIndexes); in generateSyntheticBodyForDeserializeLambda()
2882 lookupswitch(defaultLabel, keys, sortedIndexes, switchLabels); in generateSyntheticBodyForDeserializeLambda()
6347 writeSignedWord(keys[sortedIndexes[i]]); in lookupswitch()
6348 casesLabel[sortedIndexes[i]].branch(); in lookupswitch()
[all …]
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core.tests.model/workspace/Compiler/src/org/eclipse/jdt/internal/compiler/codegen/ |
| H A D | CodeStream.java | 4197 final public void lookupswitch(CaseLabel defaultLabel, int[] keys, int[] sortedIndexes, CaseLabel[]… in lookupswitch() argument
4222 writeSignedWord(keys[sortedIndexes[i]]); in lookupswitch()
4223 casesLabel[sortedIndexes[i]].branch(); in lookupswitch()
5325 …leswitch(CaseLabel defaultLabel, int low, int high, int[] keys, int[] sortedIndexes, CaseLabel[] c… in tableswitch() argument
5354 int key = keys[index = sortedIndexes[j - low]]; in tableswitch()
|
| /dports/www/grafana8/grafana-8.3.6/public/build/ |
| H A D | 7622.0e38943fa459e872fe93.js.map | 1 …sortedIndexes = [];\r\n this._onChange = new Emitter();\r\n this.onChange = this._on…
|