1
0
Fork 0
mirror of https://git.rwth-aachen.de/acs/public/villas/node/ synced 2025-03-23 00:00:01 +01:00
VILLASnode/common/lib/version.cpp

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

71 lines
1.8 KiB
C++
Raw Normal View History

2018-08-27 11:09:25 +02:00
/** Version.
*
* @author Steffen Vogel <github@daniel-krebs.net>
2020-01-20 17:15:25 +01:00
* @copyright 2014-2020, Institute for Automation of Complex Power Systems, EONERC
2018-08-27 11:09:25 +02:00
* @license GNU General Public License (version 3)
*
* VILLAScommon
*
* This program 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
* any later version.
*
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*********************************************************************************/
#include <stdexcept>
#include <string>
#include <villas/log.hpp>
#include <villas/utils.hpp>
#include <villas/version.hpp>
using namespace villas::utils;
Version::Version(const std::string &str)
{
size_t endpos;
auto comp = tokenize(str, ".");
if (comp.size() > 3)
throw std::invalid_argument("Not a valid version string");
2018-08-27 11:09:25 +02:00
for (unsigned i = 0; i < 3; i++) {
if (i < comp.size()) {
components[i] = std::stoi(comp[i], &endpos, 10);
if (comp[i].begin() + endpos != comp[i].end())
throw std::invalid_argument("Not a valid version string");
2018-08-27 11:09:25 +02:00
}
else
components[i] = 0;
}
}
Version::Version(int maj, int min, int pat) :
components{maj, min, pat}
{
}
int Version::cmp(const Version& lhs, const Version& rhs)
{
int d;
for (int i = 0; i < 3; i++) {
d = lhs.components[i] - rhs.components[i];
if (d)
return d;
}
return 0;
}