From 555eaf5bbbcacfda939e106b8f108ef8703b9139 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Tue, 30 Sep 2003 18:37:50 +0000 Subject: Standardize header file comments llvm-svn: 8782 --- llvm/include/Support/BitSetVector.h | 16 +++++++--------- 1 file changed, 7 insertions(+), 9 deletions(-) (limited to 'llvm/include/Support/BitSetVector.h') diff --git a/llvm/include/Support/BitSetVector.h b/llvm/include/Support/BitSetVector.h index cdcd52d9486..fa2598a2856 100644 --- a/llvm/include/Support/BitSetVector.h +++ b/llvm/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, 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, 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: // -- cgit v1.2.3