Namespaces
	detail

	details

	endian

	factory_toolbox
	Toolbox for factory implementation.

	hash_toolbox
	toolbox for hash containers

	plugin

	pools

	singleton
	Singleton manipulation.

	smart
	Smart pointers implementation.

Classes
class	auto_flag

class	auto_flag< bool >

class	bad_syntax

class	commandline_error

class	cmdline_option

class	command_line

struct	parse_error

class	config_file

class	config_set

struct	not_found

struct	pkgconfig_error

class	pkgconfig

class	ConfigurationFinder

struct	arg_traits
	argument type traits More...

struct	binary_compose_2
	Binary functor composition with two unary functors. More...

class	cached_fn
	A functor with cache. More...

struct	unary_compose
	Unary functors composition. More...

struct	identity
	Identity functor. More...

struct	select_1st
	First pair attribute access. More...

struct	select_2nd
	Second pair attribute access. More...

struct	hash
	hash functor More...

struct	hash< bool >

struct	hash< char >

struct	hash< signed char >

struct	hash< unsigned char >

struct	hash< signed int >

struct	hash< unsigned int >

struct	hash< signed short int >

struct	hash< unsigned short int >

struct	hash< signed long int >

struct	hash< unsigned long int >

struct	hash< float >

struct	hash< double >

struct	hash< long double >

struct	hash< Ty * >

struct	hash< std::basic_string< CharT, Traits, Alloc > >

class	hash_map
	map with hashing access More...

class	hash_set
	set with hashing access More...

class	iterator_sequence

struct	hash< smart::pointer< Manager > >

class	process

class	base_socket

class	socket

class	server_socket

class	unix_error

class	auto_close

class	tempfile

class	basic_symbol
	Generic string using unique instance memory. More...

struct	hash< basic_symbol< CharT, Traits, Alloc > >

class	factory
	Generic Factory implementation. More...

struct	undirected_graph_tag

class	undirected_graph

class	undirected_property_map

Typedefs
typedef std::list< std::string >	stringlist

typedef basic_symbol< char >	symbol
	specialization of utilmm::basic_symbol using char More...

Functions
std::ostream &	operator<< (std::ostream &stream, utilmm::command_line const &cmdline)

std::string	shell_expand (std::string const &text)

std::string	demangle (char const *name)
	name demangling function More...

std::string	demangle (std::string const &name)
	name demangling function More...

std::string	demangle (std::type_info const &type)
	demangled name function More...

template<typename Ty >
std::string	real_name_of ()
	demangled name function More...

template<typename Iterator >
void	sweep (Iterator begin, Iterator end)

template<typename Iterator >
void	sweep_arrays (Iterator begin, Iterator end)

stringlist	split (std::string const &s, std::string const &sep=" ", bool ignore_empty=true)

std::string	join (stringlist const &l, std::string const &sep=" ")

template<typename T >
std::string	join (std::list< T > const &l, std::string const &sep=" ")

std::string	upcase (std::string const &s)

bool	starts_with (std::string const &str, std::string const &start)

boost::filesystem::path	clean_path (std::string str)

template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap , typename Vertex >
void	undirected_dfs (const Graph &g, DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color, Vertex start_vertex)

template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >
void	undirected_dfs (const Graph &g, DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color)

template<typename Graph , typename P , typename T , typename R >
void	undirected_dfs (const Graph &g, const boost::bgl_named_params< P, T, R > &params)

template<typename IncidenceGraph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap , typename TerminatorFunc >
void	undirected_depth_first_visit (const IncidenceGraph &g, typename boost::graph_traits< IncidenceGraph >::vertex_descriptor u, DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color, TerminatorFunc func=TerminatorFunc())

template<class BidirectionalGraph >
undirected_graph < BidirectionalGraph >	make_undirected_graph (const BidirectionalGraph &g)

template<class BidirectionalGraph >
undirected_graph < BidirectionalGraph, BidirectionalGraph & >	make_undirected_graph (BidirectionalGraph &g)

