/dports/finance/quickfix/quickfix-1.15.1/examples/tradeclientgui/banzai/src/quickfix/banzai/ |
H A D | BanzaiApplication.java | 445 replace40(order, newOrder); in replace() 447 replace41(order, newOrder); in replace() 449 replace42(order, newOrder); in replace() 451 replace42(order, newOrder); in replace() 453 replace42(order, newOrder); in replace() 455 replace42(order, newOrder); in replace() 463 new ClOrdID(newOrder.getID()), in replace40() 479 new ClOrdID(newOrder.getID()), in replace41() 494 new ClOrdID(newOrder.getID()), in replace42() 510 new ClOrdID(newOrder.getID()), in replace43() [all …]
|
/dports/editors/calligra/calligra-3.2.1/libs/flake/commands/ |
H A D | KoShapeReorderCommand.cpp | 81 static void prepare(KoShape *s, QHash<KoShape*, QList<KoShape*> > &newOrder, KoShapeManager *manage… in prepare() argument 84 QHash<KoShape*, QList<KoShape*> >::iterator it(newOrder.find(parent)); in prepare() 85 if (it == newOrder.end()) { in prepare() 98 it = newOrder.insert(parent, children); in prepare() 100 QList<KoShape *> & shapes(newOrder[parent]); in prepare() 131 QHash<KoShape*, QList<KoShape*> > newOrder; in createCommand() local 136 prepare(sortedShapes.at(i), newOrder, manager, move); in createCommand() 141 prepare(sortedShapes.at(i), newOrder, manager, move); in createCommand() 145 QHash<KoShape*, QList<KoShape*> >::ConstIterator newIt(newOrder.constBegin()); in createCommand() 146 for (; newIt!= newOrder.constEnd(); ++newIt) { in createCommand()
|
/dports/finance/quickfix/quickfix-1.15.1/examples/tradeclientgui/banzai/src/quickfix/banzai/ui/ |
H A D | CancelReplacePanel.java | 122 Order newOrder = (Order)order.clone(); in actionPerformed() local 123 newOrder.setQuantity in actionPerformed() 125 newOrder.setLimit in actionPerformed() 127 newOrder.setRejected(false); in actionPerformed() 128 newOrder.setCanceled(false); in actionPerformed() 129 newOrder.setOpen(0); in actionPerformed() 130 newOrder.setExecuted(0); in actionPerformed() 132 application.replace(order, newOrder); in actionPerformed()
|
/dports/graphics/xournalpp/xournalpp-1.1.0/src/undo/ |
H A D | ArrangeUndoAction.cpp | 9 InsertOrder newOrder): in ArrangeUndoAction() argument 10 …ion("ArrangeUndoAction"), layer(layer), description(desc), oldOrder(oldOrder), newOrder(newOrder) { in ArrangeUndoAction() 30 const auto& srcOrder = this->undone ? this->newOrder : this->oldOrder; in applyRearrange() 31 const auto& tgtOrder = this->undone ? this->oldOrder : this->newOrder; in applyRearrange()
|
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/compile/internal/ssa/ |
H A D | looprotate.go | 95 newOrder := make([]*Block, 0, f.NumBlocks()) 100 newOrder = append(newOrder, b) 103 newOrder = append(newOrder, a) 110 f.Blocks = newOrder
|
/dports/www/p5-FAQ-OMatic/FAQ-OMatic-2.719/lib/FAQ/OMatic/ |
H A D | submitItem.pm | 84 my @newOrder = split(/[\s,]+/, $params->{'_partOrder'} || ''); 87 if (scalar @newOrder != $item->numParts()) { 88 FAQ::OMatic::gripe('error', gettexta("Your part order list (%0) ", join(", ", @newOrder)) 94 my %newOrderHash = map { ($_,1) } @newOrder; 98 FAQ::OMatic::gripe('error', gettexta("Your part order list (%0) ", join(", ", @newOrder)) 105 foreach $i (@newOrder) {
|
/dports/sysutils/plasma5-libksysguard/libksysguard-5.23.5/autotests/ |
H A D | signalplottertest.cpp | 101 QList<int> newOrder; in testReorderBeams() local 112 s->reorderBeams(newOrder); in testReorderBeams() 117 newOrder.clear(); in testReorderBeams() 119 s->reorderBeams(newOrder); in testReorderBeams() 125 s->reorderBeams(newOrder); in testReorderBeams() 140 newOrder.clear(); in testReorderBeams() 141 newOrder << 2 << 0 << 1; in testReorderBeams() 151 QList<int> newOrder; in testReorderBeamsWithData() local 171 newOrder.clear(); in testReorderBeamsWithData() 194 newOrder.clear(); in testReorderBeamsWithData() [all …]
|
/dports/devel/R-cran-caret/caret/R/ |
H A D | findCorrelation.R | 49 newOrder <- originalOrder[maxAbsCorOrder] functionVar 69 if(verbose) cat("Compare row", newOrder[i], 70 " and column ", newOrder[j], 77 if (verbose) cat(" so flagging column", newOrder[i], "\n") 83 if (verbose) cat(" so flagging column", newOrder[j], "\n") 89 newOrder[which(deletecol)]
|
/dports/java/bouncycastle15/crypto-169/pg/src/main/java/org/bouncycastle/openpgp/ |
H A D | PGPSecretKeyRingCollection.java | 326 List newOrder = new ArrayList(ringCollection.order); in addSecretKeyRing() local 329 newOrder.add(key); in addSecretKeyRing() 331 return new PGPSecretKeyRingCollection(newSecretRings, newOrder); in addSecretKeyRing() 355 List newOrder = new ArrayList(ringCollection.order); in removeSecretKeyRing() local 359 for (int i = 0; i < newOrder.size(); i++) in removeSecretKeyRing() 361 Long r = (Long)newOrder.get(i); in removeSecretKeyRing() 365 newOrder.remove(i); in removeSecretKeyRing() 370 return new PGPSecretKeyRingCollection(newSecretRings, newOrder); in removeSecretKeyRing()
|
H A D | PGPPublicKeyRingCollection.java | 417 List newOrder = new ArrayList(ringCollection.order); in addPublicKeyRing() local 420 newOrder.add(key); in addPublicKeyRing() 422 return new PGPPublicKeyRingCollection(newPubRings, newOrder); in addPublicKeyRing() 446 List newOrder = new ArrayList(ringCollection.order); in removePublicKeyRing() local 450 for (int i = 0; i < newOrder.size(); i++) in removePublicKeyRing() 452 Long r = (Long)newOrder.get(i); in removePublicKeyRing() 456 newOrder.remove(i); in removePublicKeyRing() 461 return new PGPPublicKeyRingCollection(newPubRings, newOrder); in removePublicKeyRing()
|
/dports/graphics/krita/krita-4.4.8/libs/flake/commands/ |
H A D | KoShapeReorderCommand.cpp | 109 static void prepare(KoShape *s, QMap<KoShape*, QList<KoShape*> > &newOrder, KoShapeManager *manager… in prepare() argument 112 QMap<KoShape*, QList<KoShape*> >::iterator it(newOrder.find(parent)); in prepare() 113 if (it == newOrder.end()) { in prepare() 126 it = newOrder.insert(parent, children); in prepare() 128 QList<KoShape *> & shapes(newOrder[parent]); in prepare() 164 QMap<KoShape*, QList<KoShape*> > newOrder; in createCommand() local 169 prepare(sortedShapes.at(i), newOrder, manager, move); in createCommand() 174 prepare(sortedShapes.at(i), newOrder, manager, move); in createCommand() 178 QMap<KoShape*, QList<KoShape*> >::iterator newIt(newOrder.begin()); in createCommand() 179 for (; newIt!= newOrder.end(); ++newIt) { in createCommand()
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/embedder/ |
H A D | EmbedderMaxFaceBiconnectedGraphsLayers.h | 129 NodeArray< List<adjEntry> >& newOrder, 173 NodeArray< List<adjEntry> >& newOrder, 216 NodeArray< List<adjEntry> >& newOrder, 262 NodeArray< List<adjEntry> >& newOrder, 310 NodeArray< List<adjEntry> >& newOrder, 420 G.sort(v, newOrder[v]); in embed() 435 NodeArray< List<adjEntry> >& newOrder, in adjEntryForNode() 527 NodeArray< List<adjEntry> >& newOrder, in expandEdge() 569 NodeArray< List<adjEntry> >& newOrder, in expandEdgeSNode() 698 NodeArray< List<adjEntry> >& newOrder, in expandEdgePNode() [all …]
|
H A D | EmbedderMaxFaceBiconnectedGraphs.h | 270 NodeArray< List<adjEntry> >& newOrder, 307 NodeArray< List<adjEntry> >& newOrder, 343 NodeArray< List<adjEntry> >& newOrder, 382 NodeArray< List<adjEntry> >& newOrder, 517 G.sort(v, newOrder[v]); in embed() 531 NodeArray< List<adjEntry> >& newOrder, in adjEntryForNode() 561 nodeLength, edgeLength, newOrder, in adjEntryForNode() 619 NodeArray< List<adjEntry> >& newOrder, in expandEdge() 658 NodeArray< List<adjEntry> >& newOrder, in expandEdgeSNode() 757 NodeArray< List<adjEntry> >& newOrder, in expandEdgePNode() [all …]
|
/dports/science/opensph/sph-7de6c044339f649e3d19e61f735a6a24572b792a/core/quantities/ |
H A D | Quantity.cpp | 27 void Holder<TValue>::setOrder(const OrderEnum newOrder) { in setOrder() argument 28 SPH_ASSERT(Size(newOrder) > Size(order)); in setOrder() 29 if (newOrder == OrderEnum::SECOND) { in setOrder() 32 } else if (newOrder == OrderEnum::FIRST) { in setOrder() 36 order = newOrder; in setOrder()
|
/dports/astro/qmapshack/qmapshack-V_1.16.1/src/qmapshack/gis/rte/router/ |
H A D | CRouterOptimization.cpp | 131 qreal CRouterOptimization::createNextBestOrder(const SGisLine& oldOrder, SGisLine& newOrder) in createNextBestOrder() argument 164 newOrder = SGisLine(oldOrder); in createNextBestOrder() 171 newOrder.move(bestInsertedItemIndex, bestBaseIndex); in createNextBestOrder() 175 newOrder.move(bestInsertedItemIndex, bestBaseIndex + 1); in createNextBestOrder() 181 qreal CRouterOptimization::twoOptStep(const SGisLine& oldOrder, SGisLine& newOrder) in twoOptStep() argument 214 newOrder = SGisLine(oldOrder); in twoOptStep() 217 std::reverse(newOrder.begin() + bestBeginIndex, newOrder.begin() + bestEndIndex); in twoOptStep()
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/ |
H A D | Renumber.cpp | 19 const std::vector<unsigned int> &newOrder) { in renumberAtoms() argument 21 PRECONDITION(newOrder.size() == nAts, "bad newOrder size"); in renumberAtoms() 25 unsigned int oIdx = newOrder[nIdx]; in renumberAtoms() 39 unsigned int oIdx = newOrder[nIdx]; in renumberAtoms() 78 nConf->setAtomPos(i, (*oConf)->getAtomPos(newOrder[i])); in renumberAtoms()
|
/dports/games/openmw/openmw-openmw-0.47.0/apps/opencs/view/world/ |
H A D | table.cpp | 524 newOrder[0] = row2-row; in moveUpRecord() 525 newOrder[row2-row] = 0; in moveUpRecord() 527 newOrder[i] = i; in moveUpRecord() 557 newOrder[0] = row2-row; in moveDownRecord() 558 newOrder[row2-row] = 0; in moveDownRecord() 560 newOrder[i] = i; in moveDownRecord() 593 newOrder[i] = i; in moveRecords() 616 newOrder.erase(newOrder.begin() + originRow - baseRow - 1); in moveRecords() 617 newOrder.emplace(newOrder.begin() + originRow - baseRow - 1, targetRow - baseRow - 1); in moveRecords() 623 ++newOrder[i]; in moveRecords() [all …]
|
/dports/editors/calligra/calligra-3.2.1/plugins/shapefiltereffects/ |
H A D | ConvolveMatrixEffectConfigWidget.cpp | 157 QPoint newOrder(m_orderX->value(), m_orderY->value()); in orderChanged() local 159 if (newOrder != oldOrder) { in orderChanged() 160 m_effect->setOrder(newOrder); in orderChanged() 161 const int newSize = newOrder.x() * newOrder.y(); in orderChanged() 173 m_targetX->setMaximum(newOrder.x()); in orderChanged() 174 m_targetY->setMaximum(newOrder.y()); in orderChanged()
|
/dports/graphics/alembic/alembic-1.8.3/python/PyAlembic/Tests/ |
H A D | testCurves.py | 76 newOrder = UnsignedCharArray(3) 78 newOrder[ii] = ii 79 curvesSamp.setOrders(newOrder) 83 self.assertEqual(newOrder[ii], ii)
|
/dports/x11-toolkits/itk/itk3.3/generic/ |
H A D | itk_util.c | 84 Tcl_HashEntry** newOrder; local 93 newOrder = (Tcl_HashEntry**)ckalloc((unsigned)2*size); 94 memcpy((VOID*)newOrder, (VOID*)olist->list, (size_t)size); 97 olist->list = newOrder;
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/bundles/org.eclipse.core.resources/src/org/eclipse/core/resources/ |
H A D | ResourcesPlugin.java | 505 List<String> newOrder = new ArrayList<>(); in initializePreferenceLookupOrder() local 507 newOrder.add(ProjectScope.SCOPE); in initializePreferenceLookupOrder() 508 newOrder.addAll(Arrays.asList(original)); in initializePreferenceLookupOrder() 509 service.setDefaultDefaultLookupOrder(newOrder.toArray(new String[newOrder.size()])); in initializePreferenceLookupOrder()
|
/dports/games/openmw/openmw-openmw-0.47.0/apps/opencs/model/world/ |
H A D | collection.hpp | 101 bool reorderRowsImp (int baseIndex, const std::vector<int>& newOrder); 193 bool reorderRows (int baseIndex, const std::vector<int>& newOrder) override; 221 const std::vector<int>& newOrder) in reorderRowsImp() argument 223 if (!newOrder.empty()) in reorderRowsImp() 225 int size = static_cast<int> (newOrder.size()); in reorderRowsImp() 228 std::vector<int> test (newOrder); in reorderRowsImp() 238 buffer[newOrder[i]] = mRecords [baseIndex+i]; in reorderRowsImp() 239 buffer[newOrder[i]].setModified (buffer[newOrder[i]].get()); in reorderRowsImp() 248 iter->second = newOrder.at (iter->second-baseIndex)+baseIndex; in reorderRowsImp() 582 … Collection<ESXRecordT, IdAccessorT>::reorderRows (int baseIndex, const std::vector<int>& newOrder) in reorderRows() argument
|
/dports/math/ogdf/OGDF/src/ogdf/basic/ |
H A D | DualGraph.cpp | 78 List<adjEntry> newOrder; in DualGraph() local 85 newOrder.pushBack(adjDual); in DualGraph() 88 dualGraph.sort(vDual, newOrder); in DualGraph()
|
/dports/science/cdk/cdk-cdk-2.3/descriptor/cip/src/main/java/org/openscience/cdk/geometry/cip/ |
H A D | LigancyFourChirality.java | 123 public LigancyFourChirality project(ILigand[] newOrder) { in project() argument 131 if (!newAtoms[i].getLigandAtom().equals(newOrder[i].getLigandAtom())) { in project() 135 if (newAtoms[j].getLigandAtom().equals(newOrder[i].getLigandAtom())) { in project()
|
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/space/test/ |
H A D | hierarchicspace.cc | 104 int newOrder> 109 int newOrder> 110 …wPolorder< DiscreteSpace< FunctionSpace, GridPart, polOrder, Dune::Fem::CachingStorage>, newOrder > 112 typedef DiscreteSpace< FunctionSpace, GridPart, newOrder, Dune::Fem::CachingStorage> Type;
|