@cparra/apex-reflection 0.1.0-alpha.0 → 0.1.1-alpha.10

package/antlr4-4.9.2/lib/src/util/bit_set.dart

@@ -1,308 +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.
- */
-
-import 'dart:math';
-import 'dart:typed_data';
-
-class BitSet {
-  static final Uint32List EmptyBits = Uint32List(0);
-  static const BitsPerElement = 8 * 32;
-
-  Uint32List _data = EmptyBits;
-
-  BitSet([int nbits = 0]) {
-    if (nbits == 0) {
-      return;
-    }
-    if (nbits < 0) throw RangeError('nbits');
-
-    if (nbits > 0) {
-      final length = ((nbits + BitsPerElement - 1) / BitsPerElement).floor();
-      _data = Uint32List(length);
-    }
-  }
-
-  static int getBitCount(Uint32List value) {
-    var data = 0;
-    final size = value.length;
-    final m1 = BigInt.parse('0x5555555555555555').toInt();
-    final m2 = BigInt.parse('0x3333333333333333').toInt();
-    final m4 = BigInt.parse('0x0F0F0F0F0F0F0F0F').toInt();
-    final m8 = BigInt.parse('0x00FF00FF00FF00FF').toInt();
-    final m16 = BigInt.parse('0x0000FFFF0000FFFF').toInt();
-    final h01 = BigInt.parse('0x0101010101010101').toInt();
-
-    var bitCount = 0;
-    final limit30 = size - size % 30;
-
-    // 64-bit tree merging (merging3)
-    for (var i = 0; i < limit30; i += 30, data += 30) {
-      var acc = 0;
-      for (var j = 0; j < 30; j += 3) {
-        var count1 = value[data + j];
-        var count2 = value[data + j + 1];
-        var half1 = value[data + j + 2];
-        var half2 = half1;
-        half1 &= m1;
-        half2 = (half2 >> 1) & m1;
-        count1 -= (count1 >> 1) & m1;
-        count2 -= (count2 >> 1) & m1;
-        count1 += half1;
-        count2 += half2;
-        count1 = (count1 & m2) + ((count1 >> 2) & m2);
-        count1 += (count2 & m2) + ((count2 >> 2) & m2);
-        acc += (count1 & m4) + ((count1 >> 4) & m4);
-      }
-
-      acc = (acc & m8) + ((acc >> 8) & m8);
-      acc = (acc + (acc >> 16)) & m16;
-      acc = acc + (acc >> 32);
-      bitCount += acc;
-    }
-
-    // count the bits of the remaining bytes (MAX 29*8) using
-    // "Counting bits set, in parallel" from the "Bit Twiddling Hacks",
-    // the code uses wikipedia's 64-bit popcount_3() implementation:
-    // http://en.wikipedia.org/wiki/Hamming_weight#Efficient_implementation
-    for (var i = 0; i < size - limit30; i++) {
-      var x = value[data + i];
-      x = x - ((x >> 1) & m1);
-      x = (x & m2) + ((x >> 2) & m2);
-      x = (x + (x >> 4)) & m4;
-      bitCount += ((x * h01) >> 56);
-    }
-
-    return bitCount;
-  }
-
-  static final List<int> index64 = [
-    0,
-    47,
-    1,
-    56,
-    48,
-    27,
-    2,
-    60,
-    57,
-    49,
-    41,
-    37,
-    28,
-    16,
-    3,
-    61,
-    54,
-    58,
-    35,
-    52,
-    50,
-    42,
-    21,
-    44,
-    38,
-    32,
-    29,
-    23,
-    17,
-    11,
-    4,
-    62,
-    46,
-    55,
-    26,
-    59,
-    40,
-    36,
-    15,
-    53,
-    34,
-    51,
-    20,
-    43,
-    31,
-    22,
-    10,
-    45,
-    25,
-    39,
-    14,
-    33,
-    19,
-    30,
-    9,
-    24,
-    13,
-    18,
-    8,
-    12,
-    7,
-    6,
-    5,
-    63
-  ];
-
-  static int BitScanForward(int value) {
-    if (value == 0) return -1;
-
-    final debruijn64 = BigInt.parse('0x03f79d71b4cb0a89');
-    final temp = (BigInt.from(((value ^ (value - 1)))) * debruijn64 >> 58);
-    return index64[(temp % BigInt.from(64)).toInt()];
-  }
-
-  BitSet clone() {
-    final result = BitSet();
-    result._data = List.from(_data);
-    return result;
-  }
-
-  void clear(int index) {
-    if (index < 0) throw RangeError('index');
-
-    final element = (index / BitsPerElement).floor();
-    if (element >= _data.length) return;
-
-    _data[element] &= ~(1 << (index % BitsPerElement));
-  }
-
-  bool operator [](int index) {
-    return get(index);
-  }
-
-  bool get(int index) {
-    if (index < 0) throw RangeError('index');
-
-    final element = (index / BitsPerElement).floor();
-    if (element >= _data.length) return false;
-
-    return (_data[element] & (1 << (index % BitsPerElement))) != 0;
-  }
-
-  void set(int index) {
-    if (index < 0) throw RangeError('index');
-
-    final element = (index / BitsPerElement).floor();
-    if (element >= _data.length) {
-      final newList = Uint32List(max(_data.length * 2, element + 1))
-        ..setRange(0, _data.length, _data);
-      _data = newList;
-    }
-    _data[element] |= 1 << (index % BitsPerElement);
-  }
-
-  bool get isEmpty {
-    for (var i = 0; i < _data.length; i++) {
-      if (_data[i] != 0) return false;
-    }
-
-    return true;
-  }
-
-  int get cardinality {
-    return getBitCount(_data);
-  }
-
-  int nextset(int fromIndex) {
-    if (fromIndex < 0) throw RangeError('fromIndex');
-
-    if (isEmpty) return -1;
-
-    var i = (fromIndex / BitsPerElement).floor();
-    if (i >= _data.length) return -1;
-
-    var current = _data[i] & ~((1 << (fromIndex % BitsPerElement)) - 1);
-
-    while (true) {
-      final bit = BitScanForward(current);
-      if (bit >= 0) return bit + i * BitsPerElement;
-
-      i++;
-      if (i >= _data.length) break;
-
-      current = _data[i];
-    }
-
-    return -1;
-  }
-
-  void and(BitSet set) {
-    if (set == null) throw ArgumentError.notNull('set');
-
-    final length = min(_data.length, set._data.length);
-    for (var i = 0; i < length; i++) {
-      _data[i] &= set._data[i];
-    }
-
-    for (var i = length; i < _data.length; i++) {
-      _data[i] = 0;
-    }
-  }
-
-  void or(BitSet set) {
-    if (set == null) throw ArgumentError.notNull('set');
-
-    if (set._data.length > _data.length) {
-      final newList = Uint32List(set._data.length)
-        ..setRange(0, _data.length, _data);
-      _data = newList;
-    }
-
-    for (var i = 0; i < set._data.length; i++) {
-      _data[i] |= set._data[i];
-    }
-  }
-
-  @override
-  bool operator ==(obj) {
-    final other = obj as BitSet;
-    if (other == null) return false;
-
-    if (isEmpty) return other.isEmpty;
-
-    final minlength = min(_data.length, other._data.length);
-    for (var i = 0; i < minlength; i++) {
-      if (_data[i] != other._data[i]) return false;
-    }
-
-    for (var i = minlength; i < _data.length; i++) {
-      if (_data[i] != 0) return false;
-    }
-
-    for (var i = minlength; i < other._data.length; i++) {
-      if (other._data[i] != 0) return false;
-    }
-
-    return true;
-  }
-
-  @override
-  int get hashCode {
-    var result = 1;
-    for (var i = 0; i < _data.length; i++) {
-      if (_data[i] != 0) {
-        result = result * 31 ^ i;
-        result = result * 31 ^ _data[i];
-      }
-    }
-
-    return result.hashCode;
-  }
-
-  @override
-  String toString() {
-    final builder = StringBuffer();
-    builder.write('{');
-
-    for (var i = nextset(0); i >= 0; i = nextset(i + 1)) {
-      if (builder.length > 1) builder.write(', ');
-
-      builder.write(i);
-    }
-
-    builder.write('}');
-    return builder.toString();
-  }
-}

