1*b0d29bc4SBrooks Davis // Copyright 2010 The Kyua Authors. 2*b0d29bc4SBrooks Davis // All rights reserved. 3*b0d29bc4SBrooks Davis // 4*b0d29bc4SBrooks Davis // Redistribution and use in source and binary forms, with or without 5*b0d29bc4SBrooks Davis // modification, are permitted provided that the following conditions are 6*b0d29bc4SBrooks Davis // met: 7*b0d29bc4SBrooks Davis // 8*b0d29bc4SBrooks Davis // * Redistributions of source code must retain the above copyright 9*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer. 10*b0d29bc4SBrooks Davis // * Redistributions in binary form must reproduce the above copyright 11*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer in the 12*b0d29bc4SBrooks Davis // documentation and/or other materials provided with the distribution. 13*b0d29bc4SBrooks Davis // * Neither the name of Google Inc. nor the names of its contributors 14*b0d29bc4SBrooks Davis // may be used to endorse or promote products derived from this software 15*b0d29bc4SBrooks Davis // without specific prior written permission. 16*b0d29bc4SBrooks Davis // 17*b0d29bc4SBrooks Davis // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18*b0d29bc4SBrooks Davis // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19*b0d29bc4SBrooks Davis // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20*b0d29bc4SBrooks Davis // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21*b0d29bc4SBrooks Davis // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22*b0d29bc4SBrooks Davis // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23*b0d29bc4SBrooks Davis // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24*b0d29bc4SBrooks Davis // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25*b0d29bc4SBrooks Davis // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26*b0d29bc4SBrooks Davis // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27*b0d29bc4SBrooks Davis // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*b0d29bc4SBrooks Davis 29*b0d29bc4SBrooks Davis /// \file utils/fs/path.hpp 30*b0d29bc4SBrooks Davis /// Provides the utils::fs::path class. 31*b0d29bc4SBrooks Davis /// 32*b0d29bc4SBrooks Davis /// This is a poor man's reimplementation of the path class provided by 33*b0d29bc4SBrooks Davis /// Boost.Filesystem, in the sense that it tries to follow the same API but is 34*b0d29bc4SBrooks Davis /// much simplified. 35*b0d29bc4SBrooks Davis 36*b0d29bc4SBrooks Davis #if !defined(UTILS_FS_PATH_HPP) 37*b0d29bc4SBrooks Davis #define UTILS_FS_PATH_HPP 38*b0d29bc4SBrooks Davis 39*b0d29bc4SBrooks Davis #include "utils/fs/path_fwd.hpp" 40*b0d29bc4SBrooks Davis 41*b0d29bc4SBrooks Davis #include <string> 42*b0d29bc4SBrooks Davis #include <ostream> 43*b0d29bc4SBrooks Davis 44*b0d29bc4SBrooks Davis namespace utils { 45*b0d29bc4SBrooks Davis namespace fs { 46*b0d29bc4SBrooks Davis 47*b0d29bc4SBrooks Davis 48*b0d29bc4SBrooks Davis /// Representation and manipulation of a file system path. 49*b0d29bc4SBrooks Davis /// 50*b0d29bc4SBrooks Davis /// Application code should always use this class to represent a path instead of 51*b0d29bc4SBrooks Davis /// std::string, because this class is more semantically representative, ensures 52*b0d29bc4SBrooks Davis /// that the values are valid and provides some useful manipulation functions. 53*b0d29bc4SBrooks Davis /// 54*b0d29bc4SBrooks Davis /// Conversions to and from strings are always explicit. 55*b0d29bc4SBrooks Davis class path { 56*b0d29bc4SBrooks Davis /// Internal representation of the path. 57*b0d29bc4SBrooks Davis std::string _repr; 58*b0d29bc4SBrooks Davis 59*b0d29bc4SBrooks Davis public: 60*b0d29bc4SBrooks Davis explicit path(const std::string&); 61*b0d29bc4SBrooks Davis 62*b0d29bc4SBrooks Davis const char* c_str(void) const; 63*b0d29bc4SBrooks Davis const std::string& str(void) const; 64*b0d29bc4SBrooks Davis 65*b0d29bc4SBrooks Davis path branch_path(void) const; 66*b0d29bc4SBrooks Davis std::string leaf_name(void) const; 67*b0d29bc4SBrooks Davis path to_absolute(void) const; 68*b0d29bc4SBrooks Davis 69*b0d29bc4SBrooks Davis bool is_absolute(void) const; 70*b0d29bc4SBrooks Davis bool is_parent_of(path) const; 71*b0d29bc4SBrooks Davis int ncomponents(void) const; 72*b0d29bc4SBrooks Davis 73*b0d29bc4SBrooks Davis bool operator<(const path&) const; 74*b0d29bc4SBrooks Davis bool operator==(const path&) const; 75*b0d29bc4SBrooks Davis bool operator!=(const path&) const; 76*b0d29bc4SBrooks Davis path operator/(const std::string&) const; 77*b0d29bc4SBrooks Davis path operator/(const path&) const; 78*b0d29bc4SBrooks Davis }; 79*b0d29bc4SBrooks Davis 80*b0d29bc4SBrooks Davis 81*b0d29bc4SBrooks Davis std::ostream& operator<<(std::ostream&, const path&); 82*b0d29bc4SBrooks Davis 83*b0d29bc4SBrooks Davis 84*b0d29bc4SBrooks Davis } // namespace fs 85*b0d29bc4SBrooks Davis } // namespace utils 86*b0d29bc4SBrooks Davis 87*b0d29bc4SBrooks Davis #endif // !defined(UTILS_FS_PATH_HPP) 88