Namespaces | Classes | Typedefs | Functions | Variables
utilmm Namespace Reference

Namespaces

namespace  detail
namespace  details
namespace  endian
namespace  factory_toolbox
 

Toolbox for factory implementation.


namespace  hash_toolbox
 

toolbox for hash containers


namespace  plugin
namespace  pools
namespace  singleton
 

Singleton manipulation.


namespace  smart
 

Smart pointers implementation.


Classes

struct  arg_traits
 argument type traits More...
class  auto_close
class  auto_flag
class  auto_flag< bool >
class  bad_syntax
class  base_socket
class  basic_symbol
 Generic string using unique instance memory. More...
struct  binary_compose_2
 Binary functor composition with two unary functors. More...
class  cached_fn
 A functor with cache. More...
class  cmdline_option
class  command_line
class  commandline_error
class  config_file
class  config_set
class  ConfigurationFinder
class  factory
 Generic Factory implementation. More...
struct  hash
 hash functor More...
struct  hash< basic_symbol< CharT, Traits, Alloc > >
struct  hash< bool >
struct  hash< char >
struct  hash< double >
struct  hash< float >
struct  hash< long double >
struct  hash< signed char >
struct  hash< signed int >
struct  hash< signed long int >
struct  hash< signed short int >
struct  hash< smart::pointer< Manager > >
struct  hash< std::basic_string< CharT, Traits, Alloc > >
struct  hash< Ty * >
struct  hash< unsigned char >
struct  hash< unsigned int >
struct  hash< unsigned long int >
struct  hash< unsigned short int >
class  hash_map
 map with hashing access More...
class  hash_set
 set with hashing access More...
struct  identity
 Identity functor. More...
class  iterator_sequence
struct  not_found
struct  parse_error
class  pkgconfig
struct  pkgconfig_error
class  process
struct  select_1st
 First pair attribute access. More...
struct  select_2nd
 Second pair attribute access. More...
class  server_socket
class  socket
class  tempfile
struct  unary_compose
 Unary functors composition. More...
class  undirected_graph
struct  undirected_graph_tag
class  undirected_property_map
class  unix_error

Typedefs

typedef std::list< std::string > stringlist
typedef basic_symbol< char > symbol
 specialization of utilmm::basic_symbol using char

Functions

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)
boost::filesystem::path clean_path (std::string str)
std::string demangle (char const *name)
 name demangling function
std::string demangle (std::string const &name)
 name demangling function
std::string demangle (std::type_info const &type)
 demangled name function
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
undirected_graph
< BidirectionalGraph >
::edge_iterator, typename
undirected_graph
< BidirectionalGraph >
::edge_iterator > 
edges (const undirected_graph< BidirectionalGraph, GRef > &g)
template<typename PropertyMap , typename EdgeDescriptor >
boost::property_traits
< PropertyMap >::value_type 
get (undirected_property_map< PropertyMap > const &map, EdgeDescriptor e)
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 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)
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=" ")
template<typename PropertyMap >
undirected_property_map
< PropertyMap > 
make_undirected_edge_map (PropertyMap pmap)
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 >
undirected_graph
< BidirectionalGraph >
::edges_size_type 
num_edges (const undirected_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
BidirectionalGraph::vertices_size_type num_vertices (const undirected_graph< BidirectionalGraph, GRef > &g)
std::ostream & operator<< (std::ostream &stream, utilmm::command_line const &cmdline)
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
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<typename PropertyMap , typename EdgeDescriptor , typename ValueType >
void put (undirected_property_map< PropertyMap > &map, EdgeDescriptor e, ValueType value)
template<typename Ty >
std::string real_name_of ()
 demangled name function
std::string shell_expand (std::string const &text)
template<class Edge , class BidirectionalGraph , class GRef >
boost::graph_traits
< BidirectionalGraph >
::vertex_descriptor 
source (const Edge &e, const undirected_graph< BidirectionalGraph, GRef > &g)
stringlist split (std::string const &s, std::string const &sep=" ", bool ignore_empty=true)
bool starts_with (std::string const &str, std::string const &start)
template<typename Iterator >
void sweep (Iterator begin, Iterator end)
template<typename Iterator >
void sweep_arrays (Iterator begin, Iterator end)
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 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<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)
std::string upcase (std::string const &s)
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)

