2 * Copyright (c) 2011 Sveriges Television AB <info@casparcg.com>
4 * This file is part of CasparCG (www.casparcg.com).
6 * CasparCG is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
11 * CasparCG is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with CasparCG. If not, see <http://www.gnu.org/licenses/>.
19 * Author: Helge Norberg, helge.norberg@svt.se
22 #include "../../stdafx.h"
24 #include "../filesystem.h"
28 #include <boost/filesystem.hpp>
29 #include <boost/algorithm/string.hpp>
31 using namespace boost::filesystem;
35 boost::optional<std::wstring> find_case_insensitive(const std::wstring& case_insensitive)
37 path p(case_insensitive);
40 return case_insensitive;
47 auto concatenated = result / part;
49 if (exists(concatenated))
51 result = concatenated;
57 for (auto it = directory_iterator(absolute(result)); it != directory_iterator(); ++it)
59 auto leaf = it->path().leaf();
61 if (boost::algorithm::iequals(part.wstring(), leaf.wstring()))
63 result = result / leaf;
74 return result.wstring();