Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Compound Members File Members

search_graph Class Reference

#include <search_graph.h>

Inheritance diagram for search_graph:

[legend]Collaboration diagram for search_graph:


Public Methods
	search_graph (model &root_model, gptr< vdbl::database > &_db)
	search_graph (model &root_model, gptr< vdbl::database > &_db, const std::vector< annotation > &_a)
	~search_graph ()
search_node_id	get_node_id ()
search_focus &	new_focus (const search_inspector &_si)
void	destroy_focus (const search_focus &_sf)
search_focus &	set_focus (search_focus &_fc, const search_inspector &_si)
search_inspector &	new_inspector (const search_inspector &inspector_to_add)
search_inspector &	new_inspector ()
void	destroy_inspector (const search_inspector &inspector_to_destroy)
work_node	extract (const search_inspector &where)
work_node	extract (const search_focus &where)
search_inspector &	insert (const search_focus &where, const search_node &what)
search_inspector &	replace (search_focus &where, const search_node &what)
void	remove (search_focus &_sf)
void	remove_upwards (search_focus &_sf, bool relaxation_kills)
search_focus &	promote (search_focus &_sf)
search_inspector	child (search_inspector &n, unsigned int i)
search_inspector	parent (search_inspector &n, unsigned int i)
bool	check_acyclicity (const walker &__parent, const walker &__child)
void	clear ()
walker	between (const walker &__parent, const children_iterator &__cit, const walker &__child, const parents_iterator &__pit, const search_node *&__x)
walker	between (const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const search_node *&__x)
walker	between (const walker &__parent, const children_iterator &__cit, const __SequenceCtr< walker, _Allocator > &__children, const search_node *&__x)
walker	between (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pit, const search_node *&__x)
walker	between (const walker &__parent, const children_iterator &__cit, const walker &__child, const parents_iterator &__pit, const _Tp &__x)
walker	between (const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const _Tp &__x)
walker	between (const walker &__parent, const children_iterator &__cit, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x)
walker	between (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pit, const _Tp &__x)
walker	split (const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it, const search_node *&__x)
void	split (const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const search_node *&__x)
walker	split (const walker &__parent, const children_iterator &__ch_it, const __SequenceCtr< walker, _Allocator > &__children, const search_node *&__x)
walker	split (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pr_it, const search_node *&__x)
walker	split (const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it, const _Tp &__x)
void	split (const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const _Tp &__x)
walker	split (const walker &__parent, const children_iterator &__ch_it, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x)
walker	split (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pr_it, const _Tp &__x)
walker	between_back (const walker &__parent, const walker &__child, const search_node *&__x)
walker	between_back (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const search_node *&__x)
walker	between_back (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const search_node *&__x)
walker	between_back (const walker &__parent, const walker &__child, const _Tp &__x)
walker	between_back (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x)
walker	between_back (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x)
walker	split_back (const walker &__parent, const walker &__child, const search_node *&__x)
walker	split_back (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const search_node *&__x)
walker	split_back (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const search_node *&__x)
walker	split_back (const walker &__parent, const walker &__child, const _Tp &__x)
walker	split_back (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x)
walker	split_back (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x)
walker	between_front (const walker &__parent, const walker &__child, const search_node *&__x)
walker	between_front (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const search_node *&__x)
walker	between_front (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const search_node *&__x)
walker	between_front (const walker &__parent, const walker &__child, const _Tp &__x)
walker	between_front (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x)
walker	between_front (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x)
walker	split_front (const walker &__parent, const walker &__child, const search_node *&__x)
walker	split_front (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const search_node *&__x)
walker	split_front (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const search_node *&__x)
walker	split_front (const walker &__parent, const walker &__child, const _Tp &__x)
walker	split_front (const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x)
walker	split_front (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x)
void	insert_subgraph (_Self &__subgraph, const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it)
void	insert_subgraph (_Self &__subgraph, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
void	insert_subgraph (_Self &__subgraph, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children)
void	insert_back_subgraph (_Self &__subgraph, const walker &__parent, const walker &__child)
void	insert_front_subgraph (_Self &__subgraph, const walker &__parent, const walker &__child)
void	add_edge (const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it)
void	add_edge (const edge &__edge, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
void	add_edge (const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
void	add_edge_back (const walker &__parent, const walker &__child)
void	add_edge_front (const walker &__parent, const walker &__child)
allocator_type	get_allocator () const
walker	ground ()
const_walker	ground () const
walker	sky ()
const_walker	sky () const
children_iterator	root_begin ()
children_iterator	root_end ()
parents_iterator	leaf_begin ()
parents_iterator	leaf_end ()
bool	empty () const
size_type	size () const
size_type	max_size () const
void	swap (_Self &__x)
walker	insert_node_in_graph (_Node *__n, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
walker	insert_node_in_graph (_Node *__node, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children)
walker	insert_node_in_graph (_Node *__node, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children)
walker	insert_node_in_graph (_Node *__node, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref)
walker	insert_in_graph (const search_node *&__x, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
walker	insert_in_graph (const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
walker	insert_in_graph (const search_node *&__x, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children)
walker	insert_in_graph (const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children)
walker	insert_in_graph (const search_node *&__x, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children)
walker	insert_in_graph (const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children)
walker	insert_in_graph (const search_node *&__x, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref)
walker	insert_in_graph (const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref)
walker	insert_in_graph (const _Tp &__x, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp)
walker	insert_in_graph (const _Tp &__x, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children)
walker	insert_in_graph (const _Tp &__x, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children)
walker	insert_in_graph (const _Tp &__x, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref)
void	replace_edge_to_child (const walker &__parent, const walker &__child_old, const walker &__child_new)
void	replace_edge_to_parent (const walker &__parent_old, const walker &__parent_new, const walker &__child)
void	remove_edge (const edge &__edge)
void	remove_edge (const walker &__parent, const walker &__child)
void	remove_edge_and_deattach (const walker &__parent, const walker &__child)
void	sort_child_edges (walker __position, children_iterator first, children_iterator last, Compare comp)
void	sort_child_edges (walker __position, Compare comp)
void	sort_parent_edges (walker __position, parents_iterator first, parents_iterator last, Compare comp)
void	sort_parent_edges (walker __position, Compare comp)
walker	insert_node (_Node *_node, const walker &__position, const container_insert_arg &__It)
walker	insert_node (const search_node *&__x, const walker &__position, const container_insert_arg &__It)
walker	insert_node (const walker &__position, const container_insert_arg &__It)
walker	insert_node (const _Tp &__x, const walker &__position, const container_insert_arg &__It)
walker	insert_node_before (_Node *_node, const walker &__position, const container_insert_arg &__It)
void	insert_node_before (const search_node *&__x, const walker &__position, const container_insert_arg &__It)
void	insert_node_before (const walker &__position, const container_insert_arg &__It)
void	insert_node_before (const _Tp &__x, const walker &__position, const container_insert_arg &__It)
void	merge (const walker &__position, const walker &__second, bool merge_parent_edges=true, bool merge_child_edges=true)
void	erase (const walker &__position)
void	clear_erased_part (erased_part &_ep)
erased_part	erase_maximal_subgraph (const walker &__position)
erased_part	erase_maximal_subgraph (const __SequenceCtr< walker, _Allocator > &__positions)
erased_part	erase_minimal_subgraph (const walker &__position)
erased_part	erase_minimal_subgraph (const __SequenceCtr< walker, _Allocator > &__positions)
erased_part	erase_maximal_pregraph (const walker &__position)
erased_part	erase_maximal_pregraph (const __SequenceCtr< walker, _Allocator > &__positions)
erased_part	erase_minimal_pregraph (const walker &__position)
erased_part	erase_minimal_pregraph (const __SequenceCtr< walker, _Allocator > &__positions)
bool	erase_child (const walker &__position, const children_iterator &__It)
bool	erase_parent (const walker &__position, const parents_iterator &__It)
void	clear_children ()
void	clear_parents ()
void	add_all_children (_Output_Iterator fi, _DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > _parent)
void	add_all_children (_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > *_parent)
void	add_all_children (_Output_Iterator fi, _DG_node< _Tp, _Ctr, _Iterator > *_parent)
void	add_all_parents (_Output_Iterator fi, _DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > _child)
void	add_all_parents (_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > *_child)
void	add_all_parents (_Output_Iterator fi, _DG_node< _Tp, _Ctr, _Iterator > *_child)
_Node *	_C_create_node (const search_node *&__x)
_Node *	_C_create_node ()
_Node *	_C_create_node (const _Tp &__x)
void	clear_graph (_DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > _node)
void	clear_graph (_DG_node< _Tp, _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > *_node)
void	clear_graph (_DG_node< _Tp, _Ctr, _Iterator > *_node)
_DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator >	_C_get_node ()
void	_C_put_node (_DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > __p)
void	_C_put_node (_DG_node< _Tp, _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator > *__p)
void	_C_put_node (_DG_node< _Tp, _Ctr, _Iterator > *__p)
Public Attributes
std::list< walker >	focus
std::list< const_walker >	inspector
search_node *	root
search_inspector	inspector_for_root
ptr< search_node >	ptr_ground
ptr< model >	ptr_root_model
list< search_node * >	search_nodes_to_deallocate
list< delta_id >	db_deltas_to_remove
gptr< vdbl::database > *	__dbase
vdbl::userid	__dbuser
_Base::walker	walker
_Base::const_walker	const_walker
_Base::children_iterator	children_iterator
_Base::parents_iterator	parents_iterator
_Base::erased_part	erased_part
_SequenceCtr< void *, _PtrAlloc >	container_type
search_node *	value_type
_DG_iterator< search_node , search_node &, search_node **, container_type, children_iterator >	iterator
_DG_iterator< search_node , const search_node &, const search_node **, container_type, children_iterator >	const_iterator
std::reverse_iterator< const_iterator >	const_reverse_iterator
std::reverse_iterator< iterator >	reverse_iterator
std::pair< walker, walker >	edge
std::pair< edge, bool >	enhanced_edge
_Base::allocator_type	allocator_type
_DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator >	_C_ground
_DG_node< search_node , _SequenceCtr< void , _PtrAlloc >, _SequenceCtr< void , _PtrAlloc >::iterator >	_C_sky
int	_C_mark
_Node	node_type
value_type *	pointer
const value_type *	const_pointer
value_type &	reference
const value_type &	const_reference
size_t	size_type
ptrdiff_t	difference_type
Friends
bool	operator==__VGTL_NULL_TMPL_ARGS (const __DG &__x, const __DG &__y)

Constructor & Destructor Documentation

search_graph::search_graph ( model & root_model,

gptr< vdbl::database > & _db

) [inline]

Definition at line 90 of file search_graph.h.

search_graph::search_graph ( model & root_model,

gptr< vdbl::database > & _db,

const std::vector< annotation > & _a

) [inline]

Definition at line 104 of file search_graph.h.

search_graph::~search_graph ( ) [inline]

Definition at line 119 of file search_graph.h.

Member Function Documentation

_Node * dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_create_node ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Node * dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_create_node ( const search_node * & __x ) [inherited]

_DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_get_node ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_put_node ( _DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * __p ) [inherited]

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_all_children ( _Output_Iterator fi,

_DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * _parent

) [inherited]

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_all_parents ( _Output_Iterator fi,

_DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * _child

) [inherited]

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_edge ( const walker & __parent,

const walker & __child,

const container_insert_arg & __Itc,

const container_insert_arg & __Itp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_edge ( const edge & __edge,

const container_insert_arg & __Itc,

const container_insert_arg & __Itp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_edge ( const walker & __parent,

const children_iterator & __ch_it,

const walker & __child,

const parents_iterator & __pa_it

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_edge_back ( const walker & __parent,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::add_edge_front ( const walker & __parent,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const parents_iterator & __pit,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between ( const walker & __parent,

const children_iterator & __cit,

const __SequenceCtr< walker, _Allocator > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between ( const __SequenceCtr1< walker, _Allocator1 > & __parents,

const __SequenceCtr2< walker, _Allocator2 > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between ( const walker & __parent,

const children_iterator & __cit,

const walker & __child,

const parents_iterator & __pit,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between_back ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between_back ( const walker & __parent,

const __SequenceCtr< walker, _Allocator > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between_back ( const walker & __parent,

const walker & __child,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between_front ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between_front ( const walker & __parent,

const __SequenceCtr< walker, _Allocator > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::between_front ( const walker & __parent,

const walker & __child,

const search_node * & __x

) [inherited]

bool dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::check_acyclicity ( const walker & __parent,

const walker & __child

) [inherited]

search_inspector search_graph::child ( search_inspector & n,

unsigned int i

) [inline]

Definition at line 157 of file search_graph.h.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::clear ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::clear_children ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::clear_erased_part ( erased_part & _ep ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::clear_graph ( _DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * _node ) [inherited]

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::clear_parents ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void search_graph::destroy_focus ( const search_focus & _sf )

Definition at line 53 of file search_graph.cc.

void search_graph::destroy_inspector ( const search_inspector & inspector_to_destroy )

Definition at line 87 of file search_graph.cc.

bool dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::empty ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase ( const walker & __position ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

bool dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_child ( const walker & __position,

const children_iterator & __It

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_maximal_pregraph ( const __SequenceCtr< walker, _Allocator > & __positions ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_maximal_pregraph ( const walker & __position ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_maximal_subgraph ( const __SequenceCtr< walker, _Allocator > & __positions ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_maximal_subgraph ( const walker & __position ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_minimal_pregraph ( const __SequenceCtr< walker, _Allocator > & __positions ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_minimal_pregraph ( const walker & __position ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_minimal_subgraph ( const __SequenceCtr< walker, _Allocator > & __positions ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_minimal_subgraph ( const walker & __position ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

bool dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erase_parent ( const walker & __position,

const parents_iterator & __It

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

work_node search_graph::extract ( const search_focus & where )

Definition at line 113 of file search_graph.cc.

work_node search_graph::extract ( const search_inspector & where )

Definition at line 98 of file search_graph.cc.

allocator_type dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::get_allocator ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

search_node_id search_graph::get_node_id ( ) [inline]

Definition at line 134 of file search_graph.h.

const_walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::ground ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::ground ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

search_inspector & search_graph::insert ( const search_focus & where,

const search_node & what

)

Definition at line 128 of file search_graph.cc.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_back_subgraph ( _Self & __subgraph,

const walker & __parent,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_front_subgraph ( _Self & __subgraph,

const walker & __parent,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const container_insert_arg & __cref

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const search_node * & __x,

const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const container_insert_arg & __cref

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const walker & __parent,

const container_insert_arg & __pref,

const __SequenceCtr< walker, _Allocator > & __children

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const search_node * & __x,

const walker & __parent,

const container_insert_arg & __pref,

const __SequenceCtr< walker, _Allocator > & __children

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const __SequenceCtr1< walker, _Allocator1 > & __parents,

const __SequenceCtr2< walker, _Allocator2 > & __children

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const search_node * & __x,

const __SequenceCtr1< walker, _Allocator1 > & __parents,

const __SequenceCtr2< walker, _Allocator2 > & __children

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const walker & __parent,

const walker & __child,

const container_insert_arg & __Itc,

const container_insert_arg & __Itp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_in_graph ( const search_node * & __x,

const walker & __parent,

const walker & __child,

const container_insert_arg & __Itc,

const container_insert_arg & __Itp

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node ( const walker & __position,

const container_insert_arg & __It

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node ( const search_node * & __x,

const walker & __position,

const container_insert_arg & __It

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node ( _Node * _node,

const walker & __position,

const container_insert_arg & __It

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_before ( const walker & __position,

const container_insert_arg & __It

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_before ( const search_node * & __x,

const walker & __position,

const container_insert_arg & __It

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_before ( _Node * _node,

const walker & __position,

const container_insert_arg & __It

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_in_graph ( _Node * __node,

const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const container_insert_arg & __cref

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_in_graph ( _Node * __node,

const walker & __parent,

const container_insert_arg & __pref,

const __SequenceCtr< walker, _Allocator > & __children

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_in_graph ( _Node * __node,

const __SequenceCtr1< walker, _Allocator1 > & __parents,

const __SequenceCtr2< walker, _Allocator2 > & __children

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_node_in_graph ( _Node * __n,

const walker & __parent,

const walker & __child,

const container_insert_arg & __Itc,

const container_insert_arg & __Itp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_subgraph ( _Self & __subgraph,

const __SequenceCtr1< walker, _Allocator1 > & __parents,

const __SequenceCtr2< walker, _Allocator2 > & __children

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_subgraph ( _Self & __subgraph,

const walker & __parent,

const walker & __child,

const container_insert_arg & __Itc,

const container_insert_arg & __Itp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::insert_subgraph ( _Self & __subgraph,

const walker & __parent,

const children_iterator & __ch_it,

const walker & __child,

const parents_iterator & __pa_it

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

parents_iterator dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::leaf_begin ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

parents_iterator dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::leaf_end ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

size_type dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::max_size ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::merge ( const walker & __position,

const walker & __second,

bool merge_parent_edges = true,

bool merge_child_edges = true

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

search_focus & search_graph::new_focus ( const search_inspector & _si )

Definition at line 41 of file search_graph.cc.

search_inspector& search_graph::new_inspector ( ) [inline]

Definition at line 142 of file search_graph.h.

search_inspector & search_graph::new_inspector ( const search_inspector & inspector_to_add )

Definition at line 76 of file search_graph.cc.

search_inspector search_graph::parent ( search_inspector & n,

unsigned int i

) [inline]

Definition at line 165 of file search_graph.h.

search_focus & search_graph::promote ( search_focus & _sf )

Definition at line 279 of file search_graph.cc.

void search_graph::remove ( search_focus & _sf )

Definition at line 267 of file search_graph.cc.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::remove_edge ( const walker & __parent,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::remove_edge ( const edge & __edge ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::remove_edge_and_deattach ( const walker & __parent,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void search_graph::remove_upwards ( search_focus & _sf,

bool relaxation_kills

)

Definition at line 370 of file search_graph.cc.

search_inspector & search_graph::replace ( search_focus & where,

const search_node & what

)

Definition at line 142 of file search_graph.cc.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::replace_edge_to_child ( const walker & __parent,

const walker & __child_old,

const walker & __child_new

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::replace_edge_to_parent ( const walker & __parent_old,

const walker & __parent_new,

const walker & __child

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

children_iterator dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::root_begin ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

children_iterator dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::root_end ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

search_focus & search_graph::set_focus ( search_focus & _fc,

const search_inspector & _si

)

Definition at line 62 of file search_graph.cc.

size_type dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::size ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

const_walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::sky ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::sky ( ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::sort_child_edges ( walker __position,

Compare comp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::sort_child_edges ( walker __position,

children_iterator first,

children_iterator last,

Compare comp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::sort_parent_edges ( walker __position,

Compare comp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::sort_parent_edges ( walker __position,

parents_iterator first,

parents_iterator last,

Compare comp

) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const parents_iterator & __pr_it,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split ( const walker & __parent,

const children_iterator & __ch_it,

const __SequenceCtr< walker, _Allocator > & __children,

const search_node * & __x

) [inherited]

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split ( const __SequenceCtr1< walker, _Allocator1 > & __parents,

const __SequenceCtr2< walker, _Allocator2 > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split ( const walker & __parent,

const children_iterator & __ch_it,

const walker & __child,

const parents_iterator & __pa_it,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split_back ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split_back ( const walker & __parent,

const __SequenceCtr< walker, _Allocator > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split_back ( const walker & __parent,

const walker & __child,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split_front ( const __SequenceCtr< walker, _Allocator > & __parents,

const walker & __child,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split_front ( const walker & __parent,

const __SequenceCtr< walker, _Allocator > & __children,

const search_node * & __x

) [inherited]

walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::split_front ( const walker & __parent,

const walker & __child,

const search_node * & __x

) [inherited]

void dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::swap ( _Self & __x ) [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

Friends And Related Function Documentation

bool operator==__VGTL_NULL_TMPL_ARGS ( const __DG & __x,

const __DG & __y

) [friend, inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

Member Data Documentation

gptr<vdbl::database>* search_graph::__dbase

Definition at line 81 of file search_graph.h.

vdbl::userid search_graph::__dbuser

Definition at line 82 of file search_graph.h.

_DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_ground [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

int dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_mark [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_DG_node< search_node *, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > * dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::_C_sky [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Base::allocator_type dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::allocator_type [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Base::children_iterator dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::children_iterator [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_DG_iterator< search_node *, const search_node * &, const search_node * *, container_type, children_iterator > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::const_iterator [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

const value_type * __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::const_pointer [inherited]

const value_type & __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::const_reference [inherited]

std::reverse_iterator< const_iterator > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::const_reverse_iterator [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Base::const_walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::const_walker [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_SequenceCtr< void *, _PtrAlloc > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::container_type [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

list<delta_id> search_graph::db_deltas_to_remove

Definition at line 80 of file search_graph.h.

ptrdiff_t __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::difference_type [inherited]

std::pair< walker, walker > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::edge [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

std::pair< edge, bool > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::enhanced_edge [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Base::erased_part dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::erased_part [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

std::list<walker> search_graph::focus

Definition at line 72 of file search_graph.h.

std::list<const_walker> search_graph::inspector

Definition at line 73 of file search_graph.h.

search_inspector search_graph::inspector_for_root

Definition at line 76 of file search_graph.h.

_DG_iterator< search_node *, search_node * &, search_node * *, container_type, children_iterator > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::iterator [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Node __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::node_type [inherited]

_Base::parents_iterator dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::parents_iterator [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

value_type * __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::pointer [inherited]

ptr<search_node> search_graph::ptr_ground

Definition at line 77 of file search_graph.h.

ptr<model> search_graph::ptr_root_model

Definition at line 78 of file search_graph.h.

value_type & __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::reference [inherited]

std::reverse_iterator< iterator > dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::reverse_iterator [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

search_node* search_graph::root

Definition at line 75 of file search_graph.h.

list<search_node*> search_graph::search_nodes_to_deallocate

Definition at line 79 of file search_graph.h.

size_t __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::size_type [inherited]

search_node * dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::value_type [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

_Base::walker dag< search_node *, _SequenceCtr, _PtrAlloc, _Alloc >::walker [inherited]

Reimplemented from dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >.

The documentation for this class was generated from the following files:

Generated on Tue Nov 4 01:59:32 2003 for COCONUT API by

1.2.18

search_graph Class Reference

Public Methods

Public Attributes

Friends

Constructor & Destructor Documentation

Member Function Documentation

Friends And Related Function Documentation

Member Data Documentation