| /dports/lang/ruby26/ruby-2.6.9/spec/mspec/spec/utils/ |
| H A D | name_map_spec.rb | 28 describe NameMap, "#exception?" do
30 @map = NameMap.new
55 @map = NameMap.new true
89 describe NameMap, "#dir_name" do
91 @map = NameMap.new
121 describe NameMap, "#file_name" do
123 @map = NameMap.new
144 describe NameMap, "#namespace" do
146 @map = NameMap.new
160 describe NameMap, "#map" do
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| H A D | print-out-edges.cpp | 50 template < typename NameMap > class name_equals_t {
52 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
62 NameMap m_name_map;
66 template < typename NameMap >
67 inline name_equals_t < NameMap >
68 name_equals(const std::string & str, NameMap name) in name_equals()
70 return name_equals_t < NameMap > (str, name); in name_equals()
|
| H A D | print-in-edges.cpp | 50 template < typename NameMap > class name_equals_t {
52 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
62 NameMap m_name_map;
66 template < typename NameMap >
67 inline name_equals_t < NameMap >
68 name_equals(const std::string & str, NameMap name) in name_equals()
70 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-out-edges.cpp | 50 template < typename NameMap > class name_equals_t {
52 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
62 NameMap m_name_map;
66 template < typename NameMap >
67 inline name_equals_t < NameMap >
68 name_equals(const std::string & str, NameMap name) in name_equals()
70 return name_equals_t < NameMap > (str, name); in name_equals()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| H A D | print-in-edges.cpp | 50 template < typename NameMap > class name_equals_t {
52 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
62 NameMap m_name_map;
66 template < typename NameMap >
67 inline name_equals_t < NameMap >
68 name_equals(const std::string & str, NameMap name) in name_equals()
70 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| H A D | print-in-edges.cpp | 50 template < typename NameMap > class name_equals_t {
52 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
62 NameMap m_name_map;
66 template < typename NameMap >
67 inline name_equals_t < NameMap >
68 name_equals(const std::string & str, NameMap name) in name_equals()
70 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| H A D | print-adjacent-vertices.cpp | 51 template < typename NameMap > class name_equals_t {
53 name_equals_t(const std::string & n, NameMap map) in name_equals_t()
63 NameMap m_name_map;
67 template < typename NameMap >
68 inline name_equals_t < NameMap >
69 name_equals(const std::string & str, NameMap name) in name_equals()
71 return name_equals_t < NameMap > (str, name); in name_equals()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template <typename Graph, typename NameMap, typename VertexMap>
19 add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
42 template <typename Graph, typename NameMap, typename InputStream>
44 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
66 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_graph() typedef
67 return read_graph(g, NameMap(), is); in read_graph()
70 template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
72 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
107 typedef boost::null_property_map<Vertex, std::string> NameMap; in read_weighted_graph() typedef
109 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | helper.hpp | 17 template < typename Graph, typename NameMap, typename VertexMap >
19 Graph& g, NameMap nm, const std::string& name, VertexMap& vm) in add_named_vertex()
44 template < typename Graph, typename NameMap, typename InputStream >
47 read_graph(Graph& g, NameMap nm, InputStream& is) in read_graph()
72 typedef boost::null_property_map< Vertex, std::string > NameMap; in read_graph() typedef
73 return read_graph(g, NameMap(), is); in read_graph()
76 template < typename Graph, typename NameMap, typename WeightMap,
80 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
117 typedef boost::null_property_map< Vertex, std::string > NameMap; in read_weighted_graph() typedef
119 return read_weighted_graph(g, NameMap(), wm, is); in read_weighted_graph()
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/PRM/o3prm/ |
| H A D | O3NameSolver.h | 85 using NameMap = HashTable< std::string, std::string >; variable
87 NameMap _typeName_;
88 NameMap _eltName_;
89 NameMap _refName_;
90 NameMap _interfaceName_;
91 NameMap _className_;
|
| /dports/security/hs-cryptol/cryptol-2.11.0/src/Cryptol/TypeCheck/ |
| H A D | PP.hs | 12 ( NameMap, WithNames(..)
26 type NameMap = IntMap String type
28 emptyNameMap :: NameMap
33 data WithNames a = WithNames a NameMap
35 ppWithNamesPrec :: PP (WithNames a) => NameMap -> Int -> a -> Doc
38 ppWithNames :: PP (WithNames a) => NameMap -> a -> Doc
|
| /dports/games/hs-scroll/scroll-1.20180421/_cabal_deps/c2hs-0.28.7/src/Data/ |
| H A D | Attributes.hs | 91 import qualified Data.IntMap as NameMap (fromList, insert, findWithDefault, empty, assocs)
98 type NameMap = IntMap type
178 SoftTable (NameMap a) -- updated attr.s
190 "AttrTable "++ descr ++ " { " ++ (unwords . map show) (NameMap.assocs mp) ++ " }"
193 nameMapToList :: NameMap a -> [(Name, a)]
194 nameMapToList = map (\(k,v) -> (Name k, v)) . NameMap.assocs
195 nameMapFromList :: [(Name, a)] -> NameMap a
196 nameMapFromList = NameMap.fromList . map (\(k,v) -> (nameId k, v))
204 newAttrTable desc = SoftTable NameMap.empty desc
214 (SoftTable fm _) -> NameMap.findWithDefault undef (nameId aid) fm
[all …]
|