| /dports/editors/libreoffice/libreoffice-7.2.6.2/svl/source/inc/ |
| H A D | poolio.hxx | 125 …auto sortIt = std::lower_bound(maSortablePoolItems.begin(), maSortablePoolItems.end(), pNeedle, Co… in erase() local
128 if (sortIt == maSortablePoolItems.end()) in erase()
133 if (**sortIt < *pNeedle) in erase()
139 if (*sortIt == pNeedle) in erase()
141 maSortablePoolItems.erase(sortIt); in erase()
144 ++sortIt; in erase()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/svl/source/inc/ |
| H A D | poolio.hxx | 124 …auto sortIt = std::lower_bound(maSortablePoolItems.begin(), maSortablePoolItems.end(), pNeedle, Co… in erase() local
127 if (sortIt == maSortablePoolItems.end()) in erase()
132 if (**sortIt < *pNeedle) in erase()
138 if (*sortIt == pNeedle) in erase()
140 maSortablePoolItems.erase(sortIt); in erase()
143 ++sortIt; in erase()
|
| /dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/ |
| H A D | EnrichPlot.py | 186 def AccumulateCounts(predictions, thresh=0, sortIt=1): argument
210 if sortIt:
308 details.sortIt = 1
350 details.sortIt = 0
441 runningCounts = AccumulateCounts(screenRes, sortIt=details.sortIt, thresh=details.threshold)
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/update/ |
| H A D | push_node.cpp | 145 auto sortIt = clausesFound.find(kSortClauseName); in init() local
146 if (sortIt != clausesFound.end()) { in init()
147 auto sortClause = sortIt->second; in init()
|
| /dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmfg/libsrc/ |
| H A D | concatenationloader.cc | 192 OFListIterator(ConcatenationLoader::Info::Instance) sortIt = c->m_Files.begin(); in checkAndInsertInfo()
193 while (sortIt != c->m_Files.end()) in checkAndInsertInfo()
195 if ((*sortIt).m_InConcatenationNumber > inst.m_InConcatenationNumber) in checkAndInsertInfo()
197 sortIt++; in checkAndInsertInfo()
201 c->m_Files.insert(sortIt, inst); in checkAndInsertInfo()
|
| /dports/finance/hs-hledger/hledger-1.19/_cabal_deps/fgl-5.7.0.3/test/Data/Graph/Inductive/Query/ |
| H A D | Properties.hs | 137 sortIt (dom domGraph 1) `shouldMatchList` [ (1, [1])
145 sortIt = map (second sort) function
|
| /dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/fgl-5.7.0.3/test/Data/Graph/Inductive/Query/ |
| H A D | Properties.hs | 137 sortIt (dom domGraph 1) `shouldMatchList` [ (1, [1])
145 sortIt = map (second sort) function
|
| /dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/fgl-5.7.0.3/test/Data/Graph/Inductive/Query/ |
| H A D | Properties.hs | 137 sortIt (dom domGraph 1) `shouldMatchList` [ (1, [1])
145 sortIt = map (second sort) function
|
| /dports/devel/hs-spago/spago-0.20.3/_cabal_deps/fgl-5.7.0.3/test/Data/Graph/Inductive/Query/ |
| H A D | Properties.hs | 137 sortIt (dom domGraph 1) `shouldMatchList` [ (1, [1])
145 sortIt = map (second sort) function
|
| /dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/fgl-5.7.0.3/test/Data/Graph/Inductive/Query/ |
| H A D | Properties.hs | 137 sortIt (dom domGraph 1) `shouldMatchList` [ (1, [1])
145 sortIt = map (second sort) function
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/query/ |
| H A D | query_request.cpp | 586 BSONObjIterator sortIt(_sort); in validate() local
587 while (sortIt.more()) { in validate()
588 BSONElement sortElt = sortIt.next(); in validate()
|
| /dports/archivers/lbzip2/lbzip2-2.5/tests/ |
| H A D | bzip2-0.1pl2.c | 1968 void sortIt ( void ) in sortIt() function
2259 sortIt (); in doReversibleTransformation()
2272 sortIt(); in doReversibleTransformation()
|
| /dports/archivers/bzip/bzip-0.21/ |
| H A D | bzip.c | 1936 void sortIt ( void ) in sortIt() function
2061 sortIt (); in doReversibleTransformation()
|