ac8c9f1e39
<filesystem> is a C++17 addition. In C++11 and C++14 modes, we actually have all the code for <filesystem> but it is hidden behind a non-inline namespace __fs so it is not accessible. Instead of doing this unusual dance, just guard the code for filesystem behind a classic C++17 check like we normally do.
140 lines
4.1 KiB
C++
140 lines
4.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++03, c++11, c++14
|
|
// UNSUPPORTED: availability-filesystem-missing
|
|
|
|
// <filesystem>
|
|
|
|
// class path
|
|
|
|
// template <class Source>
|
|
// path(const Source& source);
|
|
// template <class InputIterator>
|
|
// path(InputIterator first, InputIterator last);
|
|
|
|
|
|
#include <filesystem>
|
|
#include <cassert>
|
|
#include <iterator>
|
|
#include <type_traits>
|
|
|
|
#include "test_macros.h"
|
|
namespace fs = std::filesystem;
|
|
|
|
template <class Iter1, class Iter2>
|
|
bool checkCollectionsEqual(
|
|
Iter1 start1, Iter1 const end1
|
|
, Iter2 start2, Iter2 const end2
|
|
)
|
|
{
|
|
while (start1 != end1 && start2 != end2) {
|
|
if (*start1 != *start2) {
|
|
return false;
|
|
}
|
|
++start1; ++start2;
|
|
}
|
|
return (start1 == end1 && start2 == end2);
|
|
}
|
|
|
|
template <class Iter1, class Iter2>
|
|
bool checkCollectionsEqualBackwards(
|
|
Iter1 const start1, Iter1 end1
|
|
, Iter2 const start2, Iter2 end2
|
|
)
|
|
{
|
|
while (start1 != end1 && start2 != end2) {
|
|
--end1; --end2;
|
|
if (*end1 != *end2) {
|
|
return false;
|
|
}
|
|
}
|
|
return (start1 == end1 && start2 == end2);
|
|
}
|
|
|
|
void checkIteratorConcepts() {
|
|
using namespace fs;
|
|
using It = path::iterator;
|
|
using Traits = std::iterator_traits<It>;
|
|
ASSERT_SAME_TYPE(path::const_iterator, It);
|
|
#if TEST_STD_VER > 17
|
|
static_assert(std::bidirectional_iterator<It>);
|
|
#endif
|
|
ASSERT_SAME_TYPE(Traits::value_type, path);
|
|
LIBCPP_STATIC_ASSERT(std::is_same<Traits::iterator_category, std::input_iterator_tag>::value, "");
|
|
LIBCPP_STATIC_ASSERT(std::is_same<Traits::pointer, path const*>::value, "");
|
|
LIBCPP_STATIC_ASSERT(std::is_same<Traits::reference, path>::value, "");
|
|
{
|
|
It it;
|
|
ASSERT_SAME_TYPE(It&, decltype(++it));
|
|
ASSERT_SAME_TYPE(It, decltype(it++));
|
|
ASSERT_SAME_TYPE(It&, decltype(--it));
|
|
ASSERT_SAME_TYPE(It, decltype(it--));
|
|
ASSERT_SAME_TYPE(Traits::reference, decltype(*it));
|
|
ASSERT_SAME_TYPE(Traits::pointer, decltype(it.operator->()));
|
|
#ifdef _WIN32
|
|
ASSERT_SAME_TYPE(std::wstring const&, decltype(it->native()));
|
|
#else
|
|
ASSERT_SAME_TYPE(std::string const&, decltype(it->native()));
|
|
#endif
|
|
ASSERT_SAME_TYPE(bool, decltype(it == it));
|
|
ASSERT_SAME_TYPE(bool, decltype(it != it));
|
|
}
|
|
{
|
|
path const p;
|
|
ASSERT_SAME_TYPE(It, decltype(p.begin()));
|
|
ASSERT_SAME_TYPE(It, decltype(p.end()));
|
|
assert(p.begin() == p.end());
|
|
}
|
|
}
|
|
|
|
void checkBeginEndBasic() {
|
|
using namespace fs;
|
|
using It = path::iterator;
|
|
{
|
|
path const p;
|
|
ASSERT_SAME_TYPE(It, decltype(p.begin()));
|
|
ASSERT_SAME_TYPE(It, decltype(p.end()));
|
|
assert(p.begin() == p.end());
|
|
}
|
|
{
|
|
path const p("foo");
|
|
It default_constructed;
|
|
default_constructed = p.begin();
|
|
assert(default_constructed == p.begin());
|
|
assert(default_constructed != p.end());
|
|
default_constructed = p.end();
|
|
assert(default_constructed == p.end());
|
|
assert(default_constructed != p.begin());
|
|
}
|
|
{
|
|
path p("//root_name//first_dir////second_dir");
|
|
#ifdef _WIN32
|
|
const path expect[] = {"//root_name", "/", "first_dir", "second_dir"};
|
|
#else
|
|
const path expect[] = {"/", "root_name", "first_dir", "second_dir"};
|
|
#endif
|
|
assert(checkCollectionsEqual(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
assert(checkCollectionsEqualBackwards(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
}
|
|
{
|
|
path p("////foo/bar/baz///");
|
|
const path expect[] = {"/", "foo", "bar", "baz", ""};
|
|
assert(checkCollectionsEqual(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
assert(checkCollectionsEqualBackwards(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
}
|
|
}
|
|
|
|
int main(int, char**) {
|
|
using namespace fs;
|
|
checkIteratorConcepts();
|
|
checkBeginEndBasic(); // See path.decompose.pass.cpp for more tests.
|
|
|
|
return 0;
|
|
}
|