sneedmc/logic/Version.cpp

#include "Version.h"

#include <QStringList>
#include <QUrl>
#include <QRegularExpression>
#include <QRegularExpressionMatch>

Version::Version(const QString &str) : m_string(str)
{
	parse();
}

bool Version::operator<(const Version &other) const
{
	const int size = qMax(m_sections.size(), other.m_sections.size());
	for (int i = 0; i < size; ++i)
	{
		const Section sec1 = (i >= m_sections.size()) ? Section("0") : m_sections.at(i);
		const Section sec2 =
			(i >= other.m_sections.size()) ? Section("0") : other.m_sections.at(i);
		if (sec1 != sec2)
		{
			return sec1 < sec2;
		}
	}

	return false;
}
bool Version::operator<=(const Version &other) const
{
	return *this < other || *this == other;
}
bool Version::operator>(const Version &other) const
{
	const int size = qMax(m_sections.size(), other.m_sections.size());
	for (int i = 0; i < size; ++i)
	{
		const Section sec1 = (i >= m_sections.size()) ? Section("0") : m_sections.at(i);
		const Section sec2 =
			(i >= other.m_sections.size()) ? Section("0") : other.m_sections.at(i);
		if (sec1 != sec2)
		{
			return sec1 > sec2;
		}
	}

	return false;
}
bool Version::operator>=(const Version &other) const
{
	return *this > other || *this == other;
}
bool Version::operator==(const Version &other) const
{
	const int size = qMax(m_sections.size(), other.m_sections.size());
	for (int i = 0; i < size; ++i)
	{
		const Section sec1 = (i >= m_sections.size()) ? Section("0") : m_sections.at(i);
		const Section sec2 =
			(i >= other.m_sections.size()) ? Section("0") : other.m_sections.at(i);
		if (sec1 != sec2)
		{
			return false;
		}
	}

	return true;
}
bool Version::operator!=(const Version &other) const
{
	return !operator==(other);
}

void Version::parse()
{
	m_sections.clear();

	QStringList parts = m_string.split('.');

	for (const auto part : parts)
	{
		m_sections.append(Section(part));
	}
}

bool versionIsInInterval(const QString &version, const QString &interval)
{
	return versionIsInInterval(Version(version), interval);
}
bool versionIsInInterval(const Version &version, const QString &interval)
{
	if (interval.isEmpty() || version.toString() == interval)
	{
		return true;
	}

	// Interval notation is used
	QRegularExpression exp(
		"(?<start>[\\[\\]\\(\\)])(?<bottom>.*?)(,(?<top>.*?))?(?<end>[\\[\\]\\(\\)]),?");
	QRegularExpressionMatch match = exp.match(interval);
	if (match.hasMatch())
	{
		const QChar start = match.captured("start").at(0);
		const QChar end = match.captured("end").at(0);
		const QString bottom = match.captured("bottom");
		const QString top = match.captured("top");

		// check if in range (bottom)
		if (!bottom.isEmpty())
		{
			const auto bottomVersion = Version(bottom);
			if ((start == '[') && !(version >= bottomVersion))
			{
				return false;
			}
			else if ((start == '(') && !(version > bottomVersion))
			{
				return false;
			}
		}

		// check if in range (top)
		if (!top.isEmpty())
		{
			const auto topVersion = Version(top);
			if ((end == ']') && !(version <= topVersion))
			{
				return false;
			}
			else if ((end == ')') && !(version < topVersion))
			{
				return false;
			}
		}

		return true;
	}

	return false;
}