#include <gdt_graph_array.h>
Public Member Functions | |
gdtedge_array () | |
gdtedge_array (const undi_graph &g) | |
gdtedge_array (const undi_graph &g, E x) | |
gdtedge_array (const self &A) | |
self & | operator= (const self &A) |
const E & | operator[] (struct_gdtedge *i) const |
E & | operator[] (struct_gdtedge *i) |
Definition at line 172 of file gdt_graph_array.h.
gdt::gdtedge_array< E >::gdtedge_array | ( | ) | [inline] |
Definition at line 178 of file gdt_graph_array.h.
gdt::gdtedge_array< E >::gdtedge_array | ( | const undi_graph & | g | ) | [inline] |
Definition at line 179 of file gdt_graph_array.h.
gdt::gdtedge_array< E >::gdtedge_array | ( | const undi_graph & | g, | |
E | x | |||
) | [inline] |
Definition at line 180 of file gdt_graph_array.h.
gdt::gdtedge_array< E >::gdtedge_array | ( | const self & | A | ) | [inline] |
Definition at line 181 of file gdt_graph_array.h.
self& gdt::gdtedge_array< E >::operator= | ( | const self & | A | ) | [inline] |
Reimplemented from gdt::gdt_graph_array< I, OP, E >.
Reimplemented in gdt::gdtedge_map< E >, gdt::gdtedge_map< map_node_set >, gdt::gdtedge_map< struct_draw_edge_info >, gdt::gdtedge_map< std::string >, gdt::gdtedge_map< struct_dime_edge_info >, gdt::gdtedge_map< struct_gdtnode >, gdt::gdtedge_map< struct_gdtedge >, gdt::gdtedge_map< int >, gdt::gdtedge_map< struct_flow_dire_edge_info >, gdt::gdtedge_map< bend_constraint >, gdt::gdtedge_map< struct_plan_edge_info >, gdt::gdtedge_map< struct_undi_edge_info >, gdt::gdtedge_map< struct_face >, gdt::gdtedge_map< struct_split_edge_info >, and gdt::gdtedge_map< struct_SPQR_edge_info >.
Definition at line 183 of file gdt_graph_array.h.
const E& gdt::gdtedge_array< E >::operator[] | ( | struct_gdtedge * | i | ) | const [inline] |
Reimplemented in gdt::gdtedge_map< E >, gdt::gdtedge_map< map_node_set >, gdt::gdtedge_map< struct_draw_edge_info >, gdt::gdtedge_map< std::string >, gdt::gdtedge_map< struct_dime_edge_info >, gdt::gdtedge_map< struct_gdtnode >, gdt::gdtedge_map< struct_gdtedge >, gdt::gdtedge_map< int >, gdt::gdtedge_map< struct_flow_dire_edge_info >, gdt::gdtedge_map< bend_constraint >, gdt::gdtedge_map< struct_plan_edge_info >, gdt::gdtedge_map< struct_undi_edge_info >, gdt::gdtedge_map< struct_face >, gdt::gdtedge_map< struct_split_edge_info >, and gdt::gdtedge_map< struct_SPQR_edge_info >.
Definition at line 184 of file gdt_graph_array.h.
E& gdt::gdtedge_array< E >::operator[] | ( | struct_gdtedge * | i | ) | [inline] |
Reimplemented in gdt::gdtedge_map< E >, gdt::gdtedge_map< map_node_set >, gdt::gdtedge_map< struct_draw_edge_info >, gdt::gdtedge_map< std::string >, gdt::gdtedge_map< struct_dime_edge_info >, gdt::gdtedge_map< struct_gdtnode >, gdt::gdtedge_map< struct_gdtedge >, gdt::gdtedge_map< int >, gdt::gdtedge_map< struct_flow_dire_edge_info >, gdt::gdtedge_map< bend_constraint >, gdt::gdtedge_map< struct_plan_edge_info >, gdt::gdtedge_map< struct_undi_edge_info >, gdt::gdtedge_map< struct_face >, gdt::gdtedge_map< struct_split_edge_info >, and gdt::gdtedge_map< struct_SPQR_edge_info >.
Definition at line 185 of file gdt_graph_array.h.