From c28476f1d9b04d44082727f82d0e7bca6a67a14c Mon Sep 17 00:00:00 2001
From: Chris Lattner
Date: Sun, 30 Sep 2007 00:58:59 +0000
Subject: [PATCH] document DenseSet.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42475 91177308-0d34-0410-b5e6-96231b3b80d8
---
docs/ProgrammersManual.html | 20 ++++++++++++++++++++
1 file changed, 20 insertions(+)
diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html
index d3b7eefee36..792dbf0e529 100644
--- a/docs/ProgrammersManual.html
+++ b/docs/ProgrammersManual.html
@@ -62,6 +62,7 @@ option
A sorted 'vector'
"llvm/ADT/SmallSet.h"
"llvm/ADT/SmallPtrSet.h"
+ "llvm/ADT/DenseSet.h"
"llvm/ADT/FoldingSet.h"
<set>
"llvm/ADT/SetVector.h"
@@ -986,6 +987,25 @@ visited in sorted order.
+
+
+
+
+DenseSet is a simple quadratically probed hash table. It excels at supporting
+small values: it uses a single allocation to hold all of the pairs that
+are currently inserted in the set. DenseSet is a great way to unique small
+values that are not simple pointers (use SmallPtrSet for pointers). Note that DenseSet has
+the same requirements for the value type that DenseMap has.
+
+
+
+