Home
libcuml
cucim
cudf-java
cudf
cugraph
cuml
cuproj
cuspatial
cuvs
cuxfilter
dask-cuda
dask-cudf
kvikio
libcudf
libcuml
libcuproj
libcuspatial
libkvikio
librmm
libucxx
raft
rapids-cmake
rmm
nightly (25.04)
nightly (25.04)
stable (25.02)
legacy (24.12)
Main Page
Related Pages
Modules
Namespaces
Namespace List
Namespace Members
All
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
Functions
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
Variables
Typedefs
c
d
f
h
i
k
m
n
o
p
r
s
t
Enumerations
a
c
d
e
f
i
l
m
n
o
p
r
s
t
Enumerator
a
b
c
d
e
f
g
h
i
l
m
n
o
p
r
s
t
u
Classes
Class List
Class Index
Class Hierarchy
Class Members
All
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
Functions
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
~
Variables
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Typedefs
a
b
c
d
f
i
k
m
n
o
p
r
s
t
v
Enumerations
Enumerator
Related Functions
Files
File List
File Members
All
a
c
d
f
h
k
l
m
o
p
q
r
t
Functions
c
f
k
Typedefs
Enumerations
Enumerator
Macros
•
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Modules
Pages
include
cuml
experimental
fil
tree_layout.hpp
Go to the documentation of this file.
1
/*
2
* Copyright (c) 2023-2025, NVIDIA CORPORATION.
3
*
4
* Licensed under the Apache License, Version 2.0 (the "License");
5
* you may not use this file except in compliance with the License.
6
* You may obtain a copy of the License at
7
*
8
* http://www.apache.org/licenses/LICENSE-2.0
9
*
10
* Unless required by applicable law or agreed to in writing, software
11
* distributed under the License is distributed on an "AS IS" BASIS,
12
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13
* See the License for the specific language governing permissions and
14
* limitations under the License.
15
*/
16
#pragma once
17
namespace
ML
{
18
namespace
experimental {
19
namespace
fil {
20
enum class
tree_layout
: unsigned char {
21
depth_first
= 0,
22
breadth_first
= 1,
23
// Traverse forest by proceeding through the root nodes of each tree first,
24
// followed by the hot and distant children of those root nodes for each tree,
25
// and so forth. This traversal order ensures that all nodes of a
26
// particular tree at a particular depth are traversed together.
27
layered_children_together
= 2
28
};
29
30
}
31
}
// namespace experimental
32
}
// namespace ML
ML::experimental::fil::tree_layout
tree_layout
Definition:
tree_layout.hpp:20
ML::experimental::fil::tree_layout::breadth_first
@ breadth_first
ML::experimental::fil::tree_layout::layered_children_together
@ layered_children_together
ML::experimental::fil::tree_layout::depth_first
@ depth_first
ML
Definition:
dbscan.hpp:30
Generated by
1.9.1