xmingc

@0xflotus Please give a patch on https://github.com/awesomedata/apd-core Thanks 👍

The same issue on centos 7, clangd 13.0.1 ``` #0 0x00007f88bb983d8e llvm::sys::PrintStackTrace(llvm::raw_ostream&, int) (/lib64/libLLVM-13.so+0x993d8e) #1 0x00007f88bb981e5a llvm::sys::RunSignalHandlers() (/lib64/libLLVM-13.so+0x991e5a) #2 0x00007f88bb9825e8 (/lib64/libLLVM-13.so+0x9925e8) #3 0x00007f88c2e7f630 __restore_rt sigaction.c:0:0 #4 0x00007f88c0aa0664 (/lib64/libclang-cpp.so.13+0x1777664) #5 0x00007f88c0aa2ae6...

It seems as duplicated as method `children` which could convert into an iterator via iter(childrenI())

@ben-e-whitney 's solution seems more elegant to be compatible. :+1:

Issue #65 addressed a more general ordering of nodes by ANY attribute. SortedDict may replace the inner node dict, but it may introduce more performance concerns (see SO http://stackoverflow.com/questions/8176513/ordereddict-performance-compared-to-deque).

You know the tree nodes are stored as Python dict, which only reserves hashed order. It cann't be ordered on the tree per se. I think there is a small...

A potential solution. Node children are stored as a list in its `_fpointer`. You can implement a `tree.sort_children()` to get sorted `_fpointer` permanently.

Yeah, seems useful feature. I am a little busy with job stuff. Are you interested to add this feature? @ghostku Call For Contributor...

@StevenLi-DS I thinks it is not hard to do that if you are not concerned about the children order of each non-leaf nodes. You can implement this algorithms easily by...

@andresionek91 This data is awesome but it is already indexed by kaggle.com. I am struggling to control the volume of this repo to highlight some really HQ datasets outside some...