[llvm-commits] [llvm] r151163 - in /llvm/trunk: include/llvm/ADT/SparseSet.h unittests/ADT/SparseSetTest.cpp

[Jakob Stoklund Olesen]

Author: stoklund
Date: Wed Feb 22 10:01:54 2012
New Revision: 151163

URL: http://llvm.org/viewvc/llvm-project?rev=151163&view=rev
Log:
Fix typos.

Modified:
    llvm/trunk/include/llvm/ADT/SparseSet.h
    llvm/trunk/unittests/ADT/SparseSetTest.cpp

Modified: llvm/trunk/include/llvm/ADT/SparseSet.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/SparseSet.h?rev=151163&r1=151162&r2=151163&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/SparseSet.h (original)
+++ llvm/trunk/include/llvm/ADT/SparseSet.h Wed Feb 22 10:01:54 2012
@@ -9,7 +9,7 @@
 //
 // This file defines the SparseSet class derived from the version described in
 // Briggs, Torczon, "An efficient representation for sparse sets", ACM Letters
-// on Programming Languages and Systems, Volume 2 Issue 1-4, March–Dec.  1993.
+// on Programming Languages and Systems, Volume 2 Issue 1-4, March-Dec.  1993.
 //
 // A sparse set holds a small number of objects identified by integer keys from
 // a moderately sized universe. The sparse set uses more memory than other

Modified: llvm/trunk/unittests/ADT/SparseSetTest.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/unittests/ADT/SparseSetTest.cpp?rev=151163&r1=151162&r2=151163&view=diff
==============================================================================
--- llvm/trunk/unittests/ADT/SparseSetTest.cpp (original)
+++ llvm/trunk/unittests/ADT/SparseSetTest.cpp Wed Feb 22 10:01:54 2012
@@ -16,7 +16,7 @@
 
 typedef SparseSet<unsigned> USet;
 
-// Empty set tests
+// Empty set tests.
 TEST(SparseSetTest, EmptySet) {
   USet Set;
   EXPECT_TRUE(Set.empty());
@@ -39,7 +39,7 @@
   EXPECT_TRUE(I == CSet.end());
 }
 
-// Single entry set tests
+// Single entry set tests.
 TEST(SparseSetTest, SingleEntrySet) {
   USet Set;
   Set.setUniverse(10);
@@ -63,7 +63,7 @@
   EXPECT_FALSE(IP.second);
   EXPECT_TRUE(IP.first == Set.begin());
 
-  // Erase non-existant element.
+  // Erase non-existent element.
   EXPECT_FALSE(Set.erase(1));
   EXPECT_EQ(1u, Set.size());
   EXPECT_EQ(5u, *Set.begin());
@@ -76,7 +76,7 @@
   EXPECT_TRUE(Set.empty());
 }
 
-// Multiple entry set tests
+// Multiple entry set tests.
 TEST(SparseSetTest, MultipleEntrySet) {
   USet Set;
   Set.setUniverse(10);