aGrUM  0.16.0
edgeGraphPart_tpl.h
Go to the documentation of this file.
1 
29 #ifndef DOXYGEN_SHOULD_SKIP_THIS
30 
31 // to ease parsing by IDE
33 
34 namespace gum {
35 
36  template < typename VAL >
37  INLINE EdgeProperty< VAL > EdgeGraphPart::edgesProperty(VAL (*f)(const Edge&),
38  Size size) const {
39  return __edges.hashMap(f, size);
40  }
41 
42  template < typename VAL >
43  INLINE EdgeProperty< VAL > EdgeGraphPart::edgesProperty(const VAL& val,
44  Size size) const {
45  return __edges.hashMap(val, size);
46  }
47 
48  template < typename VAL >
49  INLINE List< VAL > EdgeGraphPart::listMapEdges(VAL (*f)(const Edge&)) const {
50  return __edges.listMap(f);
51  }
52 
53 } /* namespace gum */
54 
55 #endif // DOXYGEN_SHOULD_SKIP_THIS
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
EdgeProperty< VAL > edgesProperty(VAL(*f)(const Edge &), Size size=0) const
a method to create a hashMap of VAL from a set of edges (using for every edge, say x...
List< VAL > listMapEdges(VAL(*f)(const Edge &)) const
a method to create a list of VAL from a set of edges (using for every edge, say x, the VAL f(x))
HashTable< Key, NewKey, NewAlloc > hashMap(NewKey(*f)(const Key &), Size capacity=0) const
Creates a hashtable of NewKey from the set.
Definition: set_tpl.h:838
List< NewKey, NewAlloc > listMap(NewKey(*f)(const Key &)) const
A method to create a List of NewKey from the set.
Definition: set_tpl.h:884
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:48
EdgeSet __edges
the set of all the edges contained within the EdgeGraphPart