| /dports/devel/glibmm/glibmm-2.64.2/glib/glibmm/ |
| H A D | vectorutils.h | 226 class SListIterator
238 explicit inline SListIterator(const GSList* node);
241 inline SListIterator<Tr>& operator++();
242 inline const SListIterator<Tr> operator++(int);
244 inline bool operator==(const SListIterator<Tr>& rhs) const;
750 inline SListIterator<Tr>::SListIterator(const GSList* node) : node_(node) in SListIterator() function
755 inline typename SListIterator<Tr>::value_type SListIterator<Tr>::operator*() const
761 inline SListIterator<Tr>& SListIterator<Tr>::operator++()
768 inline const SListIterator<Tr> SListIterator<Tr>::operator++(int)
777 SListIterator<Tr>::operator==(const SListIterator<Tr>& rhs) const
[all …]
|
| /dports/math/ogdf/OGDF/include/ogdf/basic/ |
| H A D | SList.h | 41 template<class E> using SListIterator = SListIteratorBase<E, false>; variable
189 using iterator = SListIterator<E>;
336 iterator end() { return SListIterator<E>(); } in end()
637 SListIterator<E> search(const E &e) { in search()
638 SListIterator<E> i; in search()
655 SListIterator<E> search(const E &e, const COMPARER &comp) { in search()
656 SListIterator<E> i; in search()
859 SListIterator<E> pushFront(const E &x) { in pushFront()
872 SListIterator<E> pushBack(const E &x) { in pushBack()
885 SListIterator<E> insertAfter(const E &x, SListIterator<E> itBefore) { in insertAfter()
[all …]
|
| H A D | Queue.h | 61 using iterator = SListIterator<E>;
220 using iterator = SListIterator<E>;
|
| /dports/devel/eastl/EASTL-3.13.06/include/EASTL/ |
| H A D | slist.h | 133 struct SListIterator struct
136 typedef SListIterator<T, T*, T&> iterator; argument
150 SListIterator(); argument
151 SListIterator(const SListNodeBase* pNode);
152 SListIterator(const iterator& x);
248 typedef SListIterator<T, T*, T&> iterator;
528 inline SListIterator<T, Pointer, Reference>::SListIterator() in SListIterator() function
536 inline SListIterator<T, Pointer, Reference>::SListIterator(const SListNodeBase* pNode) in SListIterator() function
544 inline SListIterator<T, Pointer, Reference>::SListIterator(const iterator& x) in SListIterator() function
569 SListIterator<T, Pointer, Reference>::operator++()
[all …]
|
| /dports/math/ogdf/OGDF/include/ogdf/planarity/boyer_myrvold/ |
| H A D | FindKuratowskis.h | 77 SListIterator<ExternE> externEStart;
78 SListIterator<ExternE> externEEnd;
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/planar_subgraph_fast/ |
| H A D | PlanarSubgraphPQTree.cpp | 80 SListIterator<PQLeafKey<edge,whaInfo*,bool>* > itn = castLeafKeys.begin(); in Reduction()
81 SListIterator<PQLeafKey<edge,whaInfo*,bool>* > itp = itn++; in Reduction()
|
| /dports/math/ogdf/OGDF/include/ogdf/uml/ |
| H A D | UMLGraph.h | 225 SListIterator<UMLGraph::AssociationClass*> it = m_assClassList.begin(); in modelAssociationClasses()
246 SListIterator<UMLGraph::AssociationClass*> it = m_assClassList.begin(); in undoAssociationClasses()
|
| /dports/math/ogdf/OGDF/include/ogdf/planarity/ |
| H A D | BoothLueker.h | 104 NodeArray<SListIterator<adjEntry> > &adjMarker,
|
| /dports/math/ogdf/OGDF/src/ogdf/augmentation/ |
| H A D | PlanarAugmentation.cpp | 501 SListIterator<adjEntry> childIt = m_adjNonChildren[bcNode].begin(); in followPath()
729 SListIterator<edge> edgeIt = newEdges.begin(); in joinPendants()
771 SListIterator<adjEntry> adjIt = m_adjNonChildren[head].begin(); in connectInsideLabel()
1128 SListIterator<node> pathIt = path.begin(); in updateAdjNonChildren()
1130 SListIterator<adjEntry> childIt = m_adjNonChildren[newBlock].begin(); in updateAdjNonChildren()
1131 SListIterator<adjEntry> prevIt = m_adjNonChildren[newBlock].begin(); in updateAdjNonChildren()
|
| H A D | PlanarAugmentationFix.cpp | 933 SListIterator<node> it = path->begin(); in modifyBCRoot()
934 SListIterator<node> it2 = path->begin(); in modifyBCRoot()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/ |
| H A D | BoothLueker.cpp | 413 NodeArray<SListIterator<adjEntry> > adjMarker(G,nullptr); in doEmbed()
501 NodeArray<SListIterator<adjEntry> > &adjMarker, in entireEmbed()
506 SListIterator<adjEntry> it; in entireEmbed()
|
| H A D | MultiEdgeApproxInserter.cpp | 1200 AdjEntryArray<SListIterator<adjEntry> > &pos) in appendToList()
1210 void insertAfterList(SListPure<adjEntry> &adjList, SListIterator<adjEntry> itBefore, adjEntry adj1, in insertAfterList()
1212 AdjEntryArray<SListIterator<adjEntry> > &pos) in insertAfterList()
1368 AdjEntryArray<SListIterator<adjEntry> > pos(PG,nullptr); in doCall()
1389 SListIterator<CutvertexPreference> it = prefs.begin(); in doCall()
|
| /dports/math/ogdf/OGDF/src/ogdf/decomposition/ |
| H A D | DynamicSPQRForest.cpp | 218 SListIterator<node> iT = pathT.backIterator(); in findPathSPQR()
387 SListIterator<node> iT = pathT.begin(); in updateInsertedEdgeSPQR()
388 SListIterator<node> jT = iT; in updateInsertedEdgeSPQR()
603 SListIterator<node> jB = pathB.begin(); in updateInsertedEdge()
604 SListIterator<node> iB = jB; in updateInsertedEdge()
|
| H A D | BCTree.cpp | 242 for (SListIterator<node> iB=pB.backIterator(); tB!=nB; tB=parent(tB)) pB.insertAfter(tB,iB); in findPath()
252 for (SListIterator<node> iB=pB->backIterator(); tB!=nB; tB=parent(tB)) pB->insertAfter(tB,iB); in findPathBCTree()
|
| /dports/math/ogdf/OGDF/include/ogdf/cluster/ |
| H A D | CconnectClusterPlanarEmbed.h | 90 NodeArray<SListIterator<adjEntry> > &adjMarker,
|
| H A D | ClusterSet.h | 84 SListIterator<cluster> it; in clear()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarlayout/ |
| H A D | BiconnectedShellingOrder.cpp | 1189 Array<SListIterator<QType> > posInQ(0, p - 1, SListIterator<QType>()); in findMaxBaseChain()
1205 SListIterator<QType> it, itLimit = posInQ[i]; in findMaxBaseChain()
1208 posInQ[(*it).m_limit] = SListIterator<QType>(); in findMaxBaseChain()
|
| /dports/math/ogdf/OGDF/src/ogdf/uml/ |
| H A D | UMLGraph.cpp | 56 SListIterator<AssociationClass*> it = m_assClassList.begin(); in ~UMLGraph()
551 SListIterator<node> it = m_centerNodes.begin(); in undoStars()
|
| /dports/math/ogdf/OGDF/src/ogdf/cluster/ |
| H A D | CconnectClusterPlanarEmbed.cpp | 893 NodeArray<SListIterator<adjEntry> > adjMarker(*subGraph,nullptr); in recursiveEmbed()
922 SListIterator<adjEntry> it; in recursiveEmbed()
1745 NodeArray<SListIterator<adjEntry> > adjMarker(*biconComp,nullptr); in doEmbed()
1765 NodeArray<SListIterator<adjEntry> > &adjMarker, in entireEmbed()
1770 SListIterator<adjEntry> it; in entireEmbed()
|
| H A D | ClusterPlanRep.cpp | 260 SListIterator<adjEntry> it = outAdj.begin(); in insertBoundary()
|
| /dports/math/ogdf/OGDF/src/ogdf/energybased/ |
| H A D | NodeRespecterLayout.cpp | 495 SListIterator<node> iter = SListIterator<node>(); in updateNodeLoop()
|
| /dports/math/ogdf/OGDF/src/ogdf/orthogonal/internal/ |
| H A D | CommonCompactionConstraintGraphBase.cpp | 179 SListIterator<Tuple2<node, node>> it, itNext, itPrev; in removeRedundantVisibArcs()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/planarization_layout/ |
| H A D | CliqueReplacer.cpp | 177 SListIterator<node> it = m_centerNodes.begin(); in undoStars()
|
| /dports/math/ogdf/OGDF/include/ogdf/planarity/planar_subgraph_fast/ |
| H A D | MaxSequencePQTree.h | 408 SListIterator<PQLeafKey<T,whaInfo*,Y>*> it; in Bubble()
475 SListIterator<PQNode<T,whaInfo*,Y>*> itn; in Bubble()
578 SListIterator<PQLeafKey<T,whaInfo*,Y>*> it; in determineMinRemoveSequence()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/boyer_myrvold/ |
| H A D | FindKuratowskis.cpp | 322 SListIterator<WInfo> it = k.wNodes.begin(); in splitInMinorTypes()
380 SListIterator<ExternE> itExternE = k.externE.begin(); in splitInMinorTypes()
|