| /dports/security/sudo/sudo-1.9.8p2/plugins/sudoers/ |
| H A D | interfaces.c | 122 const char *ai_end = ai + strlen(ai); in dump_interfaces() local
127 cp = sudo_strsplit(ai, ai_end, " \t", &ep); in dump_interfaces()
130 cp = sudo_strsplit(NULL, ai_end, " \t", &ep); in dump_interfaces()
|
| /dports/biology/abyss/abyss-2.3.1/Unittest/BloomDBG/ |
| H A D | RollingBloomDBGTest.cpp | 102 GraphTraits::adjacency_iterator ai, ai_end; in TEST_F() local
103 boost::tie(ai, ai_end) = adjacent_vertices(GACTC, m_graph); in TEST_F()
104 ASSERT_NE(ai_end, ai); in TEST_F()
110 ASSERT_NE(ai_end, ai); in TEST_F()
114 ASSERT_EQ(ai_end, ai); in TEST_F()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 65 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
66 for (boost::tie(ai, ai_end) = adjacent_vertices(first_vertex, g); in planar_canonical_ordering()
67 ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 69 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
70 for(tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 65 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
66 for (boost::tie(ai, ai_end) = adjacent_vertices(first_vertex, g); in planar_canonical_ordering()
67 ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 65 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
66 for (boost::tie(ai, ai_end) = adjacent_vertices(first_vertex, g); in planar_canonical_ordering()
67 ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | quick_tour.cpp | 58 typename graph_traits<Graph>::adjacency_iterator ai, ai_end; in operator ()() local
59 for (boost::tie(ai,ai_end) = adjacent_vertices(v, g); ai != ai_end; ++ai) in operator ()()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 67 adjacency_iterator_t ai, ai_end; in planar_canonical_ordering() local
68 for(boost::tie(ai,ai_end) = adjacent_vertices(first_vertex,g); ai != ai_end; ++ai) in planar_canonical_ordering()
|