12343201393

Committed 15 Dec 2024 11:30PM UTC coverage: 84.419% (-1.1%) from 85.522%

Build # 12343201393

Build Type

Pull #3724

github

Committed by

web-flow

Commit Message

Merge 532931b9f into ddae5c4ba

Pull Request Pull Request #3724: Support importing Taskwarrior v2.x data files

Run Details

15 of 145 new or added lines in 4 files covered. (10.34%)

183 existing lines in 48 files now uncovered.

19289 of 22849 relevant lines covered (84.42%)

23168.82 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

90.24

/src/Lexer.cpp

////////////////////////////////////////////////////////////////////////////////
//
// Copyright 2013 - 2021, Tomas Babej, Paul Beckingham, Federico Hernandez.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
// https://www.opensource.org/licenses/mit-license.php
//
////////////////////////////////////////////////////////////////////////////////

#include <cmake.h>
// cmake.h include header must come first

#include <Datetime.h>
#include <Duration.h>
#include <Lexer.h>
#include <ctype.h>
#include <unicode.h>
#include <utf8.h>

#include <algorithm>

static const std::string uuid_pattern = "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx";
static const unsigned int uuid_min_length = 8;

std::string Lexer::dateFormat = "";
std::string::size_type Lexer::minimumMatchLength = 3;
std::map<std::string, std::string> Lexer::attributes;

////////////////////////////////////////////////////////////////////////////////
Lexer::Lexer(const std::string& text) : _text(text), _cursor(0), _eos(text.size()) {}