package/antlr4-4.9.2/lib/src/util/murmur_hash.dart

@@ -1,77 +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.
- */
-
-class MurmurHash {
-  static final int DEFAULT_SEED = 0;
-
-  /// Initialize the hash using the specified [seed].
-  ///
-  /// @param seed the seed
-  /// @return the intermediate hash value
-  static int initialize([int seed]) {
-    return seed ?? DEFAULT_SEED;
-  }
-
-  /// Update the intermediate hash value for the next input [value].
-  ///
-  /// @param hash the intermediate hash value
-  /// @param value the value to add to the current hash
-  /// @return the updated intermediate hash value
-  static int update(int hash, [value]) {
-    final c1 = 0xCC9E2D51;
-    final c2 = 0x1B873593;
-    final r1 = 15;
-    final r2 = 13;
-    final m = 5;
-    final n = 0xE6546B64;
-
-    var k = value is int ? value : value?.hashCode ?? 0;
-
-    k = k * c1;
-    k = (k << r1) | (k >> (32 - r1));
-    k = k * c2;
-
-    hash = hash ^ k;
-    hash = (hash << r2) | (hash >> (32 - r2));
-    hash = hash * m + n;
-
-    return hash;
-  }
-
-  /// Apply the final computation steps to the intermediate value [hash]
-  /// to form the final result of the MurmurHash 3 hash function.
-  ///
-  /// @param hash the intermediate hash value
-  /// @param numberOfWords the number of integer values added to the hash
-  /// @return the final hash result
-  static int finish(int hash, int numberOfWords) {
-    hash = hash ^ (numberOfWords * 4);
-    hash = hash ^ (hash >> 16);
-    hash = hash * 0x85EBCA6B;
-    hash = hash ^ (hash >> 13);
-    hash = hash * 0xC2B2AE35;
-    hash = hash ^ (hash >> 16);
-    return hash;
-  }
-
-  /// Utility function to compute the hash code of an array using the
-  /// MurmurHash algorithm.
-  ///
-  /// @param <T> the array element type
-  /// @param data the array data
-  /// @param seed the seed for the MurmurHash algorithm
-  /// @return the hash code of the data
-  static int getHashCode<T>(List<T> data, int seed) {
-    var hash = initialize(seed);
-
-    for (var value in data) {
-      hash = update(hash, value);
-    }
-
-    hash = finish(hash, data.length);
-    return hash;
-  }
-}

