RubyGems - expressir - Versions diffs - 0.2.5-x64-mingw32 → 0.2.7-x64-mingw32 - Mend

expressir 0.2.5-x64-mingw32 → 0.2.7-x64-mingw32

Files changed (526) hide show

data/ext/express-parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/MurmurHash.cpp DELETED Viewed

@@ -1,134 +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/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)
-#define FORCE_INLINE	__forceinline
-#include <stdlib.h>
-#define ROTL32(x,y)	_rotl(x,y)
-#define ROTL64(x,y)	_rotl64(x,y)
-#define BIG_CONSTANT(x) (x)
-#else	// defined(_MSC_VER)
-// Other compilers
-#define	FORCE_INLINE inline __attribute__((always_inline))
-inline uint32_t rotl32 (uint32_t x, int8_t r)
-{
-  return (x << r) | (x >> (32 - r));
-}
-inline uint64_t rotl64 (uint64_t x, int8_t r)
-{
-  return (x << r) | (x >> (64 - r));
-}
-#define	ROTL32(x,y)	rotl32(x,y)
-#define ROTL64(x,y)	rotl64(x,y)
-#define BIG_CONSTANT(x) (x##LLU)
-#endif // !defined(_MSC_VER)
-size_t MurmurHash::initialize() {
-  return initialize(DEFAULT_SEED);
-}
-size_t MurmurHash::initialize(size_t seed) {
-  return seed;
-}
-#if defined(_WIN32) || defined(_WIN64)
-  #if _WIN64
-    #define ENVIRONMENT64
-  #else
-    #define ENVIRONMENT32
-  #endif
-#endif
-#if defined(__GNUC__)
-  #if defined(__x86_64__) || defined(__ppc64__)
-    #define ENVIRONMENT64
-  #else
-    #define ENVIRONMENT32
-  #endif
-#endif
-#if defined(ENVIRONMENT32)
-size_t MurmurHash::update(size_t hash, size_t value) {
-  static const size_t c1 = 0xCC9E2D51;
-  static const size_t c2 = 0x1B873593;
-  size_t k1 = value;
-  k1 *= c1;
-  k1 = ROTL32(k1, 15);
-  k1 *= c2;
-  hash ^= k1;
-  hash = ROTL32(hash, 13);
-  hash = hash * 5 + 0xE6546B64;
-  return hash;
-}
-size_t MurmurHash::finish(size_t hash, size_t entryCount) {
-  hash ^= entryCount * 4;
-  hash ^= hash >> 16;
-  hash *= 0x85EBCA6B;
-  hash ^= hash >> 13;
-  hash *= 0xC2B2AE35;
-  hash ^= hash >> 16;
-  return hash;
-}
-#else
-size_t MurmurHash::update(size_t hash, size_t value) {
-  static const size_t c1 = BIG_CONSTANT(0x87c37b91114253d5);
-  static const size_t c2 = BIG_CONSTANT(0x4cf5ad432745937f);
-  size_t k1 = value;
-  k1 *= c1;
-  k1 = ROTL64(k1, 31);
-  k1 *= c2;
-  hash ^= k1;
-  hash = ROTL64(hash, 27);
-  hash = hash * 5 + 0x52dce729;
-  return hash;
-}
-size_t MurmurHash::finish(size_t hash, size_t entryCount) {
-  hash ^= entryCount * 8;
-  hash ^= hash >> 33;
-  hash *= 0xff51afd7ed558ccd;
-  hash ^= hash >> 33;
-  hash *= 0xc4ceb9fe1a85ec53;
-  hash ^= hash >> 33;
-  return hash;
-}
-#endif

data/ext/express-parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/MurmurHash.h DELETED Viewed

@@ -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 antlr4 {
-namespace misc {
-  class ANTLR4CPP_PUBLIC MurmurHash {
-  private:
-    static const size_t DEFAULT_SEED = 0;
-    /// Initialize the hash using the default seed value.
-    /// Returns the intermediate hash value.
-  public:
-    static size_t initialize();
-    /// Initialize the hash using the specified seed.
-    static size_t initialize(size_t 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);
-    }
-    /// <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) {
-      size_t hash = initialize(seed);
-      for (auto entry : data) {
-        hash = update(hash, entry->hashCode());
-      }
-      return finish(hash, data.size());
-    }
-  };
-} // namespace atn
-} // namespace antlr4

data/ext/express-parser/antlr4-upstream/runtime/Cpp/runtime/src/misc/Predicate.cpp DELETED Viewed

@@ -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 DELETED Viewed

@@ -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 DELETED Viewed

@@ -1,13 +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;
-Any::~Any()
-{
-    delete _ptr;
-}

data/ext/express-parser/antlr4-upstream/runtime/Cpp/runtime/src/support/Any.h DELETED Viewed

@@ -1,170 +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"
-#ifdef _MSC_VER
-  #pragma warning(push)
-  #pragma warning(disable: 4521) // 'antlrcpp::Any': multiple copy constructors specified
-#endif
-namespace antlrcpp {
-template<class T>
-  using StorageType = typename std::decay<T>::type;
-struct ANTLR4CPP_PUBLIC Any
-{
-  bool isNull() const { return _ptr == nullptr; }
-  bool isNotNull() const { return _ptr != nullptr; }
-  Any() : _ptr(nullptr) {
-  }
-  Any(Any& that) : _ptr(that.clone()) {
-  }
-  Any(Any&& that) : _ptr(that._ptr) {
-    that._ptr = nullptr;
-  }
-  Any(const Any& that) : _ptr(that.clone()) {
-  }
-  Any(const Any&& that) : _ptr(that.clone()) {
-  }
-  template<typename U>
-  Any(U&& value) : _ptr(new Derived<StorageType<U>>(std::forward<U>(value))) {
-  }
-  template<class U>
-  bool is() const {
-    auto derived = getDerived<U>(false);
-    return derived != nullptr;
-  }
-  template<class U>
-  StorageType<U>& as() {
-    auto derived = getDerived<U>(true);
-    return derived->value;
-  }
-  template<class U>
-  const StorageType<U>& as() const {
-    auto derived = getDerived<U>(true);
-    return derived->value;
-  }
-  template<class U>
-  operator U() {
-    return as<StorageType<U>>();
-  }
-  template<class U>
-  operator const U() const {
-    return as<const StorageType<U>>();
-  }
-  Any& operator = (const Any& a) {
-    if (_ptr == a._ptr)
-      return *this;
-    auto old_ptr = _ptr;
-    _ptr = a.clone();
-    if (old_ptr)
-      delete old_ptr;
-    return *this;
-  }
-  Any& operator = (Any&& a) {
-    if (_ptr == a._ptr)
-      return *this;
-    std::swap(_ptr, a._ptr);
-    return *this;
-  }
-  virtual ~Any();
-  virtual bool equals(Any other) const {
-    return _ptr == other._ptr;
-  }
-private:
-  struct Base {
-    virtual ~Base() {};
-    virtual Base* clone() const = 0;
-  };
-  template<typename T>
-  struct Derived : Base
-  {
-    template<typename U> Derived(U&& value_) : value(std::forward<U>(value_)) {
-    }
-    T value;
-    Base* clone() const {
-      return clone<>();
-    }
-  private:
-    template<int N = 0, typename std::enable_if<N == N && std::is_nothrow_copy_constructible<T>::value, int>::type = 0>
-    Base* clone() const {
-      return new Derived<T>(value);
-    }
-    template<int N = 0, typename std::enable_if<N == N && !std::is_nothrow_copy_constructible<T>::value, int>::type = 0>
-    Base* clone() const {
-      return nullptr;
-    }
-  };
-  Base* clone() const
-  {
-    if (_ptr)
-      return _ptr->clone();
-    else
-      return nullptr;
-  }
-  template<class U>
-  Derived<StorageType<U>>* getDerived(bool checkCast) const {
-    typedef StorageType<U> T;
-    auto derived = dynamic_cast<Derived<T>*>(_ptr);
-    if (checkCast && !derived)
-      throw std::bad_cast();
-    return derived;
-  }
-  Base *_ptr;
-};
-  template<> inline
-  Any::Any(std::nullptr_t&& ) : _ptr(nullptr) {
-  }
-} // namespace antlrcpp
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif

data/ext/express-parser/antlr4-upstream/runtime/Cpp/runtime/src/support/Arrays.cpp DELETED Viewed

@@ -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 (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 DELETED Viewed

@@ -1,110 +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;
-      }
-      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 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<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 DELETED Viewed

@@ -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(){
-      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();
-    }
-  };
-}