Home
last modified time | relevance | path

Searched defs:Vit (Results 1 – 25 of 38) sorted by relevance

12

/dports/biology/abyss/abyss-2.3.1/Graph/
H A DDepthFirstSearch.h22 typedef typename GTraits::vertex_iterator Vit; typedef
H A DDistIO.h15 typedef typename graph_traits<Graph>::vertex_iterator Vit; in write_dist() typedef
H A DGfaIO.h24 typedef typename graph_traits<Graph>::vertex_iterator Vit; in write_gfa1() typedef
196 typedef typename graph_traits<Graph>::vertex_iterator Vit; in write_gfa2() typedef
H A DAsqgIO.h21 typedef typename graph_traits<Graph>::vertex_iterator Vit; in write_asqg() typedef
H A DContigGraphAlgorithms.h258 typedef typename graph_traits<Graph>::adjacency_iterator Vit; in pruneTips_if() typedef
/dports/biology/abyss/abyss-2.3.1/Layout/
H A Dlayout.cc117 typedef GTraits::vertex_iterator Vit; in filterVertices() typedef
191 typedef graph_traits<Graph>::vertex_iterator Vit; in buildLengthHistogram() typedef
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/adaptagrams/libvpsc/
H A Dblock.h55 typedef Variables::iterator Vit; typedef
/dports/x11-toolkits/gtkada3/gtkada-1688bb8/src/
H A Dglib-graphs-layouts.adb647 Vit : Vertex_Iterator := First (G); variable
670 Vit : Vertex_Iterator := First (G); variable
843 Vit : Vertex_Iterator := First (G); variable
942 Vit : constant Vertex_Iterator := First (G); constant
/dports/science/qmcpack/qmcpack-3.11.0/src/QMCHamiltonians/
H A DForwardWalking.h59 std::vector<RealType>::iterator Vit = Values.begin(); in calculate() local
/dports/biology/abyss/abyss-2.3.1/Assembly/
H A DDotWriter.h17 typedef graph_traits<Graph>::vertex_iterator Vit; typedef
/dports/biology/abyss/abyss-2.3.1/Scaffold/
H A Ddrawgraph.cc185 typedef graph_traits<Graph>::vertex_iterator Vit; in main() typedef
H A Dscaffold.cc225 typedef GTraits::vertex_iterator Vit; in filterGraph() typedef
295 typedef graph_traits<Graph>::adjacency_iterator Vit; in resolveForks() typedef
638 typedef graph_traits<Graph>::vertex_iterator Vit; in buildScaffoldLengthHistogram() typedef
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/adaptagrams/libavoid/
H A Dvpsc.h102 typedef Variables::iterator Vit; typedef
/dports/biology/abyss/abyss-2.3.1/FilterGraph/
H A DFilterGraph.cc404 typedef GTraits::vertex_iterator Vit; in findShortContigs() typedef
523 typedef GTraits::vertex_iterator Vit; in removeContigs_if() typedef
/dports/biology/abyss/abyss-2.3.1/AdjList/
H A DAdjList.cpp167 typedef graph_traits<Graph>::vertex_iterator Vit; in addOverlapsSA() typedef
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Delevator.h62 typedef Item *Vit; typedef
/dports/math/lemon/lemon-1.3.1/lemon/
H A Delevator.h62 typedef Item *Vit; typedef
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Delevator.h62 typedef Item *Vit; typedef
/dports/biology/abyss/abyss-2.3.1/PopBubbles/
H A DPopBubbles.cpp508 typedef GTraits::vertex_iterator Vit; in filterGraph() typedef
/dports/biology/abyss/abyss-2.3.1/MergePaths/
H A DMergePaths.cpp634 typedef graph_traits<PathGraph>::adjacency_iterator Vit; in addMissingEdges() typedef
698 typedef graph_traits<PathGraph>::vertex_iterator Vit; in removeSmallOverlaps() typedef
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DPeriodic_2_triangulation_2.h4489 Vertex_handle2 >::const_iterator Vit; in test_next() typedef
/dports/games/hyperrogue/hyperrogue-12.0f/
H A Dgraph.cpp846 shiftmatrix Vit = V; in drawItemType() local
/dports/mail/rspamd-devel/rspamd-93430bb/contrib/languages-data/
H A Dan.json1 …,"O":7507,"H":3089,"I":5567,"J":2444,"K":1244,"U":4208,"T":7124,"W":1232,"V":6098,"Q":391,"P":1395…
/dports/mail/rspamd/rspamd-3.1/contrib/languages-data/
H A Dan.json1 …,"O":7507,"H":3089,"I":5567,"J":2444,"K":1244,"U":4208,"T":7124,"W":1232,"V":6098,"Q":391,"P":1395…
H A Deu.json1 …19703,"O":18871,"H":20234,"I":17795,"J":9363,"K":12674,"U":5646,"T":16850,"W":3928,"V":9991,"Q":11…

12