diff --git a/src/collections/sets.rs b/src/collections/sets.rs
index b4510b48778b1812e4e26b6e2caa0dc87885904f..669a5b65f1f60091ca9a0c97b767e559b49bb584 100644
--- a/src/collections/sets.rs
+++ b/src/collections/sets.rs
@@ -1,7 +1,8 @@
 use std::collections::VecDeque;
 
 /// Simple double ended queue that ensures that all elements are unique. Queue
-/// is not ordered.
+/// elements are not ordered (use case is that the queue should be rather
+/// small).
 pub struct DequeSet<T: Eq> {
     inner: VecDeque<T>,
 }
@@ -43,6 +44,11 @@ impl<T: Eq> DequeSet<T> {
         self.inner.push_front(to_push);
     }
 
+    #[inline]
+    pub fn clear(&mut self) {
+        self.inner.clear();
+    }
+
     #[inline]
     pub fn is_empty(&self) -> bool {
         self.inner.is_empty()