esruby 0.0.0 → 0.0.2

data/resources/mruby/build/mrbgems/mruby-regexp-pcre/pcre/pcre_refcount.c

@@ -1,92 +0,0 @@
-/*************************************************
-*      Perl-Compatible Regular Expressions       *
-*************************************************/
-
-/* PCRE is a library of functions to support regular expressions whose syntax
-and semantics are as close as possible to those of the Perl 5 language.
-
-                       Written by Philip Hazel
-           Copyright (c) 1997-2012 University of Cambridge
-
------------------------------------------------------------------------------
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-    * Redistributions of source code must retain the above copyright notice,
-      this list of conditions and the following disclaimer.
-
-    * 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.
-
-    * Neither the name of the University of Cambridge 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 OWNER 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.
------------------------------------------------------------------------------
-*/
-
-
-/* This module contains the external function pcre_refcount(), which is an
-auxiliary function that can be used to maintain a reference count in a compiled
-pattern data block. This might be helpful in applications where the block is
-shared by different users. */
-
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "pcre_internal.h"
-
-
-/*************************************************
-*           Maintain reference count             *
-*************************************************/
-
-/* The reference count is a 16-bit field, initialized to zero. It is not
-possible to transfer a non-zero count from one host to a different host that
-has a different byte order - though I can't see why anyone in their right mind
-would ever want to do that!
-
-Arguments:
-  argument_re   points to compiled code
-  adjust        value to add to the count
-
-Returns:        the (possibly updated) count value (a non-negative number), or
-                a negative error number
-*/
-
-#if defined COMPILE_PCRE8
-PCRE_EXP_DEFN int PCRE_CALL_CONVENTION
-pcre_refcount(pcre *argument_re, int adjust)
-#elif defined COMPILE_PCRE16
-PCRE_EXP_DEFN int PCRE_CALL_CONVENTION
-pcre16_refcount(pcre16 *argument_re, int adjust)
-#elif defined COMPILE_PCRE32
-PCRE_EXP_DEFN int PCRE_CALL_CONVENTION
-pcre32_refcount(pcre32 *argument_re, int adjust)
-#endif
-{
-REAL_PCRE *re = (REAL_PCRE *)argument_re;
-if (re == NULL) return PCRE_ERROR_NULL;
-if (re->magic_number != MAGIC_NUMBER) return PCRE_ERROR_BADMAGIC;
-if ((re->flags & PCRE_MODE) == 0) return PCRE_ERROR_BADMODE;
-re->ref_count = (-adjust > re->ref_count)? 0 :
-                (adjust + re->ref_count > 65535)? 65535 :
-                re->ref_count + adjust;
-return re->ref_count;
-}
-
-/* End of pcre_refcount.c */

data/resources/mruby/build/mrbgems/mruby-regexp-pcre/pcre/pcre_scanner.cc