Variables

const char * configEnv = "ROCK_CONFIG_PATH"

Typedef Documentation

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

Definition at line 12 of file stringtools.hh.

specialization of utilmm::basic_symbol using char

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

Definition at line 15 of file symbol_fwd.hh.


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]

Definition at line 244 of file undirected_graph.hh.

boost::filesystem::path utilmm::clean_path ( std::string  str) [inline]

Definition at line 77 of file stringtools.hh.

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:
nameAn 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@laas.fr>

Definition at line 10 of file demangle.cc.

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:
nameAn internal C++ type name
Returns:
the real name of this type
Author:
Frédéric Py <fpy@laas.fr>

Definition at line 40 of file demangle.hh.

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:
typeA C++ type descriptor
Returns:
the real name of this type
Author:
Frédéric Py <fpy@laas.fr>

Definition at line 55 of file demangle.hh.

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]

Definition at line 227 of file undirected_graph.hh.

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)

Definition at line 179 of file undirected_graph.hh.

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

Definition at line 333 of file undirected_graph.hh.

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]

Definition at line 262 of file undirected_graph.hh.

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]

Definition at line 237 of file undirected_graph.hh.

std::string utilmm::join ( stringlist const &  l,
std::string const &  sep = " " 
) [inline]

Definition at line 38 of file stringtools.hh.

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

Definition at line 55 of file stringtools.hh.

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

Definition at line 338 of file undirected_graph.hh.

template<class BidirectionalGraph >
undirected_graph<BidirectionalGraph> utilmm::make_undirected_graph ( const BidirectionalGraph &  g) [inline]

Definition at line 156 of file undirected_graph.hh.

template<class BidirectionalGraph >
undirected_graph<BidirectionalGraph, BidirectionalGraph&> utilmm::make_undirected_graph ( BidirectionalGraph &  g) [inline]

Definition at line 163 of file undirected_graph.hh.

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

Definition at line 212 of file undirected_graph.hh.

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

Definition at line 205 of file undirected_graph.hh.

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

Definition at line 212 of file commandline.hh.

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]

Definition at line 219 of file undirected_graph.hh.

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]

Definition at line 187 of file undirected_graph.hh.

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

Definition at line 328 of file undirected_graph.hh.

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:
TyA C++ type
Returns:
the real name of this type
Author:
Frédéric Py <fpy@laas.fr>

Definition at line 71 of file demangle.hh.

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]

Definition at line 268 of file undirected_graph.hh.

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

Definition at line 14 of file stringtools.hh.

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

Definition at line 74 of file stringtools.hh.

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

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

Definition at line 9 of file sweep.hh.

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

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

Definition at line 21 of file sweep.hh.

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]

Definition at line 278 of file undirected_graph.hh.

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() 
)

Definition at line 214 of file undirected_dfs.hh.

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 
)

Definition at line 104 of file undirected_dfs.hh.

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

Definition at line 138 of file undirected_dfs.hh.

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 
)

Definition at line 191 of file undirected_dfs.hh.

std::string utilmm::upcase ( std::string const &  s) [inline]

Definition at line 63 of file stringtools.hh.

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)

Definition at line 171 of file undirected_graph.hh.


Variable Documentation

const char* utilmm::configEnv = "ROCK_CONFIG_PATH"

Definition at line 14 of file configuration_finder.cc.



utilmm
Author(s): Sylvain Joyeux/sylvain.joyeux@m4x.org
autogenerated on Thu Jan 2 2014 11:38:31