expressir 1.4.3 → 2.1.0

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/internal/Synchronization.h

@@ -1,154 +0,0 @@
-// Copyright 2012-2022 The ANTLR Project
-//
-// Redistribution and use in source and binary forms, with or without modification, are permitted
-// provided that the following conditions are met:
-//
-// 1. Redistributions of source code must retain the above copyright notice, this list of conditions
-//    and the following disclaimer.
-//
-// 2. Redistributions in binary form must reproduce the above copyright notice, this list of
-//    conditions and the following disclaimer in the documentation and/or other materials provided
-//    with the distribution.
-//
-// 3. Neither the name of the copyright holder nor the names of its contributors may be used to
-//    endorse or promote products derived from this software without specific prior written
-//    permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
-// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
-// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
-// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
-// WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-#pragma once
-
-#include "antlr4-common.h"
-
-#include <mutex>
-#include <shared_mutex>
-#include <utility>
-
-#if ANTLR4CPP_USING_ABSEIL
-#include "absl/base/call_once.h"
-#include "absl/base/thread_annotations.h"
-#include "absl/synchronization/mutex.h"
-#define ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS ABSL_NO_THREAD_SAFETY_ANALYSIS
-#else
-#define ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS
-#endif
-
-// By default ANTLRv4 uses synchronization primitives provided by the C++ standard library. In most
-// deployments this is fine, however in some using custom synchronization primitives may be
-// preferred. This header allows that by optionally supporting some alternative implementations and
-// allowing for more easier patching of other alternatives.
-
-namespace antlr4::internal {
-
-  // Must be compatible with C++ standard library Mutex requirement.
-  class ANTLR4CPP_PUBLIC Mutex final {
-  public:
-    Mutex() = default;
-
-    // No copying or moving, we are as strict as possible to support other implementations.
-    Mutex(const Mutex&) = delete;
-    Mutex(Mutex&&) = delete;
-
-    // No copying or moving, we are as strict as possible to support other implementations.
-    Mutex& operator=(const Mutex&) = delete;
-    Mutex& operator=(Mutex&&) = delete;
-
-    void lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    bool try_lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    void unlock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-  private:
-#if ANTLR4CPP_USING_ABSEIL
-    absl::Mutex _impl;
-#else
-    std::mutex _impl;
-#endif
-  };
-
-  template <typename Mutex>
-  using UniqueLock = std::unique_lock<Mutex>;
-
-  // Must be compatible with C++ standard library SharedMutex requirement.
-  class ANTLR4CPP_PUBLIC SharedMutex final {
-  public:
-    SharedMutex() = default;
-
-    // No copying or moving, we are as strict as possible to support other implementations.
-    SharedMutex(const SharedMutex&) = delete;
-    SharedMutex(SharedMutex&&) = delete;
-
-    // No copying or moving, we are as strict as possible to support other implementations.
-    SharedMutex& operator=(const SharedMutex&) = delete;
-    SharedMutex& operator=(SharedMutex&&) = delete;
-
-    void lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    bool try_lock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    void unlock() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    void lock_shared() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    bool try_lock_shared() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-    void unlock_shared() ANTLR4CPP_NO_THREAD_SAFTEY_ANALYSIS;
-
-  private:
-#if ANTLR4CPP_USING_ABSEIL
-    absl::Mutex _impl;
-#else
-    std::shared_mutex _impl;
-#endif
-  };
-
-  template <typename Mutex>
-  using SharedLock = std::shared_lock<Mutex>;
-
-  class OnceFlag;
-
-  template <typename Callable, typename... Args>
-  void call_once(OnceFlag &onceFlag, Callable &&callable, Args&&... args);
-
-  // Must be compatible with std::once_flag.
-  class ANTLR4CPP_PUBLIC OnceFlag final {
-  public:
-    constexpr OnceFlag() = default;
-
-    // No copying or moving, we are as strict as possible to support other implementations.
-    OnceFlag(const OnceFlag&) = delete;
-    OnceFlag(OnceFlag&&) = delete;
-
-    // No copying or moving, we are as strict as possible to support other implementations.
-    OnceFlag& operator=(const OnceFlag&) = delete;
-    OnceFlag& operator=(OnceFlag&&) = delete;
-
-  private:
-    template <typename Callable, typename... Args>
-    friend void call_once(OnceFlag &onceFlag, Callable &&callable, Args&&... args);
-
-#if ANTLR4CPP_USING_ABSEIL
-    absl::once_flag _impl;
-#else
-    std::once_flag _impl;
-#endif
-  };
-
-  template <typename Callable, typename... Args>
-  void call_once(OnceFlag &onceFlag, Callable &&callable, Args&&... args) {
-#if ANTLR4CPP_USING_ABSEIL
-    absl::call_once(onceFlag._impl, std::forward<Callable>(callable), std::forward<Args>(args)...);
-#else
-    std::call_once(onceFlag._impl, std::forward<Callable>(callable), std::forward<Args>(args)...);
-#endif
-  }
-
-}  // namespace antlr4::internal

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/InterpreterDataReader.cpp

