---

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

Author: thestinger

[refs]

@@ -2,7 +2,7 @@
 refs/heads/master: 19dfec2aaf746535de1521f68421f9980dbf25de
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 2f46b763da2c098913884f101b6d71d69af41b49
-refs/heads/try: d0011714355c48f491d6846b65a4e96b4629d917
+refs/heads/try: dc27759bd14fac7657bcc65f9a97fdd6c740f57c
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: a810c03263670238bccd64cabb12a23a46e3a278

branches/try/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: -