diff --git a/README.md b/README.md
index bcec58b6..7b31e7e5 100644
--- a/README.md
+++ b/README.md
@@ -23,6 +23,7 @@ data structures
 - `RAL`, a random-access list structure, with `O(1)` cons/hd/tl and `O(ln(n))`
 access to elements by their index.
 - `Leftistheap`, a polymorphic heap structure.
+- `SmallSet`, a sorted list implementation behaving like a set.
 
 Other structures are:
 
@@ -37,6 +38,7 @@ monadic futures, and MVars (concurrent boxes)
 - `FlatHashtbl`, a (deprecated) open addressing hashtable with
     a functorial interface (replaced by PHashtbl)
 - `Gen` and `Sequence`, generic iterators structures.
+- `UnionFind`, a functorial imperative Union-Find structure.
 
 Some serialisation formats are also implemented, with a streaming, non-blocking
 interface that allows the user to feed the input in chunk by chunk (useful
diff --git a/containers.mllib b/containers.mllib
index 990ac5ee..fe678cdd 100644
--- a/containers.mllib
+++ b/containers.mllib
@@ -22,3 +22,5 @@ Bencode
 Sexp
 RAL
 MultiSet
+UnionFind
+SmallSet
diff --git a/containers.odocl b/containers.odocl
index 990ac5ee..fe678cdd 100644
--- a/containers.odocl
+++ b/containers.odocl
@@ -22,3 +22,5 @@ Bencode
 Sexp
 RAL
 MultiSet
+UnionFind
+SmallSet