@@ -1,124 +0,0 @@
-/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-#include "atn/ATN.h"
-#include "atn/ATNDeserializer.h"
-#include "Vocabulary.h"
-
-#include "misc/InterpreterDataReader.h"
-
-using namespace antlr4::dfa;
-using namespace antlr4::atn;
-using namespace antlr4::misc;
-
-InterpreterData::InterpreterData(std::vector<std::string> const& literalNames, std::vector<std::string> const& symbolicNames)
-: vocabulary(literalNames, symbolicNames) {
-}
-
-InterpreterData InterpreterDataReader::parseFile(std::string const& fileName) {
-  // The structure of the data file is very simple. Everything is line based with empty lines
-  // separating the different parts. For lexers the layout is:
-  // token literal names:
-  // ...
-  //
-  // token symbolic names:
-  // ...
-  //
-  // rule names:
-  // ...
-  //
-  // channel names:
-  // ...
-  //
-  // mode names:
-  // ...
-  //
-  // atn:
-  // <a single line with comma separated int values> enclosed in a pair of squared brackets.
-  //
-  // Data for a parser does not contain channel and mode names.
-
-  std::ifstream input(fileName);
-  if (!input.good())
-    return {};
-
-  std::vector<std::string> literalNames;
-  std::vector<std::string> symbolicNames;
-
-  std::string line;
-
-  std::getline(input, line, '\n');
-  assert(line == "token literal names:");
-  while (true) {
-    std::getline(input, line, '\n');
-    if (line.empty())
-      break;
-
-    literalNames.push_back(line == "null" ? "" : line);
-  };
-
-  std::getline(input, line, '\n');
-  assert(line == "token symbolic names:");
-  while (true) {
-    std::getline(input, line, '\n');
-    if (line.empty())
-      break;
-
-    symbolicNames.push_back(line == "null" ? "" : line);
-  };
-  InterpreterData result(literalNames, symbolicNames);
-
-  std::getline(input, line, '\n');
-  assert(line == "rule names:");
-  while (true) {
-    std::getline(input, line, '\n');
-    if (line.empty())
-      break;
-
-    result.ruleNames.push_back(line);
-  };
-
-  std::getline(input, line, '\n');
-  if (line == "channel names:") {
-    while (true) {
-      std::getline(input, line, '\n');
-      if (line.empty())
-        break;
-
-      result.channels.push_back(line);
-    };
-
-    std::getline(input, line, '\n');
-    assert(line == "mode names:");
-    while (true) {
-      std::getline(input, line, '\n');
-      if (line.empty())
-        break;
-
-      result.modes.push_back(line);
-    };
-  }
-
-  std::vector<int32_t> serializedATN;
-
-  std::getline(input, line, '\n');
-  assert(line == "atn:");
-  std::getline(input, line, '\n');
-  std::stringstream tokenizer(line);
-  std::string value;
-  while (tokenizer.good()) {
-    std::getline(tokenizer, value, ',');
-    unsigned long number;
-    if (value[0] == '[')
-      number = std::strtoul(&value[1], nullptr, 10);
-    else
-      number = std::strtoul(value.c_str(), nullptr, 10);
-    serializedATN.push_back(static_cast<int32_t>(number));
-  }
-
-  ATNDeserializer deserializer;
-  result.atn = deserializer.deserialize(serializedATN);
-  return result;
-}

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/InterpreterDataReader.h

@@ -1,33 +0,0 @@
-/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-#pragma once
-
-#include "antlr4-common.h"
-#include "atn/ATN.h"
-#include "Vocabulary.h"
-
-namespace antlr4 {
-namespace misc {
-
-  struct InterpreterData {
-    std::unique_ptr<atn::ATN> atn;
-    dfa::Vocabulary vocabulary;
-    std::vector<std::string> ruleNames;
-    std::vector<std::string> channels; // Only valid for lexer grammars.
-    std::vector<std::string> modes; // ditto
-
-    InterpreterData() {}; // For invalid content.
-    InterpreterData(std::vector<std::string> const& literalNames, std::vector<std::string> const& symbolicNames);
-  };
-
-  // A class to read plain text interpreter data produced by ANTLR.
-  class ANTLR4CPP_PUBLIC InterpreterDataReader {
-  public:
-    static InterpreterData parseFile(std::string const& fileName);
-  };
-
-} // namespace atn
-} // namespace antlr4

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/Interval.cpp

