We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 58ba2b8 commit 8007d91Copy full SHA for 8007d91
sklearn/manifold/_barnes_hut_tsne.pyx
@@ -365,10 +365,17 @@ cdef int free_tree(Tree* tree) nogil:
365
for i in range(3):
366
cnt[i] = 0
367
free_recursive(tree, tree.root_node, cnt)
368
+ if not tree.root_node.is_leaf:
369
+ free(tree.root_node.children)
370
+ free(tree.root_node.width)
371
+ free(tree.root_node.left_edge)
372
+ free(tree.root_node.center)
373
+ free(tree.root_node.barycenter)
374
+ free(tree.root_node.leaf_point_position)
375
free(tree.root_node)
- free(tree)
376
check = cnt[0] == tree.n_cells
377
check &= cnt[2] == tree.n_points
378
+ free(tree)
379
free(cnt)
380
return check
381
0 commit comments