libstdc++-v3/testsuite/27_io/filesystem/path/decompose/relative_path.cc

   1 // { dg-options "-std=gnu++17" }
   2 // { dg-do run { target c++17 } }
   3
   4 // Copyright (C) 2014-2019 Free Software Foundation, Inc.
   5 //
   6 // This file is part of the GNU ISO C++ Library.  This library is free
   7 // software; you can redistribute it and/or modify it under the
   8 // terms of the GNU General Public License as published by the
   9 // Free Software Foundation; either version 3, or (at your option)
  10 // any later version.
  11
  12 // This library is distributed in the hope that it will be useful,
  13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 // GNU General Public License for more details.
  16
  17 // You should have received a copy of the GNU General Public License along
  18 // with this library; see the file COPYING3.  If not see
  19 // <http://www.gnu.org/licenses/>.
  20
  21 // 8.4.9 path decomposition [path.decompose]
  22
  23 #include <filesystem>
  24 #include <testsuite_hooks.h>
  25 #include <testsuite_fs.h>
  26
  27 using std::filesystem::path;
  28
  29 void
  30 test01()
  31 {
  32   path p1 = "foo";
  33   VERIFY( p1.relative_path() == p1 );
  34   path p2 = "foo/bar";
  35   VERIFY( p2.relative_path() == p2 );
  36   path p3 = "/foo/bar";
  37   VERIFY( p3.relative_path() == p2 );
  38 }
  39
  40 #include <iostream> // XXX
  41
  42 void
  43 test02()
  44 {
  45   for (const path& p : __gnu_test::test_paths)
  46   {
  47     bool after_root = false;
  48     const path prel = p.relative_path();
  49     VERIFY( !prel.has_root_name() );
  50     path rel;
  51     for (const auto& cmpt : p)
  52     {
  53       if (!cmpt.has_root_path())
  54         after_root = true;
  55       if (after_root)
  56         rel /= cmpt;
  57     }
  58     if (prel != rel)
  59       std::cout << prel << ' ' << rel << '\n';
  60     VERIFY( prel == rel );
  61   }
  62 }
  63
  64 int
  65 main()
  66 {
  67   test01();
  68   test02();
  69 }