Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/arborx/ArborX
/ functions
Functions
400 in github.com/arborx/ArborX
⨍
Functions
400
◇
Types & classes
206
↓ 127 callers
Method
data
src/details/ArborX_DetailsContainers.hpp:55
↓ 65 callers
Function
intersects
check if two axis-aligned bounding boxes intersect
src/details/ArborX_DetailsAlgorithms.hpp:156
↓ 57 callers
Function
size
src/details/ArborX_DetailsContainers.hpp:78
↓ 52 callers
Method
size
test/tstMiscellaneous.cpp:41
↓ 45 callers
Function
equals
src/details/ArborX_DetailsAlgorithms.hpp:26
↓ 43 callers
Method
query
test/ArborX_BoostRTreeHelpers.hpp:250
↓ 42 callers
Function
distance
distance point-point
src/details/ArborX_DetailsAlgorithms.hpp:72
↓ 40 callers
Method
empty
Capacity
src/details/ArborX_DetailsStack.hpp:43
↓ 34 callers
Method
size
src/details/ArborX_DetailsStack.hpp:44
↓ 29 callers
Method
emplace
src/details/ArborX_DetailsStack.hpp:60
↓ 25 callers
Method
back
src/details/ArborX_DetailsContainers.hpp:45
↓ 21 callers
Function
lastElement
src/details/ArborX_DetailsUtils.hpp:254
↓ 21 callers
Method
maxCorner
src/details/ArborX_Box.hpp:48
↓ 21 callers
Function
reallocWithoutInitializing
src/details/ArborX_DetailsUtils.hpp:518
↓ 20 callers
Function
expand
expand an axis-aligned bounding box to include a point
src/details/ArborX_DetailsAlgorithms.hpp:110
↓ 20 callers
Function
make_compressed_storage
test/boost_ext/CompressedStorageComparison.hpp:63
↓ 19 callers
Function
isValid
src/details/ArborX_DetailsAlgorithms.hpp:48
↓ 18 callers
Function
exclusivePrefixSum
src/details/ArborX_DetailsUtils.hpp:186
↓ 18 callers
Function
isPrefixedWith
test/tstKokkosToolsDistributedAnnotations.cpp:28
↓ 16 callers
Function
isPrefixedWith
test/tstKokkosToolsAnnotations.cpp:39
↓ 15 callers
Method
isLeaf
src/details/ArborX_DetailsNode.hpp:30
↓ 15 callers
Function
max
src/details/ArborX_DetailsUtils.hpp:380
↓ 15 callers
Method
push
Modifiers
src/details/ArborX_DetailsStack.hpp:51
↓ 15 callers
Function
query
test/Search_UnitTestHelpers.hpp:92
↓ 14 callers
Method
bounds
src/ArborX_LinearBVH.hpp:56
↓ 14 callers
Function
iota
src/details/ArborX_DetailsUtils.hpp:279
↓ 14 callers
Function
popHeap
src/details/ArborX_DetailsHeap.hpp:94
↓ 14 callers
Function
pushHeap
src/details/ArborX_DetailsHeap.hpp:57
↓ 13 callers
Method
top
Element access
src/details/ArborX_DetailsPriorityQueue.hpp:77
↓ 12 callers
Method
begin
test/ArborX_EnableViewComparison.hpp:35
↓ 12 callers
Method
capacity
src/details/ArborX_DetailsContainers.hpp:42
↓ 12 callers
Method
end
test/ArborX_EnableViewComparison.hpp:36
↓ 12 callers
Method
maxSize
src/details/ArborX_DetailsContainers.hpp:41
↓ 12 callers
Method
size
examples/halo_finder/ArborX_HaloFinder.hpp:98
↓ 11 callers
Method
data
src/details/ArborX_DetailsPriorityQueue.hpp:115
↓ 11 callers
Method
front
src/details/ArborX_DetailsContainers.hpp:52
↓ 11 callers
Method
pop
src/details/ArborX_DetailsStack.hpp:64
↓ 11 callers
Method
size
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:193
↓ 10 callers
Function
check_valid_callback
src/details/ArborX_Callbacks.hpp:100
↓ 10 callers
Method
pushBack
src/details/ArborX_DetailsContainers.hpp:47
↓ 9 callers
Function
isHeap
src/details/ArborX_DetailsHeap.hpp:25
↓ 9 callers
Function
min
src/details/ArborX_DetailsUtils.hpp:347
↓ 9 callers
Method
radius
src/details/ArborX_Sphere.hpp:39
↓ 8 callers
Function
check_heap
test/tstDetailsTreeTraversal.cpp:32
↓ 8 callers
Function
create_layout_right_mirror_view
src/details/ArborX_DetailsUtils.hpp:48
↓ 8 callers
Function
getK
src/details/ArborX_Predicates.hpp:83
↓ 7 callers
Function
attach
src/details/ArborX_Predicates.hpp:135
↓ 7 callers
Method
size
test/Search_UnitTestHelpers.hpp:58
↓ 6 callers
Function
accumulate
src/details/ArborX_DetailsUtils.hpp:417
↓ 6 callers
Function
adjacentDifference
src/details/ArborX_DetailsUtils.hpp:467
↓ 6 callers
Function
check_valid_access_traits
src/details/ArborX_AccessTraits.hpp:100
↓ 6 callers
Function
expandBits
Expands a 10-bit integer into 30 bits by inserting 2 zeros after each bit.
src/details/ArborX_DetailsMortonCode.hpp:26
↓ 6 callers
Function
maxSize
src/details/ArborX_DetailsContainers.hpp:79
↓ 6 callers
Method
popBack
src/details/ArborX_DetailsContainers.hpp:51
↓ 6 callers
Method
size
src/details/ArborX_DetailsPriorityQueue.hpp:74
↓ 5 callers
Function
checkBufferLayout
test/tstDetailsDistributedSearchTreeImpl.cpp:281
↓ 5 callers
Method
getRoot
src/details/ArborX_DetailsTreeVisualization.hpp:61
↓ 5 callers
Function
minMax
src/details/ArborX_DetailsUtils.hpp:316
↓ 5 callers
Function
performQueries
test/ArborX_BoostRTreeHelpers.hpp:178
↓ 5 callers
Method
query
src/ArborX_LinearBVH.hpp:59
↓ 5 callers
Function
queryImpl
src/details/ArborX_DetailsBufferOptimization.hpp:232
↓ 5 callers
Function
sortObjects
src/details/ArborX_DetailsSortUtils.hpp:64
↓ 4 callers
Function
checkViewWasNotAllocated
test/tstDetailsDistributedSearchTreeImpl.cpp:188
↓ 4 callers
Method
getNodePtr
src/details/ArborX_DetailsTreeConstruction.hpp:269
↓ 4 callers
Method
popPush
src/details/ArborX_DetailsPriorityQueue.hpp:106
↓ 4 callers
Function
queryDispatch
src/details/ArborX_DetailsBoundingVolumeHierarchyImpl.hpp:96
↓ 4 callers
Function
returnCentroid
src/details/ArborX_DetailsAlgorithms.hpp:196
↓ 3 callers
Function
centroid
calculate the centroid of a box
src/details/ArborX_DetailsAlgorithms.hpp:183
↓ 3 callers
Function
checkNewViewWasAllocated
test/tstDetailsDistributedSearchTreeImpl.cpp:212
↓ 3 callers
Function
cloneWithoutInitializingNorCopying
src/details/ArborX_DetailsUtils.hpp:542
↓ 3 callers
Method
createFromSends
src/details/ArborX_DetailsDistributor.hpp:205
↓ 3 callers
Function
empty
src/details/ArborX_DetailsContainers.hpp:65
↓ 3 callers
Function
generatePointCloud
benchmarks/point_clouds/point_clouds.hpp:193
↓ 3 callers
Method
getComm
src/ArborX_DistributedSearchTree.hpp:104
↓ 3 callers
Method
getNewTimer
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 callers
Method
launch
src/details/ArborX_DetailsBoundingVolumeHierarchyImpl.hpp:78
↓ 3 callers
Function
makeLeafNode
src/details/ArborX_DetailsNode.hpp:46
↓ 3 callers
Function
make_reference_solution
test/Search_UnitTestHelpers.hpp:85
↓ 3 callers
Function
morton3D
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 callers
Method
size
test/ArborX_EnableViewComparison.hpp:37
↓ 3 callers
Method
start
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:56
↓ 3 callers
Method
stop
benchmarks/distributed_tree_driver/distributed_tree_driver.cpp:62
↓ 3 callers
Function
toVectorOfTuples
test/tstMiscellaneous.cpp:53
↓ 3 callers
Function
translateAndScale
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 callers
Function
traverse
src/details/ArborX_DetailsTreeTraversal.hpp:385
↓ 2 callers
Function
BOOST_CHECK_EXCEPTION
test/tstException.cpp:32
↓ 2 callers
Function
applyPermutation
src/details/ArborX_DetailsSortUtils.hpp:190
↓ 2 callers
Method
argv
benchmarks/bvh_driver/bvh_driver.cpp:300
↓ 2 callers
Function
assignMortonCodes
src/details/ArborX_DetailsTreeConstruction.hpp:114
↓ 2 callers
Function
bubbleDown
src/details/ArborX_DetailsHeap.hpp:73
↓ 2 callers
Function
calculateBoundingBoxOfTheScene
src/details/ArborX_DetailsTreeConstruction.hpp:64
↓ 2 callers
Function
clone
src/details/ArborX_DetailsUtils.hpp:549
↓ 2 callers
Method
emplaceBack
src/details/ArborX_DetailsContainers.hpp:50
↓ 2 callers
Method
empty
Capacity
src/details/ArborX_DetailsPriorityQueue.hpp:73
↓ 2 callers
Function
generateHierarchy
src/details/ArborX_DetailsTreeConstruction.hpp:382
↓ 2 callers
Function
getSizeOfArrays
test/VectorOfTuples.hpp:56
↓ 2 callers
Function
initializeLeafNodes
src/details/ArborX_DetailsTreeConstruction.hpp:169
↓ 2 callers
Function
isFinite
src/details/ArborX_DetailsKokkosExt.hpp:68
↓ 2 callers
Function
is_commented
(line)
examples/viz/arborx_query_sort.py:30
↓ 2 callers
Function
is_edge
(line)
examples/viz/arborx_query_sort.py:33
next →
1–100 of 400, ranked by callers