@@ -84,7 +84,8 @@ def add_root(index):
8484 is_left = False
8585 is_leaf = False
8686 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 )
8889 values .append (UNUSED )
8990 n_nodes .append (n )
9091 return n
@@ -95,15 +96,17 @@ def add_nodes(parent, i, j, is_left):
9596 # it means j is the parent split
9697 if i == j :
9798 # 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 )
99101 n_nodes .append (n )
100102 values .append (i )
101103 return n
102104 if i + 1 == j :
103105 # split
104106 values .append (UNUSED )
105107 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 )
107110 n_nodes .append (n )
108111 add_nodes (n , i , i , True )
109112 add_nodes (n , i , j , False )
@@ -113,7 +116,8 @@ def add_nodes(parent, i, j, is_left):
113116 values .append (UNUSED )
114117 index = (i + j ) // 2
115118 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 )
117121 n_nodes .append (n )
118122 add_nodes (n , i , index , True )
119123 add_nodes (n , index , j , False )
@@ -123,15 +127,17 @@ def add_nodes(parent, i, j, is_left):
123127 if i + 1 == j :
124128 # leaf
125129 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 )
127132 n_nodes .append (n )
128133 return n
129134 if i + 1 < j :
130135 # split
131136 values .append (UNUSED )
132137 index = (i + j ) // 2
133138 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 )
135141 n_nodes .append (n )
136142 add_nodes (n , i , index , True )
137143 add_nodes (n , index , j , False )
0 commit comments