[llvm-commits] CVS: llvm/lib/Support/FoldingSet.cpp

[Chris Lattner]

Changes in directory llvm/lib/Support:

FoldingSet.cpp updated: 1.11 -> 1.12
---
Log message:

reformat comment


---
Diffs of the changes:  (+2 -2)

 FoldingSet.cpp |    4 ++--
 1 files changed, 2 insertions(+), 2 deletions(-)


Index: llvm/lib/Support/FoldingSet.cpp
diff -u llvm/lib/Support/FoldingSet.cpp:1.11 llvm/lib/Support/FoldingSet.cpp:1.12
--- llvm/lib/Support/FoldingSet.cpp:1.11	Thu Nov  2 19:38:14 2006
+++ llvm/lib/Support/FoldingSet.cpp	Tue Jan 30 17:16:22 2007
@@ -125,8 +125,8 @@
 /// singly-linked-list. In order to make deletion more efficient, we make
 /// the list circular, so we can delete a node without computing its hash.
 /// The problem with this is that the start of the hash buckets are not
-/// Nodes.  If NextInBucketPtr is a bucket pointer, this method returns null
-/// : use GetBucketPtr when this happens.
+/// Nodes.  If NextInBucketPtr is a bucket pointer, this method returns null:
+/// use GetBucketPtr when this happens.
 static FoldingSetImpl::Node *GetNextPtr(void *NextInBucketPtr,
                                         void **Buckets, unsigned NumBuckets) {
   if (NextInBucketPtr >= Buckets && NextInBucketPtr < Buckets + NumBuckets)