p->q

note that use is to find real node when different nodes have euqiv val

Be able to use c printf style

曾因EPS 0.00001，精度太高，而比较失败，得注意

return True if it's ~p form

Inserts a word into the trie. :type word: str :rtype: void

曾因EPS 0.00001，精度太高，而比较失败，得注意

search the key, delete it , and form down to up to rebalance it

rotate prt with the center of chd

return a generator of sorted data

notice how to get cantor func

notice how to get cantor func

notice how to get cantor func

} graphics! n floors, m elevs 1 +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~+ 2 |Time: 000.0s | 3 |

return Pairs of formulas likr[(p,q)...] after applying enough p2p func, eg q>(~r>(~t>s)): return [(q,~r>(~t>s)),(~r,~t>s),(~t,s)]

return a generator of sorted data

This is a single elev Main Ctrl Function Decide what to do next, considering all possible conditions Be called frequently

fourier[a]