IBM SYSTEMG G RUNTIME & NATIVE STORE  0.5
IBM Native Graph Computing and Storage System based on IBM Parallel Programming Library
 All Classes Functions Variables Typedefs Pages
ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type > Member List

This is the complete list of members for ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >, including all inherited members.

_directness (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >protected
_edge_end (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >protected
_edge_iterator_t() (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
_edge_iterator_t(base_type const &it, DIRECTNESS d, bool f=false) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
_pred_end (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >protected
_pred_iter (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >protected
_source_id (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >protected
_using_predlist (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >protected
delete_subproperty(const property_name_type &pname)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
delete_subproperty(size_t propid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
find_edge_iterator(void) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_double_subproperty(size_t propid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_first_subproperty_id() (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_int_subproperty(size_t propid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_label(void)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_labelid(void) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_next_subproperty_id(size_t propid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_subproperty(const property_name_type &pname)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_subproperty(size_t propid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_subproperty_count() (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
get_subpropertytype(size_t propid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
id()ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
is_edge() (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
operator!=(const _edge_iterator_t &rhs) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
operator++(int xx) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
operator++() (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
operator->() (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
operator==(const _edge_iterator_t &rhs) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
pred_iterator typedef (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >private
property_begin()ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
property_end()ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
property_iterator typedef (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >private
property_name_type typedef (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >private
property_value_type typedef (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >private
set_edge_end(base_type const &e) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
set_pred_info(pred_iterator const &cur, pred_iterator const &tail) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
set_source_id(size_t srcid) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
set_subproperty(const property_name_type &pname, const property_value_type &value)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
set_subproperty(const size_t propid, const property_value_type &value) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
set_subproperty(const size_t propid, int ivalue) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
set_subproperty(const size_t propid, double dvalue) (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
source()ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
target()ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >inline
this_type typedef (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >private
vertex_iterator typedef (defined in ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >)ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >private