expressir 1.4.2 → 2.0.0

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

@@ -1,120 +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 <cstddef>
-#include <cstdint>
-#include <cstring>
-
-#include "misc/MurmurHash.h"
-
-using namespace antlr4::misc;
-
-// A variation of the MurmurHash3 implementation (https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp)
-// Here we unrolled the loop used there into individual calls to update(), as we usually hash object fields
-// instead of entire buffers.
-
-// Platform-specific functions and macros
-
-// Microsoft Visual Studio
-
-#if defined(_MSC_VER)
-
-#include <stdlib.h>
-
-#define ROTL32(x,y)	_rotl(x,y)
-#define ROTL64(x,y)	_rotl64(x,y)
-
-#elif ANTLR4CPP_HAVE_BUILTIN(__builtin_rotateleft32) && ANTLR4CPP_HAVE_BUILTIN(__builtin_rotateleft64)
-
-#define ROTL32(x, y) __builtin_rotateleft32(x, y)
-#define ROTL64(x, y) __builtin_rotateleft64(x, y)
-
-#else	// defined(_MSC_VER)
-
-// Other compilers
-
-namespace {
-
-constexpr uint32_t ROTL32(uint32_t x, int r) {
-  return (x << r) | (x >> (32 - r));
-}
-constexpr uint64_t ROTL64(uint64_t x, int r) {
-  return (x << r) | (x >> (64 - r));
-}
-
-}
-
-#endif // !defined(_MSC_VER)
-
-#if SIZE_MAX == UINT64_MAX
-
-size_t MurmurHash::update(size_t hash, size_t value) {
-  size_t k1 = value;
-  k1 *= UINT64_C(0x87c37b91114253d5);
-  k1 = ROTL64(k1, 31);
-  k1 *= UINT64_C(0x4cf5ad432745937f);
-
-  hash ^= k1;
-  hash = ROTL64(hash, 27);
-  hash = hash * 5 + UINT64_C(0x52dce729);
-
-  return hash;
-}
-
-size_t MurmurHash::finish(size_t hash, size_t entryCount) {
-  hash ^= entryCount * 8;
-  hash ^= hash >> 33;
-  hash *= UINT64_C(0xff51afd7ed558ccd);
-  hash ^= hash >> 33;
-  hash *= UINT64_C(0xc4ceb9fe1a85ec53);
-  hash ^= hash >> 33;
-  return hash;
-}
-
-#elif SIZE_MAX == UINT32_MAX
-
-size_t MurmurHash::update(size_t hash, size_t value) {
-  size_t k1 = value;
-  k1 *= UINT32_C(0xCC9E2D51);
-  k1 = ROTL32(k1, 15);
-  k1 *= UINT32_C(0x1B873593);
-
-  hash ^= k1;
-  hash = ROTL32(hash, 13);
-  hash = hash * 5 + UINT32_C(0xE6546B64);
-
-  return hash;
-}
-
-size_t MurmurHash::finish(size_t hash, size_t entryCount) {
-  hash ^= entryCount * 4;
-  hash ^= hash >> 16;
-  hash *= UINT32_C(0x85EBCA6B);
-  hash ^= hash >> 13;
-  hash *= UINT32_C(0xC2B2AE35);
-  hash ^= hash >> 16;
-  return hash;
-}
-
-#else
-#error "Expected sizeof(size_t) to be 4 or 8."
-#endif
-
-size_t MurmurHash::update(size_t hash, const void *data, size_t size) {
-  size_t value;
-  const uint8_t *bytes = static_cast<const uint8_t*>(data);
-  while (size >= sizeof(size_t)) {
-    std::memcpy(&value, bytes, sizeof(size_t));
-    hash = update(hash, value);
-    bytes += sizeof(size_t);
-    size -= sizeof(size_t);
-  }
-  if (size != 0) {
-    value = 0;
-    std::memcpy(&value, bytes, size);
-    hash = update(hash, value);
-  }
-  return hash;
-}

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

@@ -1,102 +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 <cstdint>
-#include <type_traits>
-
-#include "antlr4-common.h"
-
-namespace antlr4 {
-namespace misc {
-
-  class ANTLR4CPP_PUBLIC MurmurHash final {
-  private:
-    static constexpr size_t DEFAULT_SEED = 0;
-
-    /// Initialize the hash using the default seed value.
-    /// Returns the intermediate hash value.
-  public:
-    static size_t initialize() { return initialize(DEFAULT_SEED); }
-
-    /// Initialize the hash using the specified seed.
-    static size_t initialize(size_t seed) { return seed; }
-
-    /// Update the intermediate hash value for the next input {@code value}.
-    /// <param name="hash"> the intermediate hash value </param>
-    /// <param name="value"> the value to add to the current hash </param>
-    /// Returns the updated intermediate hash value.
-    static size_t update(size_t hash, size_t value);
-
-    /**
-     * Update the intermediate hash value for the next input {@code value}.
-     *
-     * @param hash the intermediate hash value
-     * @param value the value to add to the current hash
-     * @return the updated intermediate hash value
-     */
-    template <class T>
-    static size_t update(size_t hash, Ref<T> const& value) {
-      return update(hash, value != nullptr ? value->hashCode() : 0);
-    }
-
-    template <class T>
-    static size_t update(size_t hash, T *value) {
-      return update(hash, value != nullptr ? value->hashCode() : 0);
-    }
-
-    static size_t update(size_t hash, const void *data, size_t size);
-
-    template <typename T>
-    static size_t update(size_t hash, const T *data, size_t size) {
-      return update(hash, static_cast<const void*>(data), size * sizeof(std::remove_reference_t<T>));
-    }
-
-    /// <summary>
-    /// Apply the final computation steps to the intermediate value {@code hash}
-    /// to form the final result of the MurmurHash 3 hash function.
-    /// </summary>
-    /// <param name="hash"> the intermediate hash value </param>
-    /// <param name="entryCount"> the number of calls to update() before calling finish() </param>
-    /// <returns> the final hash result </returns>
-    static size_t finish(size_t hash, size_t entryCount);
-
-    /// Utility function to compute the hash code of an array using the MurmurHash3 algorithm.
-    ///
-    /// @param <T> the array element type </param>
-    /// <param name="data"> the array data </param>
-    /// <param name="seed"> the seed for the MurmurHash algorithm </param>
-    /// <returns> the hash code of the data </returns>
-    template<typename T> // where T is C array type
-    static size_t hashCode(const std::vector<Ref<T>> &data, size_t seed = DEFAULT_SEED) {
-      size_t hash = initialize(seed);
-      for (auto &entry : data) {
-        hash = update(hash, entry);
-      }
-      return finish(hash, data.size());
-    }
-
-    static size_t hashCode(const void *data, size_t size, size_t seed = DEFAULT_SEED) {
-      size_t hash = initialize(seed);
-      hash = update(hash, data, size);
-      return finish(hash, size);
-    }
-
-    template <typename T>
-    static size_t hashCode(const T *data, size_t size, size_t seed = DEFAULT_SEED) {
-      return hashCode(static_cast<const void*>(data), size * sizeof(std::remove_reference_t<T>), seed);
-    }
-
-  private:
-    MurmurHash() = delete;
-
-    MurmurHash(const MurmurHash&) = delete;
-
-    MurmurHash& operator=(const MurmurHash&) = delete;
-  };
-
-} // namespace atn
-} // namespace antlr4

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

@@ -1,4 +0,0 @@
-#include "misc/Predicate.h"
-
-antlr4::misc::Predicate::~Predicate() {
-}

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

@@ -1,21 +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 {
-
-  class ANTLR4CPP_PUBLIC Predicate {
-  public:
-    virtual ~Predicate();
-
-    virtual bool test(tree::ParseTree *t) = 0;
-  };
-
-} // namespace tree
-} // namespace antlr4

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/support/Any.cpp

@@ -1,8 +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 "Any.h"
-
-using namespace antlrcpp;

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/support/Any.h

@@ -1,16 +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.
- */
-
-// A standard C++ class loosely modeled after boost::Any.
-
-#pragma once
-
-#include "antlr4-common.h"
-
-namespace antlrcpp {
-
-  using Any = std::any;
-
-} // namespace antlrcpp

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/support/Arrays.cpp

@@ -1,43 +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 "tree/ParseTree.h"
-#include "Exceptions.h"
-
-#include "support/Arrays.h"
-
-using namespace antlrcpp;
-
-std::string Arrays::listToString(const std::vector<std::string> &list, const std::string &separator)
-{
-  std::stringstream ss;
-  bool firstEntry = true;
-
-  ss << '[';
-  for (const auto &entry : list) {
-    ss << entry;
-    if (firstEntry) {
-      ss << separator;
-      firstEntry = false;
-    }
-  }
-
-  ss << ']';
-  return ss.str();
-}
-
-template <>
-std::string Arrays::toString(const std::vector<antlr4::tree::ParseTree*> &source) {
-  std::string result = "[";
-  bool firstEntry = true;
-  for (auto *value : source) {
-    result += value->toStringTree();
-    if (firstEntry) {
-      result += ", ";
-      firstEntry = false;
-    }
-  }
-  return result + "]";
-}

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/support/Arrays.h

@@ -1,149 +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 antlrcpp {
-
-  class ANTLR4CPP_PUBLIC Arrays {
-  public:
-
-    static std::string listToString(const std::vector<std::string> &list, const std::string &separator);
-
-    template <typename T>
-    static bool equals(const std::vector<T> &a, const std::vector<T> &b) {
-      if (a.size() != b.size())
-        return false;
-
-      for (size_t i = 0; i < a.size(); ++i)
-        if (!(a[i] == b[i]))
-          return false;
-
-      return true;
-    }
-
-    template <typename T>
-    static bool equals(const std::vector<T *> &a, const std::vector<T *> &b) {
-      if (a.size() != b.size())
-        return false;
-
-      for (size_t i = 0; i < a.size(); ++i) {
-        if (!a[i] && !b[i])
-          continue;
-        if (!a[i] || !b[i])
-          return false;
-        if (a[i] == b[i])
-          continue;
-
-        if (!(*a[i] == *b[i]))
-          return false;
-      }
-
-      return true;
-    }
-
-    template <typename T>
-    static bool equals(const std::vector<Ref<T>> &a, const std::vector<Ref<T>> &b) {
-      if (a.size() != b.size())
-        return false;
-
-      for (size_t i = 0; i < a.size(); ++i) {
-        if (!a[i] && !b[i])
-          continue;
-        if (!a[i] || !b[i])
-          return false;
-        if (a[i] == b[i])
-          continue;
-
-        if (!(*a[i] == *b[i]))
-          return false;
-      }
-
-      return true;
-    }
-
-    template <typename T>
-    static bool equals(const std::vector<std::unique_ptr<T>> &a, const std::vector<std::unique_ptr<T>> &b) {
-      if (a.size() != b.size())
-        return false;
-
-      for (size_t i = 0; i < a.size(); ++i) {
-        if (!a[i] && !b[i])
-          continue;
-        if (!a[i] || !b[i])
-          return false;
-        if (a[i] == b[i])
-          continue;
-
-        if (!(*a[i] == *b[i]))
-          return false;
-      }
-
-      return true;
-    }
-
-    template <typename T>
-    static std::string toString(const std::vector<T> &source) {
-      std::string result = "[";
-      bool firstEntry = true;
-      for (auto &value : source) {
-        result += value.toString();
-        if (firstEntry) {
-          result += ", ";
-          firstEntry = false;
-        }
-      }
-      return result + "]";
-    }
-
-    template <typename T>
-    static std::string toString(const std::vector<Ref<T>> &source) {
-      std::string result = "[";
-      bool firstEntry = true;
-      for (auto &value : source) {
-        result += value->toString();
-        if (firstEntry) {
-          result += ", ";
-          firstEntry = false;
-        }
-      }
-      return result + "]";
-    }
-
-    template <typename T>
-    static std::string toString(const std::vector<std::unique_ptr<T>> &source) {
-      std::string result = "[";
-      bool firstEntry = true;
-      for (auto &value : source) {
-        result += value->toString();
-        if (firstEntry) {
-          result += ", ";
-          firstEntry = false;
-        }
-      }
-      return result + "]";
-    }
-
-    template <typename T>
-    static std::string toString(const std::vector<T *> &source) {
-      std::string result = "[";
-      bool firstEntry = true;
-      for (auto value : source) {
-        result += value->toString();
-        if (firstEntry) {
-          result += ", ";
-          firstEntry = false;
-        }
-      }
-      return result + "]";
-    }
-
-  };
-
-  template <>
-  std::string Arrays::toString(const std::vector<antlr4::tree::ParseTree *> &source);
-}

data/ext/express_parser/antlr4-upstream/runtime/Cpp/runtime/src/support/BitSet.h

@@ -1,76 +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 antlrcpp {
-
-  class ANTLR4CPP_PUBLIC BitSet : public std::bitset<2048> {
-  public:
-    size_t nextSetBit(size_t pos) const {
-      for (size_t i = pos; i < size(); i++){
-        if (test(i)) {
-          return i;
-        }
-      }
-
-      return INVALID_INDEX;
-    }
-
-    // Prints a list of every index for which the bitset contains a bit in true.
-    friend std::wostream& operator << (std::wostream& os, const BitSet& obj)
-    {
-      os << "{";
-      size_t total = obj.count();
-      for (size_t i = 0; i < obj.size(); i++){
-        if (obj.test(i)){
-          os << i;
-          --total;
-          if (total > 1){
-            os << ", ";
-          }
-        }
-      }
-
-      os << "}";
-      return os;
-    }
-
-    static std::string subStringRepresentation(const std::vector<BitSet>::iterator &begin,
-                                                const std::vector<BitSet>::iterator &end) {
-      std::string result;
-      std::vector<BitSet>::iterator vectorIterator;
-
-      for (vectorIterator = begin; vectorIterator != end; vectorIterator++) {
-        result += vectorIterator->toString();
-      }
-      // Grab the end
-      result += end->toString();
-
-      return result;
-    }
-
-    std::string toString() const {
-      std::stringstream stream;
-      stream << "{";
-      bool valueAdded = false;
-      for (size_t i = 0; i < size(); ++i){
-        if (test(i)){
-          if (valueAdded) {
-            stream << ", ";
-          }
-          stream << i;
-          valueAdded = true;
-        }
-      }
-
-      stream << "}";
-      return stream.str();
-    }
-
-  };
-}