aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorJakob Stoklund Olesen <stoklund@2pi.dk>2012-02-22 16:01:54 +0000
committerJakob Stoklund Olesen <stoklund@2pi.dk>2012-02-22 16:01:54 +0000
commita3bf915888ba81c4f695ebc38e5d6ce0881ef354 (patch)
tree596602e37d9ad419282e76c2083219ed06718aa3
parente1a4427ccb6e29e63c11e63224460a92ee66de37 (diff)
downloadexternal_llvm-a3bf915888ba81c4f695ebc38e5d6ce0881ef354.zip
external_llvm-a3bf915888ba81c4f695ebc38e5d6ce0881ef354.tar.gz
external_llvm-a3bf915888ba81c4f695ebc38e5d6ce0881ef354.tar.bz2
Fix typos.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@151163 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--include/llvm/ADT/SparseSet.h2
-rw-r--r--unittests/ADT/SparseSetTest.cpp8
2 files changed, 5 insertions, 5 deletions
diff --git a/include/llvm/ADT/SparseSet.h b/include/llvm/ADT/SparseSet.h
index b9928b9..7801d8d 100644
--- a/include/llvm/ADT/SparseSet.h
+++ b/include/llvm/ADT/SparseSet.h
@@ -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
diff --git a/unittests/ADT/SparseSetTest.cpp b/unittests/ADT/SparseSetTest.cpp
index 981d52e..a6ea757 100644
--- a/unittests/ADT/SparseSetTest.cpp
+++ b/unittests/ADT/SparseSetTest.cpp
@@ -16,7 +16,7 @@ namespace {
typedef SparseSet<unsigned> USet;
-// Empty set tests
+// Empty set tests.
TEST(SparseSetTest, EmptySet) {
USet Set;
EXPECT_TRUE(Set.empty());
@@ -39,7 +39,7 @@ TEST(SparseSetTest, EmptySet) {
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 @@ TEST(SparseSetTest, SingleEntrySet) {
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 @@ TEST(SparseSetTest, SingleEntrySet) {
EXPECT_TRUE(Set.empty());
}
-// Multiple entry set tests
+// Multiple entry set tests.
TEST(SparseSetTest, MultipleEntrySet) {
USet Set;
Set.setUniverse(10);