---

yaml
---
r: 42461
b: refs/heads/try
c: 90b111f
h: refs/heads/master
i:
  42459: 13564a3
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: 670748e383dfedb6ee6fe94dfad313ce8e7e5688
+refs/heads/try: 90b111f4bf1f63f6dbb0fc048f334cfe02cab0d9
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: a810c03263670238bccd64cabb12a23a46e3a278

branches/try/src/libstd/treemap.rs

@@ -25,6 +25,8 @@ use core::prelude::*;
 
 // Future improvements:
 
+// range search - O(log n) retrieval of an iterator from some key
+
 // 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