forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
159 lines
4.9 KiB
C++
159 lines
4.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++98, c++03
|
|
|
|
// <filesystem>
|
|
|
|
// class recursive_directory_iterator
|
|
|
|
// recursive_directory_iterator& operator=(recursive_directory_iterator const&);
|
|
|
|
#include "filesystem_include.hpp"
|
|
#include <type_traits>
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "rapid-cxx-test.hpp"
|
|
#include "filesystem_test_helper.hpp"
|
|
|
|
using namespace fs;
|
|
|
|
TEST_SUITE(recursive_directory_iterator_copy_assign_tests)
|
|
|
|
recursive_directory_iterator createInterestingIterator()
|
|
// Create an "interesting" iterator where all fields are
|
|
// in a non-default state. The returned 'it' is in a
|
|
// state such that:
|
|
// it.options() == directory_options::skip_permission_denied
|
|
// it.depth() == 1
|
|
// it.recursion_pending() == true
|
|
{
|
|
const path testDir = StaticEnv::Dir;
|
|
const recursive_directory_iterator endIt;
|
|
recursive_directory_iterator it(testDir,
|
|
directory_options::skip_permission_denied);
|
|
TEST_ASSERT(it != endIt);
|
|
while (it.depth() != 1) {
|
|
++it;
|
|
TEST_ASSERT(it != endIt);
|
|
}
|
|
TEST_ASSERT(it.depth() == 1);
|
|
it.disable_recursion_pending();
|
|
return it;
|
|
}
|
|
|
|
|
|
recursive_directory_iterator createDifferentInterestingIterator()
|
|
// Create an "interesting" iterator where all fields are
|
|
// in a non-default state. The returned 'it' is in a
|
|
// state such that:
|
|
// it.options() == directory_options::follow_directory_symlink
|
|
// it.depth() == 2
|
|
// it.recursion_pending() == false
|
|
{
|
|
const path testDir = StaticEnv::Dir;
|
|
const recursive_directory_iterator endIt;
|
|
recursive_directory_iterator it(testDir,
|
|
directory_options::follow_directory_symlink);
|
|
TEST_ASSERT(it != endIt);
|
|
while (it.depth() != 2) {
|
|
++it;
|
|
TEST_ASSERT(it != endIt);
|
|
}
|
|
TEST_ASSERT(it.depth() == 2);
|
|
return it;
|
|
}
|
|
|
|
TEST_CASE(test_assignment_signature) {
|
|
using D = recursive_directory_iterator;
|
|
static_assert(std::is_copy_assignable<D>::value, "");
|
|
}
|
|
|
|
TEST_CASE(test_copy_to_end_iterator)
|
|
{
|
|
const recursive_directory_iterator endIt;
|
|
|
|
const recursive_directory_iterator from = createInterestingIterator();
|
|
const path entry = *from;
|
|
|
|
recursive_directory_iterator to;
|
|
to = from;
|
|
TEST_REQUIRE(to == from);
|
|
TEST_CHECK(*to == entry);
|
|
TEST_CHECK(to.options() == from.options());
|
|
TEST_CHECK(to.depth() == from.depth());
|
|
TEST_CHECK(to.recursion_pending() == from.recursion_pending());
|
|
}
|
|
|
|
|
|
TEST_CASE(test_copy_from_end_iterator)
|
|
{
|
|
const recursive_directory_iterator from;
|
|
recursive_directory_iterator to = createInterestingIterator();
|
|
|
|
to = from;
|
|
TEST_REQUIRE(to == from);
|
|
TEST_CHECK(to == recursive_directory_iterator{});
|
|
}
|
|
|
|
TEST_CASE(test_copy_valid_iterator)
|
|
{
|
|
const recursive_directory_iterator endIt;
|
|
|
|
const recursive_directory_iterator it = createInterestingIterator();
|
|
const path entry = *it;
|
|
|
|
recursive_directory_iterator it2 = createDifferentInterestingIterator();
|
|
TEST_REQUIRE(it2 != it);
|
|
TEST_CHECK(it2.options() != it.options());
|
|
TEST_CHECK(it2.depth() != it.depth());
|
|
TEST_CHECK(it2.recursion_pending() != it.recursion_pending());
|
|
TEST_CHECK(*it2 != entry);
|
|
|
|
it2 = it;
|
|
TEST_REQUIRE(it2 == it);
|
|
TEST_CHECK(it2.options() == it.options());
|
|
TEST_CHECK(it2.depth() == it.depth());
|
|
TEST_CHECK(it2.recursion_pending() == it.recursion_pending());
|
|
TEST_CHECK(*it2 == entry);
|
|
}
|
|
|
|
TEST_CASE(test_returns_reference_to_self)
|
|
{
|
|
const recursive_directory_iterator it;
|
|
recursive_directory_iterator it2;
|
|
recursive_directory_iterator& ref = (it2 = it);
|
|
TEST_CHECK(&ref == &it2);
|
|
}
|
|
|
|
TEST_CASE(test_self_copy)
|
|
{
|
|
// Create two non-equal iterators that have exactly the same state.
|
|
recursive_directory_iterator it = createInterestingIterator();
|
|
recursive_directory_iterator it2 = createInterestingIterator();
|
|
TEST_CHECK(it != it2);
|
|
TEST_CHECK(it2.options() == it.options());
|
|
TEST_CHECK(it2.depth() == it.depth());
|
|
TEST_CHECK(it2.recursion_pending() == it.recursion_pending());
|
|
TEST_CHECK(*it2 == *it);
|
|
|
|
// perform a self-copy and check that the state still matches the
|
|
// other unmodified iterator.
|
|
recursive_directory_iterator const& cit = it;
|
|
it = cit;
|
|
TEST_CHECK(it2.options() == it.options());
|
|
TEST_CHECK(it2.depth() == it.depth());
|
|
TEST_CHECK(it2.recursion_pending() == it.recursion_pending());
|
|
TEST_CHECK(*it2 == *it);
|
|
}
|
|
|
|
TEST_SUITE_END()
|