Added is_full to IndexSet

Author: sourcebox

CHANGELOG.md

@@ -14,6 +14,7 @@ and this project adheres to [Semantic Versioning](http://semver.org/).
 - Added `is_full`, `recent_index`, `oldest`, and `oldest_index` to `HistoryBuffer`
 - Added `is_full` to `BinaryHeap`
 - Added `is_full` to `IndexMap`
+- Added `is_full` to `IndexSet`
 - Added infallible conversions from arrays to `Vec`.
 - Added `Vec::spare_capacity_mut`.
 - Added `Extend` impls for `Deque`.

src/indexset.rs

@@ -180,6 +180,25 @@ impl<T, S, const N: usize> IndexSet<T, S, N> {
         self.map.is_empty()
     }
 
+    /// Returns `true` if the set is full.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// use heapless::FnvIndexSet;
+    ///
+    /// let mut v: FnvIndexSet<_, 4> = FnvIndexSet::new();
+    /// assert!(!v.is_full());
+    /// v.insert(1).unwrap();
+    /// v.insert(2).unwrap();
+    /// v.insert(3).unwrap();
+    /// v.insert(4).unwrap();
+    /// assert!(v.is_full());
+    /// ```
+    pub fn is_full(&self) -> bool {
+        self.map.is_full()
+    }
+
     /// Clears the set, removing all values.
     ///
     /// # Examples