////////////////////////////////////////////////////////////////////////////////
// When a Lexer object is constructed with a string, this method walks through
// the stream of low-level tokens.
bool Lexer::token(std::string& token, Lexer::Type& type) {
  // Eat white space.
  while (unicodeWhitespace(_text[_cursor])) utf8_next_char(_text, _cursor);

  // Terminate at EOS.
  if (isEOS()) return false;

  // The sequence is specific, and must follow these rules:
  //   - date < duration < uuid < identifier
  //   - dom < uuid
  //   - uuid < hex < number
  //   - url < pair < identifier
  //   - hex < number
  //   - separator < tag < operator
  //   - path < substitution < pattern
  //   - set < number
  //   - word last
  if (isString(token, type, "'\"") || isDate(token, type) || isDuration(token, type) ||
      isURL(token, type) || isPair(token, type) || isUUID(token, type, true) ||
      isSet(token, type) || isDOM(token, type) || isHexNumber(token, type) ||
      isNumber(token, type) || isSeparator(token, type) || isTag(token, type) ||
      isPath(token, type) || isSubstitution(token, type) || isPattern(token, type) ||
      isOperator(token, type) || isIdentifier(token, type) || isWord(token, type))
    return true;

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// This static method tokenizes the input, but discards the type information.
std::vector<std::string> Lexer::split(const std::string& text) {
  std::vector<std::string> all;
  std::string token;
  Lexer::Type ignored;
  Lexer l(text);
  while (l.token(token, ignored)) all.push_back(token);

  return all;
}

////////////////////////////////////////////////////////////////////////////////
// No L10N - these are for internal purposes.
const std::string Lexer::typeName(const Lexer::Type& type) {
  switch (type) {
    case Lexer::Type::uuid:
      return "uuid";
    case Lexer::Type::number:
      return "number";
    case Lexer::Type::hex:
      return "hex";
    case Lexer::Type::string:
      return "string";
    case Lexer::Type::url:
      return "url";
    case Lexer::Type::pair:
      return "pair";
    case Lexer::Type::set:
      return "set";
    case Lexer::Type::separator:
      return "separator";
    case Lexer::Type::tag:
      return "tag";
    case Lexer::Type::path:
      return "path";
    case Lexer::Type::substitution:
      return "substitution";
    case Lexer::Type::pattern:
      return "pattern";
    case Lexer::Type::op:
      return "op";
    case Lexer::Type::dom:
      return "dom";
    case Lexer::Type::identifier:
      return "identifier";
    case Lexer::Type::word:
      return "word";
    case Lexer::Type::date:
      return "date";
    case Lexer::Type::duration:
      return "duration";
  }

  return "unknown";
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isIdentifierStart(int c) {
  return c &&  // Include null character check.
         !unicodeWhitespace(c) && !unicodeLatinDigit(c) && !isSingleCharOperator(c) &&
         !isPunctuation(c);
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isIdentifierNext(int c) {
  return c &&         // Include null character check.
         c != ':' &&  // Used in isPair.
         c != '=' &&  // Used in isPair.
         !unicodeWhitespace(c) && !isSingleCharOperator(c);
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isSingleCharOperator(int c) {
  return c == '+' ||  // Addition
         c == '-' ||  // Subtraction or unary minus = ambiguous
         c == '*' ||  // Multiplication
         c == '/' ||  // Diviѕion
         c == '(' ||  // Precedence open parenthesis
         c == ')' ||  // Precedence close parenthesis
         c == '<' ||  // Less than
         c == '>' ||  // Greater than
         c == '^' ||  // Exponent
         c == '!' ||  // Unary not
         c == '%' ||  // Modulus
         c == '=' ||  // Partial match
         c == '~';    // Pattern match
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isDoubleCharOperator(int c0, int c1, int c2) {
  return (c0 == '=' && c1 == '=') || (c0 == '!' && c1 == '=') || (c0 == '<' && c1 == '=') ||
         (c0 == '>' && c1 == '=') || (c0 == 'o' && c1 == 'r' && isBoundary(c1, c2)) ||
         (c0 == '|' && c1 == '|') || (c0 == '&' && c1 == '&') || (c0 == '!' && c1 == '~');
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isTripleCharOperator(int c0, int c1, int c2, int c3) {
  return (c0 == 'a' && c1 == 'n' && c2 == 'd' && isBoundary(c2, c3)) ||
         (c0 == 'x' && c1 == 'o' && c2 == 'r' && isBoundary(c2, c3)) ||
         (c0 == '!' && c1 == '=' && c2 == '=');
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isBoundary(int left, int right) {
  // EOS
  if (right == '\0') return true;

  // XOR
  if (unicodeLatinAlpha(left) != unicodeLatinAlpha(right)) return true;
  if (unicodeLatinDigit(left) != unicodeLatinDigit(right)) return true;
  if (unicodeWhitespace(left) != unicodeWhitespace(right)) return true;

  // OR
  if (isPunctuation(left) || isPunctuation(right)) return true;

  return false;
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isHardBoundary(int left, int right) {
  // EOS
  if (right == '\0') return true;

  // FILTER operators that don't need to be surrounded by whitespace.
  if (left == '(' || left == ')' || right == '(' || right == ')') return true;

  return false;
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isPunctuation(int c) {
  return isprint(c) && c != ' ' && c != '@' && c != '#' && c != '$' && c != '_' &&
         !unicodeLatinDigit(c) && !unicodeLatinAlpha(c);
}

////////////////////////////////////////////////////////////////////////////////
// Assumes that quotes is a string containing a non-trivial set of quote
// characters.
void Lexer::dequote(std::string& input, const std::string& quotes) {
  int quote = input[0];
  if (quotes.find(quote) != std::string::npos) {
    size_t len = input.length();
    if (quote == input[len - 1]) input = input.substr(1, len - 2);
  }
}

////////////////////////////////////////////////////////////////////////////////
// Detects characters in an input string that indicate quotes were required, or
// escapes, to get them past the shell.
bool Lexer::wasQuoted(const std::string& input) {
  if (input.find_first_of(" \t()<>&~") != std::string::npos) return true;

  return false;
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isEOS() const { return _cursor >= _eos; }

////////////////////////////////////////////////////////////////////////////////
// Converts '0'     -> 0
//          '9'     -> 9
//          'a'/'A' -> 10
//          'f'/'F' -> 15
int Lexer::hexToInt(int c) {
  if (c >= '0' && c <= '9')
    return (c - '0');
  else if (c >= 'a' && c <= 'f')
    return (c - 'a' + 10);
  else
    return (c - 'A' + 10);
}

////////////////////////////////////////////////////////////////////////////////
int Lexer::hexToInt(int c0, int c1) { return (hexToInt(c0) << 4) + hexToInt(c1); }

////////////////////////////////////////////////////////////////////////////////
int Lexer::hexToInt(int c0, int c1, int c2, int c3) {
  return (hexToInt(c0) << 12) + (hexToInt(c1) << 8) + (hexToInt(c2) << 4) + hexToInt(c3);
}

////////////////////////////////////////////////////////////////////////////////
// Compares two strings, and returns the number bytes in common.
//
// left:   wonderful
// right:  wonderbread
// returns:     ^ 6
std::string::size_type Lexer::commonLength(const std::string& left, const std::string& right) {
  std::string::size_type l = 0;
  std::string::size_type r = 0;
  while (left[l] == right[r] && utf8_next_char(left, l) && utf8_next_char(right, r));

  return l;
}

////////////////////////////////////////////////////////////////////////////////
// Compares two strings with offsets, and returns the number bytes in common.
//
// left:   wonderful
// l:      ^
// right:  prowonderbread
// r:         ^
// returns:        ^ 6
std::string::size_type Lexer::commonLength(const std::string& left, std::string::size_type l,
                                           const std::string& right, std::string::size_type r) {
  while (left[l] == right[r] && utf8_next_char(left, l) && utf8_next_char(right, r));

  return l;
}

////////////////////////////////////////////////////////////////////////////////
std::string Lexer::commify(const std::string& data) {
  // First scan for decimal point and end of digits.
  int decimalPoint = -1;
  int end = -1;

  int i;
  for (int i = 0; i < (int)data.length(); ++i) {
    if (unicodeLatinDigit(data[i])) end = i;

    if (data[i] == '.') decimalPoint = i;
  }

  std::string result;
  if (decimalPoint != -1) {
    // In reverse order, transfer all digits up to, and including the decimal
    // point.
    for (i = (int)data.length() - 1; i >= decimalPoint; --i) result += data[i];

    int consecutiveDigits = 0;
    for (; i >= 0; --i) {
      if (unicodeLatinDigit(data[i])) {
        result += data[i];

        if (++consecutiveDigits == 3 && i && unicodeLatinDigit(data[i - 1])) {
          result += ',';
          consecutiveDigits = 0;
        }
      } else
        result += data[i];
    }
  } else {
    // In reverse order, transfer all digits up to, but not including the last
    // digit.
    for (i = (int)data.length() - 1; i > end; --i) result += data[i];

    int consecutiveDigits = 0;
    for (; i >= 0; --i) {
      if (unicodeLatinDigit(data[i])) {
        result += data[i];

        if (++consecutiveDigits == 3 && i && unicodeLatinDigit(data[i - 1])) {
          result += ',';
          consecutiveDigits = 0;
        }
      } else
        result += data[i];
    }
  }

  // reverse result into data.
  std::string done;
  for (int i = (int)result.length() - 1; i >= 0; --i) done += result[i];

  return done;
}

////////////////////////////////////////////////////////////////////////////////
std::string Lexer::lowerCase(const std::string& input) {
  std::string output = input;
  std::transform(output.begin(), output.end(), output.begin(), tolower);
  return output;
}

////////////////////////////////////////////////////////////////////////////////
std::string Lexer::ucFirst(const std::string& input) {
  std::string output = input;

  if (output.length() > 0) output[0] = toupper(output[0]);

  return output;
}

////////////////////////////////////////////////////////////////////////////////
std::string Lexer::trimLeft(const std::string& in, const std::string& t /*= " "*/) {
  std::string::size_type ws = in.find_first_not_of(t);
  if (ws > 0) {
    std::string out{in};
    return out.erase(0, ws);
  }

  return in;
}

////////////////////////////////////////////////////////////////////////////////
std::string Lexer::trimRight(const std::string& in, const std::string& t /*= " "*/) {
  std::string out{in};
  return out.erase(in.find_last_not_of(t) + 1);
}

////////////////////////////////////////////////////////////////////////////////
std::string Lexer::trim(const std::string& in, const std::string& t /*= " "*/) {
  return trimLeft(trimRight(in, t), t);
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::string
//   '|"
//   [ U+XXXX | \uXXXX | \" | \' | \\ | \/ | \b | \f | \n | \r | \t | . ]
//   '|"
bool Lexer::isString(std::string& token, Lexer::Type& type, const std::string& quotes) {
  std::size_t marker = _cursor;
  if (readWord(_text, quotes, marker, token)) {
    type = Lexer::Type::string;
    _cursor = marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::date
//   <Datetime>
bool Lexer::isDate(std::string& token, Lexer::Type& type) {
  // Try an ISO date parse.
  std::size_t iso_i = 0;
  Datetime iso;
  if (iso.parse(_text.substr(_cursor), iso_i, Lexer::dateFormat)) {
    type = Lexer::Type::date;
    token = _text.substr(_cursor, iso_i);
    _cursor += iso_i;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::duration
//   <Duration>
bool Lexer::isDuration(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  std::string extractedToken;
  Lexer::Type extractedType;
  if (isOperator(extractedToken, extractedType)) {
    _cursor = marker;
    return false;
  }

  marker = 0;
  Duration iso;
  if (iso.parse(_text.substr(_cursor), marker)) {
    type = Lexer::Type::duration;
    token = _text.substr(_cursor, marker);
    _cursor += marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::uuid
//   XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX
//   XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXX
//   XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXX
//   XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXX
//   ...
//   XXXXXXXX-XX
//   XXXXXXXX-X
//   XXXXXXXX-
//   XXXXXXXX
//   Followed only by EOS, whitespace, or single character operator.
bool Lexer::isUUID(std::string& token, Lexer::Type& type, bool endBoundary) {
  std::size_t marker = _cursor;

  // Greedy.
  std::size_t i = 0;
  for (; i < 36 && marker + i < _eos; i++) {
    if (uuid_pattern[i] == 'x') {
      if (!unicodeHexDigit(_text[marker + i])) break;
    } else if (uuid_pattern[i] != _text[marker + i])
      break;
  }

  if (i >= uuid_min_length &&
      (!endBoundary || !_text[marker + i] || unicodeWhitespace(_text[marker + i]) ||
       isSingleCharOperator(_text[marker + i]))) {
    token = _text.substr(_cursor, i);
    type = Lexer::Type::uuid;
    _cursor += i;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::hex
//   0xX+
bool Lexer::isHexNumber(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  if (_eos - marker >= 3 && _text[marker + 0] == '0' && _text[marker + 1] == 'x') {
    marker += 2;

    while (unicodeHexDigit(_text[marker])) ++marker;

    if (marker - _cursor > 2) {
      token = _text.substr(_cursor, marker - _cursor);
      type = Lexer::Type::hex;
      _cursor = marker;
      return true;
    }
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::number
//   0
//   [1-9]\d*
//   [ . \d+ ]
//   [ e|E [ +|- ] \d+ [ . \d+ ] ]
//   not followed by non-operator.
bool Lexer::isNumber(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  bool leading_zero = (_text[marker] == '0');

  if (unicodeLatinDigit(_text[marker])) {
    ++marker;

    // Two (or more) digit number with a leading zero are not allowed
    if (leading_zero && unicodeLatinDigit(_text[marker])) return false;

    while (unicodeLatinDigit(_text[marker])) utf8_next_char(_text, marker);

    if (_text[marker] == '.') {
      ++marker;
      if (unicodeLatinDigit(_text[marker])) {
        ++marker;
        while (unicodeLatinDigit(_text[marker])) utf8_next_char(_text, marker);
      }
    }

    if (_text[marker] == 'e' || _text[marker] == 'E') {
      ++marker;

      if (_text[marker] == '+' || _text[marker] == '-') ++marker;

      if (unicodeLatinDigit(_text[marker])) {
        ++marker;
        while (unicodeLatinDigit(_text[marker])) utf8_next_char(_text, marker);

        if (_text[marker] == '.') {
          ++marker;
          if (unicodeLatinDigit(_text[marker])) {
            ++marker;
            while (unicodeLatinDigit(_text[marker])) utf8_next_char(_text, marker);
          }
        }
      }
    }

    // Lookahead: !<unicodeWhitespace> | !<isSingleCharOperator>
    // If there is an immediately consecutive character, that is not an operator, fail.
    if (_eos > marker && !unicodeWhitespace(_text[marker]) && !isSingleCharOperator(_text[marker]))
      return false;

    token = _text.substr(_cursor, marker - _cursor);
    type = Lexer::Type::number;
    _cursor = marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::number
//   0
//   [1-9]\d*
//   Integers do not start with a leading 0, unless they are zero.
bool Lexer::isInteger(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  bool leading_zero = (_text[marker] == '0');

  if (unicodeLatinDigit(_text[marker])) {
    ++marker;
    while (unicodeLatinDigit(_text[marker])) utf8_next_char(_text, marker);

    // Leading zero is only allowed in the case of number 0
    if (leading_zero and marker - _cursor > 1) return false;

    token = _text.substr(_cursor, marker - _cursor);
    type = Lexer::Type::number;
    _cursor = marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::separator
//   --
bool Lexer::isSeparator(std::string& token, Lexer::Type& type) {
  if (_eos - _cursor >= 2 && _text[_cursor] == '-' && _text[_cursor + 1] == '-') {
    _cursor += 2;
    type = Lexer::Type::separator;
    token = "--";
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::url
//   http [s] :// ...
bool Lexer::isURL(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  if (_eos - _cursor > 9 &&  // length 'https://*'
      (_text[marker + 0] == 'h' || _text[marker + 0] == 'H') &&
      (_text[marker + 1] == 't' || _text[marker + 1] == 'T') &&
      (_text[marker + 2] == 't' || _text[marker + 2] == 'T') &&
      (_text[marker + 3] == 'p' || _text[marker + 3] == 'P')) {
    marker += 4;
    if (_text[marker + 0] == 's' || _text[marker + 0] == 'S') ++marker;

    if (_text[marker + 0] == ':' && _text[marker + 1] == '/' && _text[marker + 2] == '/') {
      marker += 3;

      while (marker < _eos && !unicodeWhitespace(_text[marker])) utf8_next_char(_text, marker);

      token = _text.substr(_cursor, marker - _cursor);
      type = Lexer::Type::url;
      _cursor = marker;
      return true;
    }
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::pair
//   <identifier> <separator> [ <string> | <word> ]
//   separator '::' | ':=' | ':' | '='
bool Lexer::isPair(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  std::string ignoredToken;
  Lexer::Type ignoredType;
  if (isIdentifier(ignoredToken, ignoredType)) {
    // Look for a valid separator.
    std::string separator = _text.substr(_cursor, 2);
    if (separator == "::" || separator == ":=")
      _cursor += 2;
    else if (separator[0] == ':' || separator[0] == '=')
      _cursor++;
    else {
      _cursor = marker;
      return false;
    }

    // String, word or nothing are all valid.
    if (readWord(_text, "'\"", _cursor, ignoredToken) || readWord(_text, _cursor, ignoredToken) ||
        isEOS() || unicodeWhitespace(_text[_cursor])) {
      token = _text.substr(marker, _cursor - marker);
      type = Lexer::Type::pair;
      return true;
    }
  }

  _cursor = marker;
  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::set
//   a single number:      1
//   a list of numbers:    1,3,5
//   a range:              5-10
//   or a combination:     1,3,5-10
//
//   <id> [ - <id> ] [ , <id> [ - <id> ] ] ...
bool Lexer::isSet(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;
  int count = 0;
  std::string dummyToken;
  Lexer::Type dummyType;

  do {
    if (isInteger(dummyToken, dummyType)) {
      ++count;
      if (isLiteral("-", false, false)) {
        if (isInteger(dummyToken, dummyType))
          ++count;
        else {
          _cursor = marker;
          return false;
        }
      }
    } else {
      _cursor = marker;
      return false;
    }
  } while (isLiteral(",", false, false));

  // Success is multiple numbers, matching the pattern.
  if (count > 1 && (isEOS() || unicodeWhitespace(_text[_cursor]) ||
                    isHardBoundary(_text[_cursor], _text[_cursor + 1]))) {
    token = _text.substr(marker, _cursor - marker);
    type = Lexer::Type::set;
    return true;
  }

  _cursor = marker;
  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::tag
//   ^ | '(' | ')' | <unicodeWhitespace>
//     [ +|- ] <isIdentifierStart> [ <isIdentifierNext> ]*
bool Lexer::isTag(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  // Lookbehind: Assert ^ or preceded by whitespace, (, or ).
  if (marker > 0 && !unicodeWhitespace(_text[marker - 1]) && _text[marker - 1] != '(' &&
      _text[marker - 1] != ')')
    return false;

  if (_text[marker] == '+' || _text[marker] == '-') {
    ++marker;

    if (isIdentifierStart(_text[marker])) {
      utf8_next_char(_text, marker);

      while (isIdentifierNext(_text[marker])) utf8_next_char(_text, marker);

      token = _text.substr(_cursor, marker - _cursor);
      type = Lexer::Type::tag;
      _cursor = marker;
      return true;
    }
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::path
//   ( / <non-slash, non-whitespace> )+
bool Lexer::isPath(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;
  int slashCount = 0;

  while (true) {
    if (_text[marker] == '/') {
      ++marker;
      ++slashCount;
    } else
      break;

    if (_text[marker] && !unicodeWhitespace(_text[marker]) && _text[marker] != '/') {
      utf8_next_char(_text, marker);
      while (_text[marker] && !unicodeWhitespace(_text[marker]) && _text[marker] != '/')
        utf8_next_char(_text, marker);
    } else
      break;
  }

  if (marker > _cursor && slashCount > 3) {
    type = Lexer::Type::path;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::substitution
//   / <unquoted-string> / <unquoted-string> / [g]  <EOS> | <unicodeWhitespace>
bool Lexer::isSubstitution(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  std::string word;
  if (readWord(_text, "/", _cursor, word)) {
    --_cursor;  // Step backwards over the '/'.

    if (readWord(_text, "/", _cursor, word)) {
      if (_text[_cursor] == 'g') ++_cursor;

      // Lookahread: <EOS> | <unicodeWhitespace>
      if (_text[_cursor] == '\0' || unicodeWhitespace(_text[_cursor])) {
        token = _text.substr(marker, _cursor - marker);
        type = Lexer::Type::substitution;
        return true;
      }
    }
  }

  _cursor = marker;
  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::pattern
//   / <unquoted-string> /  <EOS> | <unicodeWhitespace>
bool Lexer::isPattern(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  std::string word;
  if (readWord(_text, "/", _cursor, word) && (isEOS() || unicodeWhitespace(_text[_cursor]))) {
    token = _text.substr(marker, _cursor - marker);
    type = Lexer::Type::pattern;
    return true;
  }

  _cursor = marker;
  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::op
//   _hastag_ | _notag | _neg_ | _pos_ |
//   <isTripleCharOperator> |
//   <isDoubleCharOperator> |
//   <isSingleCharOperator> |
bool Lexer::isOperator(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  if (_eos - marker >= 8 && _text.substr(marker, 8) == "_hastag_") {
    marker += 8;
    type = Lexer::Type::op;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  else if (_eos - marker >= 7 && _text.substr(marker, 7) == "_notag_") {
    marker += 7;
    type = Lexer::Type::op;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  else if (_eos - marker >= 5 && _text.substr(marker, 5) == "_neg_") {
    marker += 5;
    type = Lexer::Type::op;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  else if (_eos - marker >= 5 && _text.substr(marker, 5) == "_pos_") {
    marker += 5;
    type = Lexer::Type::op;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  else if (_eos - marker >= 3 && isTripleCharOperator(_text[marker], _text[marker + 1],
                                                      _text[marker + 2], _text[marker + 3])) {
    marker += 3;
    type = Lexer::Type::op;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  else if (_eos - marker >= 2 &&
           isDoubleCharOperator(_text[marker], _text[marker + 1], _text[marker + 2])) {
    marker += 2;
    type = Lexer::Type::op;
    token = _text.substr(_cursor, marker - _cursor);
    _cursor = marker;
    return true;
  }

  else if (isSingleCharOperator(_text[marker])) {
    token = _text[marker];
    type = Lexer::Type::op;
    _cursor = ++marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::dom
//   [ <isUUID> | <isDigit>+ . ] <isIdentifier> [ . <isIdentifier> ]*
//
// Configuration:
//   rc.<name>
//
// System:
//   tw.syncneeded
//   tw.program
//   tw.args
//   tw.width
//   tw.height
//   context.program      // 2017-02-25 Deprecated in 2.6.0
//   context.args         // 2017-02-25 Deprecated in 2.6.0
//   context.width        // 2017-02-25 Deprecated in 2.6.0
//   context.height       // 2017-02-25 Deprecated in 2.6.0
//   system.version
//   system.os
//
// Relative or absolute attribute:
//   <attribute>
//   <id>.<attribute>
//   <uuid>.<attribute>
//
// Single tag:
//   tags.<word>
//
// Date type:
//   <date>.year
//   <date>.month
//   <date>.day
//   <date>.week
//   <date>.weekday
//   <date>.julian
//   <date>.hour
//   <date>.minute
//   <date>.second
//
// Annotations (entry is a date):
//   annotations.count
//   annotations.<N>.entry
//   annotations.<N>.description
//
bool Lexer::isDOM(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  // rc. ...
  std::string partialToken;
  Lexer::Type partialType;
  if (isLiteral("rc.", false, false) && isWord(partialToken, partialType)) {
    token = _text.substr(marker, _cursor - marker);
    type = Lexer::Type::dom;
    return true;
  } else
    _cursor = marker;

  // Literals
  if (isOneOf({"tw.syncneeded", "tw.program", "tw.args", "tw.width", "tw.height", "tw.version",
               "context.program", "context.args", "context.width", "context.height",
               "system.version", "system.os"},
              false, true)) {
    token = _text.substr(marker, _cursor - marker);
    type = Lexer::Type::dom;
    return true;
  }

  // Optional:
  //   <uuid>.
  //   <id>.
  std::string extractedToken;
  Lexer::Type extractedType;
  if (isUUID(extractedToken, extractedType, false) || isInteger(extractedToken, extractedType)) {
    if (!isLiteral(".", false, false)) {
      _cursor = marker;
      return false;
    }
  }

  // Any failure after this line should rollback to the checkpoint.
  std::size_t checkpoint = _cursor;

  // [prefix]tags.<word>
  if (isLiteral("tags", false, false) && isLiteral(".", false, false) &&
      isWord(partialToken, partialType)) {
    token = _text.substr(marker, _cursor - marker);
    type = Lexer::Type::dom;
    return true;
  } else
    _cursor = checkpoint;

  // [prefix]attribute (bounded)
  if (isOneOf(attributes, false, true)) {
    token = _text.substr(marker, _cursor - marker);
    type = Lexer::Type::dom;
    return true;
  }

  // [prefix]attribute. (unbounded)
  if (isOneOf(attributes, false, false)) {
    if (isLiteral(".", false, false)) {
      std::string attribute = _text.substr(checkpoint, _cursor - checkpoint - 1);

      // if attribute type is 'date', then it has sub-elements.
      if (attributes[attribute] == "date" &&
          isOneOf({"year", "month", "day", "week", "weekday", "julian", "hour", "minute", "second"},
                  false, true)) {
        token = _text.substr(marker, _cursor - marker);
        type = Lexer::Type::dom;
        return true;
      }

      _cursor = checkpoint;
    }

    // Lookahead: !<alpha>
    else if (!unicodeLatinAlpha(_text[marker])) {
      token = _text.substr(marker, _cursor - marker);
      type = Lexer::Type::dom;
      return true;
    }

    _cursor = checkpoint;
  }

  // [prefix]annotations.
  if (isLiteral("annotations", true, false) && isLiteral(".", false, false)) {
    if (isLiteral("count", false, false)) {
      token = _text.substr(marker, _cursor - marker);
      type = Lexer::Type::dom;
      return true;
    }

    std::string extractedToken;
    Lexer::Type extractedType;
    if (isInteger(extractedToken, extractedType)) {
      if (isLiteral(".", false, false)) {
        if (isLiteral("description", false, true)) {
          token = _text.substr(marker, _cursor - marker);
          type = Lexer::Type::dom;
          return true;
        } else if (isLiteral("entry", false, true)) {
          token = _text.substr(marker, _cursor - marker);
          type = Lexer::Type::dom;
          return true;
        } else if (isLiteral("entry", false, false) && isLiteral(".", false, false) &&
                   isOneOf({"year", "month", "day", "week", "weekday", "julian", "hour", "minute",
                            "second"},
                           false, true)) {
          token = _text.substr(marker, _cursor - marker);
          type = Lexer::Type::dom;
          return true;
        }
      }
    } else
      _cursor = checkpoint;
  }

  _cursor = marker;
  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::identifier
//   <isIdentifierStart> [ <isIdentifierNext> ]*
bool Lexer::isIdentifier(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  if (isIdentifierStart(_text[marker])) {
    utf8_next_char(_text, marker);

    while (isIdentifierNext(_text[marker])) utf8_next_char(_text, marker);

    token = _text.substr(_cursor, marker - _cursor);
    type = Lexer::Type::identifier;
    _cursor = marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Lexer::Type::word
//   [^\s]+
bool Lexer::isWord(std::string& token, Lexer::Type& type) {
  std::size_t marker = _cursor;

  while (_text[marker] && !unicodeWhitespace(_text[marker]) && !isSingleCharOperator(_text[marker]))
    utf8_next_char(_text, marker);

  if (marker > _cursor) {
    token = _text.substr(_cursor, marker - _cursor);
    type = Lexer::Type::word;
    _cursor = marker;
    return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isLiteral(const std::string& literal, bool allowAbbreviations, bool endBoundary) {
  auto common = commonLength(literal, 0, _text, _cursor);

  // Without abbreviations, common must equal literal length.
  if (!allowAbbreviations && common < literal.length()) return false;

  // Abbreviations must meet the minimum size.
  if (allowAbbreviations && common < minimumMatchLength) return false;

  // End boundary conditions must be met.
  if (endBoundary && _text[_cursor + common] && !unicodeWhitespace(_text[_cursor + common]) &&
      !Lexer::isSingleCharOperator(_text[_cursor + common]))
    return false;

  _cursor += common;
  return true;
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isOneOf(const std::vector<std::string>& options, bool allowAbbreviations,
                    bool endBoundary) {
  for (auto& item : options)
    if (isLiteral(item, allowAbbreviations, endBoundary)) return true;

  return false;
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isOneOf(const std::map<std::string, std::string>& options, bool allowAbbreviations,
                    bool endBoundary) {
  for (auto& item : options)
    if (isLiteral(item.first, allowAbbreviations, endBoundary)) return true;

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// Static
std::string Lexer::typeToString(Lexer::Type type) {
  if (type == Lexer::Type::string)
    return std::string("\033[38;5;7m\033[48;5;3m") + "string" + "\033[0m";
  else if (type == Lexer::Type::uuid)
    return std::string("\033[38;5;7m\033[48;5;10m") + "uuid" + "\033[0m";
  else if (type == Lexer::Type::hex)
    return std::string("\033[38;5;7m\033[48;5;14m") + "hex" + "\033[0m";
  else if (type == Lexer::Type::number)
    return std::string("\033[38;5;7m\033[48;5;6m") + "number" + "\033[0m";
  else if (type == Lexer::Type::separator)
    return std::string("\033[38;5;7m\033[48;5;4m") + "separator" + "\033[0m";
  else if (type == Lexer::Type::url)
    return std::string("\033[38;5;7m\033[48;5;4m") + "url" + "\033[0m";
  else if (type == Lexer::Type::pair)
    return std::string("\033[38;5;7m\033[48;5;1m") + "pair" + "\033[0m";
  else if (type == Lexer::Type::set)
    return std::string("\033[38;5;15m\033[48;5;208m") + "set" + "\033[0m";
  else if (type == Lexer::Type::tag)
    return std::string("\033[37;45m") + "tag" + "\033[0m";
  else if (type == Lexer::Type::path)
    return std::string("\033[37;102m") + "path" + "\033[0m";
  else if (type == Lexer::Type::substitution)
    return std::string("\033[37;102m") + "substitution" + "\033[0m";
  else if (type == Lexer::Type::pattern)
    return std::string("\033[37;42m") + "pattern" + "\033[0m";
  else if (type == Lexer::Type::op)
    return std::string("\033[38;5;7m\033[48;5;203m") + "op" + "\033[0m";
  else if (type == Lexer::Type::dom)
    return std::string("\033[38;5;15m\033[48;5;244m") + "dom" + "\033[0m";
  else if (type == Lexer::Type::identifier)
    return std::string("\033[38;5;15m\033[48;5;244m") + "identifier" + "\033[0m";
  else if (type == Lexer::Type::word)
    return std::string("\033[38;5;15m\033[48;5;236m") + "word" + "\033[0m";
  else if (type == Lexer::Type::date)
    return std::string("\033[38;5;15m\033[48;5;34m") + "date" + "\033[0m";
  else if (type == Lexer::Type::duration)
    return std::string("\033[38;5;15m\033[48;5;34m") + "duration" + "\033[0m";
  else
    return std::string("\033[37;41m") + "unknown" + "\033[0m";
}

////////////////////////////////////////////////////////////////////////////////
bool Lexer::isAllDigits(const std::string& text) {
  return text.length() && text.find_first_not_of("0123456789") == std::string::npos;
}

////////////////////////////////////////////////////////////////////////////////
// This is intentionally looking for a single token.
bool Lexer::isDOM(const std::string& text) {
  Lexer lex(text);
  int count = 0;
  std::string token;
  Lexer::Type type;
  while (lex.token(token, type)) ++count;

  return count == 1 && type == Lexer::Type::dom;
}

////////////////////////////////////////////////////////////////////////////////
// Full implementation of a quoted word.  Includes:
//   '\''
//   '"'
//   "'"
//   "\""
//   'one two'
// Result includes the quotes.
bool Lexer::readWord(const std::string& text, const std::string& quotes,
                     std::string::size_type& cursor, std::string& word) {
  if (quotes.find(text[cursor]) == std::string::npos) return false;

  std::string::size_type eos = text.length();
  int quote = text[cursor++];
  word = quote;

  int c;
  while ((c = text[cursor])) {
    // Quoted word ends on a quote.
    if (quote && quote == c) {
      word += utf8_character(utf8_next_char(text, cursor));
      break;
    }

    // Unicode U+XXXX or \uXXXX codepoint.
    else if (eos - cursor >= 6 &&
             ((text[cursor + 0] == 'U' && text[cursor + 1] == '+') ||
              (text[cursor + 0] == '\\' && text[cursor + 1] == 'u')) &&
             unicodeHexDigit(text[cursor + 2]) && unicodeHexDigit(text[cursor + 3]) &&
             unicodeHexDigit(text[cursor + 4]) && unicodeHexDigit(text[cursor + 5])) {
      word += utf8_character(
          hexToInt(text[cursor + 2], text[cursor + 3], text[cursor + 4], text[cursor + 5]));
      cursor += 6;
    }

    // An escaped thing.
    else if (c == '\\') {
      c = text[++cursor];

      switch (c) {
        case '"':
          word += (char)0x22;
          ++cursor;
          break;
        case '\'':
          word += (char)0x27;
          ++cursor;
          break;
        case '\\':
          word += (char)0x5C;
          ++cursor;
          break;
        case 'b':
          word += (char)0x08;
          ++cursor;
          break;
        case 'f':
          word += (char)0x0C;
          ++cursor;
          break;
        case 'n':
          word += (char)0x0A;
          ++cursor;
          break;
        case 'r':
          word += (char)0x0D;
          ++cursor;
          break;
        case 't':
          word += (char)0x09;
          ++cursor;
          break;
        case 'v':
          word += (char)0x0B;
          ++cursor;
          break;

        // This pass-through default case means that anything can be escaped
        // harmlessly. In particular 'quote' is included, if it not one of the
        // above characters.
        default:
          word += (char)c;
          ++cursor;
          break;
      }
    }

    // Ordinary character.
    else
      word += utf8_character(utf8_next_char(text, cursor));
  }

  // Verify termination.
  return word[0] == quote && word[word.length() - 1] == quote && word.length() >= 2;
}

////////////////////////////////////////////////////////////////////////////////
// Full implementation of an unquoted word.  Includes:
//   one\ two
//   abcU+0020def
//   abc\u0020def
//   a\tb
//
// Ends at:
//   Lexer::isEOS
//   unicodeWhitespace
//   Lexer::isHardBoundary
bool Lexer::readWord(const std::string& text, std::string::size_type& cursor, std::string& word) {
  std::string::size_type eos = text.length();

  word = "";
  int c;
  int prev = 0;
  while ((c = text[cursor]))  // Handles EOS.
  {
    // Unquoted word ends on white space.
    if (unicodeWhitespace(c)) break;

    // Parentheses mostly.
    if (prev && Lexer::isHardBoundary(prev, c)) break;

    // Unicode U+XXXX or \uXXXX codepoint.
    else if (eos - cursor >= 6 &&
             ((text[cursor + 0] == 'U' && text[cursor + 1] == '+') ||
              (text[cursor + 0] == '\\' && text[cursor + 1] == 'u')) &&
             unicodeHexDigit(text[cursor + 2]) && unicodeHexDigit(text[cursor + 3]) &&
             unicodeHexDigit(text[cursor + 4]) && unicodeHexDigit(text[cursor + 5])) {
      word += utf8_character(
          hexToInt(text[cursor + 2], text[cursor + 3], text[cursor + 4], text[cursor + 5]));
      cursor += 6;
    }

    // An escaped thing.
    else if (c == '\\') {
      c = text[++cursor];

      switch (c) {
        case '"':
          word += (char)0x22;
          ++cursor;
          break;
        case '\'':
          word += (char)0x27;
          ++cursor;
          break;
        case '\\':
          word += (char)0x5C;
          ++cursor;
          break;
        case 'b':
          word += (char)0x08;
          ++cursor;
          break;
        case 'f':
          word += (char)0x0C;
          ++cursor;
          break;
        case 'n':
          word += (char)0x0A;
          ++cursor;
          break;
        case 'r':
          word += (char)0x0D;
          ++cursor;
          break;
        case 't':
          word += (char)0x09;
          ++cursor;
          break;
        case 'v':
          word += (char)0x0B;
          ++cursor;
          break;

        // This pass-through default case means that anything can be escaped
        // harmlessly. In particular 'quote' is included, if it not one of the
        // above characters.
        default:
          word += (char)c;
          ++cursor;
          break;
      }
    }

    // Ordinary character.
    else
      word += utf8_character(utf8_next_char(text, cursor));

    prev = c;
  }

  return word.length() > 0 ? true : false;
}

////////////////////////////////////////////////////////////////////////////////
// <name> [. <modifier>] <: | = | :: | :=> [<value>]
bool Lexer::decomposePair(const std::string& text, std::string& name, std::string& modifier,
                          std::string& separator, std::string& value) {
  // Look for the required elements.
  std::string::size_type dot = text.find('.');
  std::string::size_type sep_defer = text.find("::");
  std::string::size_type sep_eval = text.find(":=");
  std::string::size_type sep_colon = text.find(':');
  std::string::size_type sep_equal = text.find('=');

  // Determine which separator is dominant, which would be the first one seen,
  // taking into consideration the overlapping : characters.
  std::string::size_type sep = std::string::npos;
  std::string::size_type sep_end = std::string::npos;
  if (sep_defer != std::string::npos && (sep_eval == std::string::npos || sep_defer <= sep_eval) &&
      (sep_colon == std::string::npos || sep_defer <= sep_colon) &&
      (sep_equal == std::string::npos || sep_defer <= sep_equal)) {
    sep = sep_defer;
    sep_end = sep_defer + 2;
  } else if (sep_eval != std::string::npos &&
             (sep_defer == std::string::npos || sep_eval <= sep_defer) &&
             (sep_colon == std::string::npos || sep_eval <= sep_colon) &&
             (sep_equal == std::string::npos || sep_eval <= sep_equal)) {
    sep = sep_eval;
    sep_end = sep_eval + 2;
  } else if (sep_colon != std::string::npos &&
             (sep_defer == std::string::npos || sep_colon <= sep_defer) &&
             (sep_eval == std::string::npos || sep_colon <= sep_eval) &&
             (sep_equal == std::string::npos || sep_colon <= sep_equal)) {
    sep = sep_colon;
    sep_end = sep_colon + 1;
  } else if (sep_equal != std::string::npos &&
             (sep_defer == std::string::npos || sep_equal <= sep_defer) &&
             (sep_eval == std::string::npos || sep_equal <= sep_eval) &&
             (sep_colon == std::string::npos || sep_equal <= sep_colon)) {
    sep = sep_equal;
    sep_end = sep_equal + 1;
  }

  // If sep is known, all is well.
  if (sep != std::string::npos) {
    // Now the only unknown is whethere there is a modifier.
    if (dot != std::string::npos && dot < sep) {
      name = text.substr(0, dot);
      modifier = text.substr(dot + 1, sep - dot - 1);
    } else {
      name = text.substr(0, sep);
      modifier = "";
    }

    separator = text.substr(sep, sep_end - sep);
    value = text.substr(sep_end);

    // An empty name is an error.
    if (name.length()) return true;
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// / <from> / <to> / [<flags>]
bool Lexer::decomposeSubstitution(const std::string& text, std::string& from, std::string& to,
                                  std::string& flags) {
  std::string parsed_from;
  std::string::size_type cursor = 0;
  if (readWord(text, "/", cursor, parsed_from) && parsed_from.length()) {
    --cursor;
    std::string parsed_to;
    if (readWord(text, "/", cursor, parsed_to)) {
      std::string parsed_flags = text.substr(cursor);
      if (parsed_flags.find('/') == std::string::npos) {
        dequote(parsed_from, "/");
        dequote(parsed_to, "/");

        from = parsed_from;
        to = parsed_to;
        flags = parsed_flags;
        return true;
      }
    }
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////
// / <pattern> / [<flags>]
bool Lexer::decomposePattern(const std::string& text, std::string& pattern, std::string& flags) {
  std::string ignored;
  std::string::size_type cursor = 0;
  if (readWord(text, "/", cursor, ignored) && ignored.length()) {
    auto parsed_flags = text.substr(cursor);
    if (parsed_flags.find('/') == std::string::npos) {
      flags = parsed_flags;
      pattern = text.substr(1, cursor - 2 - flags.length());
      return true;
    }
  }

  return false;
}

////////////////////////////////////////////////////////////////////////////////

GothenburgBitFactory / taskwarrior / 12343201393

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous