You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
117 lines
3.1 KiB
117 lines
3.1 KiB
/*
|
|
* Copyright (c) 2011-2014, Intel Corporation
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|
* are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. 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.
|
|
*
|
|
* 3. Neither the name of the copyright holder 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 HOLDER 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 "PathNavigator.h"
|
|
#include "Tokenizer.h"
|
|
|
|
CPathNavigator::CPathNavigator(const std::string &strPath)
|
|
{
|
|
init(strPath);
|
|
}
|
|
|
|
void CPathNavigator::init(const std::string &strPath)
|
|
{
|
|
Tokenizer tokenizer(strPath, "/");
|
|
|
|
_astrItems = tokenizer.split();
|
|
|
|
_bValid = checkPathFormat(strPath);
|
|
}
|
|
|
|
bool CPathNavigator::isPathValid() const
|
|
{
|
|
return _bValid;
|
|
}
|
|
|
|
// Navigate through
|
|
bool CPathNavigator::navigateThrough(const std::string &strItemName, std::string &strError)
|
|
{
|
|
if (!_bValid) {
|
|
|
|
strError = "Path not well formed: " + getCurrentPath();
|
|
|
|
return false;
|
|
}
|
|
|
|
std::string *pStrChildName = next();
|
|
|
|
if (!pStrChildName) {
|
|
|
|
strError =
|
|
"Path not complete: " + getCurrentPath() + ", trying to access to " + strItemName;
|
|
|
|
return false;
|
|
}
|
|
|
|
if (*pStrChildName != strItemName) {
|
|
|
|
strError = "Path not found: " + getCurrentPath() + ", expected: " + strItemName +
|
|
" but found: " + *pStrChildName;
|
|
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
std::string *CPathNavigator::next()
|
|
{
|
|
if (_currentIndex < _astrItems.size()) {
|
|
|
|
return &_astrItems[_currentIndex++];
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
std::string CPathNavigator::getCurrentPath() const
|
|
{
|
|
std::string strPath = "/";
|
|
|
|
if (!_currentIndex) {
|
|
|
|
return strPath;
|
|
}
|
|
|
|
size_t item;
|
|
for (item = 0; item < _currentIndex - 1; item++) {
|
|
|
|
strPath += _astrItems[item] + "/";
|
|
}
|
|
|
|
strPath += _astrItems[item];
|
|
|
|
return strPath;
|
|
}
|
|
|
|
bool CPathNavigator::checkPathFormat(const std::string &strUpl)
|
|
{
|
|
return strUpl[0] == '/';
|
|
}
|