Reference documentation for deal.II version 9.4.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Public Types | Static Public Member Functions | List of all members
ArborX::AccessTraits<::ArborXWrappers::PointNearestPredicate, PredicatesTag > Struct Reference

#include <deal.II/arborx/access_traits.h>

Public Types

using memory_space = Kokkos::HostSpace
 

Static Public Member Functions

static std::size_t size (const ::ArborXWrappers::PointNearestPredicate &pt_nearest)
 
static auto get (const ::ArborXWrappers::PointNearestPredicate &pt_nearest, std::size_t i)
 

Detailed Description

This struct allows ArborX to use PointNearestPredicate as a predicate.

Definition at line 420 of file access_traits.h.

Member Typedef Documentation

◆ memory_space

using ArborX::AccessTraits<::ArborXWrappers::PointNearestPredicate, PredicatesTag >::memory_space = Kokkos::HostSpace

Definition at line 423 of file access_traits.h.

Member Function Documentation

◆ size()

std::size_t ArborX::AccessTraits<::ArborXWrappers::PointNearestPredicate, PredicatesTag >::size ( const ::ArborXWrappers::PointNearestPredicate pt_nearest)
inlinestatic

The number of points stored in pt_nearest.

Definition at line 580 of file access_traits.h.

◆ get()

auto ArborX::AccessTraits<::ArborXWrappers::PointNearestPredicate, PredicatesTag >::get ( const ::ArborXWrappers::PointNearestPredicate pt_nearest,
std::size_t  i 
)
inlinestatic

Return an ArborX::nearest(ArborX::Point, PointNearestPredicate::get_n_nearest_neighbors) object constructed from the ith Point stored in pt_nearest.

Definition at line 589 of file access_traits.h.


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