Home
last modified time | relevance | path

Searched refs:g2 (Results 1 – 4 of 4) sorted by relevance

/oneTBB/doc/main/tbb_userguide/
H A Dcommunicate_with_nodes.rst42 graph g2;
43 function_node< int, int > m1( g2, 1, [](int i) -> int {
48 function_node< int, int > m2( g2, 1, [&](int i) -> int {
63 g2.wait_for_all();
83 g2. The call to g2.wait_for_all returns after both m1 and m2 are done,
84 since they belong to g2; the call does not however wait for n1 and n2,
95 g2.wait_for_all();
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolyover.cpp51 int r1, g1, b1, r2, g2, b2; in OverlayOnePolygonWithMap() local
62 p2->getColor(&r2, &g2, &b2); in OverlayOnePolygonWithMap()
64 myg = g1 + g2; in OverlayOnePolygonWithMap()
342 int r1, g1, b1, r2, g2, b2; in operator ()() local
368 p2->getColor(&r2, &g2, &b2); in operator ()()
370 myg = g1 + g2; in operator ()()
477 int r1, g1, b1, r2, g2, b2; in operator ()() local
503 p2->getColor(&r2, &g2, &b2); in operator ()()
505 myg = g1 + g2; in operator ()()
614 int r1, g1, b1, r2, g2, b2; in operator ()() local
[all …]
/oneTBB/test/tbb/
H A Dtest_flow_graph.cpp367 graph g2; variable
369 CHECK_MESSAGE((g.begin() != g2.begin()), "Different graphs should have different iterators");
H A Dtest_flow_graph_whitebox.cpp920 graph g2; variable
921 CHECK_MESSAGE((g2.begin() == g2.end()), "Starting graph is empty");