---

yaml
---
r: 41792
b: refs/heads/master
c: dc27759
h: refs/heads/master
v: v3

Author: thestinger

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: d0011714355c48f491d6846b65a4e96b4629d917
+refs/heads/master: dc27759bd14fac7657bcc65f9a97fdd6c740f57c
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 2f46b763da2c098913884f101b6d71d69af41b49
 refs/heads/try: 3d5418789064fdb463e872a4e651af1c628a3650

trunk/src/libstd/treemap.rs

@@ -23,11 +23,13 @@ use core::prelude::*;
 // as a right child. The time complexity is the same, and re-balancing
 // operations are more frequent but also cheaper.
 
-// TODO: implement Ord for TreeSet
+// Future improvements:
+
+// implement Ord for TreeSet
 // could be superset/subset-based or in-order lexicographic comparison... but
 // there are methods for is_superset/is_subset so lexicographic is more useful
 
-// TODO: (possibly) implement the overloads Python does for sets:
+// (possibly) implement the overloads Python does for sets:
 //   * union: |
 //   * intersection: &
 //   * difference: -