Data structure to contain the two caches. More...

#include <node.hpp>

Public Attributes
std::map< size_t, std::shared_ptr< leaf_node< T, SAFE_MATH > > >	nodes
	Cache of node.

std::map< size_t, backend::buffer< T > >	backends
	Cache of backend buffers.

Detailed Description

template<jit::float_scalar T, bool SAFE_MATH = false>
struct graph::leaf_node< T, SAFE_MATH >::caches_t

Data structure to contain the two caches.

This a avoids an issue on gnu compilers where it would try to redefine the __tls_guard twice depending on the include order.

The documentation for this struct was generated from the following file:

Public Attributes