Home
last modified time | relevance | path

Searched refs:Cell (Results 1 – 5 of 5) sorted by relevance

/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DGraph.hpp40 class Cell { class
46 Cell* input[2];
55 std::vector<Cell*> successor;
64 Cell() {} in Cell() function in Cell
67 Cell(const Cell& other);
72 std::vector<Cell> my_vertex_set;
82 void get_root_set(std::vector<Cell*>& root_set);
H A DGraph.cpp23 Cell::Cell(const Cell& other) : op(other.op), value(other.value), successor(other.successor) { in Cell() function in Cell
33 Cell& c = my_vertex_set[k]; in create_random_dag()
40 c.value = Cell::value_type((float)k); in create_random_dag()
48 Cell& input = my_vertex_set[rand() % k]; in create_random_dag()
63 void Graph::get_root_set(std::vector<Cell*>& root_set) { in get_root_set()
69 Cell& c = my_vertex_set[k]; in get_root_set()
79 void Cell::update() { in update()
H A Dparallel_preorder.cpp31 typedef Cell* argument_type;
33 void operator()(Cell* c, oneapi::tbb::feeder<Cell*>& feeder) const { in operator ()()
38 Cell* successor = c->successor[k]; in operator ()()
49 void ParallelPreorderTraversal(const std::vector<Cell*>& root_set) { in ParallelPreorderTraversal()
H A Dmain.cpp33 class Cell;
34 void ParallelPreorderTraversal(const std::vector<Cell*>& root_set);
73 std::vector<Cell*> root_set; in main()
H A DREADME.md9 …ef_count` that is an atomic integer. Initialize `ref_count` to the number of inputs for the `Cell`.
20 * The smaller value type causes each `Cell` to be significantly smaller than a cache line, which le…