mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
79 lines
2.3 KiB
C++
79 lines
2.3 KiB
C++
/*
|
||
This file is part of solidity.
|
||
|
||
solidity is free software: you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation, either version 3 of the License, or
|
||
(at your option) any later version.
|
||
|
||
solidity is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with solidity. If not, see <http://www.gnu.org/licenses/>.
|
||
*/
|
||
/** @file StringUtils.h
|
||
* @author Balajiganapathi S <balajiganapathi.s@gmail.com>
|
||
* @date 2017
|
||
*
|
||
* String routines
|
||
*/
|
||
|
||
#pragma once
|
||
|
||
#include <string>
|
||
#include <vector>
|
||
|
||
namespace dev
|
||
{
|
||
|
||
// Calculates the Damerau–Levenshtein distance between _str1 and _str2 and returns true if that distance is not greater than _maxDistance
|
||
bool stringWithinDistance(std::string const& _str1, std::string const& _str2, size_t _maxDistance);
|
||
// Calculates the Damerau–Levenshtein distance between _str1 and _str2
|
||
size_t stringDistance(std::string const& _str1, std::string const& _str2);
|
||
// Return a string having elements of suggestions as quoted, alternative suggestions. e.g. "a", "b" or "c"
|
||
std::string quotedAlternativesList(std::vector<std::string> const& suggestions);
|
||
|
||
/// Joins collection of strings into one string with separators between, last separator can be different.
|
||
/// @param _list collection of strings to join
|
||
/// @param _separator defaults to ", "
|
||
/// @param _lastSeparator (optional) will be used to separate last two strings instead of _separator
|
||
/// @example join(vector<string>{"a", "b", "c"}, "; ", " or ") == "a; b or c"
|
||
template<class T>
|
||
std::string joinHumanReadable
|
||
(
|
||
T const& _list,
|
||
std::string const& _separator = ", ",
|
||
std::string const& _lastSeparator = ""
|
||
)
|
||
{
|
||
auto it = begin(_list);
|
||
auto itEnd = end(_list);
|
||
|
||
std::string result;
|
||
|
||
// append first string
|
||
if (it != itEnd)
|
||
{
|
||
result += *it;
|
||
++it;
|
||
}
|
||
|
||
for (;it != itEnd; ++it)
|
||
{
|
||
if ((next(it) == itEnd) && !_lastSeparator.empty())
|
||
result += _lastSeparator; // last iteration
|
||
else
|
||
result += _separator;
|
||
|
||
// append string
|
||
result += *it;
|
||
}
|
||
|
||
return result;
|
||
}
|
||
|
||
}
|