@@ -1,199 +0,0 @@
-// Copyright (c) 2005, Google Inc.
-// All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-//     * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-//     * 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.
-//     * Neither the name of Google Inc. 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
-// OWNER 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.
-//
-// Author: Sanjay Ghemawat
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include <vector>
-#include <assert.h>
-
-#include "pcrecpp_internal.h"
-#include "pcre_scanner.h"
-
-using std::vector;
-
-namespace pcrecpp {
-
-Scanner::Scanner()
-  : data_(),
-    input_(data_),
-    skip_(NULL),
-    should_skip_(false),
-    skip_repeat_(false),
-    save_comments_(false),
-    comments_(NULL),
-    comments_offset_(0) {
-}
-
-Scanner::Scanner(const string& in)
-  : data_(in),
-    input_(data_),
-    skip_(NULL),
-    should_skip_(false),
-    skip_repeat_(false),
-    save_comments_(false),
-    comments_(NULL),
-    comments_offset_(0) {
-}
-
-Scanner::~Scanner() {
-  delete skip_;
-  delete comments_;
-}
-
-void Scanner::SetSkipExpression(const char* re) {
-  delete skip_;
-  if (re != NULL) {
-    skip_ = new RE(re);
-    should_skip_ = true;
-    skip_repeat_ = true;
-    ConsumeSkip();
-  } else {
-    skip_ = NULL;
-    should_skip_ = false;
-    skip_repeat_ = false;
-  }
-}
-
-void Scanner::Skip(const char* re) {
-  delete skip_;
-  if (re != NULL) {
-    skip_ = new RE(re);
-    should_skip_ = true;
-    skip_repeat_ = false;
-    ConsumeSkip();
-  } else {
-    skip_ = NULL;
-    should_skip_ = false;
-    skip_repeat_ = false;
-  }
-}
-
-void Scanner::DisableSkip() {
-  assert(skip_ != NULL);
-  should_skip_ = false;
-}
-
-void Scanner::EnableSkip() {
-  assert(skip_ != NULL);
-  should_skip_ = true;
-  ConsumeSkip();
-}
-
-int Scanner::LineNumber() const {
-  // TODO: Make it more efficient by keeping track of the last point
-  // where we computed line numbers and counting newlines since then.
-  // We could use std:count, but not all systems have it. :-(
-  int count = 1;
-  for (const char* p = data_.data(); p < input_.data(); ++p)
-    if (*p == '\n')
-      ++count;
-  return count;
-}
-
-int Scanner::Offset() const {
-  return (int)(input_.data() - data_.c_str());
-}
-
-bool Scanner::LookingAt(const RE& re) const {
-  int consumed;
-  return re.DoMatch(input_, RE::ANCHOR_START, &consumed, 0, 0);
-}
-
-
-bool Scanner::Consume(const RE& re,
-                      const Arg& arg0,
-                      const Arg& arg1,
-                      const Arg& arg2) {
-  const bool result = re.Consume(&input_, arg0, arg1, arg2);
-  if (result && should_skip_) ConsumeSkip();
-  return result;
-}
-
-// helper function to consume *skip_ and honour save_comments_
-void Scanner::ConsumeSkip() {
-  const char* start_data = input_.data();
-  while (skip_->Consume(&input_)) {
-    if (!skip_repeat_) {
-      // Only one skip allowed.
-      break;
-    }
-  }
-  if (save_comments_) {
-    if (comments_ == NULL) {
-      comments_ = new vector<StringPiece>;
-    }
-    // already pointing one past end, so no need to +1
-    int length = (int)(input_.data() - start_data);
-    if (length > 0) {
-      comments_->push_back(StringPiece(start_data, length));
-    }
-  }
-}
-
-
-void Scanner::GetComments(int start, int end, vector<StringPiece> *ranges) {
-  // short circuit out if we've not yet initialized comments_
-  // (e.g., when save_comments is false)
-  if (!comments_) {
-    return;
-  }
-  // TODO: if we guarantee that comments_ will contain StringPieces
-  // that are ordered by their start, then we can do a binary search
-  // for the first StringPiece at or past start and then scan for the
-  // ones contained in the range, quit early (use equal_range or
-  // lower_bound)
-  for (vector<StringPiece>::const_iterator it = comments_->begin();
-       it != comments_->end(); ++it) {
-    if ((it->data() >= data_.c_str() + start &&
-         it->data() + it->size() <= data_.c_str() + end)) {
-      ranges->push_back(*it);
-    }
-  }
-}
-
-
-void Scanner::GetNextComments(vector<StringPiece> *ranges) {
-  // short circuit out if we've not yet initialized comments_
-  // (e.g., when save_comments is false)
-  if (!comments_) {
-    return;
-  }
-  for (vector<StringPiece>::const_iterator it =
-         comments_->begin() + comments_offset_;
-       it != comments_->end(); ++it) {
-    ranges->push_back(*it);
-    ++comments_offset_;
-  }
-}
-
-}   // namespace pcrecpp

data/resources/mruby/build/mrbgems/mruby-regexp-pcre/pcre/pcre_scanner.h