@@ -1,61 +0,0 @@
-/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-#include "misc/Interval.h"
-
-using namespace antlr4::misc;
-
-const Interval Interval::INVALID;
-
-size_t Interval::hashCode() const {
-  size_t hash = 23;
-  hash = hash * 31 + static_cast<size_t>(a);
-  hash = hash * 31 + static_cast<size_t>(b);
-  return hash;
-}
-
-bool Interval::startsBeforeDisjoint(const Interval &other) const {
-  return a < other.a && b < other.a;
-}
-
-bool Interval::startsBeforeNonDisjoint(const Interval &other) const {
-  return a <= other.a && b >= other.a;
-}
-
-bool Interval::startsAfter(const Interval &other) const {
-  return a > other.a;
-}
-
-bool Interval::startsAfterDisjoint(const Interval &other) const {
-  return a > other.b;
-}
-
-bool Interval::startsAfterNonDisjoint(const Interval &other) const {
-  return a > other.a && a <= other.b; // b >= other.b implied
-}
-
-bool Interval::disjoint(const Interval &other) const {
-  return startsBeforeDisjoint(other) || startsAfterDisjoint(other);
-}
-
-bool Interval::adjacent(const Interval &other) const {
-  return a == other.b + 1 || b == other.a - 1;
-}
-
-bool Interval::properlyContains(const Interval &other) const {
-  return other.a >= a && other.b <= b;
-}
-
-Interval Interval::Union(const Interval &other) const {
-  return Interval(std::min(a, other.a), std::max(b, other.b));
-}
-
-Interval Interval::intersection(const Interval &other) const {
-  return Interval(std::max(a, other.a), std::min(b, other.b));
-}
-
-std::string Interval::toString() const {
-  return std::to_string(a) + ".." + std::to_string(b);
-}

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/Interval.h

@@ -1,84 +0,0 @@
-/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-#pragma once
-
-#include "antlr4-common.h"
-
-namespace antlr4 {
-namespace misc {
-
-  // Helpers to convert certain unsigned symbols (e.g. Token::EOF) to their original numeric value (e.g. -1)
-  // and vice versa. This is needed mostly for intervals to keep their original order and for toString()
-  // methods to print the original numeric value (e.g. for tests).
-  constexpr size_t numericToSymbol(ssize_t v) { return static_cast<size_t>(v); }
-  constexpr ssize_t symbolToNumeric(size_t v) { return static_cast<ssize_t>(v); }
-
-  /// An immutable inclusive interval a..b
-  class ANTLR4CPP_PUBLIC Interval final {
-  public:
-    static const Interval INVALID;
-
-    // Must stay signed to guarantee the correct sort order.
-    ssize_t a;
-    ssize_t b;
-
-    constexpr Interval() : Interval(static_cast<ssize_t>(-1), static_cast<ssize_t>(-2)) {}
-
-    constexpr explicit Interval(size_t a_, size_t b_) : Interval(symbolToNumeric(a_), symbolToNumeric(b_)) {}
-
-    constexpr Interval(ssize_t a_, ssize_t b_) : a(a_), b(b_) {}
-
-    /// return number of elements between a and b inclusively. x..x is length 1.
-    ///  if b < a, then length is 0.  9..10 has length 2.
-    constexpr size_t length() const { return b >= a ? static_cast<size_t>(b - a + 1) : 0; }
-
-    constexpr bool operator==(const Interval &other) const { return a == other.a && b == other.b; }
-
-    size_t hashCode() const;
-
-    /// <summary>
-    /// Does this start completely before other? Disjoint </summary>
-    bool startsBeforeDisjoint(const Interval &other) const;
-
-    /// <summary>
-    /// Does this start at or before other? Nondisjoint </summary>
-    bool startsBeforeNonDisjoint(const Interval &other) const;
-
-    /// <summary>
-    /// Does this.a start after other.b? May or may not be disjoint </summary>
-    bool startsAfter(const Interval &other) const;
-
-    /// <summary>
-    /// Does this start completely after other? Disjoint </summary>
-    bool startsAfterDisjoint(const Interval &other) const;
-
-    /// <summary>
-    /// Does this start after other? NonDisjoint </summary>
-    bool startsAfterNonDisjoint(const Interval &other) const;
-
-    /// <summary>
-    /// Are both ranges disjoint? I.e., no overlap? </summary>
-    bool disjoint(const Interval &other) const;
-
-    /// <summary>
-    /// Are two intervals adjacent such as 0..41 and 42..42? </summary>
-    bool adjacent(const Interval &other) const;
-
-    bool properlyContains(const Interval &other) const;
-
-    /// <summary>
-    /// Return the interval computed from combining this and other </summary>
-    Interval Union(const Interval &other) const;
-
-    /// <summary>
-    /// Return the interval in common between this and o </summary>
-    Interval intersection(const Interval &other) const;
-
-    std::string toString() const;
-  };
-
-} // namespace atn
-} // namespace antlr4