#include "shamalgs/details/numeric/numeric.hpp"
#include "shambackends/DeviceScheduler.hpp"
#include "shambackends/EventList.hpp"
#include "shammath/AABB.hpp"
#include "shammodels/common/amr/NeighGraph.hpp"
#include "shamrock/patch/PatchDataField.hpp"
#include "shamtree/TreeTraversal.hpp"

Include dependency graph for compute_neigh_graph.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	shammodels
	namespace for models

namespace	shammodels::basegodunov
	namespace for the basegodunov model

namespace	shammodels::basegodunov::modules
	namespace for the basegodunov model modules

Functions
template<class NeighFindKernel , class... Args>
shammodels::basegodunov::modules::NeighGraph	shammodels::basegodunov::modules::details::compute_neigh_graph (const sham::DeviceScheduler_ptr &dev_sched, u32 graph_nodes, Args &&...args)
	Create a neighbour graph using a class that will list the ids of the found neighbourgh NeighFindKernel will list the index and that function will run it twice to generate the graph.

template<class NeighFindKernel , class... Args>
shammodels::basegodunov::modules::NeighGraph	shammodels::basegodunov::modules::details::compute_neigh_graph_deprecated (const sham::DeviceScheduler_ptr &dev_sched, u32 graph_nodes, Args &&...args)
	Create a neighbour graph using a class that will list the ids of the found neighbourgh NeighFindKernel will list the index and that function will run it twice to generate the graph.

Detailed Description

Author: Timothée David–Cléris (tim.s.nosp@m.hamr.nosp@m.ock@p.nosp@m.roto.nosp@m.n.me)

Definition in file compute_neigh_graph.hpp.

Function Documentation

◆ compute_neigh_graph()

template<class NeighFindKernel , class... Args>

shammodels::basegodunov::modules::NeighGraph shammodels::basegodunov::modules::details::compute_neigh_graph	(	const sham::DeviceScheduler_ptr &	dev_sched,
		u32	graph_nodes,
		Args &&...	args
	)

Create a neighbour graph using a class that will list the ids of the found neighbourgh NeighFindKernel will list the index and that function will run it twice to generate the graph.

Template Parameters

NeighFindKernel	the neigh find kernel
Args	arguments that will be forwarded to the kernel

Parameters

q	the sycl queue
graph_nodes	the number of graph nodes
args	arguments that will be forwarded to the kernel

Returns: shammodels::basegodunov::modules::NeighGraph the neigh graph

Definition at line 41 of file compute_neigh_graph.hpp.

Here is the call graph for this function:

◆ compute_neigh_graph_deprecated()

template<class NeighFindKernel , class... Args>

shammodels::basegodunov::modules::NeighGraph shammodels::basegodunov::modules::details::compute_neigh_graph_deprecated	(	const sham::DeviceScheduler_ptr &	dev_sched,
		u32	graph_nodes,
		Args &&...	args
	)

Create a neighbour graph using a class that will list the ids of the found neighbourgh NeighFindKernel will list the index and that function will run it twice to generate the graph.

// TODO remove it when the tree will finally be USM