Home
last modified time | relevance | path

Searched refs:indx (Results 1 – 6 of 6) sorted by relevance

/oneTBB/examples/graph/som/
H A Dsom.hpp83 double &operator[](int indx) { in operator []() argument
84 return w.at(indx); in operator []()
86 const double &operator[](int indx) const { in operator []()
87 return w.at(indx); in operator []()
148 teaching_vector_type &operator[](int indx) { in operator []() argument
149 return my_map[indx]; in operator []()
H A Dsom_graph.cpp254 void cancel_submaps(int &xval, int &yval, double &radius, int indx) { in cancel_submaps() argument
262 (*g_array[indx])[x][y]->cancel(); in cancel_submaps()
270 void restart_submaps(int &xval, int &yval, double &radius, int indx, SOM_element &vector) { in restart_submaps() argument
279 (*g_array[indx])[x][y]->reset(); in restart_submaps()
281 (*s_array[indx])[x][y]->try_put(vector); in restart_submaps()
286 search_result_type graph_BMU(int indx) { // indx ranges over [0 .. SPECULATION_CNT -1] in graph_BMU() argument
287 wait_for_all_graphs(indx); // wait for the array of subgraphs in graph_BMU()
288 (g[indx])->wait_for_all(); in graph_BMU()
298 while ((q[indx])->try_get(sr)) { in graph_BMU()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp425 int indx = NextRan(maxSides); in GenerateMap() local
426 int polyIndx = validPolys[indx]; in GenerateMap()
427 int checkSide = validSide[indx]; in GenerateMap()
474 for (int i = indx + 1; i < maxSides; i++) { in GenerateMap()
545 #define indx(i, j) (i * gMapYSize + j) in CheckPolygonMap() macro
586 cArray[indx(i, j)] = 0; in CheckPolygonMap()
609 if (cArray[indx(i, j)] != 0) { in CheckPolygonMap()
610 std::cout << "checkMap error: polygons " << cArray[indx(i, j)] << " and " << k in CheckPolygonMap()
615 cArray[indx(i, j)] = k; in CheckPolygonMap()
621 if (cArray[indx(i, j)] == 0) { in CheckPolygonMap()
/oneTBB/test/tbb/
H A Dtest_eh_flow_graph.cpp446 template<class NodeType, class ItemType, int indx, NodeFetchType NFT>
449 template<class NodeType, class ItemType, int indx>
450 struct AttachPoint<NodeType,ItemType,indx,multifunc_node_type> {
452 return tbb::flow::output_port<indx>(n); in GetSender()
456 template<class NodeType, class ItemType, int indx>
457 struct AttachPoint<NodeType,ItemType,indx,func_node_type> {
H A Dtest_join_node.h62 K operator()(const int indx) { in operator()
63 return (K)(3*indx+1); in operator()
69 std::string operator()(const int indx) {
70 return std::string(names[indx % NameCnt]);
/oneTBB/examples/graph/fgbzip2/
H A Dbzlib.cpp757 Int32 BZ2_indexIntoF(Int32 indx, Int32* cftab) { in BZ2_indexIntoF() argument
763 if (indx >= cftab[mid]) in BZ2_indexIntoF()