1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183
|
/************************************************************************/
/* */
/* Centre for Speech Technology Research */
/* University of Edinburgh, UK */
/* Copyright (c) 1996,1997 */
/* All Rights Reserved. */
/* */
/* Permission to use, copy, modify, distribute this software and its */
/* documentation for research, educational and individual use only, is */
/* hereby granted without fee, subject to the following conditions: */
/* 1. The code must retain the above copyright notice, this list of */
/* conditions and the following disclaimer. */
/* 2. Any modifications must be clearly marked as such. */
/* 3. Original authors' names are not deleted. */
/* This software may not be used for commercial purposes without */
/* specific prior written permission from the authors. */
/* */
/* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
/* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
/* THIS SOFTWARE. */
/* */
/************************************************************************/
/* Author: Richard Caley (rjc@cstr.ed.ac.uk) */
/* Date: Tue Mar 18 1997 */
/************************************************************************/
/* */
/* Implementation of a class for manipulating filenames and so on. */
/* */
/* This is all hard coded to be unix filenames. I think the best */
/* strategy is to have a separate version of this for any other */
/* pathname format rather than trying to parameterise this. Most of */
/* it is fairly simple. */
/* */
/************************************************************************/
#include "EST_unix.h"
#include "EST_Pathname.h"
void EST_Pathname::setup(void)
{
}
int EST_Pathname::is_absolute(void) const
{
return length()>0 && (*this)(0) == '/';
}
int EST_Pathname::is_dirname(void) const
{
return length()>0 && (*this)(length()-1) == '/';
}
EST_Pathname EST_Pathname::directory(void) const {
if (is_dirname())
return *this;
int pos;
if ((pos=index("/", -1)) >=0)
return before(pos+1);
else
return "./";
}
EST_Pathname EST_Pathname::as_file(void) const
{
if (is_filename())
return *this;
if (length() > 0)
return before(-1);
return ".";
}
EST_Pathname EST_Pathname::as_directory(void) const
{
if (is_dirname())
return *this;
if (length() > 0)
return ((EST_String)(*this) + (EST_String)"/");
return "./";
}
EST_Pathname EST_Pathname::construct(EST_Pathname dir,
EST_String filename)
{
EST_Pathname result(dir.as_directory());
result += filename;
return result;
}
EST_Pathname EST_Pathname::construct(EST_Pathname dir,
EST_String basename,
EST_String extension)
{
EST_Pathname filename(basename + "." + extension);
return EST_Pathname::construct(dir, filename);
}
EST_TList<EST_String> EST_Pathname::entries(int check_for_directories) const
{
DIR *dir;
EST_TList<EST_String> list;
if ((dir = opendir(this->as_directory()))!=NULL)
{
struct dirent *entry;
while ((entry = readdir(dir)) != NULL)
{
EST_Pathname name(entry->d_name);
struct stat buf;
if (check_for_directories &&
stat((EST_String)this->as_directory() + name, &buf)==0 &&
(buf.st_mode & S_IFDIR))
list.append(name.as_directory());
else
list.append(name);
}
closedir(dir);
}
return list;
}
EST_Pathname EST_Pathname::append(EST_Pathname directory, EST_Pathname addition)
{
if (addition.is_absolute())
return addition;
EST_Pathname result(directory.as_directory());
result += addition;
return result;
}
EST_String EST_Pathname::extension(void) const
{
EST_String result("");
if (length() <= 0)
return result;
if (contains("."))
result = after(index(".",-1));
return result;
}
EST_Pathname EST_Pathname::filename(void) const
{
EST_String result(this->as_file());
if (contains("/"))
result = result.after(index("/",-1));
return result;
}
EST_String EST_Pathname::basename(int remove_all) const
{
EST_String result(this->as_file().filename());
if (remove_all)
{
if (result.contains("."))
result = result.before(".");
}
return result;
}
|