@@ -84,7 +84,8 @@ def add_root(index):
84
84
is_left = False
85
85
is_leaf = False
86
86
threshold = bins [index ]
87
- n = tree_add_node (tree , parent , is_left , is_leaf , 0 , threshold , 0 , 1 , 1. , 0 )
87
+ n = tree_add_node (tree , parent , is_left , is_leaf ,
88
+ 0 , threshold , 0 , 1 , 1. , 0 )
88
89
values .append (UNUSED )
89
90
n_nodes .append (n )
90
91
return n
@@ -95,15 +96,17 @@ def add_nodes(parent, i, j, is_left):
95
96
# it means j is the parent split
96
97
if i == j :
97
98
# leaf
98
- n = tree_add_node (tree , parent , is_left , True , 0 , 0 , 0 , 1 , 1. , 0 )
99
+ n = tree_add_node (tree , parent , is_left ,
100
+ True , 0 , 0 , 0 , 1 , 1. , 0 )
99
101
n_nodes .append (n )
100
102
values .append (i )
101
103
return n
102
104
if i + 1 == j :
103
105
# split
104
106
values .append (UNUSED )
105
107
th = bins [i ]
106
- n = tree_add_node (tree , parent , is_left , False , 0 , th , 0 , 1 , 1. , 0 )
108
+ n = tree_add_node (tree , parent , is_left ,
109
+ False , 0 , th , 0 , 1 , 1. , 0 )
107
110
n_nodes .append (n )
108
111
add_nodes (n , i , i , True )
109
112
add_nodes (n , i , j , False )
@@ -113,7 +116,8 @@ def add_nodes(parent, i, j, is_left):
113
116
values .append (UNUSED )
114
117
index = (i + j ) // 2
115
118
th = bins [index ]
116
- n = tree_add_node (tree , parent , is_left , False , 0 , th , 0 , 1 , 1. , 0 )
119
+ n = tree_add_node (tree , parent , is_left ,
120
+ False , 0 , th , 0 , 1 , 1. , 0 )
117
121
n_nodes .append (n )
118
122
add_nodes (n , i , index , True )
119
123
add_nodes (n , index , j , False )
@@ -123,15 +127,17 @@ def add_nodes(parent, i, j, is_left):
123
127
if i + 1 == j :
124
128
# leaf
125
129
values .append (j )
126
- n = tree_add_node (tree , parent , is_left , True , 0 , 0 , 0 , 1 , 1. , 0 )
130
+ n = tree_add_node (tree , parent , is_left ,
131
+ True , 0 , 0 , 0 , 1 , 1. , 0 )
127
132
n_nodes .append (n )
128
133
return n
129
134
if i + 1 < j :
130
135
# split
131
136
values .append (UNUSED )
132
137
index = (i + j ) // 2
133
138
th = bins [index ]
134
- n = tree_add_node (tree , parent , is_left , False , 0 , th , 0 , 1 , 1. , 0 )
139
+ n = tree_add_node (tree , parent , is_left ,
140
+ False , 0 , th , 0 , 1 , 1. , 0 )
135
141
n_nodes .append (n )
136
142
add_nodes (n , i , index , True )
137
143
add_nodes (n , index , j , False )
0 commit comments