| /dports/biology/iqtree/IQ-TREE-2.0.6/tree/ |
| H A D | candidateset.cpp | 170 for (SplitGraph::iterator splitIt = allSplits.begin(); splitIt != allSplits.end(); splitIt++) { in addCandidateSplits() local
172 Split *sp = candSplits.findSplit(*splitIt, value); in addCandidateSplits()
177 sp = new Split(*(*splitIt)); in addCandidateSplits()
190 for (SplitGraph::iterator splitIt = allSplits.begin(); splitIt != allSplits.end(); splitIt++) { in removeCandidateSplits() local
193 sp = candSplits.findSplit(*splitIt, value); in removeCandidateSplits()
196 (*splitIt)->report(cout); in removeCandidateSplits()
203 candSplits.eraseSplit(*splitIt); in removeCandidateSplits()
|
| /dports/cad/sumo/sumo-1.2.0/src/utils/router/ |
| H A D | IntermodalNetwork.h | 334 typename std::vector<_IntermodalEdge*>::const_iterator splitIt = splitList.begin(); in getArrivalEdge() local
336 while (splitIt != splitList.end() && totalLength + (*splitIt)->getLength() < pos) { in getArrivalEdge()
337 totalLength += (*splitIt)->getLength(); in getArrivalEdge()
338 ++splitIt; in getArrivalEdge()
340 return *splitIt; in getArrivalEdge()
512 typename std::vector<_IntermodalEdge*>::iterator splitIt = splitList.begin(); in addAccess() local
515 while (splitIt != splitList.end() && totalLength < pos) { in addAccess()
516 totalLength += (*splitIt)->getLength(); in addAccess()
517 last = *splitIt; in addAccess()
518 ++splitIt; in addAccess()
[all …]
|
| /dports/net/eternalterminal/EternalTerminal-et-v5.1.9/src/htm/ |
| H A D | MultiplexerState.cpp | 123 auto splitIt = splits.find(sourcePane->parentId); in newSplit() local
124 if (splitIt != splits.end() && splitIt->second->vertical == vertical) { in newSplit()
128 auto split = splitIt->second; in newSplit()
139 if (splitIt != splits.end()) { in newSplit()
143 auto parentSplit = splitIt->second; in newSplit()
|
| /dports/multimedia/vlc/vlc-3.0.16/modules/demux/adaptive/playlist/ |
| H A D | SegmentInformation.cpp | 607 std::vector<SplitPoint>::const_iterator splitIt; in SplitUsingIndex() local
608 for(splitIt = splitlist.begin(); splitIt < splitlist.end(); ++splitIt) in SplitUsingIndex()
610 split = *splitIt; in SplitUsingIndex()
611 if(splitIt != splitlist.begin()) in SplitUsingIndex()
|
| /dports/www/firefox-esr/firefox-91.8.0/netwerk/cache2/ |
| H A D | CacheFileContextEvictor.cpp | 402 auto splitIt = split.begin(); in LoadEvictInfoFromDisk() local
403 origin = *splitIt; in LoadEvictInfoFromDisk()
404 ++splitIt; in LoadEvictInfoFromDisk()
405 decoded = *splitIt; in LoadEvictInfoFromDisk()
|
| /dports/www/firefox/firefox-99.0/netwerk/cache2/ |
| H A D | CacheFileContextEvictor.cpp | 402 auto splitIt = split.begin(); in LoadEvictInfoFromDisk() local
403 origin = *splitIt; in LoadEvictInfoFromDisk()
404 ++splitIt; in LoadEvictInfoFromDisk()
405 decoded = *splitIt; in LoadEvictInfoFromDisk()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/netwerk/cache2/ |
| H A D | CacheFileContextEvictor.cpp | 402 auto splitIt = split.begin(); in LoadEvictInfoFromDisk() local
403 origin = *splitIt; in LoadEvictInfoFromDisk()
404 ++splitIt; in LoadEvictInfoFromDisk()
405 decoded = *splitIt; in LoadEvictInfoFromDisk()
|
| /dports/graphics/graphos/Graphos-0.7/ |
| H A D | GRBezierPath.h | 48 - (void)subdividePathAtPoint:(NSPoint)p splitIt:(BOOL)split;
|
| H A D | GRDocView.h | 114 - (void)subdividePathAtPoint:(NSPoint)p splitIt:(BOOL)split;
|
| H A D | #GRBezierPath.h# | 48 - (void)subdividePathAtPoint:(NSPoint)p splitIt:(BOOL)split;
|
| H A D | GRDocView.m | 1166 - (void)subdividePathAtPoint:(NSPoint)p splitIt:(BOOL)split
1179 [obj subdividePathAtPoint: p splitIt: split];
1945 [self subdividePathAtPoint: p splitIt: NO];
1947 [self subdividePathAtPoint: p splitIt: YES];
|
| H A D | GRBezierPath.m | 365 - (void)subdividePathAtPoint:(NSPoint)p splitIt:(BOOL)split
|
| /dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/src/FCollada/FCDocument/ |
| H A D | FCDGeometryPolygonsTools.cpp | 1105 UInt32List::iterator splitIt = faceVertexCounts.end(); in FitIndexBuffers() local
1107 for (splitIt = faceVertexCounts.begin(); splitIt != faceVertexCounts.end(); ++splitIt) in FitIndexBuffers()
1109 if (faceVertexCount + (*splitIt) > maximumIndexCount) break; in FitIndexBuffers()
1110 faceVertexCount += (*splitIt); in FitIndexBuffers()
1112 if (splitIt == faceVertexCounts.end()) continue; // Polygons sets fit correctly. in FitIndexBuffers()
1114 size_t splitFaceCount = splitIt - faceVertexCounts.begin(); in FitIndexBuffers()
|
| /dports/devel/kpublictransport/kpublictransport-21.12.3/src/generator/ |
| H A D | generator.cpp | 122 …auto splitIt = std::partition(dataSet.relations.begin(), dataSet.relations.end(), [](const auto &r… in processOSMData() local
125 sort(splitIt, dataSet.relations.end()); in processOSMData()
126 const auto routeMasterCount = std::distance(dataSet.relations.begin(), splitIt); in processOSMData()
|
| /dports/devel/intel-graphics-compiler/intel-graphics-compiler-igc-1.0.9636/visa/ |
| H A D | HWConformity.cpp | 8374 INST_LIST_ITER splitIt = std::prev(it); in fixUnalignedRegions() local
8376 while (insertIt != splitIt) in fixUnalignedRegions()
|