Lines Matching full:keys
65 * keys([reverse]) -> generator for keys of T, O(n)
73 slicing by keys
77 * keyslice(s, e) -> generator for keys of T for s <= key < e, O(n)
79 * T[s:e] -> TreeSlice object, with keys in range s <= key < e, O(n)
93 * TreeSlice[s1:e1] -> TreeSlice object, with keys in range s1 <= key < e1
100 * keys() -> generator for keys of T, O(n)
102 * __iter__ <==> keys()
133 * intersection(t1, t2, ...) -> Tree with keys *common* to all trees
134 * union(t1, t2, ...) -> Tree with keys from *either* trees
135 * difference(t1, t2, ...) -> Tree with keys in T but not any of t1, t2, ...
136 * symmetric_difference(t1) -> Tree with keys in either T and t1 but not both
144 * fromkeys(S[,v]) -> New tree with keys from S and values equal to v.
149 Profiling with timeit(): 5000 unique random int keys, time in seconds
156 search 100x all keys 2,86 0,96 0,27 0,06
164 search 100x all keys 2,34 0,85 0,89 0,14
172 search 100x all keys 2,32 0,86 0,86 0,13
200 * removed user defined compare() function - keys have to be comparable!
202 * keys(), items(), values() generating 'views'