template<class BidirectionalGraph , class GRef >
std::pair< typename undirected_graph < BidirectionalGraph > ::vertex_iterator, typename undirected_graph < BidirectionalGraph > ::vertex_iterator >	vertices (const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
std::pair< typename undirected_graph < BidirectionalGraph > ::edge_iterator, typename undirected_graph < BidirectionalGraph > ::edge_iterator >	edges (const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
std::pair< typename undirected_graph < BidirectionalGraph, GRef > ::out_edge_iterator, typename undirected_graph < BidirectionalGraph, GRef > ::out_edge_iterator >	out_edges (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
BidirectionalGraph::vertices_size_type	num_vertices (const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
undirected_graph < BidirectionalGraph > ::edges_size_type	num_edges (const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
BidirectionalGraph::degree_size_type	out_degree (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
std::pair< typename BidirectionalGraph::edge_descriptor, bool >	edge (const typename BidirectionalGraph::vertex_descriptor u, const typename BidirectionalGraph::vertex_descriptor v, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
std::pair< typename BidirectionalGraph::out_edge_iterator, typename BidirectionalGraph::out_edge_iterator >	in_edges (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
std::pair< typename undirected_graph < BidirectionalGraph, GRef > ::adjacency_iterator, typename undirected_graph < BidirectionalGraph, GRef > ::adjacency_iterator >	adjacent_vertices (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class BidirectionalGraph , class GRef >
BidirectionalGraph::degree_size_type	in_degree (const typename BidirectionalGraph::vertex_descriptor u, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class Edge , class BidirectionalGraph , class GRef >
boost::graph_traits < BidirectionalGraph > ::vertex_descriptor	source (const Edge &e, const undirected_graph< BidirectionalGraph, GRef > &g)

template<class Edge , class BidirectionalGraph , class GRef >
boost::graph_traits < BidirectionalGraph > ::vertex_descriptor	target (const Edge &e, const undirected_graph< BidirectionalGraph, GRef > &g)

template<typename PropertyMap , typename EdgeDescriptor , typename ValueType >
void	put (undirected_property_map< PropertyMap > &map, EdgeDescriptor e, ValueType value)

template<typename PropertyMap , typename EdgeDescriptor >
boost::property_traits < PropertyMap >::value_type	get (undirected_property_map< PropertyMap > const &map, EdgeDescriptor e)

template<typename PropertyMap >
undirected_property_map < PropertyMap >	make_undirected_edge_map (PropertyMap pmap)

Typedef Documentation

typedef std::list<std::string> utilmm::stringlist

typedef basic_symbol<char> utilmm::symbol

specialization of utilmm::basic_symbol using char

You can see it as std::string compared to std::basic_string

Function Documentation

template<class BidirectionalGraph , class GRef >

std::pair<typename undirected_graph<BidirectionalGraph,GRef>::adjacency_iterator, typename undirected_graph<BidirectionalGraph,GRef>::adjacency_iterator> utilmm::adjacent_vertices	(	const typename BidirectionalGraph::vertex_descriptor	u,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

boost::filesystem::path utilmm::clean_path ( std::string str )

inline

std::string utilmm::demangle ( char const * name )

name demangling function

This function demangle C++ type names to a human-readable form. It convert the name given by typeid().name() in the classical C++ form.

Parameters

name	An internal C++ type name

Returns: the real name of this type

Bug:: this function is not currently fully implemented. It is based on g++ ABI and uses g++ internals. Finally there's no error treatment at this time.

Author: Fr�d�ric Py fpy@l.nosp@m.aas..nosp@m.fr

Referenced by demangle(), and real_name_of().

std::string utilmm::demangle ( std::string const & name )

inline

name demangling function

This function demangle C++ type names to a human-readable form. It convert the name given by typeid().name() in the classical C++ form.

Parameters

name	An internal C++ type name

Returns: the real name of this type

Author: Fr�d�ric Py fpy@l.nosp@m.aas..nosp@m.fr

References demangle().

std::string utilmm::demangle ( std::type_info const & type )

inline

demangled name function

This function demangle C++ type names to a human-readable form. It convert the name given by typeid().name() in the classical C++ form.

Parameters

type	A C++ type descriptor

Returns: the real name of this type

Author: Fr�d�ric Py fpy@l.nosp@m.aas..nosp@m.fr

References demangle().

template<class BidirectionalGraph , class GRef >

std::pair<typename BidirectionalGraph::edge_descriptor, bool> utilmm::edge	(	const typename BidirectionalGraph::vertex_descriptor	u,
		const typename BidirectionalGraph::vertex_descriptor	v,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

template<class BidirectionalGraph , class GRef >

std::pair<typename undirected_graph<BidirectionalGraph>::edge_iterator, typename undirected_graph<BidirectionalGraph>::edge_iterator> utilmm::edges ( const undirected_graph< BidirectionalGraph, GRef > & g )

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

Referenced by undirected_dfs().

template<typename PropertyMap , typename EdgeDescriptor >

boost::property_traits<PropertyMap>::value_type utilmm::get	(	undirected_property_map< PropertyMap > const &	map,
		EdgeDescriptor	e
	)

template<class BidirectionalGraph , class GRef >

BidirectionalGraph::degree_size_type utilmm::in_degree	(	const typename BidirectionalGraph::vertex_descriptor	u,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References out_degree().

Referenced by out_degree().

template<class BidirectionalGraph , class GRef >

std::pair<typename BidirectionalGraph::out_edge_iterator, typename BidirectionalGraph::out_edge_iterator> utilmm::in_edges	(	const typename BidirectionalGraph::vertex_descriptor	u,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References out_edges().

Referenced by out_edges().

std::string utilmm::join	(	stringlist const &	l,
		std::string const &	sep = `" "`
	)

inline

Referenced by join().

template<typename T >

std::string utilmm::join	(	std::list< T > const &	l,
		std::string const &	sep = `" "`
	)

inline

References join().

template<typename PropertyMap >

undirected_property_map<PropertyMap> utilmm::make_undirected_edge_map ( PropertyMap pmap )

template<class BidirectionalGraph >

undirected_graph<BidirectionalGraph> utilmm::make_undirected_graph ( const BidirectionalGraph & g )

inline

template<class BidirectionalGraph >

undirected_graph<BidirectionalGraph, BidirectionalGraph&> utilmm::make_undirected_graph ( BidirectionalGraph & g )

inline

template<class BidirectionalGraph , class GRef >

undirected_graph<BidirectionalGraph>::edges_size_type utilmm::num_edges ( const undirected_graph< BidirectionalGraph, GRef > & g )

inline

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

template<class BidirectionalGraph , class GRef >

BidirectionalGraph::vertices_size_type utilmm::num_vertices ( const undirected_graph< BidirectionalGraph, GRef > & g )

inline

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

Referenced by utilmm::detail::udfs_dispatch< boost::detail::error_property_not_found >::apply().

std::ostream& utilmm::operator<<	(	std::ostream &	stream,
		utilmm::command_line const &	cmdline
	)

References utilmm::command_line::usage().

template<class BidirectionalGraph , class GRef >

BidirectionalGraph::degree_size_type utilmm::out_degree	(	const typename BidirectionalGraph::vertex_descriptor	u,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References in_degree(), and utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

Referenced by in_degree().

template<class BidirectionalGraph , class GRef >

std::pair<typename undirected_graph<BidirectionalGraph,GRef>::out_edge_iterator, typename undirected_graph<BidirectionalGraph,GRef>::out_edge_iterator> utilmm::out_edges	(	const typename BidirectionalGraph::vertex_descriptor	u,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References in_edges(), and utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

Referenced by in_edges(), and utilmm::detail::undir_dfv_impl_term().

template<typename PropertyMap , typename EdgeDescriptor , typename ValueType >

void utilmm::put	(	undirected_property_map< PropertyMap > &	map,
		EdgeDescriptor	e,
		ValueType	value
	)

References utilmm::undirected_property_map< PropertyMap >::map().

Referenced by utilmm::detail::undir_dfv_impl_term(), and undirected_dfs().

template<typename Ty >

std::string utilmm::real_name_of ( )

demangled name function

This function demangle C++ type names to a human-readable form. It convert the name given by typeid().name() in the classical C++ form.

Parameters

Ty	A C++ type

Returns: the real name of this type

Author: Fr�d�ric Py fpy@l.nosp@m.aas..nosp@m.fr

References demangle().

std::string utilmm::shell_expand ( std::string const & text )

template<class Edge , class BidirectionalGraph , class GRef >

boost::graph_traits<BidirectionalGraph>::vertex_descriptor utilmm::source	(	const Edge &	e,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g, and target().

Referenced by target(), utilmm::endian::to_big(), and utilmm::endian::to_little().

stringlist utilmm::split	(	std::string const &	s,
		std::string const &	sep = `" "`,
		bool	ignore_empty = `true`
	)

inline

bool utilmm::starts_with	(	std::string const &	str,
		std::string const &	start
	)

inline

template<typename Iterator >

void utilmm::sweep	(	Iterator	begin,
		Iterator	end
	)

Calls delete for each iterator value in [begin, end)

Referenced by utilmm::pools::object_pool< T >::~object_pool().

template<typename Iterator >

void utilmm::sweep_arrays	(	Iterator	begin,
		Iterator	end
	)

Calls delete[] for each iterator value in [begin, end)

template<class Edge , class BidirectionalGraph , class GRef >

boost::graph_traits<BidirectionalGraph>::vertex_descriptor utilmm::target	(	const Edge &	e,
		const undirected_graph< BidirectionalGraph, GRef > &	g
	)

inline

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g, and source().

Referenced by source(), and utilmm::detail::undir_dfv_impl_term().

template<typename IncidenceGraph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap , typename TerminatorFunc >

void utilmm::undirected_depth_first_visit	(	const IncidenceGraph &	g,
		typename boost::graph_traits< IncidenceGraph >::vertex_descriptor	u,
		DFSVisitor	vis,
		VertexColorMap	vertex_color,
		EdgeColorMap	edge_color,
		TerminatorFunc	func = `TerminatorFunc()`
	)

References utilmm::detail::undir_dfv_impl_term().

template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap , typename Vertex >

void utilmm::undirected_dfs	(	const Graph &	g,
		DFSVisitor	vis,
		VertexColorMap	vertex_color,
		EdgeColorMap	edge_color,
		Vertex	start_vertex
	)

References edges(), put(), utilmm::detail::undir_dfv_impl_term(), and vertices().

Referenced by utilmm::detail::udfs_dispatch< VertexColorMap >::apply(), utilmm::detail::udfs_dispatch< boost::detail::error_property_not_found >::apply(), and undirected_dfs().

template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >

void utilmm::undirected_dfs	(	const Graph &	g,
		DFSVisitor	vis,
		VertexColorMap	vertex_color,
		EdgeColorMap	edge_color
	)

References undirected_dfs(), and vertices().

template<typename Graph , typename P , typename T , typename R >

void utilmm::undirected_dfs	(	const Graph &	g,
		const boost::bgl_named_params< P, T, R > &	params
	)

References utilmm::detail::udfs_dispatch< VertexColorMap >::apply(), and vertices().

std::string utilmm::upcase ( std::string const & s )

inline

template<class BidirectionalGraph , class GRef >

std::pair<typename undirected_graph<BidirectionalGraph>::vertex_iterator, typename undirected_graph<BidirectionalGraph>::vertex_iterator> utilmm::vertices ( const undirected_graph< BidirectionalGraph, GRef > & g )

References utilmm::undirected_graph< BidirectionalGraph, GraphRef >::m_g.

Referenced by undirected_dfs().

Namespaces

Classes

Typedefs

Functions

Typedef Documentation

Function Documentation