, including all inherited members.
| __DG(const allocator_type &__a=allocator_type()) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG(const _Self &__x) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| _C_create_node(const _Tp &__x) | dag< expression_node > | [protected] |
| _C_create_node() | dag< expression_node > | [protected] |
| _C_destroy_node(_Node *__p) | dag< expression_node > | [protected] |
| _C_get_node() | dag< expression_node > | [protected] |
| _C_ground | dag< expression_node > | [protected] |
| _C_mark | dag< expression_node > | [protected] |
| _C_put_node(_DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *__p) | dag< expression_node > | [protected] |
| _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc >::_C_put_node(_DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *__p) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc > | [protected] |
| _C_sky | dag< expression_node > | [protected] |
| _DG_base(const allocator_type &) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc > | |
| add_all_children(_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_parent) | dag< expression_node > | [protected] |
| _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc >::add_all_children(_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_parent) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc > | [protected] |
| add_all_parents(_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_child) | dag< expression_node > | [protected] |
| _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc >::add_all_parents(_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_child) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc > | [protected] |
| add_edge(const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it) | dag< expression_node > | |
| add_edge(const edge &__edge, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | dag< expression_node > | |
| add_edge(const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::add_edge(const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| add_edge_back(const walker &__parent, const walker &__child) | dag< expression_node > | |
| add_edge_front(const walker &__parent, const walker &__child) | dag< expression_node > | |
| allocator_type typedef | dag< expression_node > | [protected] |
| arrange_constraints() | coco::model | [inline] |
| basic_simplify() | coco::model | |
| between(const walker &__parent, const children_iterator &__cit, const walker &__child, const parents_iterator &__pit, const _Tp &__x) | dag< expression_node > | |
| between(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const _Tp &__x) | dag< expression_node > | |
| between(const walker &__parent, const children_iterator &__cit, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dag< expression_node > | |
| between(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pit, const _Tp &__x) | dag< expression_node > | |
| between_back(const walker &__parent, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| between_back(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dag< expression_node > | |
| between_back(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| between_front(const walker &__parent, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| between_front(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dag< expression_node > | |
| between_front(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| binary(const walker &_op1, const walker &_op2, int expr_type, double _coeff1=1.0, double _coeff2=1.0) | coco::model | [inline] |
| binary(const walker &_op1, const walker &_op2, int expr_type, const basic_alltype &_params, double _coeff1=1.0, double _coeff2=1.0) | coco::model | [inline] |
| check_acyclicity(const walker &__parent, const walker &__child) | dag< expression_node > | |
| check_counters(bool reset) const | coco::model | |
| children_const_iterator typedef | dag< expression_node > | |
| children_iterator typedef | dag< expression_node > | |
| clear() | dag< expression_node > | |
| clear_children() | dag< expression_node > | [protected] |
| clear_erased_part(erased_part &_ep) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::clear_erased_part(erased_part &_ep) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| clear_graph(_DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_node) | dag< expression_node > | [protected] |
| _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc >::clear_graph(_DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_node) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc > | [protected] |
| clear_parents() | dag< expression_node > | [protected] |
| clr_sky_ground_link() | coco::model | [inline] |
| compress_numbers() | coco::model | [inline] |
| const_iterator typedef | dag< expression_node > | |
| const_name(unsigned int n) const | coco::model | [inline] |
| const_pointer typedef | dag< expression_node > | |
| const_ref_iterator typedef | coco::model | |
| const_reference typedef | dag< expression_node > | |
| const_reverse_iterator typedef | dag< expression_node > | |
| const_walker typedef | coco::model | |
| constant(double _constant) | coco::model | [inline] |
| constant(const std::vector< double > &_constant) | coco::model | [inline] |
| constraint(unsigned int i) const | coco::model | [inline] |
| constraints | coco::model | |
| container_type typedef | dag< expression_node > | |
| dag(const allocator_type &__a=allocator_type()) | dag< expression_node > | |
| dag(const _Self &__dag) | dag< expression_node > | |
| dag(const _Base &__dag) | dag< expression_node > | |
| dag(const erased_part &__ep) | dag< expression_node > | |
| dag_delta class | coco::model | [friend] |
| dag_undelta class | coco::model | [friend] |
| detach_gid() | coco::model | [inline] |
| detect_0chain() | coco::model | |
| dgraph(const allocator_type &__a=allocator_type()) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
| dgraph(const _Self &__dg) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
| dgraph(const erased_part &__ep, const allocator_type &__a=allocator_type()) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
| difference_type typedef | dag< expression_node > | |
| edge typedef | dag< expression_node > | |
| empty() const | dag< expression_node > | |
| empty_reference() const | coco::model | [inline] |
| enhanced_edge typedef | dag< expression_node > | |
| erase(const walker &__position) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erase_child(const walker &__position, const children_iterator &__It) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_child(const walker &__position, const children_iterator &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erase_maximal_pregraph(const walker &__position) | dag< expression_node > | |
| erase_maximal_pregraph(const __SequenceCtr< walker, _Allocator > &__positions) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_maximal_pregraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_maximal_pregraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erase_maximal_subgraph(const walker &__position) | dag< expression_node > | |
| erase_maximal_subgraph(const __SequenceCtr< walker, _Allocator > &__positions) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_maximal_subgraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_maximal_subgraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erase_minimal_pregraph(const walker &__position) | dag< expression_node > | |
| erase_minimal_pregraph(const __SequenceCtr< walker, _Allocator > &__positions) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_minimal_pregraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_minimal_pregraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erase_minimal_subgraph(const walker &__position) | dag< expression_node > | |
| erase_minimal_subgraph(const __SequenceCtr< walker, _Allocator > &__positions) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_minimal_subgraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_minimal_subgraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erase_parent(const walker &__position, const parents_iterator &__It) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::erase_parent(const walker &__position, const parents_iterator &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| erased_part typedef | dag< expression_node > | |
| fixed_var(unsigned int n) const | coco::model | [inline] |
| free_all() | coco::model | [inline] |
| free_const_num(const walker &_w, unsigned int _cnum) | coco::model | [inline] |
| free_node_num(unsigned int _nnum) | coco::model | [inline] |
| free_nodes_on_destroy() | coco::model | [inline] |
| free_var_num(int _vnum) | coco::model | [inline] |
| get_allocator() const | dag< expression_node > | |
| get_const_num(unsigned int node_num, unsigned int &const_num) const | coco::model | [inline] |
| get_linear_coeffs(const const_walker &expr, linalg::sparse_vector< double > &coeffs, double &constant, const std::vector< interval > &_ranges) | coco::model | [inline] |
| get_linear_coeffs(const const_walker &expr, linalg::sparse_vector< double > &coeffs, double &constant) | coco::model | [inline] |
| ghost(unsigned int _nnum) | coco::model | [inline] |
| ghost_begin() | coco::model | [inline] |
| ghost_begin() const | coco::model | [inline] |
| ghost_end() | coco::model | [inline] |
| ghost_end() const | coco::model | [inline] |
| gid_data() const | coco::model | [inline] |
| ground() | dag< expression_node > | |
| ground() const | dag< expression_node > | |
| has_read_errors | coco::model | |
| insert_back_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child) | dag< expression_node > | |
| insert_front_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child) | dag< expression_node > | |
| insert_in_graph(const _Tp &__x, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | dag< expression_node > | |
| insert_in_graph(const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | dag< expression_node > | |
| insert_in_graph(const _Tp &__x, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | dag< expression_node > | |
| insert_in_graph(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | dag< expression_node > | |
| insert_in_graph(const _Tp &__x, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | dag< expression_node > | |
| insert_in_graph(const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | dag< expression_node > | |
| insert_in_graph(const _Tp &__x, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | dag< expression_node > | |
| insert_in_graph(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const _Tp &__x, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const _Tp &__x, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const _Tp &__x, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const _Tp &__x, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_in_graph(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| insert_node(_Node *_node, const walker &__position, const container_insert_arg &__It) | dag< expression_node > | |
| insert_node(const _Tp &__x, const walker &__position, const container_insert_arg &__It) | dag< expression_node > | |
| insert_node(const walker &__position, const container_insert_arg &__It) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node(_Node *_node, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node(const _Tp &__x, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node(const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| insert_node_before(_Node *_node, const walker &__position, const container_insert_arg &__It) | dag< expression_node > | |
| insert_node_before(const _Tp &__x, const walker &__position, const container_insert_arg &__It) | dag< expression_node > | |
| insert_node_before(const walker &__position, const container_insert_arg &__It) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_before(_Node *_node, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_before(const _Tp &__x, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_before(const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| insert_node_in_graph(_Node *__n, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | dag< expression_node > | |
| insert_node_in_graph(_Node *__node, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | dag< expression_node > | |
| insert_node_in_graph(_Node *__node, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | dag< expression_node > | |
| insert_node_in_graph(_Node *__node, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_in_graph(_Node *__n, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_in_graph(_Node *__node, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_in_graph(_Node *__node, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_node_in_graph(_Node *__node, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| insert_subgraph(_Self &__subgraph, const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it) | dag< expression_node > | |
| insert_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | dag< expression_node > | |
| insert_subgraph(_Self &__subgraph, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_subgraph(_Self &__subgraph, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| is_empty(const walker &_w) const | coco::model | [inline] |
| iterator typedef | dag< expression_node > | |
| keep_nodes_on_destroy() | coco::model | [inline] |
| leaf_begin() | dag< expression_node > | |
| leaf_begin() const | dag< expression_node > | |
| leaf_end() | dag< expression_node > | |
| leaf_end() const | dag< expression_node > | |
| lin | coco::model | |
| matd | coco::model | |
| mati | coco::model | |
| max_size() const | dag< expression_node > | |
| merge(const walker &__position, const walker &__second, bool merge_parent_edges=true, bool merge_child_edges=true) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::merge(const walker &__position, const walker &__second, bool merge_parent_edges=true, bool merge_child_edges=true) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| micro_simplify() | coco::model | |
| model(model_gid *__id=NULL, bool clone=false) | coco::model | [inline] |
| model(model_gid *__id, const erased_part &_ep, bool clone=false) | coco::model | |
| model(int __num_of_vars) | coco::model | [inline] |
| model(const model &__m) | coco::model | [inline] |
| model(model_gid *__id, const model &__m) | coco::model | [inline] |
| model(std::istream &inp, bool do_simplify=true, vdbl::database *_db=NULL, vdbl::userid _uid=vdbl::userid(), std::vector< annotation > *_la=NULL, std::string mname=std::string(), bool continue_on_errors=false) | coco::model | |
| model(const char *name, bool do_simplify=true, vdbl::database *_db=NULL, vdbl::userid _uid=vdbl::userid(), std::vector< annotation > *_la=NULL, bool continue_on_errors=false) | coco::model | |
| model_name() const | coco::model | [inline] |
| n_fixed_vars() const | coco::model | [inline] |
| n_unused_constrs() const | coco::model | [inline] |
| n_unused_vars() const | coco::model | [inline] |
| nary(const std::vector< walker > &_op, int expr_type, const std::vector< double > &_coeffs=std::vector< double >()) | coco::model | [inline] |
| nary(const std::vector< walker > &_op, int expr_type, const basic_alltype &_params, const std::vector< double > &_coeffs=std::vector< double >()) | coco::model | [inline] |
| new_variables(int _new_num_of_vars) | coco::model | [inline] |
| next_constraint_num() | coco::model | [inline] |
| next_num() | coco::model | [inline] |
| next_variable_num() | coco::model | [inline] |
| node(unsigned int i) const | coco::model | [inline] |
| node_type typedef | dag< expression_node > | |
| number_of_constraints() const | coco::model | [inline] |
| number_of_managed_constraints() const | coco::model | [inline] |
| number_of_managed_nodes() const | coco::model | [inline] |
| number_of_managed_variables() const | coco::model | [inline] |
| number_of_nodes() const | coco::model | [inline] |
| number_of_variables() const | coco::model | [inline] |
| obj_adj() const | coco::model | [inline] |
| obj_mult() const | coco::model | [inline] |
| obj_name() const | coco::model | [inline] |
| objective | coco::model | |
| ocoeff | coco::model | |
| operator=(const _RV_DG &__rl) | dag< expression_node > | |
| operator=(const erased_part &__ep) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::operator=(const _Self &__x) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::operator=(const erased_part &__ep) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| optima() const | coco::model | [inline] |
| parents_const_iterator typedef | dag< expression_node > | |
| parents_iterator typedef | dag< expression_node > | |
| partial_erase_to_parent(const walker &__position, const walker &__parent, unsigned int idx) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::partial_erase_to_parent(const walker &__position, const walker &__parent, unsigned int idx) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| pointer typedef | dag< expression_node > | |
| prepare_kill() | coco::model | [inline] |
| ref_iterator typedef | coco::model | |
| reference typedef | dag< expression_node > | |
| remove_edge(const edge &__edge) | dag< expression_node > | |
| remove_edge(const walker &__parent, const walker &__child) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::remove_edge(const walker &__parent, const walker &__child) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| remove_edge_and_deattach(const walker &__parent, const walker &__child) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::remove_edge_and_deattach(const walker &__parent, const walker &__child) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| remove_node(const walker &_w, unsigned int _nnum) | coco::model | |
| remove_node(const walker &_w) | coco::model | [inline] |
| remove_node(unsigned int __node_num) | coco::model | [inline] |
| renumber_constraints() | coco::model | |
| renumber_variables() | coco::model | [inline] |
| replace_edge_to_child(const walker &__parent, const walker &__child_old, const walker &__child_new) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::replace_edge_to_child(const walker &__parent, const walker &__child_old, const walker &__child_new) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| replace_edge_to_parent(const walker &__parent_old, const walker &__parent_new, const walker &__child) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::replace_edge_to_parent(const walker &__parent_old, const walker &__parent_new, const walker &__child) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| reverse_iterator typedef | dag< expression_node > | |
| root_begin() | dag< expression_node > | |
| root_begin() const | dag< expression_node > | |
| root_end() | dag< expression_node > | |
| root_end() const | dag< expression_node > | |
| set_counters() | coco::model | [inline] |
| simplify_thin() | coco::model | [inline] |
| size() const | dag< expression_node > | |
| size_type typedef | dag< expression_node > | |
| sky() | dag< expression_node > | |
| sky() const | dag< expression_node > | |
| sort_child_edges(walker __position, children_iterator first, children_iterator last, Compare comp) | dag< expression_node > | |
| sort_child_edges(walker __position, Compare comp) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::sort_child_edges(walker __position, children_iterator first, children_iterator last, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::sort_child_edges(walker __position, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| sort_parent_edges(walker __position, parents_iterator first, parents_iterator last, Compare comp) | dag< expression_node > | |
| sort_parent_edges(walker __position, Compare comp) | dag< expression_node > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::sort_parent_edges(walker __position, parents_iterator first, parents_iterator last, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::sort_parent_edges(walker __position, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| split(const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it, const _Tp &__x) | dag< expression_node > | |
| split(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const _Tp &__x) | dag< expression_node > | |
| split(const walker &__parent, const children_iterator &__ch_it, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dag< expression_node > | |
| split(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pr_it, const _Tp &__x) | dag< expression_node > | |
| split_back(const walker &__parent, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| split_back(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dag< expression_node > | |
| split_back(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| split_front(const walker &__parent, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| split_front(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dag< expression_node > | |
| split_front(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dag< expression_node > | |
| store_constraint(const walker &_w) | coco::model | [inline] |
| store_ghost(const walker &_w) | coco::model | [inline] |
| store_node(const walker &_w) | coco::model | [inline] |
| store_variable(const walker &_w) | coco::model | [inline] |
| swap(_Self &__x) | dag< expression_node > | |
| trace_points() const | coco::model | [inline] |
| unary(const walker &_op1, int expr_type, double _coeff=1.0) | coco::model | [inline] |
| unary(const walker &_op1, int expr_type, const basic_alltype &_params, double _coeff=1.0) | coco::model | [inline] |
| unused_constr(unsigned int n) const | coco::model | [inline] |
| unused_var(unsigned int n) const | coco::model | [inline] |
| value_type typedef | dag< expression_node > | |
| var(unsigned int i) const | coco::model | [inline] |
| var_name(unsigned int n) const | coco::model | [inline] |
| variable(unsigned int _vnum) | coco::model | |
| vnary(int expr_type,...) | coco::model | |
| vxnary(const basic_alltype &_params, int expr_type,...) | coco::model | |
| walker typedef | coco::model | |
| write(std::ostream &__o=std::cout) const | coco::model | |
| ~__DG() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
| ~_DG_base() | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::const_iterator, _Alloc > | |
| ~model() | coco::model | [inline] |
