RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-26 04:32:44 +01:00
Code Issues Projects Releases Wiki Activity

Fix typos.

Browse Source 
llvm-svn: 151163
This commit is contained in:
Jakob Stoklund Olesen 2012-02-22 16:01:54 +00:00
parent 4d0ae7cfef
commit 0d60aa4b33
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/llvm/ADT/SparseSet.h
View File

@ -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

8
unittests/ADT/SparseSetTest.cpp
View File

@ -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);