diff options
author | Mandeep Singh Grang <mgrang@codeaurora.org> | 2018-04-07 01:29:45 +0000 |
---|---|---|
committer | Mandeep Singh Grang <mgrang@codeaurora.org> | 2018-04-07 01:29:45 +0000 |
commit | 13e70cb1811e8f7c0cacc16a272c95b4634490f9 (patch) | |
tree | 69c1f4c8124b9068c98b107b1cdd2f8881b9a20a /llvm/unittests/Support/Path.cpp | |
parent | b12cc2003a2375cd3e207bb831930719d11521ab (diff) | |
download | bcm5719-llvm-13e70cb1811e8f7c0cacc16a272c95b4634490f9.tar.gz bcm5719-llvm-13e70cb1811e8f7c0cacc16a272c95b4634490f9.zip |
[unittests] Change std::sort to llvm::sort in response to r327219
r327219 added wrappers to std::sort which randomly shuffle the container before
sorting. This will help in uncovering non-determinism caused due to undefined
sorting order of objects having the same key.
To make use of that infrastructure we need to invoke llvm::sort instead of
std::sort.
Note: This patch is one of a series of patches to replace *all* std::sort to
llvm::sort. Refer the comments section in D44363 for a list of all the
required patches.
llvm-svn: 329475
Diffstat (limited to 'llvm/unittests/Support/Path.cpp')
-rw-r--r-- | llvm/unittests/Support/Path.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/llvm/unittests/Support/Path.cpp b/llvm/unittests/Support/Path.cpp index 8b053b33ec2..d1592692088 100644 --- a/llvm/unittests/Support/Path.cpp +++ b/llvm/unittests/Support/Path.cpp @@ -900,8 +900,8 @@ TEST_F(FileSystemTest, BrokenSymlinkDirectoryIteration) { ASSERT_NO_ERROR(ec); VisitedNonBrokenSymlinks.push_back(path::filename(i->path())); } - std::sort(VisitedNonBrokenSymlinks.begin(), VisitedNonBrokenSymlinks.end()); - std::sort(VisitedBrokenSymlinks.begin(), VisitedBrokenSymlinks.end()); + llvm::sort(VisitedNonBrokenSymlinks.begin(), VisitedNonBrokenSymlinks.end()); + llvm::sort(VisitedBrokenSymlinks.begin(), VisitedBrokenSymlinks.end()); v_t ExpectedNonBrokenSymlinks = {"b", "d"}; ASSERT_EQ(ExpectedNonBrokenSymlinks.size(), VisitedNonBrokenSymlinks.size()); ASSERT_TRUE(std::equal(VisitedNonBrokenSymlinks.begin(), @@ -927,8 +927,8 @@ TEST_F(FileSystemTest, BrokenSymlinkDirectoryIteration) { ASSERT_NO_ERROR(ec); VisitedNonBrokenSymlinks.push_back(path::filename(i->path())); } - std::sort(VisitedNonBrokenSymlinks.begin(), VisitedNonBrokenSymlinks.end()); - std::sort(VisitedBrokenSymlinks.begin(), VisitedBrokenSymlinks.end()); + llvm::sort(VisitedNonBrokenSymlinks.begin(), VisitedNonBrokenSymlinks.end()); + llvm::sort(VisitedBrokenSymlinks.begin(), VisitedBrokenSymlinks.end()); ExpectedNonBrokenSymlinks = {"b", "bb", "d", "da", "dd", "ddd", "ddd"}; ASSERT_EQ(ExpectedNonBrokenSymlinks.size(), VisitedNonBrokenSymlinks.size()); ASSERT_TRUE(std::equal(VisitedNonBrokenSymlinks.begin(), @@ -954,8 +954,8 @@ TEST_F(FileSystemTest, BrokenSymlinkDirectoryIteration) { ASSERT_NO_ERROR(ec); VisitedNonBrokenSymlinks.push_back(path::filename(i->path())); } - std::sort(VisitedNonBrokenSymlinks.begin(), VisitedNonBrokenSymlinks.end()); - std::sort(VisitedBrokenSymlinks.begin(), VisitedBrokenSymlinks.end()); + llvm::sort(VisitedNonBrokenSymlinks.begin(), VisitedNonBrokenSymlinks.end()); + llvm::sort(VisitedBrokenSymlinks.begin(), VisitedBrokenSymlinks.end()); ExpectedNonBrokenSymlinks = {"a", "b", "ba", "bb", "bc", "c", "d", "da", "dd", "ddd", "e"}; ASSERT_EQ(ExpectedNonBrokenSymlinks.size(), VisitedNonBrokenSymlinks.size()); |