3 *****************************************************************************
4 * Copyright (C) 2010 - 2012 Klagenfurt University
6 * Created on: Feb 20, 2012
7 * Authors: Christopher Mueller <christopher.mueller@itec.uni-klu.ac.at>
8 * Christian Timmerer <christian.timmerer@itec.uni-klu.ac.at>
10 * This program is free software; you can redistribute it and/or modify it
11 * under the terms of the GNU Lesser General Public License as published
12 * by the Free Software Foundation; either version 2.1 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU Lesser General Public License for more details.
20 * You should have received a copy of the GNU Lesser General Public License
21 * along with this program; if not, write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
23 *****************************************************************************/
32 std::string Helper::combinePaths (const std::string &path1, const std::string &path2)
34 if ( path2.length() == 0 )
36 else if ( path1.length() == 0 )
39 char path1Last = path1.at(path1.size() - 1);
40 char path2First = path2.at(0);
42 if(path1Last == '/' && path2First == '/')
43 return path1 + path2.substr(1, path2.size());
45 if(path1Last != '/' && path2First != '/')
46 return path1 + "/" + path2;
50 std::string Helper::getDirectoryPath (const std::string &path)
52 int pos = path.find_last_of('/');
54 return path.substr(0, pos);
57 bool Helper::ifind(std::string haystack, std::string needle)
59 transform(haystack.begin(), haystack.end(), haystack.begin(), toupper);
60 transform(needle.begin(), needle.end(), needle.begin(), toupper);
61 return haystack.find(needle) != std::string::npos;