Searched refs:my_map (Results 1 – 5 of 5) sorted by relevance
| /oneTBB/examples/graph/som/ |
| H A D | som.hpp | 131 std::vector<std::vector<SOM_element>> my_map; member in SOMap
135 my_map.reserve(xSize); in SOMap()
137 my_map.push_back(teaching_vector_type()); in SOMap()
138 my_map[i].reserve(ySize); in SOMap()
140 my_map[i].push_back(SOM_element()); in SOMap()
145 return my_map.size(); in size()
149 return my_map[indx]; in operator []()
152 return my_map[xVal][yVal]; in at()
167 if (max_xiter > (int)my_map.size() - 1) in epoch_update()
168 max_xiter = (int)(my_map.size() - 1); in epoch_update()
[all …]
|
| H A D | som.cpp | 109 my_map[x][y][i] = (randval(min_range[i], max_range[i])); in initialize()
112 my_map[x][y][i] = in initialize()
128 double dist = distance_squared(s, my_map[x][y]); in BMU_range()
157 if (max_xiter > (int)my_map.size() - 1) in epoch_update_range()
158 max_xiter = (int)my_map.size() - 1; in epoch_update_range()
168 if (yy >= 0 && yy < (int)my_map[xx].size()) { in epoch_update_range()
172 add_fraction_of_difference(my_map[xx][yy], s, theta * learning_rate); in epoch_update_range()
187 subsquare_type br2(0, (int)my_map.size(), 1, 0, (int)my_map[0].size(), 1); in teach()
199 for (int i = 0; i < (int)(this->my_map.size()); ++i) { in debug_output()
200 for (int j = 0; j < (int)(this->my_map[i].size()); ++j) { in debug_output()
[all …]
|
| H A D | som_graph.cpp | 84 SOMap &my_map; member in BMU_search_body
90 : my_map(_m), in BMU_search_body()
94 : my_map(other.my_map), in BMU_search_body()
100 double min_dist = my_map.BMU_range(s, my_x, my_y, my_square); in operator ()()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_hash_map.h | 387 hash_map_iterator(): my_map(), my_index(), my_bucket(), my_node() {} in hash_map_iterator()
389 my_map(other.my_map), in hash_map_iterator()
396 my_map = other.my_map;
441 while (k <= my_map->my_mask.load(std::memory_order_relaxed)) { in advance_to_next_bucket()
445 else my_bucket = my_map->get_bucket( k ); in advance_to_next_bucket()
470 my_map(&map), my_index(index), my_bucket(b), my_node(static_cast<node*>(n)) in hash_map_iterator()
477 const Container *my_map; variable
488 return i.my_node == j.my_node && i.my_map == j.my_map;
493 return i.my_node != j.my_node || i.my_map != j.my_map;
559 auto b = my_begin.my_map->get_bucket(m); in set_midpoint()
[all …]
|
| /oneTBB/test/tbb/ |
| H A D | test_enumerable_thread_specific.cpp | 283 typedef typename std::map<Key, Val> my_map; in flog_segmented_iterator_map() typedef
284 typedef std::vector< my_map > nested_vec; in flog_segmented_iterator_map()
285 my_map my_inner_container; in flog_segmented_iterator_map()
|