thijn/SqMod
1
0
Fork 0
mirror of https://github.com/VCMP-SqMod/SqMod.git synced 2025-01-19 12:07:13 +01:00
Code Releases Activity

Fix negation inf entity searching algorithms.

Browse Source
This commit is contained in:
Sandu Liviu Catalin 2016-06-21 17:56:58 +03:00
parent cb82a98bf6
commit 875ea33022
1 changed files with 34 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
source/Base/Algo.hpp
View File

@ -65,7 +65,14 @@ void EachBegins(Iterator first, Iterator last,
// Retrieve the string // Retrieve the string
const auto & s = retrieve(*first); const auto & s = retrieve(*first);
// Compare the string // Compare the string
if (s.size() >= len && (s.compare(0, len, str) == 0) == neg) if (s.size() >= len)
{
if ((s.compare(0, len, str) == 0) == neg)
{
collect(*first);
}
}
else if (!neg)
{ {
collect(*first); collect(*first);
} }
@ -90,7 +97,14 @@ void EachEnds(Iterator first, Iterator last,
// Retrieve the string // Retrieve the string
const auto & s = retrieve(*first); const auto & s = retrieve(*first);
// Compare the tag // Compare the tag
if (s.size() >= len && (s.compare(s.size() - len, len, str) == 0) == neg) if (s.size() >= len)
{
if ((s.compare(s.size() - len, len, str) == 0) == neg)
{
collect(*first);
}
}
else if (!neg)
{ {
collect(*first); collect(*first);
} }
@ -151,7 +165,15 @@ void FirstBegins(Iterator first, Iterator last,
// Retrieve the string // Retrieve the string
const auto & s = retrieve(*first); const auto & s = retrieve(*first);
// Compare the string // Compare the string
if (s.size() >= len && (s.compare(0, len, str) == 0) == neg) if (s.size() >= len)
{
if ((s.compare(0, len, str) == 0) == neg)
{
receive(*first);
break;
}
}
else if (!neg)
{ {
receive(*first); receive(*first);
break; break;
@ -177,7 +199,15 @@ void FirstEnds(Iterator first, Iterator last,
// Retrieve the string // Retrieve the string
const auto & s = retrieve(*first); const auto & s = retrieve(*first);
// Compare the string // Compare the string
if (s.size() >= len && (s.compare(s.size() - len, len, str) == 0) == neg) if (s.size() >= len)
{
if ((s.compare(s.size() - len, len, str) == 0) == neg)
{
receive(*first);
break;
}
}
else if (!neg)
{ {
receive(*first); receive(*first);
break; break;