diff --git a/src/lib.rs b/src/lib.rs
index 8f431ab0..a7012ef3 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -225,7 +225,7 @@ pub mod iter;
 
 pub use map::HashMap;
 pub use map_ref::HashMapRef;
-pub use set::FlurryHashSet;
+pub use set::HashSet;
 
 /// Default hasher for [`HashMap`].
 pub type DefaultHashBuilder = ahash::RandomState;
diff --git a/src/set/mod.rs b/src/set/mod.rs
index ebd9daa6..670027cf 100644
--- a/src/set/mod.rs
+++ b/src/set/mod.rs
@@ -1,14 +1,46 @@
-//! A concurrent hash set backed by HashMap.
+//! A concurrent hash set.
+//!
+//! See `HashSet` for details.
 
+use std::borrow::Borrow;
 use std::hash::Hash;
 
 use crate::epoch::{self, Guard};
 use crate::iter::Keys;
 use crate::HashMap;
 
-/// A concurrent hash set.
+/// A concurrent hash set implemented as a `FlurryHashMap` where the value is `()`.
+///
+/// # Examples
+///
+/// ```
+/// use flurry::HashSet;
+///
+/// // Initialize a new hash set.
+/// let books = HashSet::new();
+///
+/// // Add some books
+/// books.insert("Fight Club");
+/// books.insert("Three Men In A Raft");
+/// books.insert("The Book of Dust");
+/// books.insert("The Dry");
+///
+/// // Check for a specific one.
+/// if !books.contains(&"The Drunken Botanist") {
+///     println!("We don't have The Drunken Botanist.");
+/// }
+///
+/// // Remove a book.
+/// books.remove(&"Three Men In A Raft");
+///
+/// // Iterate over everything.
+/// let guard = flurry::epoch::pin();
+/// for book in books.iter(&guard) {
+///     println!("{}", book);
+/// }
+/// ```
 #[derive(Debug)]
-pub struct FlurryHashSet<T: 'static, S = crate::DefaultHashBuilder>
+pub struct HashSet<T: 'static, S = crate::DefaultHashBuilder>
 where
     T: Sync + Send + Clone + Hash + Eq,
     S: std::hash::BuildHasher,
@@ -16,7 +48,7 @@ where
     map: HashMap<T, (), S>,
 }
 
-impl<T> FlurryHashSet<T, crate::DefaultHashBuilder>
+impl<T> HashSet<T, crate::DefaultHashBuilder>
 where
     T: Sync + Send + Clone + Hash + Eq,
 {
@@ -25,9 +57,9 @@ where
     /// # Examples
     ///
     /// ```
-    /// use flurry::FlurryHashSet;
+    /// use flurry::HashSet;
     ///
-    /// let set: FlurryHashSet<i32> = FlurryHashSet::new();
+    /// let set: HashSet<i32> = HashSet::new();
     /// ```
     pub fn new() -> Self {
         Self {
@@ -44,9 +76,9 @@ where
     /// # Examples
     ///
     /// ```
-    /// use flurry::FlurryHashSet;
+    /// use flurry::HashSet;
     ///
-    /// let set = FlurryHashSet::new();
+    /// let set = HashSet::new();
     ///
     /// assert_eq!(set.insert(2), true);
     /// assert_eq!(set.insert(2), false);
@@ -60,24 +92,34 @@ where
 
     /// Returns true if the set contains a value.
     ///
+    /// The value may be any borrowed form of the set's type, but `Hash` and `Eq` on the borrowed
+    /// form must match those for the type.
+    ///
     /// # Examples
     ///
     /// ```
-    /// use flurry::FlurryHashSet;
+    /// use flurry::HashSet;
     ///
-    /// let set = FlurryHashSet::new();
+    /// let set = HashSet::new();
     /// set.insert(2);
     ///
     /// assert!(set.contains(&2));
     /// assert!(!set.contains(&1));
     /// ```
-    pub fn contains(&self, value: &T) -> bool {
+    pub fn contains<Q>(&self, value: &Q) -> bool
+    where
+        T: Borrow<Q>,
+        Q: ?Sized + Hash + Eq,
+    {
         let guard = epoch::pin();
         self.map.contains_key(value, &guard)
     }
 
     /// Removes a value from the set.
     ///
+    /// The value may be any borrowed form of the set's type, but `Hash` and `Eq` on the borrowed
+    /// form must match those for the type.
+    ///
     /// If the set did not have this value present, false is returned.
     ///
     /// If the set did have this value present, true is returned.
@@ -85,16 +127,20 @@ where
     /// # Examples
     ///
     /// ```
-    /// use flurry::FlurryHashSet;
+    /// use flurry::HashSet;
     ///
-    /// let set = FlurryHashSet::new();
+    /// let set = HashSet::new();
     /// set.insert(2);
     ///
     /// assert_eq!(set.remove(&2), true);
     /// assert!(!set.contains(&2));
     /// assert_eq!(set.remove(&2), false);
     /// ```
-    pub fn remove(&self, value: &T) -> bool {
+    pub fn remove<Q>(&self, value: &Q) -> bool
+    where
+        T: Borrow<Q>,
+        Q: ?Sized + Hash + Eq,
+    {
         let guard = epoch::pin();
         let removed = self.map.remove(value, &guard);
         removed.is_some()
@@ -107,9 +153,9 @@ where
     /// # Examples
     ///
     /// ```
-    /// use flurry::FlurryHashSet;
+    /// use flurry::HashSet;
     ///
-    /// let set = FlurryHashSet::new();
+    /// let set = HashSet::new();
     /// set.insert(1);
     /// set.insert(2);
     ///
diff --git a/tests/set.rs b/tests/set.rs
index c471ee56..3c0b916b 100644
--- a/tests/set.rs
+++ b/tests/set.rs
@@ -1,13 +1,13 @@
-use flurry::FlurryHashSet;
+use flurry::HashSet;
 
 #[test]
 fn new() {
-    let _set = FlurryHashSet::<usize>::new();
+    let _set = HashSet::<usize>::new();
 }
 
 #[test]
 fn insert() {
-    let set = FlurryHashSet::<usize>::new();
+    let set = HashSet::<usize>::new();
     let did_set = set.insert(42);
     assert!(did_set);
 
@@ -17,7 +17,7 @@ fn insert() {
 
 #[test]
 fn insert_contains() {
-    let set = FlurryHashSet::<usize>::new();
+    let set = HashSet::<usize>::new();
     set.insert(42);
 
     assert!(set.contains(&42));