@@ -1,172 +0,0 @@
-// Copyright (c) 2005, Google Inc.
-// All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-//     * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-//     * 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.
-//     * Neither the name of Google Inc. 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
-// OWNER 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.
-//
-// Author: Sanjay Ghemawat
-//
-// Regular-expression based scanner for parsing an input stream.
-//
-// Example 1: parse a sequence of "var = number" entries from input:
-//
-//      Scanner scanner(input);
-//      string var;
-//      int number;
-//      scanner.SetSkipExpression("\\s+"); // Skip any white space we encounter
-//      while (scanner.Consume("(\\w+) = (\\d+)", &var, &number)) {
-//        ...;
-//      }
-
-#ifndef _PCRE_SCANNER_H
-#define _PCRE_SCANNER_H
-
-#include <assert.h>
-#include <string>
-#include <vector>
-
-#include <pcrecpp.h>
-#include <pcre_stringpiece.h>
-
-namespace pcrecpp {
-
-class PCRECPP_EXP_DEFN Scanner {
- public:
-  Scanner();
-  explicit Scanner(const std::string& input);
-  ~Scanner();
-
-  // Return current line number.  The returned line-number is
-  // one-based.  I.e. it returns 1 + the number of consumed newlines.
-  //
-  // Note: this method may be slow.  It may take time proportional to
-  // the size of the input.
-  int LineNumber() const;
-
-  // Return the byte-offset that the scanner is looking in the
-  // input data;
-  int Offset() const;
-
-  // Return true iff the start of the remaining input matches "re"
-  bool LookingAt(const RE& re) const;
-
-  // Return true iff all of the following are true
-  //    a. the start of the remaining input matches "re",
-  //    b. if any arguments are supplied, matched sub-patterns can be
-  //       parsed and stored into the arguments.
-  // If it returns true, it skips over the matched input and any
-  // following input that matches the "skip" regular expression.
-  bool Consume(const RE& re,
-               const Arg& arg0 = RE::no_arg,
-               const Arg& arg1 = RE::no_arg,
-               const Arg& arg2 = RE::no_arg
-               // TODO: Allow more arguments?
-               );
-
-  // Set the "skip" regular expression.  If after consuming some data,
-  // a prefix of the input matches this RE, it is automatically
-  // skipped.  For example, a programming language scanner would use
-  // a skip RE that matches white space and comments.
-  //
-  //    scanner.SetSkipExpression("\\s+|//.*|/[*](.|\n)*?[*]/");
-  //
-  // Skipping repeats as long as it succeeds.  We used to let people do
-  // this by writing "(...)*" in the regular expression, but that added
-  // up to lots of recursive calls within the pcre library, so now we
-  // control repetition explicitly via the function call API.
-  //
-  // You can pass NULL for "re" if you do not want any data to be skipped.
-  void Skip(const char* re);   // DEPRECATED; does *not* repeat
-  void SetSkipExpression(const char* re);
-
-  // Temporarily pause "skip"ing. This
-  //   Skip("Foo"); code ; DisableSkip(); code; EnableSkip()
-  // is similar to
-  //   Skip("Foo"); code ; Skip(NULL); code ; Skip("Foo");
-  // but avoids creating/deleting new RE objects.
-  void DisableSkip();
-
-  // Reenable previously paused skipping.  Any prefix of the input
-  // that matches the skip pattern is immediately dropped.
-  void EnableSkip();
-
-  /***** Special wrappers around SetSkip() for some common idioms *****/
-
-  // Arranges to skip whitespace, C comments, C++ comments.
-  // The overall RE is a disjunction of the following REs:
-  //    \\s                     whitespace
-  //    //.*\n                  C++ comment
-  //    /[*](.|\n)*?[*]/        C comment (x*? means minimal repetitions of x)
-  // We get repetition via the semantics of SetSkipExpression, not by using *
-  void SkipCXXComments() {
-    SetSkipExpression("\\s|//.*\n|/[*](?:\n|.)*?[*]/");
-  }
-
-  void set_save_comments(bool comments) {
-    save_comments_ = comments;
-  }
-
-  bool save_comments() {
-    return save_comments_;
-  }
-
-  // Append to vector ranges the comments found in the
-  // byte range [start,end] (inclusive) of the input data.
-  // Only comments that were extracted entirely within that
-  // range are returned: no range splitting of atomically-extracted
-  // comments is performed.
-  void GetComments(int start, int end, std::vector<StringPiece> *ranges);
-
-  // Append to vector ranges the comments added
-  // since the last time this was called. This
-  // functionality is provided for efficiency when
-  // interleaving scanning with parsing.
-  void GetNextComments(std::vector<StringPiece> *ranges);
-
- private:
-  std::string   data_;          // All the input data
-  StringPiece   input_;         // Unprocessed input
-  RE*           skip_;          // If non-NULL, RE for skipping input
-  bool          should_skip_;   // If true, use skip_
-  bool          skip_repeat_;   // If true, repeat skip_ as long as it works
-  bool          save_comments_; // If true, aggregate the skip expression
-
-  // the skipped comments
-  // TODO: later consider requiring that the StringPieces be added
-  // in order by their start position
-  std::vector<StringPiece> *comments_;
-
-  // the offset into comments_ that has been returned by GetNextComments
-  int           comments_offset_;
-
-  // helper function to consume *skip_ and honour
-  // save_comments_
-  void ConsumeSkip();
-};
-
-}   // namespace pcrecpp
-
-#endif /* _PCRE_SCANNER_H */