package/antlr4-4.9.2/lib/src/util/utils.dart

@@ -1,31 +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.
- */
-
-/// Convert array of strings to string→index map. Useful for
-///  converting rulenames to name→ruleindex map.
-Map<String, int> toMap(List<String> keys) {
-  final m = {};
-  for (var i = 0; i < keys.length; i++) {
-    m[keys[i]] = i;
-  }
-  return m;
-}
-
-String arrayToString(a) {
-  return '[' + a.join(', ') + ']';
-}
-
-String escapeWhitespace(String s, [bool escapeSpaces = false]) {
-  if (escapeSpaces) s = s.replaceAll(' ', '\u00B7');
-  s = s.replaceAll('\n', r'\n');
-  s = s.replaceAll('\r', r'\r');
-  s = s.replaceAll('\t', r'\t');
-  return s;
-}
-
-bool isLowerCase(String s) => s.toLowerCase() == s;
-
-bool isUpperCase(String s) => s.toUpperCase() == s;

package/antlr4-4.9.2/lib/src/vocabulary.dart

@@ -1,254 +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.
- */
-
-import 'dart:math';
-
-import 'token.dart';
-
-/// This interface provides information about the vocabulary used by a
-/// recognizer.
-///
-/// @see Recognizer#getVocabulary()
-abstract class Vocabulary {
-  /// Returns the highest token type value. It can be used to iterate from
-  /// zero to that number, inclusively, thus querying all stored entries.
-  /// @return the highest token type value
-  int get maxTokenType;
-
-  /// Gets the string literal associated with a token type. The string returned
-  /// by this method, when not null, can be used unaltered in a parser
-  /// grammar to represent this token type.
-  ///
-  /// <p>The following table shows examples of lexer rules and the literal
-  /// names assigned to the corresponding token types.</p>
-  ///
-  /// <table>
-  ///  <tr>
-  ///   <th>Rule</th>
-  ///   <th>Literal Name</th>
-  ///   <th>Java String Literal</th>
-  ///  </tr>
-  ///  <tr>
-  ///   <td>{@code THIS : 'this';}</td>
-  ///   <td>{@code 'this'}</td>
-  ///   <td>{@code "'this'"}</td>
-  ///  </tr>
-  ///  <tr>
-  ///   <td>{@code SQUOTE : '\'';}</td>
-  ///   <td>{@code '\''}</td>
-  ///   <td>{@code "'\\''"}</td>
-  ///  </tr>
-  ///  <tr>
-  ///   <td>{@code ID : [A-Z]+;}</td>
-  ///   <td>n/a</td>
-  ///   <td>null</td>
-  ///  </tr>
-  /// </table>
-  ///
-  /// @param tokenType The token type.
-  ///
-  /// @return The string literal associated with the specified token type, or
-  /// null if no string literal is associated with the type.
-  String getLiteralName(int tokenType);
-
-  /// Gets the symbolic name associated with a token type. The string returned
-  /// by this method, when not null, can be used unaltered in a parser
-  /// grammar to represent this token type.
-  ///
-  /// <p>This method supports token types defined by any of the following
-  /// methods:</p>
-  ///
-  /// <ul>
-  ///  <li>Tokens created by lexer rules.</li>
-  ///  <li>Tokens defined in a <code>tokens{}</code> block in a lexer or parser
-  ///  grammar.</li>
-  ///  <li>The implicitly defined [EOF] token, which has the token type
-  ///  {@link Token#EOF}.</li>
-  /// </ul>
-  ///
-  /// <p>The following table shows examples of lexer rules and the literal
-  /// names assigned to the corresponding token types.</p>
-  ///
-  /// <table>
-  ///  <tr>
-  ///   <th>Rule</th>
-  ///   <th>Symbolic Name</th>
-  ///  </tr>
-  ///  <tr>
-  ///   <td>{@code THIS : 'this';}</td>
-  ///   <td>[THIS]</td>
-  ///  </tr>
-  ///  <tr>
-  ///   <td>{@code SQUOTE : '\'';}</td>
-  ///   <td>[SQUOTE]</td>
-  ///  </tr>
-  ///  <tr>
-  ///   <td>{@code ID : [A-Z]+;}</td>
-  ///   <td>[ID]</td>
-  ///  </tr>
-  /// </table>
-  ///
-  /// @param tokenType The token type.
-  ///
-  /// @return The symbolic name associated with the specified token type, or
-  /// null if no symbolic name is associated with the type.
-  String getSymbolicName(int tokenType);
-
-  /// Gets the display name of a token type.
-  ///
-  /// <p>ANTLR provides a default implementation of this method, but
-  /// applications are free to override the behavior in any manner which makes
-  /// sense for the application. The default implementation returns the first
-  /// result from the following list which produces a non-null
-  /// result.</p>
-  ///
-  /// <ol>
-  ///  <li>The result of {@link #getLiteralName}</li>
-  ///  <li>The result of {@link #getSymbolicName}</li>
-  ///  <li>The result of {@link Integer#toString}</li>
-  /// </ol>
-  ///
-  /// @param tokenType The token type.
-  ///
-  /// @return The display name of the token type, for use in error reporting or
-  /// other user-visible messages which reference specific token types.
-  String getDisplayName(int tokenType);
-}
-
-/// This class provides a default implementation of the [Vocabulary]
-/// interface.
-class VocabularyImpl implements Vocabulary {
-  static const List<String> EMPTY_NAMES = [];
-
-  /// Gets an empty [Vocabulary] instance.
-  ///
-  /// <p>
-  /// No literal or symbol names are assigned to token types, so
-  /// {@link #getDisplayName(int)} returns the numeric value for all tokens
-  /// except {@link Token#EOF}.</p>
-  static final VocabularyImpl EMPTY_VOCABULARY =
-      VocabularyImpl(EMPTY_NAMES, EMPTY_NAMES, EMPTY_NAMES);
-
-  final List<String> literalNames;
-
-  final List<String> symbolicNames;
-
-  final List<String> displayNames;
-
-  @override
-  int maxTokenType;
-
-  /// Constructs a new instance of [VocabularyImpl] from the specified
-  /// literal, symbolic, and display token names.
-  ///
-  /// @param literalNames The literal names assigned to tokens, or null
-  /// if no literal names are assigned.
-  /// @param symbolicNames The symbolic names assigned to tokens, or
-  /// null if no symbolic names are assigned.
-  /// @param displayNames The display names assigned to tokens, or null
-  /// to use the values in [literalNames] and [symbolicNames] as
-  /// the source of display names, as described in
-  /// {@link #getDisplayName(int)}.
-  ///
-  /// @see #getLiteralName(int)
-  /// @see #getSymbolicName(int)
-  /// @see #getDisplayName(int)
-  VocabularyImpl(this.literalNames, this.symbolicNames,
-      [this.displayNames = EMPTY_NAMES]) {
-    // See note here on -1 part: https://github.com/antlr/antlr4/pull/1146
-    maxTokenType = max(displayNames.length,
-            max(literalNames.length, symbolicNames.length)) -
-        1;
-  }
-
-  /// Returns a [VocabularyImpl] instance from the specified set of token
-  /// names. This method acts as a compatibility layer for the single
-  /// [tokenNames] array generated by previous releases of ANTLR.
-  ///
-  /// <p>The resulting vocabulary instance returns null for
-  /// {@link #getLiteralName(int)} and {@link #getSymbolicName(int)}, and the
-  /// value from [tokenNames] for the display names.</p>
-  ///
-  /// @param tokenNames The token names, or null if no token names are
-  /// available.
-  /// @return A [Vocabulary] instance which uses [tokenNames] for
-  /// the display names of tokens.
-  static Vocabulary fromTokenNames(List<String> tokenNames) {
-    if (tokenNames == null || tokenNames.isEmpty) {
-      return EMPTY_VOCABULARY;
-    }
-
-    final literalNames = List<String>.from(tokenNames);
-    final symbolicNames = List<String>.from(tokenNames);
-    for (var i = 0; i < tokenNames.length; i++) {
-      final tokenName = tokenNames[i];
-      if (tokenName == null) {
-        continue;
-      }
-
-      if (tokenName.isNotEmpty) {
-        final firstChar = tokenName[0];
-        if (firstChar == '\'') {
-          symbolicNames[i] = null;
-          continue;
-        } else if (firstChar.toUpperCase() == firstChar) {
-          literalNames[i] = null;
-          continue;
-        }
-      }
-
-      // wasn't a literal or symbolic name
-      literalNames[i] = null;
-      symbolicNames[i] = null;
-    }
-
-    return VocabularyImpl(literalNames, symbolicNames, tokenNames);
-  }
-
-  @override
-  String getLiteralName(int tokenType) {
-    if (tokenType >= 0 && tokenType < literalNames.length) {
-      return literalNames[tokenType];
-    }
-
-    return null;
-  }
-
-  @override
-  String getSymbolicName(int tokenType) {
-    if (tokenType >= 0 && tokenType < symbolicNames.length) {
-      return symbolicNames[tokenType];
-    }
-
-    if (tokenType == Token.EOF) {
-      return 'EOF';
-    }
-
-    return null;
-  }
-
-  @override
-  String getDisplayName(int tokenType) {
-    if (tokenType >= 0 && tokenType < displayNames.length) {
-      final displayName = displayNames[tokenType];
-      if (displayName != null) {
-        return displayName;
-      }
-    }
-
-    final literalName = getLiteralName(tokenType);
-    if (literalName != null) {
-      return literalName;
-    }
-
-    final symbolicName = getSymbolicName(tokenType);
-    if (symbolicName != null) {
-      return symbolicName;
-    }
-
-    return tokenType.toString();
-  }
-}

package/antlr4-4.9.2/pubspec.yaml

@@ -1,13 +0,0 @@
-name: "antlr4"
-version: "4.9.2"
-description: "New Dart runtime for ANTLR4."
-homepage: "https://github.com/antlr/antlr4"
-license: "BSD-3-Clause"
-dependencies: 
-  logging: ^0.11.4
-  collection: ^1.14.12
-dev_dependencies:
-  pedantic: ^1.0.0
-
-environment:
-  sdk: ">=2.7.0 <3.0.0"

package/example/node_example/index.js

@@ -1,8 +0,0 @@
-const {reflect} = require('../../js');
-const classBody = `
-/** 
- * @description My Class description 
- */
- public with sharing class MyClass{}
-`;
-console.log(reflect(classBody));

package/example/node_example/package.json

@@ -1,12 +0,0 @@
-{
-  "name": "node_example",
-  "version": "1.0.0",
-  "description": "",
-  "main": "index.js",
-  "scripts": {
-    "test": "echo \"Error: no test specified\" && exit 1"
-  },
-  "keywords": [],
-  "author": "",
-  "license": "ISC"
-}