| /dports/misc/py-gluonnlp/gluon-nlp-0.10.0/src/gluonnlp/data/xlnet/ |
| H A D | squad.py | 57 if index_map[pos] is not None:
58 return index_map[pos]
59 N = len(index_map)
66 assert index_map[front] is not None or index_map[rear] is not None
67 if index_map[front] is None:
68 if index_map[rear] >= 1:
73 return index_map[rear]
74 if index_map[rear] is None:
80 return index_map[front]
82 if index_map[rear] > index_map[front] + 1:
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/base/ |
| H A D | polynomials_p.cc | 29 create_polynomial_ordering(index_map); in PolynomialsP()
30 this->set_numbering(index_map); in PolynomialsP()
37 std::vector<unsigned int> &index_map) const in create_polynomial_ordering()
39 Assert(index_map.size() == this->n(), in create_polynomial_ordering()
44 index_map[i] = i; in create_polynomial_ordering()
62 std::vector<unsigned int> &index_map) const in create_polynomial_ordering()
64 Assert(index_map.size() == this->n(), in create_polynomial_ordering()
75 index_map[i] = imap2[p][i]; in create_polynomial_ordering()
91 std::vector<unsigned int> &index_map) const in create_polynomial_ordering()
93 Assert(index_map.size() == this->n(), in create_polynomial_ordering()
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/experimental/ |
| H A D | AABB_filtered_projection_traits.h | 59 IndexPropertyMap index_map = IndexPropertyMap())
64 index_map(index_map) in m_closest_point()
71 IndexPropertyMap index_map = IndexPropertyMap())
76 index_map(index_map) in m_closest_point()
85 IndexPropertyMap index_map = IndexPropertyMap())
89 index_map(index_map) in m_closest_point_initialized()
95 IndexPropertyMap index_map = IndexPropertyMap())
99 index_map(index_map) in m_closest_point_initialized()
108 const Index_type& id = get(index_map, primitive.id()); in intersection()
157 IndexPropertyMap index_map; variable
|
| /dports/math/py-or-tools/or-tools-9.2/examples/python/ |
| H A D | maze_escape_sat.py | 43 before_index = index_map[(x, y, z)]
45 after_index = index_map[(x + dx, y + dy, z + dz)]
61 index_map = {}
67 index_map[(x, y, z)] = counter
91 add_neighbor(size, x, y, z, -1, 0, 0, model, index_map,
93 add_neighbor(size, x, y, z, 1, 0, 0, model, index_map,
95 add_neighbor(size, x, y, z, 0, -1, 0, model, index_map,
97 add_neighbor(size, x, y, z, 0, 1, 0, model, index_map,
99 add_neighbor(size, x, y, z, 0, 0, -1, model, index_map,
101 add_neighbor(size, x, y, z, 0, 0, 1, model, index_map,
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 126 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
165 cout << index_map[*i] << " "; in main()
169 perm[index_map[sloan_order[c]]] = c; in main()
171 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
174 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
177 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
183 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
205 cout << index_map[*i] << " "; in main()
209 perm[index_map[sloan_order[c]]] = c; in main()
211 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 126 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
165 cout << index_map[*i] << " "; in main()
169 perm[index_map[sloan_order[c]]] = c; in main()
171 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
174 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
177 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
183 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
205 cout << index_map[*i] << " "; in main()
209 perm[index_map[sloan_order[c]]] = c; in main()
211 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 125 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
164 cout << index_map[*i] << " "; in main()
168 perm[index_map[sloan_order[c]]] = c; in main()
170 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
173 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
176 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
182 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
204 cout << index_map[*i] << " "; in main()
208 perm[index_map[sloan_order[c]]] = c; in main()
210 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 125 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
164 cout << index_map[*i] << " "; in main()
168 perm[index_map[sloan_order[c]]] = c; in main()
170 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
173 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
176 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
182 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
204 cout << index_map[*i] << " "; in main()
208 perm[index_map[sloan_order[c]]] = c; in main()
210 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 125 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
164 cout << index_map[*i] << " "; in main()
168 perm[index_map[sloan_order[c]]] = c; in main()
170 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
173 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
176 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
182 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
204 cout << index_map[*i] << " "; in main()
208 perm[index_map[sloan_order[c]]] = c; in main()
210 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 125 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
164 cout << index_map[*i] << " "; in main()
168 perm[index_map[sloan_order[c]]] = c; in main()
170 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
173 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
176 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
182 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
204 cout << index_map[*i] << " "; in main()
208 perm[index_map[sloan_order[c]]] = c; in main()
210 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 126 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
165 cout << index_map[*i] << " "; in main()
169 perm[index_map[sloan_order[c]]] = c; in main()
171 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
174 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
177 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
183 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
205 cout << index_map[*i] << " "; in main()
209 perm[index_map[sloan_order[c]]] = c; in main()
211 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 125 property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G); in main() local
164 cout << index_map[*i] << " "; in main()
168 perm[index_map[sloan_order[c]]] = c; in main()
170 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
173 << profile(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
176 << max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
182 << rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
204 cout << index_map[*i] << " "; in main()
208 perm[index_map[sloan_order[c]]] = c; in main()
210 << bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0])) in main()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | sloan_ordering.cpp | 114 property_map< Graph, vertex_index_t >::type index_map in main() local
152 cout << index_map[*i] << " "; in main()
156 perm[index_map[sloan_order[c]]] = c; in main()
160 &perm[0], index_map, perm[0])) in main()
165 &perm[0], index_map, perm[0])) in main()
170 &perm[0], index_map, perm[0])) in main()
175 &perm[0], index_map, perm[0])) in main()
180 &perm[0], index_map, perm[0])) in main()
197 cout << index_map[*i] << " "; in main()
201 perm[index_map[sloan_order[c]]] = c; in main()
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Arr_vertex_index_map.h | 61 Index_map index_map; // Mapping vertices to indices. variable
108 return index_map[v];
157 index_map.clear(); in after_detach()
174 index_map[v] = n_vertices - 1; in after_create_vertex()
192 index_map[v] = n_vertices - 1; in after_create_boundary_vertex()
215 unsigned int index = index_map[v]; in before_remove_vertex()
221 index_map[last_v] = index; in before_remove_vertex()
243 index_map.clear(); in _init()
255 index_map[vh] = index; in _init()
270 unsigned int get (const CGAL::Arr_vertex_index_map<Arrangement>& index_map, in get() argument
[all …]
|
| H A D | Arr_face_index_map.h | 60 Index_map index_map; // Mapping faces to indices. variable
107 return (index_map[f]);
156 index_map.clear(); in after_detach()
177 index_map[new_f] = n_faces - 1; in after_split_face()
206 unsigned int index = index_map[f2]; in before_merge_face()
212 index_map[last_f] = index; in before_merge_face()
236 index_map.clear(); in _init()
248 index_map[fh] = index; in _init()
265 unsigned int get (const CGAL::Arr_face_index_map<Arrangement>& index_map, in get() argument
268 return (index_map[f]); in get()
|
| /dports/net-p2p/vuze/vuze-5.7.4.0_2/com/aelitis/azureus/core/util/ |
| H A D | LinkFileMap.java | 59 Entry entry = index_map.get( index ); in get()
98 Entry entry = index_map.get( index ); in getEntry()
140 index_map.put( index, entry ); in put()
182 index_map.remove( index ); in remove()
198 for (Entry entry: index_map.values()){ in hasLinks()
219 for (Entry entry: index_map.values()){ in size()
238 if ( index_map.size() > 0 ){ in entryIterator()
242 return( index_map.values().iterator()); in entryIterator()
245 Set<Entry> entries = new HashSet<Entry>( index_map.values()); in entryIterator()
260 if ( index_map.size() > 0 ){ in getString()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/distributed/ |
| H A D | dijkstra_shortest_paths.hpp | 41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
46 weight, index_map, color_map, compare, in run()
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
92 ::run(g, s, predecessor, distance, lookahead, weight, index_map, in run()
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
145 make_iterator_property_map(colors.begin(), index_map), in run()
175 IndexMap index_map, in dijkstra_shortest_paths() argument
191 DefColorMap color_map(color.begin(), index_map); in dijkstra_shortest_paths()
[all …]
|