MCPcopy Create free account

hub / github.com/arborx/ArborX / functions

Functions400 in github.com/arborx/ArborX

↓ 127 callersMethoddata
src/details/ArborX_DetailsContainers.hpp:55
↓ 65 callersFunctionintersects
check if two axis-aligned bounding boxes intersect
src/details/ArborX_DetailsAlgorithms.hpp:156
↓ 57 callersFunctionsize
src/details/ArborX_DetailsContainers.hpp:78
↓ 52 callersMethodsize
test/tstMiscellaneous.cpp:41
↓ 45 callersFunctionequals
src/details/ArborX_DetailsAlgorithms.hpp:26
↓ 43 callersMethodquery
test/ArborX_BoostRTreeHelpers.hpp:250
↓ 42 callersFunctiondistance
distance point-point
src/details/ArborX_DetailsAlgorithms.hpp:72
↓ 40 callersMethodempty
Capacity
src/details/ArborX_DetailsStack.hpp:43
↓ 34 callersMethodsize
src/details/ArborX_DetailsStack.hpp:44
↓ 29 callersMethodemplace
src/details/ArborX_DetailsStack.hpp:60
↓ 25 callersMethodback
src/details/ArborX_DetailsContainers.hpp:45
↓ 21 callersFunctionlastElement
src/details/ArborX_DetailsUtils.hpp:254
↓ 21 callersMethodmaxCorner
src/details/ArborX_Box.hpp:48
↓ 21 callersFunctionreallocWithoutInitializing
src/details/ArborX_DetailsUtils.hpp:518
↓ 20 callersFunctionexpand
expand an axis-aligned bounding box to include a point
src/details/ArborX_DetailsAlgorithms.hpp:110
↓ 20 callersFunctionmake_compressed_storage
test/boost_ext/CompressedStorageComparison.hpp:63
↓ 19 callersFunctionisValid
src/details/ArborX_DetailsAlgorithms.hpp:48
↓ 18 callersFunctionexclusivePrefixSum
src/details/ArborX_DetailsUtils.hpp:186
↓ 18 callersFunctionisPrefixedWith
test/tstKokkosToolsDistributedAnnotations.cpp:28
↓ 16 callersFunctionisPrefixedWith
test/tstKokkosToolsAnnotations.cpp:39
↓ 15 callersMethodisLeaf
src/details/ArborX_DetailsNode.hpp:30
↓ 15 callersFunctionmax
src/details/ArborX_DetailsUtils.hpp:380
↓ 15 callersMethodpush
Modifiers
src/details/ArborX_DetailsStack.hpp:51
↓ 15 callersFunctionquery
test/Search_UnitTestHelpers.hpp:92
↓ 14 callersMethodbounds
src/ArborX_LinearBVH.hpp:56
↓ 14 callersFunctioniota
src/details/ArborX_DetailsUtils.hpp:279
↓ 14 callersFunctionpopHeap
src/details/ArborX_DetailsHeap.hpp:94
↓ 14 callersFunctionpushHeap
src/details/ArborX_DetailsHeap.hpp:57
↓ 13 callersMethodtop
Element access
src/details/ArborX_DetailsPriorityQueue.hpp:77
↓ 12 callersMethodbegin
test/ArborX_EnableViewComparison.hpp:35
↓ 12 callersMethodcapacity
src/details/ArborX_DetailsContainers.hpp:42
↓ 12 callersMethodend
test/ArborX_EnableViewComparison.hpp:36
↓ 12 callersMethodmaxSize
src/details/ArborX_DetailsContainers.hpp:41
↓ 12 callersMethodsize
examples/halo_finder/ArborX_HaloFinder.hpp:98
↓ 11 callersMethoddata
src/details/ArborX_DetailsPriorityQueue.hpp:115
↓ 11 callersMethodfront
src/details/ArborX_DetailsContainers.hpp:52
↓ 11 callersMethodpop
src/details/ArborX_DetailsStack.hpp:64
↓ 11 callersMethodsize
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:193
↓ 10 callersFunctioncheck_valid_callback
src/details/ArborX_Callbacks.hpp:100
↓ 10 callersMethodpushBack
src/details/ArborX_DetailsContainers.hpp:47
↓ 9 callersFunctionisHeap
src/details/ArborX_DetailsHeap.hpp:25
↓ 9 callersFunctionmin
src/details/ArborX_DetailsUtils.hpp:347
↓ 9 callersMethodradius
src/details/ArborX_Sphere.hpp:39
↓ 8 callersFunctioncheck_heap
test/tstDetailsTreeTraversal.cpp:32
↓ 8 callersFunctioncreate_layout_right_mirror_view
src/details/ArborX_DetailsUtils.hpp:48
↓ 8 callersFunctiongetK
src/details/ArborX_Predicates.hpp:83
↓ 7 callersFunctionattach
src/details/ArborX_Predicates.hpp:135
↓ 7 callersMethodsize
test/Search_UnitTestHelpers.hpp:58
↓ 6 callersFunctionaccumulate
src/details/ArborX_DetailsUtils.hpp:417
↓ 6 callersFunctionadjacentDifference
src/details/ArborX_DetailsUtils.hpp:467
↓ 6 callersFunctioncheck_valid_access_traits
src/details/ArborX_AccessTraits.hpp:100
↓ 6 callersFunctionexpandBits
Expands a 10-bit integer into 30 bits by inserting 2 zeros after each bit.
src/details/ArborX_DetailsMortonCode.hpp:26
↓ 6 callersFunctionmaxSize
src/details/ArborX_DetailsContainers.hpp:79
↓ 6 callersMethodpopBack
src/details/ArborX_DetailsContainers.hpp:51
↓ 6 callersMethodsize
src/details/ArborX_DetailsPriorityQueue.hpp:74
↓ 5 callersFunctioncheckBufferLayout
test/tstDetailsDistributedSearchTreeImpl.cpp:281
↓ 5 callersMethodgetRoot
src/details/ArborX_DetailsTreeVisualization.hpp:61
↓ 5 callersFunctionminMax
src/details/ArborX_DetailsUtils.hpp:316
↓ 5 callersFunctionperformQueries
test/ArborX_BoostRTreeHelpers.hpp:178
↓ 5 callersMethodquery
src/ArborX_LinearBVH.hpp:59
↓ 5 callersFunctionqueryImpl
src/details/ArborX_DetailsBufferOptimization.hpp:232
↓ 5 callersFunctionsortObjects
src/details/ArborX_DetailsSortUtils.hpp:64
↓ 4 callersFunctioncheckViewWasNotAllocated
test/tstDetailsDistributedSearchTreeImpl.cpp:188
↓ 4 callersMethodgetNodePtr
src/details/ArborX_DetailsTreeConstruction.hpp:269
↓ 4 callersMethodpopPush
src/details/ArborX_DetailsPriorityQueue.hpp:106
↓ 4 callersFunctionqueryDispatch
src/details/ArborX_DetailsBoundingVolumeHierarchyImpl.hpp:96
↓ 4 callersFunctionreturnCentroid
src/details/ArborX_DetailsAlgorithms.hpp:196
↓ 3 callersFunctioncentroid
calculate the centroid of a box
src/details/ArborX_DetailsAlgorithms.hpp:183
↓ 3 callersFunctioncheckNewViewWasAllocated
test/tstDetailsDistributedSearchTreeImpl.cpp:212
↓ 3 callersFunctioncloneWithoutInitializingNorCopying
src/details/ArborX_DetailsUtils.hpp:542
↓ 3 callersMethodcreateFromSends
src/details/ArborX_DetailsDistributor.hpp:205
↓ 3 callersFunctionempty
src/details/ArborX_DetailsContainers.hpp:65
↓ 3 callersFunctiongeneratePointCloud
benchmarks/point_clouds/point_clouds.hpp:193
↓ 3 callersMethodgetComm
src/ArborX_DistributedSearchTree.hpp:104
↓ 3 callersMethodgetNewTimer
NOTE Original code had the pointer semantics. Can change in the future. The smart pointer is a distraction. The main problem here is that the refere
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:79
↓ 3 callersMethodlaunch
src/details/ArborX_DetailsBoundingVolumeHierarchyImpl.hpp:78
↓ 3 callersFunctionmakeLeafNode
src/details/ArborX_DetailsNode.hpp:46
↓ 3 callersFunctionmake_reference_solution
test/Search_UnitTestHelpers.hpp:85
↓ 3 callersFunctionmorton3D
Calculates a 30-bit Morton code for the given 3D point located within the unit cube [0,1].
src/details/ArborX_DetailsMortonCode.hpp:38
↓ 3 callersMethodsize
test/ArborX_EnableViewComparison.hpp:37
↓ 3 callersMethodstart
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:56
↓ 3 callersMethodstop
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:62
↓ 3 callersFunctiontoVectorOfTuples
test/tstMiscellaneous.cpp:53
↓ 3 callersFunctiontranslateAndScale
transformation that maps the unit cube into a new axis-aligned box NOTE safe to perform in-place
src/details/ArborX_DetailsAlgorithms.hpp:213
↓ 3 callersFunctiontraverse
src/details/ArborX_DetailsTreeTraversal.hpp:385
↓ 2 callersFunctionBOOST_CHECK_EXCEPTION
test/tstException.cpp:32
↓ 2 callersFunctionapplyPermutation
src/details/ArborX_DetailsSortUtils.hpp:190
↓ 2 callersMethodargv
benchmarks/bvh_driver/bvh_driver.cpp:300
↓ 2 callersFunctionassignMortonCodes
src/details/ArborX_DetailsTreeConstruction.hpp:114
↓ 2 callersFunctionbubbleDown
src/details/ArborX_DetailsHeap.hpp:73
↓ 2 callersFunctioncalculateBoundingBoxOfTheScene
src/details/ArborX_DetailsTreeConstruction.hpp:64
↓ 2 callersFunctionclone
src/details/ArborX_DetailsUtils.hpp:549
↓ 2 callersMethodemplaceBack
src/details/ArborX_DetailsContainers.hpp:50
↓ 2 callersMethodempty
Capacity
src/details/ArborX_DetailsPriorityQueue.hpp:73
↓ 2 callersFunctiongenerateHierarchy
src/details/ArborX_DetailsTreeConstruction.hpp:382
↓ 2 callersFunctiongetSizeOfArrays
test/VectorOfTuples.hpp:56
↓ 2 callersFunctioninitializeLeafNodes
src/details/ArborX_DetailsTreeConstruction.hpp:169
↓ 2 callersFunctionisFinite
src/details/ArborX_DetailsKokkosExt.hpp:68
↓ 2 callersFunctionis_commented
(line)
examples/viz/arborx_query_sort.py:30
↓ 2 callersFunctionis_edge
(line)
examples/viz/arborx_query_sort.py:33
next →1–100 of 400, ranked by callers