From b50fb240be6c988d888667019f6308c3ef91615f Mon Sep 17 00:00:00 2001 From: Ivan Stankovic Date: Mon, 16 Jan 2017 21:24:18 +0100 Subject: [PATCH] libcollections: btree/map: fix typos --- src/libcollections/btree/map.rs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/libcollections/btree/map.rs b/src/libcollections/btree/map.rs index 782a5e31d2d..4755f8a4c55 100644 --- a/src/libcollections/btree/map.rs +++ b/src/libcollections/btree/map.rs @@ -656,7 +656,7 @@ pub fn append(&mut self, other: &mut Self) { } /// Constructs a double-ended iterator over a sub-range of elements in the map. - /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will + /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will /// yield elements from min (inclusive) to max (exclusive). /// The range may also be entered as `(Bound, Bound)`, so for example /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive @@ -748,7 +748,7 @@ pub fn range(&self, range: R) -> Range } /// Constructs a mutable double-ended iterator over a sub-range of elements in the map. - /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will + /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will /// yield elements from min (inclusive) to max (exclusive). /// The range may also be entered as `(Bound, Bound)`, so for example /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive