reformat comment

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33675 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Support/FoldingSet.cpp b/lib/Support/FoldingSet.cpp
index bcab5b3ec43b863154b15979ca4b512c9c6f8d8b..716fe99b52135a5eb76f1f481f431741e93303bc 100644 (file)
--- a/lib/Support/FoldingSet.cpp
+++ b/lib/Support/FoldingSet.cpp
@@ -125,8 +125,8 @@ bool FoldingSetImpl::NodeID::operator==(const FoldingSetImpl::NodeID &RHS)const{
 /// 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)