| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
94 make_list(print_edge("tree", on_tree_edge()), in main()
95 print_edge("back", on_back_edge()), in main()
96 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
102 std::make_pair(print_edge("tree", on_tree_edge()), in main()
103 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() function
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
94 make_list(print_edge("tree", on_tree_edge()), in main()
95 print_edge("back", on_back_edge()), in main()
96 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
102 std::make_pair(print_edge("tree", on_tree_edge()), in main()
103 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() argument
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
94 make_list(print_edge("tree", on_tree_edge()), in main()
95 print_edge("back", on_back_edge()), in main()
96 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
102 std::make_pair(print_edge("tree", on_tree_edge()), in main()
103 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() argument
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 template < class Tag > edge_printer< Tag > print_edge(std::string type, Tag) in print_edge() function
91 visitor(make_dfs_visitor(make_list(print_edge("tree", on_tree_edge()), in main()
92 print_edge("back", on_back_edge()), in main()
93 print_edge("forward or cross", on_forward_or_cross_edge()))))); in main()
98 make_bfs_visitor(std::make_pair(print_edge("tree", on_tree_edge()), in main()
99 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 56 template < class Graph > struct print_edge struct
58 print_edge(Graph& g) : G(g) {} in print_edge() function
106 print_edge< Graph >(g)); in operator ()()
112 print_edge< Graph >(g)); in operator ()()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
95 make_list(print_edge("tree", on_tree_edge()), in main()
96 print_edge("back", on_back_edge()), in main()
97 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
103 std::make_pair(print_edge("tree", on_tree_edge()), in main()
104 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() argument
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
95 make_list(print_edge("tree", on_tree_edge()), in main()
96 print_edge("back", on_back_edge()), in main()
97 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
103 std::make_pair(print_edge("tree", on_tree_edge()), in main()
104 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() function
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
95 make_list(print_edge("tree", on_tree_edge()), in main()
96 print_edge("back", on_back_edge()), in main()
97 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
103 std::make_pair(print_edge("tree", on_tree_edge()), in main()
104 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() argument
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
95 make_list(print_edge("tree", on_tree_edge()), in main()
96 print_edge("back", on_back_edge()), in main()
97 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
103 std::make_pair(print_edge("tree", on_tree_edge()), in main()
104 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() function
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | visitor.cpp | 62 edge_printer<Tag> print_edge(std::string type, Tag) { in print_edge() function
95 make_list(print_edge("tree", on_tree_edge()), in main()
96 print_edge("back", on_back_edge()), in main()
97 print_edge("forward or cross", on_forward_or_cross_edge()) in main()
103 std::make_pair(print_edge("tree", on_tree_edge()), in main()
104 print_edge("cycle", on_non_tree_edge()))))); in main()
|
| H A D | vertex_basics.cpp | 59 struct print_edge { struct
60 print_edge(Graph& g) : G(g) { } in print_edge() function
109 print_edge<Graph>(g)); in operator ()()
115 print_edge<Graph>(g)); in operator ()()
|
| /dports/graphics/vcg/vcg.1.30/src/ |
| H A D | grprint.c | 125 static void print_edge _PP(( FILE *f, GEDGE e));
181 print_edge(f,CEDGE(c));
183 print_edge(f,CEDGE2(c));
187 print_edge(f,AKANTE(li));
198 print_edge(f,CEDGE(c));
200 print_edge(f,CEDGE2(c));
204 print_edge(f,AKANTE(li));
215 print_edge(f,CEDGE(c));
221 print_edge(f,AKANTE(li));
515 static void print_edge(FILE *f, GEDGE e) in print_edge() function
[all …]
|
| /dports/biology/sra-tools/sra-tools-2.11.0/tools/sra-pileup/ |
| H A D | rna_splice_log.c | 265 static rc_t print_edge( struct rna_splice_log * sl, in print_edge() function
351 rc = print_edge( sl, ku.key_struct.pos + ku.key_struct.len - 2, true, false ); in on_dict_key_value()
353 rc = print_edge( sl, ku.key_struct.pos, true, true ); in on_dict_key_value()
358 rc = print_edge( sl, ku.key_struct.pos, false, false ); in on_dict_key_value()
360 rc = print_edge( sl, ku.key_struct.pos + ku.key_struct.len - 2, false, true ); in on_dict_key_value()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | print-rtl-function.c | 41 print_edge (FILE *outfile, edge e, bool from) in print_edge() function
98 print_edge (outfile, e, true); in begin_any_block()
114 print_edge (outfile, e, false); in end_any_block()
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | print-rtl-function.c | 41 print_edge (FILE *outfile, edge e, bool from) in print_edge() function
98 print_edge (outfile, e, true); in begin_any_block()
114 print_edge (outfile, e, false); in end_any_block()
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | print-rtl-function.c | 41 print_edge (FILE *outfile, edge e, bool from) in print_edge() function
98 print_edge (outfile, e, true); in begin_any_block()
114 print_edge (outfile, e, false); in end_any_block()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | print-rtl-function.c | 41 print_edge (FILE *outfile, edge e, bool from) in print_edge() function
98 print_edge (outfile, e, true); in begin_any_block()
114 print_edge (outfile, e, false); in end_any_block()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | print-rtl-function.c | 41 print_edge (FILE *outfile, edge e, bool from) in print_edge() function
98 print_edge (outfile, e, true); in begin_any_block()
114 print_edge (outfile, e, false); in end_any_block()
|