Home
last modified time | relevance | path

Searched refs:TIterConst (Results 1 – 25 of 28) sorted by relevance

12

/dports/biology/seqan1/seqan-1.3.1/seqan/graph_types/
H A Dgraph_impl_tree.h170 TIterConst it = begin(g.data_vertex, Standard()); in _rebuildParentMap()
171 TIterConst itEnd = end(g.data_vertex, Standard()); in _rebuildParentMap()
276 TIterConst it = begin(g.data_vertex, Standard()); in numEdges()
277 TIterConst itEnd = end(g.data_vertex, Standard()); in numEdges()
393 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
394 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
629 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
630 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
658 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
659 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
[all …]
H A Dgraph_impl_directed.h158 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in _copyGraph() typedef
165 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
166 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
443 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
444 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
852 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
853 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
895 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
896 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
971 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_automaton.h179 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in _copyGraph() typedef
185 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
186 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
346 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in inDegree() typedef
347 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
348 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
598 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in getAdjacencyMatrix() typedef
599 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
600 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
662 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_undirected.h157 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in _copyGraph() typedef
164 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
165 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
700 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in getAdjacencyMatrix() typedef
701 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
702 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
764 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in write() typedef
765 TIterConst it = begin(g.data_vertex, Standard()); in write()
766 TIterConst itEnd = end(g.data_vertex, Standard()); in write()
H A Dgraph_impl_wordgraph.h197 …ef typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Rooted>::Type TIterConst; in write() typedef
198 for(TIterConst it = begin(g.data_vertex);!atEnd(it);goNext(it)) { in write()
H A Dgraph_impl_hmm.h529 typedef typename Iterator<String<TEdgeStump*>, Standard>::Type TIterConst; in write() typedef
551 TIterConst it = begin(_getVertexString(g), Standard()); in write()
552 TIterConst itEnd = end(_getVertexString(g), Standard()); in write()
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_types/
H A Dgraph_impl_directed.h208 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
465 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
466 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
843 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
844 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
875 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
876 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
915 TIterConst itIn = begin(g.data_vertex, Standard()); in _getVertexAdjacencyVector()
916 TIterConst itEndIn = end(g.data_vertex, Standard()); in _getVertexAdjacencyVector()
992 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_tree.h162 TIterConst it = begin(g.data_vertex, Standard()); in _rebuildParentMap()
163 TIterConst itEnd = end(g.data_vertex, Standard()); in _rebuildParentMap()
264 TIterConst it = begin(g.data_vertex, Standard()); in numEdges()
265 TIterConst itEnd = end(g.data_vertex, Standard()); in numEdges()
374 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
375 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
598 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
599 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
626 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
627 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
[all …]
H A Dgraph_impl_automaton.h165 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in _copyGraph() typedef
171 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
172 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
323 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
324 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
559 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
560 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
599 TIterConst itIn = begin(g.data_vertex, Standard()); in getVertexAdjacencyVector()
600 TIterConst itEndIn = end(g.data_vertex, Standard()); in getVertexAdjacencyVector()
672 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_undirected.h146 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in _copyGraph() typedef
153 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
154 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
669 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in getAdjacencyMatrix() typedef
670 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
671 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
780 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in write() typedef
781 TIterConst it = begin(g.data_vertex, Standard()); in write()
782 TIterConst itEnd = end(g.data_vertex, Standard()); in write()
H A Dgraph_impl_wordgraph.h186 …ef typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Rooted>::Type TIterConst; in write() typedef
187 for(TIterConst it = begin(g.data_vertex);!atEnd(it);goNext(it)) { in write()
H A Dgraph_impl_hmm.h497 typedef typename Iterator<String<TEdgeStump*>, Standard>::Type TIterConst; in write() typedef
516 TIterConst it = begin(_getVertexString(g), Standard()); in write()
517 TIterConst itEnd = end(_getVertexString(g), Standard()); in write()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_types/
H A Dgraph_impl_directed.h208 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
465 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
466 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
843 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
844 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
875 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
876 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
915 TIterConst itIn = begin(g.data_vertex, Standard()); in _getVertexAdjacencyVector()
916 TIterConst itEndIn = end(g.data_vertex, Standard()); in _getVertexAdjacencyVector()
992 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_tree.h162 TIterConst it = begin(g.data_vertex, Standard()); in _rebuildParentMap()
163 TIterConst itEnd = end(g.data_vertex, Standard()); in _rebuildParentMap()
264 TIterConst it = begin(g.data_vertex, Standard()); in numEdges()
265 TIterConst itEnd = end(g.data_vertex, Standard()); in numEdges()
374 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
375 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
598 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
599 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
626 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
627 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
[all …]
H A Dgraph_impl_automaton.h165 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in _copyGraph() typedef
171 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
172 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
323 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
324 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
559 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
560 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
599 TIterConst itIn = begin(g.data_vertex, Standard()); in getVertexAdjacencyVector()
600 TIterConst itEndIn = end(g.data_vertex, Standard()); in getVertexAdjacencyVector()
672 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_undirected.h146 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in _copyGraph() typedef
153 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
154 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
669 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in getAdjacencyMatrix() typedef
670 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
671 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
780 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in write() typedef
781 TIterConst it = begin(g.data_vertex, Standard()); in write()
782 TIterConst itEnd = end(g.data_vertex, Standard()); in write()
H A Dgraph_impl_wordgraph.h186 …ef typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Rooted>::Type TIterConst; in write() typedef
187 for(TIterConst it = begin(g.data_vertex);!atEnd(it);goNext(it)) { in write()
H A Dgraph_impl_hmm.h497 typedef typename Iterator<String<TEdgeStump*>, Standard>::Type TIterConst; in write() typedef
516 TIterConst it = begin(_getVertexString(g), Standard()); in write()
517 TIterConst itEnd = end(_getVertexString(g), Standard()); in write()
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_types/
H A Dgraph_impl_tree.h168 TIterConst it = begin(g.data_vertex, Standard()); in _rebuildParentMap()
169 TIterConst itEnd = end(g.data_vertex, Standard()); in _rebuildParentMap()
274 TIterConst it = begin(g.data_vertex, Standard()); in numEdges()
275 TIterConst itEnd = end(g.data_vertex, Standard()); in numEdges()
391 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
392 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
625 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
626 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
654 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
655 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
[all …]
H A Dgraph_impl_directed.h156 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in _copyGraph() typedef
163 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
164 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
333 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
334 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
579 TIterConst it = begin(g.data_vertex, Standard()); in sourceVertex()
580 TIterConst itEnd = end(g.data_vertex, Standard()); in sourceVertex()
609 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
610 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
662 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_automaton.h172 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in _copyGraph() typedef
178 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
179 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
339 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in inDegree() typedef
340 TIterConst it = begin(g.data_vertex, Standard()); in inDegree()
341 TIterConst itEnd = end(g.data_vertex, Standard()); in inDegree()
584 … typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Standard>::Type TIterConst; in getAdjacencyMatrix() typedef
585 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
586 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
645 TIterConst it = begin(g.data_vertex, Standard()); in write()
[all …]
H A Dgraph_impl_undirected.h154 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in _copyGraph() typedef
161 TIterConst it = begin(source.data_vertex, Standard()); in _copyGraph()
162 TIterConst itEnd = end(source.data_vertex, Standard()); in _copyGraph()
697 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in getAdjacencyMatrix() typedef
698 TIterConst it = begin(g.data_vertex, Standard()); in getAdjacencyMatrix()
699 TIterConst itEnd = end(g.data_vertex, Standard()); in getAdjacencyMatrix()
760 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst; in write() typedef
761 TIterConst it = begin(g.data_vertex, Standard()); in write()
762 TIterConst itEnd = end(g.data_vertex, Standard()); in write()
H A Dgraph_impl_wordgraph.h193 …ef typename Iterator<String<AutomatonEdgeArray<TEdge, TAlphabet> > const, Rooted>::Type TIterConst; in write() typedef
194 for(TIterConst it = begin(g.data_vertex);!atEnd(it);goNext(it)) { in write()
H A Dgraph_impl_hmm.h512 typedef typename Iterator<String<TEdgeStump*>, Standard>::Type TIterConst; in write() typedef
531 TIterConst it = begin(_getVertexString(g), Standard()); in write()
532 TIterConst itEnd = end(_getVertexString(g), Standard()); in write()
/dports/biology/seqan1/seqan-1.3.1/seqan/refinement/
H A Dgraph_impl_align.h716 typedef typename Iterator<String<TEdgeStump*> const, Standard>::Type TIterConst;
721 TIterConst it = begin(g.data_align.data_vertex, Standard());
722 TIterConst itEnd = end(g.data_align.data_vertex, Standard());
968 typedef typename Iterator<String<TEdgeStump*> const, Rooted>::Type TIterConst;
1018 for(TIterConst it = begin(g.data_align.data_vertex);!atEnd(it);goNext(it)) {

12