head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.1 netbsd-11-0-RC3:1.1.1.1 netbsd-11-0-RC2:1.1.1.1 netbsd-11-0-RC1:1.1.1.1 perseant-exfatfs-base-20250801:1.1.1.1 netbsd-11:1.1.1.1.0.50 netbsd-11-base:1.1.1.1 netbsd-10-1-RELEASE:1.1.1.1 perseant-exfatfs-base-20240630:1.1.1.1 perseant-exfatfs:1.1.1.1.0.48 perseant-exfatfs-base:1.1.1.1 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.1 netbsd-10-0-RELEASE:1.1.1.1 netbsd-10-0-RC6:1.1.1.1 netbsd-10-0-RC5:1.1.1.1 netbsd-10-0-RC4:1.1.1.1 netbsd-10-0-RC3:1.1.1.1 netbsd-10-0-RC2:1.1.1.1 netbsd-10-0-RC1:1.1.1.1 netbsd-10:1.1.1.1.0.46 netbsd-10-base:1.1.1.1 netbsd-9-3-RELEASE:1.1.1.1 cjep_sun2x-base1:1.1.1.1 cjep_sun2x:1.1.1.1.0.44 cjep_sun2x-base:1.1.1.1 cjep_staticlib_x-base1:1.1.1.1 netbsd-9-2-RELEASE:1.1.1.1 cjep_staticlib_x:1.1.1.1.0.42 cjep_staticlib_x-base:1.1.1.1 netbsd-9-1-RELEASE:1.1.1.1 phil-wifi-20200421:1.1.1.1 phil-wifi-20200411:1.1.1.1 is-mlppp:1.1.1.1.0.40 is-mlppp-base:1.1.1.1 phil-wifi-20200406:1.1.1.1 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.1 netbsd-9-0-RC2:1.1.1.1 netbsd-9-0-RC1:1.1.1.1 phil-wifi-20191119:1.1.1.1 netbsd-9:1.1.1.1.0.38 netbsd-9-base:1.1.1.1 phil-wifi-20190609:1.1.1.1 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.1 pgoyette-compat-20190127:1.1.1.1 pgoyette-compat-20190118:1.1.1.1 pgoyette-compat-1226:1.1.1.1 pgoyette-compat-1126:1.1.1.1 pgoyette-compat-1020:1.1.1.1 pgoyette-compat-0930:1.1.1.1 pgoyette-compat-0906:1.1.1.1 netbsd-7-2-RELEASE:1.1.1.1 pgoyette-compat-0728:1.1.1.1 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.1.0.36 phil-wifi-base:1.1.1.1 pgoyette-compat-0625:1.1.1.1 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.1 pgoyette-compat-0502:1.1.1.1 pgoyette-compat-0422:1.1.1.1 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.1 pgoyette-compat-0407:1.1.1.1 pgoyette-compat-0330:1.1.1.1 pgoyette-compat-0322:1.1.1.1 pgoyette-compat-0315:1.1.1.1 netbsd-7-1-2-RELEASE:1.1.1.1 pgoyette-compat:1.1.1.1.0.34 pgoyette-compat-base:1.1.1.1 netbsd-7-1-1-RELEASE:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.32 matt-nb8-mediatek-base:1.1.1.1 perseant-stdc-iso10646:1.1.1.1.0.30 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.28 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.26 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount-20170320:1.1.1.1 netbsd-7-1:1.1.1.1.0.24 netbsd-7-1-RELEASE:1.1.1.1 netbsd-7-1-RC2:1.1.1.1 netbsd-7-nhusb-base-20170116:1.1.1.1 bouyer-socketcan:1.1.1.1.0.22 bouyer-socketcan-base:1.1.1.1 pgoyette-localcount-20170107:1.1.1.1 netbsd-7-1-RC1:1.1.1.1 pgoyette-localcount-20161104:1.1.1.1 netbsd-7-0-2-RELEASE:1.1.1.1 localcount-20160914:1.1.1.1 netbsd-7-nhusb:1.1.1.1.0.20 netbsd-7-nhusb-base:1.1.1.1 pgoyette-localcount-20160806:1.1.1.1 pgoyette-localcount-20160726:1.1.1.1 pgoyette-localcount:1.1.1.1.0.18 pgoyette-localcount-base:1.1.1.1 netbsd-7-0-1-RELEASE:1.1.1.1 netbsd-7-0:1.1.1.1.0.16 netbsd-7-0-RELEASE:1.1.1.1 netbsd-7-0-RC3:1.1.1.1 netbsd-7-0-RC2:1.1.1.1 netbsd-7-0-RC1:1.1.1.1 netbsd-7:1.1.1.1.0.14 netbsd-7-base:1.1.1.1 yamt-pagecache:1.1.1.1.0.12 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.10 tls-earlyentropy-base:1.1.1.1 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 kyua-cli-0-7:1.1.1.1 riastradh-drm2-base2:1.1.1.1 riastradh-drm2-base1:1.1.1.1 riastradh-drm2:1.1.1.1.0.2 riastradh-drm2-base:1.1.1.1 khorben-n900:1.1.1.1.0.8 agc-symver:1.1.1.1.0.6 agc-symver-base:1.1.1.1 tls-maxphys-base:1.1.1.1 tls-maxphys:1.1.1.1.0.4 kyua-cli-0-6:1.1.1.1 GOOGLE-CODE:1.1.1; locks; strict; comment @// @; 1.1 date 2013.02.23.12.34.06; author jmmv; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 2013.02.23.12.34.06; author jmmv; state Exp; branches 1.1.1.1.4.1 1.1.1.1.12.1; next ; 1.1.1.1.4.1 date 2013.02.23.12.34.06; author tls; state dead; branches; next 1.1.1.1.4.2; 1.1.1.1.4.2 date 2013.02.25.00.26.17; author tls; state Exp; branches; next ; 1.1.1.1.12.1 date 2013.02.23.12.34.06; author yamt; state dead; branches; next 1.1.1.1.12.2; commitid h3iiOYJJCkPr7yBx; 1.1.1.1.12.2 date 2014.05.22.15.45.30; author yamt; state Exp; branches; next ; commitid h3iiOYJJCkPr7yBx; desc @@ 1.1 log @Initial revision @ text @// Copyright 2010 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of Google Inc. nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include "utils/fs/path.hpp" #include "utils/fs/exceptions.hpp" #include "utils/fs/operations.hpp" #include "utils/sanity.hpp" namespace fs = utils::fs; namespace { /// Normalizes an input string to a valid path. /// /// A normalized path cannot have empty components; i.e. there can be at most /// one consecutive separator (/). /// /// \param in The string to normalize. /// /// \return The normalized string, representing a path. /// /// \throw utils::fs::invalid_path_error If the path is empty. static std::string normalize(const std::string& in) { if (in.empty()) throw fs::invalid_path_error(in, "Cannot be empty"); std::string out; std::string::size_type pos = 0; do { const std::string::size_type next_pos = in.find('/', pos); const std::string component = in.substr(pos, next_pos - pos); if (!component.empty()) { if (pos == 0) out += component; else if (component != ".") out += "/" + component; } if (next_pos == std::string::npos) pos = next_pos; else pos = next_pos + 1; } while (pos != std::string::npos); return out.empty() ? "/" : out; } } // anonymous namespace /// Creates a new path object from a textual representation of a path. /// /// \param text A valid representation of a path in textual form. /// /// \throw utils::fs::invalid_path_error If the input text does not represent a /// valid path. fs::path::path(const std::string& text) : _repr(normalize(text)) { } /// Gets a view of the path as an array of characters. const char* fs::path::c_str(void) const { return _repr.c_str(); } /// Gets a view of the path as a std::string. const std::string& fs::path::str(void) const { return _repr; } /// Gets the branch path (directory name) of the path. /// /// The branch path of a path with just one component (no separators) is ".". /// /// \return A new path representing the branch path. fs::path fs::path::branch_path(void) const { const std::string::size_type end_pos = _repr.rfind('/'); if (end_pos == std::string::npos) return fs::path("."); else if (end_pos == 0) return fs::path("/"); else return fs::path(_repr.substr(0, end_pos)); } /// Gets the leaf name (base name) of the path. /// /// \return A new string representing the leaf name. std::string fs::path::leaf_name(void) const { const std::string::size_type beg_pos = _repr.rfind('/'); if (beg_pos == std::string::npos) return _repr; else return _repr.substr(beg_pos + 1); } /// Converts a relative path in the current directory to an absolute path. /// /// \pre The path is relative. /// /// \return The absolute representation of the relative path. fs::path fs::path::to_absolute(void) const { PRE(!is_absolute()); return fs::current_path() / *this; } /// Checks whether the path is absolute. bool fs::path::is_absolute(void) const { return _repr[0] == '/'; } /// Checks whether the path is a parent of another path. /// /// A path is considered to be a parent of itself. /// /// \return True if this path is a parent of p. bool fs::path::is_parent_of(path p) const { do { if ((*this) == p) return true; p = p.branch_path(); } while (p != fs::path(".") && p != fs::path("/")); return false; } /// Counts the number of components in the path. /// /// \return The number of components. int fs::path::ncomponents(void) const { int count = 0; if (_repr == "/") return 1; else { for (std::string::const_iterator iter = _repr.begin(); iter != _repr.end(); ++iter) { if (*iter == '/') count++; } return count + 1; } } /// Less-than comparator for paths. /// /// This is provided to make identifiers useful as map keys. /// /// \param p The path to compare to. /// /// \return True if this identifier sorts before the other identifier; false /// otherwise. bool fs::path::operator<(const fs::path& p) const { return _repr < p._repr; } /// Compares two paths for equality. /// /// Given that the paths are internally normalized, input paths such as /// ///foo/bar and /foo///bar are exactly the same. However, this does NOT /// check for true equality: i.e. this does not access the file system to check /// if the paths actually point to the same object my means of links. /// /// \param p The path to compare to. /// /// \returns A boolean indicating whether the paths are equal. bool fs::path::operator==(const fs::path& p) const { return _repr == p._repr; } /// Compares two paths for inequality. /// /// See the description of operator==() for more details on the comparison /// performed. /// /// \param p The path to compare to. /// /// \returns A boolean indicating whether the paths are different. bool fs::path::operator!=(const fs::path& p) const { return _repr != p._repr; } /// Concatenates this path with one or more components. /// /// \param components The new components to concatenate to the path. These are /// normalized because, in general, they may come from user input. These /// components cannot represent an absolute path. /// /// \return A new path containing the concatenation of this path and the /// provided components. /// /// \throw utils::fs::invalid_path_error If components does not represent a /// valid path. /// \throw utils::fs::join_error If the join operation is invalid because the /// two paths are incompatible. fs::path fs::path::operator/(const std::string& components) const { return (*this) / fs::path(components); } /// Concatenates this path with another path. /// /// \param rest The path to concatenate to this one. Cannot be absolute. /// /// \return A new path containing the concatenation of this path and the other /// path. /// /// \throw utils::fs::join_error If the join operation is invalid because the /// two paths are incompatible. fs::path fs::path::operator/(const fs::path& rest) const { if (rest.is_absolute()) throw fs::join_error(_repr, rest._repr, "Cannot concatenate a path to an absolute path"); return fs::path(_repr + '/' + rest._repr); } /// Formats a path for insertion on a stream. /// /// \param os The output stream. /// \param p The path to inject to the stream. /// /// \return The output stream os. std::ostream& fs::operator<<(std::ostream& os, const fs::path& p) { return (os << p.str()); } @ 1.1.1.1 log @Initial import of Kyua CLI, version 0.6: This is the main component of Kyua and its build will be guarded by the MKKYUA knob. core@@ has approved this import. Description: Kyua (pronounced Q.A.) is a testing framework for both developers and users. Kyua is different from most other testing frameworks in that it puts the end user experience before anything else. There are multiple reasons for users to run the tests themselves, and Kyua ensures that they can do so in the most convenient way. This module, kyua-cli, provides the command-line interface to the Kyua runtime system. The major purpose of this tool is to run test cases and generate unified reports for their results. @ text @@ 1.1.1.1.12.1 log @file path.cpp was added on branch yamt-pagecache on 2014-05-22 15:45:30 +0000 @ text @d1 299 @ 1.1.1.1.12.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 299 // Copyright 2010 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of Google Inc. nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include "utils/fs/path.hpp" #include "utils/fs/exceptions.hpp" #include "utils/fs/operations.hpp" #include "utils/sanity.hpp" namespace fs = utils::fs; namespace { /// Normalizes an input string to a valid path. /// /// A normalized path cannot have empty components; i.e. there can be at most /// one consecutive separator (/). /// /// \param in The string to normalize. /// /// \return The normalized string, representing a path. /// /// \throw utils::fs::invalid_path_error If the path is empty. static std::string normalize(const std::string& in) { if (in.empty()) throw fs::invalid_path_error(in, "Cannot be empty"); std::string out; std::string::size_type pos = 0; do { const std::string::size_type next_pos = in.find('/', pos); const std::string component = in.substr(pos, next_pos - pos); if (!component.empty()) { if (pos == 0) out += component; else if (component != ".") out += "/" + component; } if (next_pos == std::string::npos) pos = next_pos; else pos = next_pos + 1; } while (pos != std::string::npos); return out.empty() ? "/" : out; } } // anonymous namespace /// Creates a new path object from a textual representation of a path. /// /// \param text A valid representation of a path in textual form. /// /// \throw utils::fs::invalid_path_error If the input text does not represent a /// valid path. fs::path::path(const std::string& text) : _repr(normalize(text)) { } /// Gets a view of the path as an array of characters. const char* fs::path::c_str(void) const { return _repr.c_str(); } /// Gets a view of the path as a std::string. const std::string& fs::path::str(void) const { return _repr; } /// Gets the branch path (directory name) of the path. /// /// The branch path of a path with just one component (no separators) is ".". /// /// \return A new path representing the branch path. fs::path fs::path::branch_path(void) const { const std::string::size_type end_pos = _repr.rfind('/'); if (end_pos == std::string::npos) return fs::path("."); else if (end_pos == 0) return fs::path("/"); else return fs::path(_repr.substr(0, end_pos)); } /// Gets the leaf name (base name) of the path. /// /// \return A new string representing the leaf name. std::string fs::path::leaf_name(void) const { const std::string::size_type beg_pos = _repr.rfind('/'); if (beg_pos == std::string::npos) return _repr; else return _repr.substr(beg_pos + 1); } /// Converts a relative path in the current directory to an absolute path. /// /// \pre The path is relative. /// /// \return The absolute representation of the relative path. fs::path fs::path::to_absolute(void) const { PRE(!is_absolute()); return fs::current_path() / *this; } /// Checks whether the path is absolute. bool fs::path::is_absolute(void) const { return _repr[0] == '/'; } /// Checks whether the path is a parent of another path. /// /// A path is considered to be a parent of itself. /// /// \return True if this path is a parent of p. bool fs::path::is_parent_of(path p) const { do { if ((*this) == p) return true; p = p.branch_path(); } while (p != fs::path(".") && p != fs::path("/")); return false; } /// Counts the number of components in the path. /// /// \return The number of components. int fs::path::ncomponents(void) const { int count = 0; if (_repr == "/") return 1; else { for (std::string::const_iterator iter = _repr.begin(); iter != _repr.end(); ++iter) { if (*iter == '/') count++; } return count + 1; } } /// Less-than comparator for paths. /// /// This is provided to make identifiers useful as map keys. /// /// \param p The path to compare to. /// /// \return True if this identifier sorts before the other identifier; false /// otherwise. bool fs::path::operator<(const fs::path& p) const { return _repr < p._repr; } /// Compares two paths for equality. /// /// Given that the paths are internally normalized, input paths such as /// ///foo/bar and /foo///bar are exactly the same. However, this does NOT /// check for true equality: i.e. this does not access the file system to check /// if the paths actually point to the same object my means of links. /// /// \param p The path to compare to. /// /// \returns A boolean indicating whether the paths are equal. bool fs::path::operator==(const fs::path& p) const { return _repr == p._repr; } /// Compares two paths for inequality. /// /// See the description of operator==() for more details on the comparison /// performed. /// /// \param p The path to compare to. /// /// \returns A boolean indicating whether the paths are different. bool fs::path::operator!=(const fs::path& p) const { return _repr != p._repr; } /// Concatenates this path with one or more components. /// /// \param components The new components to concatenate to the path. These are /// normalized because, in general, they may come from user input. These /// components cannot represent an absolute path. /// /// \return A new path containing the concatenation of this path and the /// provided components. /// /// \throw utils::fs::invalid_path_error If components does not represent a /// valid path. /// \throw utils::fs::join_error If the join operation is invalid because the /// two paths are incompatible. fs::path fs::path::operator/(const std::string& components) const { return (*this) / fs::path(components); } /// Concatenates this path with another path. /// /// \param rest The path to concatenate to this one. Cannot be absolute. /// /// \return A new path containing the concatenation of this path and the other /// path. /// /// \throw utils::fs::join_error If the join operation is invalid because the /// two paths are incompatible. fs::path fs::path::operator/(const fs::path& rest) const { if (rest.is_absolute()) throw fs::join_error(_repr, rest._repr, "Cannot concatenate a path to an absolute path"); return fs::path(_repr + '/' + rest._repr); } /// Formats a path for insertion on a stream. /// /// \param os The output stream. /// \param p The path to inject to the stream. /// /// \return The output stream os. std::ostream& fs::operator<<(std::ostream& os, const fs::path& p) { return (os << p.str()); } @ 1.1.1.1.4.1 log @file path.cpp was added on branch tls-maxphys on 2013-02-25 00:26:17 +0000 @ text @d1 299 @ 1.1.1.1.4.2 log @resync with head @ text @a0 299 // Copyright 2010 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of Google Inc. nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include "utils/fs/path.hpp" #include "utils/fs/exceptions.hpp" #include "utils/fs/operations.hpp" #include "utils/sanity.hpp" namespace fs = utils::fs; namespace { /// Normalizes an input string to a valid path. /// /// A normalized path cannot have empty components; i.e. there can be at most /// one consecutive separator (/). /// /// \param in The string to normalize. /// /// \return The normalized string, representing a path. /// /// \throw utils::fs::invalid_path_error If the path is empty. static std::string normalize(const std::string& in) { if (in.empty()) throw fs::invalid_path_error(in, "Cannot be empty"); std::string out; std::string::size_type pos = 0; do { const std::string::size_type next_pos = in.find('/', pos); const std::string component = in.substr(pos, next_pos - pos); if (!component.empty()) { if (pos == 0) out += component; else if (component != ".") out += "/" + component; } if (next_pos == std::string::npos) pos = next_pos; else pos = next_pos + 1; } while (pos != std::string::npos); return out.empty() ? "/" : out; } } // anonymous namespace /// Creates a new path object from a textual representation of a path. /// /// \param text A valid representation of a path in textual form. /// /// \throw utils::fs::invalid_path_error If the input text does not represent a /// valid path. fs::path::path(const std::string& text) : _repr(normalize(text)) { } /// Gets a view of the path as an array of characters. const char* fs::path::c_str(void) const { return _repr.c_str(); } /// Gets a view of the path as a std::string. const std::string& fs::path::str(void) const { return _repr; } /// Gets the branch path (directory name) of the path. /// /// The branch path of a path with just one component (no separators) is ".". /// /// \return A new path representing the branch path. fs::path fs::path::branch_path(void) const { const std::string::size_type end_pos = _repr.rfind('/'); if (end_pos == std::string::npos) return fs::path("."); else if (end_pos == 0) return fs::path("/"); else return fs::path(_repr.substr(0, end_pos)); } /// Gets the leaf name (base name) of the path. /// /// \return A new string representing the leaf name. std::string fs::path::leaf_name(void) const { const std::string::size_type beg_pos = _repr.rfind('/'); if (beg_pos == std::string::npos) return _repr; else return _repr.substr(beg_pos + 1); } /// Converts a relative path in the current directory to an absolute path. /// /// \pre The path is relative. /// /// \return The absolute representation of the relative path. fs::path fs::path::to_absolute(void) const { PRE(!is_absolute()); return fs::current_path() / *this; } /// Checks whether the path is absolute. bool fs::path::is_absolute(void) const { return _repr[0] == '/'; } /// Checks whether the path is a parent of another path. /// /// A path is considered to be a parent of itself. /// /// \return True if this path is a parent of p. bool fs::path::is_parent_of(path p) const { do { if ((*this) == p) return true; p = p.branch_path(); } while (p != fs::path(".") && p != fs::path("/")); return false; } /// Counts the number of components in the path. /// /// \return The number of components. int fs::path::ncomponents(void) const { int count = 0; if (_repr == "/") return 1; else { for (std::string::const_iterator iter = _repr.begin(); iter != _repr.end(); ++iter) { if (*iter == '/') count++; } return count + 1; } } /// Less-than comparator for paths. /// /// This is provided to make identifiers useful as map keys. /// /// \param p The path to compare to. /// /// \return True if this identifier sorts before the other identifier; false /// otherwise. bool fs::path::operator<(const fs::path& p) const { return _repr < p._repr; } /// Compares two paths for equality. /// /// Given that the paths are internally normalized, input paths such as /// ///foo/bar and /foo///bar are exactly the same. However, this does NOT /// check for true equality: i.e. this does not access the file system to check /// if the paths actually point to the same object my means of links. /// /// \param p The path to compare to. /// /// \returns A boolean indicating whether the paths are equal. bool fs::path::operator==(const fs::path& p) const { return _repr == p._repr; } /// Compares two paths for inequality. /// /// See the description of operator==() for more details on the comparison /// performed. /// /// \param p The path to compare to. /// /// \returns A boolean indicating whether the paths are different. bool fs::path::operator!=(const fs::path& p) const { return _repr != p._repr; } /// Concatenates this path with one or more components. /// /// \param components The new components to concatenate to the path. These are /// normalized because, in general, they may come from user input. These /// components cannot represent an absolute path. /// /// \return A new path containing the concatenation of this path and the /// provided components. /// /// \throw utils::fs::invalid_path_error If components does not represent a /// valid path. /// \throw utils::fs::join_error If the join operation is invalid because the /// two paths are incompatible. fs::path fs::path::operator/(const std::string& components) const { return (*this) / fs::path(components); } /// Concatenates this path with another path. /// /// \param rest The path to concatenate to this one. Cannot be absolute. /// /// \return A new path containing the concatenation of this path and the other /// path. /// /// \throw utils::fs::join_error If the join operation is invalid because the /// two paths are incompatible. fs::path fs::path::operator/(const fs::path& rest) const { if (rest.is_absolute()) throw fs::join_error(_repr, rest._repr, "Cannot concatenate a path to an absolute path"); return fs::path(_repr + '/' + rest._repr); } /// Formats a path for insertion on a stream. /// /// \param os The output stream. /// \param p The path to inject to the stream. /// /// \return The output stream os. std::ostream& fs::operator<<(std::ostream& os, const fs::path& p) { return (os << p.str()); } @