@@ -649,12 +649,12 @@ impl<T> BTreeSet<T> {
649649 /// #![feature(map_first_last)]
650650 /// use std::collections::BTreeSet;
651651 ///
652- /// let mut map = BTreeSet::new();
653- /// assert_eq!(map .first(), None);
654- /// map .insert(1);
655- /// assert_eq!(map .first(), Some(&1));
656- /// map .insert(2);
657- /// assert_eq!(map .first(), Some(&1));
652+ /// let mut set = BTreeSet::new();
653+ /// assert_eq!(set .first(), None);
654+ /// set .insert(1);
655+ /// assert_eq!(set .first(), Some(&1));
656+ /// set .insert(2);
657+ /// assert_eq!(set .first(), Some(&1));
658658 /// ```
659659 #[ unstable( feature = "map_first_last" , issue = "62924" ) ]
660660 pub fn first ( & self ) -> Option < & T >
@@ -675,12 +675,12 @@ impl<T> BTreeSet<T> {
675675 /// #![feature(map_first_last)]
676676 /// use std::collections::BTreeSet;
677677 ///
678- /// let mut map = BTreeSet::new();
679- /// assert_eq!(map .last(), None);
680- /// map .insert(1);
681- /// assert_eq!(map .last(), Some(&1));
682- /// map .insert(2);
683- /// assert_eq!(map .last(), Some(&2));
678+ /// let mut set = BTreeSet::new();
679+ /// assert_eq!(set .last(), None);
680+ /// set .insert(1);
681+ /// assert_eq!(set .last(), Some(&1));
682+ /// set .insert(2);
683+ /// assert_eq!(set .last(), Some(&2));
684684 /// ```
685685 #[ unstable( feature = "map_first_last" , issue = "62924" ) ]
686686 pub fn last ( & self ) -> Option < & T >
0 commit comments