GothenburgBitFactory/taskwarrior
1
0
Fork 0
mirror of https://github.com/GothenburgBitFactory/taskwarrior.git synced 2025-07-07 20:06:36 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

CLI2: Eliminate useless ::disqualifySugarFree

Browse source
This commit is contained in:
Paul Beckingham 2015-06-14 16:46:38 -04:00
parent 0aff903024
commit 9af18183c9
2 changed files with 0 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

20
src/CLI2.cpp
View file

@ -2497,26 +2497,6 @@ bool CLI2::disqualifyFirstLastBinary (
return firstBinary || lastBinary;
}
////////////////////////////////////////////////////////////////////////////////
// Disqualify terms when there are operators hidden by syntactic sugar.
// TODO This always returns false. Why bother?
bool CLI2::disqualifySugarFree (
const std::vector <std::pair <std::string, Lexer::Type>>& lexemes) const
{
bool sugared = true;
for (unsigned int i = 1; i < lexemes.size () - 1; ++i)
if (isTag (lexemes[i].first) ||
isUUIDList (lexemes[i].first) ||
isUUID (lexemes[i].first) ||
isIDSequence (lexemes[i].first) ||
isID (lexemes[i].first) ||
isPattern (lexemes[i].first) ||
isAttribute (lexemes[i].first))
sugared = true;
return ! sugared;
}
*/
////////////////////////////////////////////////////////////////////////////////

1
src/CLI2.h
View file

@ -154,7 +154,6 @@ private:
bool disqualifyNoOps (const std::vector <std::pair <std::string, Lexer::Type>>&) const;
bool disqualifyOnlyParenOps (const std::vector <std::pair <std::string, Lexer::Type>>&) const;
bool disqualifyFirstLastBinary (const std::vector <std::pair <std::string, Lexer::Type>>&) const;
bool disqualifySugarFree (const std::vector <std::pair <std::string, Lexer::Type>>&) const;
*/
public: