mirror of
https://github.com/GothenburgBitFactory/taskwarrior.git
synced 2025-08-20 04:13:07 +02:00
CLI2: Remove unused ::disqualifyOnlyParenOps method
This commit is contained in:
parent
4b11ac2dae
commit
867910f7de
2 changed files with 0 additions and 56 deletions
53
src/CLI2.cpp
53
src/CLI2.cpp
|
@ -1721,59 +1721,6 @@ bool CLI2::isUUIDList (const std::string& raw) const
|
||||||
|
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
////////////////////////////////////////////////////////////////////////////////
|
|
||||||
bool CLI2::disqualifyOnlyParenOps (
|
|
||||||
const std::vector <std::pair <std::string, Lexer::Type>>& lexemes) const
|
|
||||||
{
|
|
||||||
int opCount = 0;
|
|
||||||
int opSugarCount = 0;
|
|
||||||
int opParenCount = 0;
|
|
||||||
|
|
||||||
for (auto& lexeme : lexemes)
|
|
||||||
{
|
|
||||||
if (lexeme.second == Lexer::Type::op)
|
|
||||||
{
|
|
||||||
++opCount;
|
|
||||||
|
|
||||||
if (lexeme.first == "(" ||
|
|
||||||
lexeme.first == ")")
|
|
||||||
++opParenCount;
|
|
||||||
}
|
|
||||||
|
|
||||||
else if (isTag (lexeme.first) || // obsolete
|
|
||||||
isUUIDList (lexeme.first) ||
|
|
||||||
isUUID (lexeme.first) || // obsolete
|
|
||||||
isIDSequence (lexeme.first) || // obsolete
|
|
||||||
isID (lexeme.first) || // obsolete
|
|
||||||
isPattern (lexeme.first) || // obsolete
|
|
||||||
isAttribute (lexeme.first)) // obsolete
|
|
||||||
++opSugarCount;
|
|
||||||
}
|
|
||||||
|
|
||||||
return opCount == opParenCount && ! opSugarCount;
|
|
||||||
}
|
|
||||||
|
|
||||||
////////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Disqualify terms when there are are binary operators at either end, as long
|
|
||||||
// as there are no operators in between, which includes syntactic sugar that
|
|
||||||
// hides operators.
|
|
||||||
bool CLI2::disqualifyFirstLastBinary (
|
|
||||||
const std::vector <std::pair <std::string, Lexer::Type>>& lexemes) const
|
|
||||||
{
|
|
||||||
bool firstBinary = false;
|
|
||||||
bool lastBinary = false;
|
|
||||||
|
|
||||||
std::string dummy;
|
|
||||||
if (canonicalize (dummy, "binary_operator", lexemes[0].first))
|
|
||||||
firstBinary = true;
|
|
||||||
|
|
||||||
if (lexemes.size () > 1 &&
|
|
||||||
canonicalize (dummy, "binary_operator", lexemes[lexemes.size () - 1].first))
|
|
||||||
lastBinary = true;
|
|
||||||
|
|
||||||
return firstBinary || lastBinary;
|
|
||||||
}
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
////////////////////////////////////////////////////////////////////////////////
|
////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
|
@ -120,9 +120,6 @@ private:
|
||||||
|
|
||||||
/*
|
/*
|
||||||
bool isUUIDList (const std::string&) const;
|
bool isUUIDList (const std::string&) const;
|
||||||
|
|
||||||
// These methods come up iwht reasons not to Lex a token. Probably no longer needed.
|
|
||||||
bool disqualifyFirstLastBinary (const std::vector <std::pair <std::string, Lexer::Type>>&) const;
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue