diff options
| author | Daniel Micay <danielmicay@gmail.com> | 2013-01-29 15:53:03 -0500 |
|---|---|---|
| committer | Daniel Micay <danielmicay@gmail.com> | 2013-01-29 21:30:55 -0500 |
| commit | 456af7a79da586a3c64d810a9157bba0616b6b53 (patch) | |
| tree | d5be7d765c6c3a260631e54ef4f61cc2ef217e77 /src/libstd | |
| parent | a388e2c1a49ccb238741e01b9a53aac0f1bf7795 (diff) | |
update comments documenting issue #4492 workaround
Diffstat (limited to 'src/libstd')
| -rw-r--r-- | src/libstd/treemap.rs | 11 |
1 files changed, 2 insertions, 9 deletions
diff --git a/src/libstd/treemap.rs b/src/libstd/treemap.rs index 938c4cc4ed5..ed06d6a34b5 100644 --- a/src/libstd/treemap.rs +++ b/src/libstd/treemap.rs @@ -49,10 +49,9 @@ impl <K: Eq Ord, V: Eq> TreeMap<K, V>: Eq { let mut y = other.iter(); for self.len().times { unsafe { // unsafe as a purity workaround - // ICE: x.next() != y.next() - x = x.next(); y = y.next(); + // FIXME: #4492 (ICE), x.get() == y.get() let (x1, x2) = x.get().unwrap(); let (y1, y2) = y.get().unwrap(); @@ -967,9 +966,7 @@ mod test_treemap { let m = m; let mut iter = m.iter(); - // ICE: - //assert iter.next() == Some((&x1, &y1)); - //assert iter.next().eq(&Some((&x1, &y1))); + // FIXME: #4492 (ICE): iter.next() == Some((&x1, &y1)) iter = iter.next(); assert iter.get().unwrap() == (&x1, &y1); @@ -982,10 +979,6 @@ mod test_treemap { iter = iter.next(); assert iter.get().unwrap() == (&x5, &y5); - // ICE: - //assert iter.next() == None; - //assert iter.next().eq(&None); - iter = iter.next(); assert iter.get().is_none(); } |
