aboutsummaryrefslogtreecommitdiff
path: root/include/Support/BitSetVector.h
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2003-09-30 18:37:50 +0000
committerChris Lattner <sabre@nondot.org>2003-09-30 18:37:50 +0000
commit48486893f46d2e12e926682a3ecb908716bc66c4 (patch)
tree1b9df5ccb8bd8eb836403dc9c1b3b42707c2d07d /include/Support/BitSetVector.h
parentf4744498042cc69627b3a0b40fe80d3967179ea4 (diff)
Standardize header file comments
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8782 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/Support/BitSetVector.h')
-rw-r--r--include/Support/BitSetVector.h16
1 files changed, 7 insertions, 9 deletions
diff --git a/include/Support/BitSetVector.h b/include/Support/BitSetVector.h
index cdcd52d948..fa2598a285 100644
--- a/include/Support/BitSetVector.h
+++ b/include/Support/BitSetVector.h
@@ -1,13 +1,11 @@
-//===-- BitVectorSet.h - A bit-vector representation of sets -----*- C++ -*--=//
+//===-- BitVectorSet.h - A bit-vector representation of sets ----*- C++ -*-===//
//
-// class BitVectorSet --
-//
-// An implementation of the bit-vector representation of sets.
-// Unlike vector<bool>, this allows much more efficient parallel set
-// operations on bits, by using the bitset template . The bitset template
-// unfortunately can only represent sets with a size chosen at compile-time.
-// We therefore use a vector of bitsets. The maxmimum size of our sets
-// (i.e., the size of the universal set) can be chosen at creation time.
+// This is an implementation of the bit-vector representation of sets. Unlike
+// vector<bool>, this allows much more efficient parallel set operations on
+// bits, by using the bitset template. The bitset template unfortunately can
+// only represent sets with a size chosen at compile-time. We therefore use a
+// vector of bitsets. The maxmimum size of our sets (i.e., the size of the
+// universal set) can be chosen at creation time.
//
// External functions:
//