re2 2.0.0-arm64-darwin

data/ext/re2/re2.cc

@@ -0,0 +1,1889 @@
+/*
+ * re2 (http://github.com/mudge/re2)
+ * Ruby bindings to re2, an "efficient, principled regular expression library"
+ *
+ * Copyright (c) 2010-2014, Paul Mucur (http://mudge.name)
+ * Released under the BSD Licence, please see LICENSE.txt
+ */
+
+#include <ruby.h>
+#include <re2/re2.h>
+#include <re2/set.h>
+#include <stdint.h>
+#include <string>
+#include <sstream>
+#include <vector>
+using std::string;
+using std::ostringstream;
+using std::nothrow;
+using std::map;
+using std::vector;
+
+#define BOOL2RUBY(v) (v ? Qtrue : Qfalse)
+#define UNUSED(x) ((void)x)
+
+#ifndef RSTRING_LEN
+  #define RSTRING_LEN(x) (RSTRING(x)->len)
+#endif
+
+#ifndef RSTRING_PTR
+  #define RSTRING_PTR(x) (RSTRING(x)->ptr)
+#endif
+
+#ifdef HAVE_RUBY_ENCODING_H
+  #include <ruby/encoding.h>
+  #define ENCODED_STR_NEW(str, length, encoding) \
+    ({ \
+      VALUE _string = rb_str_new(str, length); \
+      int _enc = rb_enc_find_index(encoding); \
+      rb_enc_associate_index(_string, _enc); \
+      _string; \
+    })
+  #define ENCODED_STR_NEW2(str, length, str2) \
+    ({ \
+      VALUE _string = rb_str_new(str, length); \
+      int _enc = rb_enc_get_index(str2); \
+      rb_enc_associate_index(_string, _enc); \
+      _string; \
+    })
+#else
+  #define ENCODED_STR_NEW(str, length, encoding) \
+    rb_str_new((const char *)str, (long)length)
+  #define ENCODED_STR_NEW2(str, length, str2) \
+    rb_str_new((const char *)str, (long)length)
+#endif
+
+#ifdef HAVE_RB_STR_SUBLEN
+  #define ENCODED_STR_SUBLEN(str, offset, encoding) \
+     LONG2NUM(rb_str_sublen(str, offset))
+#else
+  #ifdef HAVE_RUBY_ENCODING_H
+    #define ENCODED_STR_SUBLEN(str, offset, encoding) \
+      ({ \
+        VALUE _string = ENCODED_STR_NEW(RSTRING_PTR(str), offset, encoding); \
+        rb_str_length(_string); \
+      })
+  #else
+    #define ENCODED_STR_SUBLEN(str, offset, encoding) \
+      LONG2NUM(offset)
+  #endif
+#endif
+
+#ifdef HAVE_ENDPOS_ARGUMENT
+  #define match(pattern, text, startpos, endpos, anchor, match, nmatch) \
+          (pattern->Match(text, startpos, endpos, anchor, match, nmatch))
+#else
+  #define match(pattern, text, startpos, endpos, anchor, match, nmatch) \
+          (pattern->Match(text, startpos, anchor, match, nmatch))
+#endif
+
+typedef struct {
+  RE2 *pattern;
+} re2_pattern;
+
+typedef struct {
+  re2::StringPiece *matches;
+  int number_of_matches;
+  VALUE regexp, text;
+} re2_matchdata;
+
+typedef struct {
+  re2::StringPiece *input;
+  int number_of_capturing_groups;
+  bool eof;
+  VALUE regexp, text;
+} re2_scanner;
+
+typedef struct {
+  RE2::Set *set;
+} re2_set;
+
+VALUE re2_mRE2, re2_cRegexp, re2_cMatchData, re2_cScanner, re2_cSet,
+      re2_eSetMatchError, re2_eSetUnsupportedError;
+
+/* Symbols used in RE2 options. */
+static ID id_utf8, id_posix_syntax, id_longest_match, id_log_errors,
+          id_max_mem, id_literal, id_never_nl, id_case_sensitive,
+          id_perl_classes, id_word_boundary, id_one_line,
+          id_unanchored, id_anchor_start, id_anchor_both, id_exception;
+
+void parse_re2_options(RE2::Options& re2_options, VALUE options) {
+  if (TYPE(options) != T_HASH) {
+    rb_raise(rb_eArgError, "options should be a hash");
+  }
+  VALUE utf8, posix_syntax, longest_match, log_errors,
+        max_mem, literal, never_nl, case_sensitive, perl_classes,
+        word_boundary, one_line;
+
+  utf8 = rb_hash_aref(options, ID2SYM(id_utf8));
+  if (!NIL_P(utf8)) {
+    re2_options.set_encoding(RTEST(utf8) ? RE2::Options::EncodingUTF8 : RE2::Options::EncodingLatin1);
+  }
+
+  posix_syntax = rb_hash_aref(options, ID2SYM(id_posix_syntax));
+  if (!NIL_P(posix_syntax)) {
+    re2_options.set_posix_syntax(RTEST(posix_syntax));
+  }
+
+  longest_match = rb_hash_aref(options, ID2SYM(id_longest_match));
+  if (!NIL_P(longest_match)) {
+    re2_options.set_longest_match(RTEST(longest_match));
+  }
+
+  log_errors = rb_hash_aref(options, ID2SYM(id_log_errors));
+  if (!NIL_P(log_errors)) {
+    re2_options.set_log_errors(RTEST(log_errors));
+  }
+
+  max_mem = rb_hash_aref(options, ID2SYM(id_max_mem));
+  if (!NIL_P(max_mem)) {
+    re2_options.set_max_mem(NUM2INT(max_mem));
+  }
+
+  literal = rb_hash_aref(options, ID2SYM(id_literal));
+  if (!NIL_P(literal)) {
+    re2_options.set_literal(RTEST(literal));
+  }
+
+  never_nl = rb_hash_aref(options, ID2SYM(id_never_nl));
+  if (!NIL_P(never_nl)) {
+    re2_options.set_never_nl(RTEST(never_nl));
+  }
+
+  case_sensitive = rb_hash_aref(options, ID2SYM(id_case_sensitive));
+  if (!NIL_P(case_sensitive)) {
+    re2_options.set_case_sensitive(RTEST(case_sensitive));
+  }
+
+  perl_classes = rb_hash_aref(options, ID2SYM(id_perl_classes));
+  if (!NIL_P(perl_classes)) {
+    re2_options.set_perl_classes(RTEST(perl_classes));
+  }
+
+  word_boundary = rb_hash_aref(options, ID2SYM(id_word_boundary));
+  if (!NIL_P(word_boundary)) {
+    re2_options.set_word_boundary(RTEST(word_boundary));
+  }
+
+  one_line = rb_hash_aref(options, ID2SYM(id_one_line));
+  if (!NIL_P(one_line)) {
+    re2_options.set_one_line(RTEST(one_line));
+  }
+}
+
+void re2_matchdata_mark(re2_matchdata* self) {
+  rb_gc_mark(self->regexp);
+  rb_gc_mark(self->text);
+}
+
+void re2_matchdata_free(re2_matchdata* self) {
+  if (self->matches) {
+    delete[] self->matches;
+  }
+  free(self);
+}
+
+void re2_scanner_mark(re2_scanner* self) {
+  rb_gc_mark(self->regexp);
+  rb_gc_mark(self->text);
+}
+
+void re2_scanner_free(re2_scanner* self) {
+  if (self->input) {
+    delete self->input;
+  }
+  free(self);
+}
+
+void re2_regexp_free(re2_pattern* self) {
+  if (self->pattern) {
+    delete self->pattern;
+  }
+  free(self);
+}
+
+static VALUE re2_matchdata_allocate(VALUE klass) {
+  re2_matchdata *m;
+  return Data_Make_Struct(klass, re2_matchdata, re2_matchdata_mark,
+      re2_matchdata_free, m);
+}
+
+static VALUE re2_scanner_allocate(VALUE klass) {
+  re2_scanner *c;
+  return Data_Make_Struct(klass, re2_scanner, re2_scanner_mark,
+      re2_scanner_free, c);
+}
+
+/*
+ * Returns a frozen copy of the string passed into +match+.
+ *
+ * @return [String] a frozen copy of the passed string.
+ * @example
+ *   m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *   m.string  #=> "bob 123"
+ */
+static VALUE re2_matchdata_string(VALUE self) {
+  re2_matchdata *m;
+  Data_Get_Struct(self, re2_matchdata, m);
+
+  return m->text;
+}
+
+/*
+ * Returns the string passed into the scanner.
+ *
+ * @return [String] the original string.
+ * @example
+ *   c = RE2::Regexp.new('(\d+)').scan("foo")
+ *   c.string #=> "foo"
+ */
+static VALUE re2_scanner_string(VALUE self) {
+  re2_scanner *c;
+  Data_Get_Struct(self, re2_scanner, c);
+
+  return c->text;
+}
+
+/*
+ * Returns whether the scanner has consumed all input or not.
+ *
+ * @return [Boolean] whether the scanner has consumed all input or not
+ * @example
+ *   c = RE2::Regexp.new('(\d+)').scan("foo")
+ *   c.eof? #=> true
+ */
+static VALUE re2_scanner_eof(VALUE self) {
+  re2_scanner *c;
+  Data_Get_Struct(self, re2_scanner, c);
+
+  return BOOL2RUBY(c->eof);
+}
+
+/*
+ * Rewind the scanner to the start of the string.
+ *
+ * @example
+ *   s = RE2::Regexp.new('(\d+)').scan("1 2 3")
+ *   e = s.to_enum
+ *   e.scan #=> ["1"]
+ *   e.scan #=> ["2"]
+ *   s.rewind
+ *   e.scan #=> ["1"]
+ */
+static VALUE re2_scanner_rewind(VALUE self) {
+  re2_scanner *c;
+  Data_Get_Struct(self, re2_scanner, c);
+
+  c->input = new(nothrow) re2::StringPiece(StringValuePtr(c->text));
+  c->eof = false;
+
+  return self;
+}
+
+/*
+ * Scan the given text incrementally for matches, returning an array of
+ * matches on each subsequent call. Returns nil if no matches are found.
+ *
+ * @return [Array<String>] the matches.
+ * @example
+ *   s = RE2::Regexp.new('(\w+)').scan("Foo bar baz")
+ *   s.scan #=> ["Foo"]
+ *   s.scan #=> ["bar"]
+ */
+static VALUE re2_scanner_scan(VALUE self) {
+  int i;
+  size_t original_input_size, new_input_size;
+  bool input_advanced;
+  re2_pattern *p;
+  re2_scanner *c;
+  VALUE result;
+
+  Data_Get_Struct(self, re2_scanner, c);
+  Data_Get_Struct(c->regexp, re2_pattern, p);
+
+  vector<RE2::Arg> argv(c->number_of_capturing_groups);
+  vector<RE2::Arg*> args(c->number_of_capturing_groups);
+  vector<string> matches(c->number_of_capturing_groups);
+
+  if (c->eof) {
+    return Qnil;
+  }
+
+  original_input_size = c->input->size();
+
+  for (i = 0; i < c->number_of_capturing_groups; i++) {
+    matches[i] = "";
+    argv[i] = &matches[i];
+    args[i] = &argv[i];
+  }
+
+  if (RE2::FindAndConsumeN(c->input, *p->pattern, &args[0],
+        c->number_of_capturing_groups)) {
+    result = rb_ary_new2(c->number_of_capturing_groups);
+    new_input_size = c->input->size();
+    input_advanced = new_input_size < original_input_size;
+
+    for (i = 0; i < c->number_of_capturing_groups; i++) {
+      if (matches[i].empty()) {
+        rb_ary_push(result, Qnil);
+      } else {
+        rb_ary_push(result, ENCODED_STR_NEW(matches[i].data(),
+              matches[i].size(),
+              p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1"));
+      }
+    }
+
+    /* Check whether we've exhausted the input yet. */
+    c->eof = new_input_size == 0;
+
+    /* If the match didn't advance the input, we need to do this ourselves. */
+    if (!input_advanced && new_input_size > 0) {
+      c->input->remove_prefix(1);
+    }
+  } else {
+    result = Qnil;
+  }
+
+  return result;
+}
+
+/*
+ * Retrieve a matchdata by index or name.
+ */
+re2::StringPiece *re2_matchdata_find_match(VALUE idx, VALUE self) {
+  int id;
+  re2_matchdata *m;
+  re2_pattern *p;
+  map<string, int> groups;
+  string name;
+  re2::StringPiece *match;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  if (FIXNUM_P(idx)) {
+    id = FIX2INT(idx);
+  } else {
+    if (SYMBOL_P(idx)) {
+      name = rb_id2name(SYM2ID(idx));
+    } else {
+      name = StringValuePtr(idx);
+    }
+
+    groups = p->pattern->NamedCapturingGroups();
+
+    if (groups.count(name) == 1) {
+      id = groups[name];
+    } else {
+      return NULL;
+    }
+  }
+
+  if (id >= 0 && id < m->number_of_matches) {
+    match = &m->matches[id];
+
+    if (!match->empty()) {
+      return match;
+    }
+  }
+
+  return NULL;
+}
+
+/*
+ * Returns the number of elements in the match array (including nils).
+ *
+ * @return [Integer] the number of elements
+ * @example
+ *   m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *   m.size      #=> 2
+ *   m.length    #=> 2
+ */
+static VALUE re2_matchdata_size(VALUE self) {
+  re2_matchdata *m;
+  Data_Get_Struct(self, re2_matchdata, m);
+
+  return INT2FIX(m->number_of_matches);
+}
+
+/*
+ * Returns the offset of the start of the nth element of the matchdata.
+ *
+ * @param [Integer, String, Symbol] n the name or number of the match
+ * @return [Integer] the offset of the start of the match
+ * @example
+ *   m = RE2::Regexp.new('ob (\d+)').match("bob 123")
+ *   m.begin(0)  #=> 1
+ *   m.begin(1)  #=> 4
+ */
+static VALUE re2_matchdata_begin(VALUE self, VALUE n) {
+  re2_matchdata *m;
+  re2_pattern *p;
+  re2::StringPiece *match;
+  long offset;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  match = re2_matchdata_find_match(n, self);
+  if (match == NULL) {
+    return Qnil;
+  } else {
+    offset = reinterpret_cast<uintptr_t>(match->data()) - reinterpret_cast<uintptr_t>(StringValuePtr(m->text));
+
+    return ENCODED_STR_SUBLEN(StringValue(m->text), offset,
+           p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+  }
+}
+
+/*
+ * Returns the offset of the character following the end of the nth element of the matchdata.
+ *
+ * @param [Integer, String, Symbol] n the name or number of the match
+ * @return [Integer] the offset of the character following the end of the match
+ * @example
+ *   m = RE2::Regexp.new('ob (\d+) b').match("bob 123 bob")
+ *   m.end(0)  #=> 9
+ *   m.end(1)  #=> 7
+ */
+static VALUE re2_matchdata_end(VALUE self, VALUE n) {
+  re2_matchdata *m;
+  re2_pattern *p;
+  re2::StringPiece *match;
+  long offset;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  match = re2_matchdata_find_match(n, self);
+
+  if (match == NULL) {
+    return Qnil;
+  } else {
+    offset = reinterpret_cast<uintptr_t>(match->data()) - reinterpret_cast<uintptr_t>(StringValuePtr(m->text)) + match->size();
+
+    return ENCODED_STR_SUBLEN(StringValue(m->text), offset,
+           p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+  }
+}
+
+/*
+ * Returns the {RE2::Regexp} used in the match.
+ *
+ * @return [RE2::Regexp] the regexp used in the match
+ * @example
+ *   m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *   m.regexp    #=> #<RE2::Regexp /(\d+)/>
+ */
+static VALUE re2_matchdata_regexp(VALUE self) {
+  re2_matchdata *m;
+  Data_Get_Struct(self, re2_matchdata, m);
+  return m->regexp;
+}
+
+/*
+ * Returns the {RE2::Regexp} used in the scanner.
+ *
+ * @return [RE2::Regexp] the regexp used in the scanner
+ * @example
+ *   c = RE2::Regexp.new('(\d+)').scan("bob 123")
+ *   c.regexp    #=> #<RE2::Regexp /(\d+)/>
+ */
+static VALUE re2_scanner_regexp(VALUE self) {
+  re2_scanner *c;
+  Data_Get_Struct(self, re2_scanner, c);
+
+  return c->regexp;
+}
+
+static VALUE re2_regexp_allocate(VALUE klass) {
+  re2_pattern *p;
+  return Data_Make_Struct(klass, re2_pattern, 0, re2_regexp_free, p);
+}
+
+/*
+ * Returns the array of matches.
+ *
+ * @return [Array<String, nil>] the array of matches
+ * @example
+ *   m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *   m.to_a    #=> ["123", "123"]
+ */
+static VALUE re2_matchdata_to_a(VALUE self) {
+  int i;
+  re2_matchdata *m;
+  re2_pattern *p;
+  re2::StringPiece *match;
+  VALUE array;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  array = rb_ary_new2(m->number_of_matches);
+  for (i = 0; i < m->number_of_matches; i++) {
+    match = &m->matches[i];
+
+    if (match->empty()) {
+      rb_ary_push(array, Qnil);
+    } else {
+      rb_ary_push(array, ENCODED_STR_NEW(match->data(), match->size(),
+            p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1"));
+    }
+  }
+
+  return array;
+}
+
+static VALUE re2_matchdata_nth_match(int nth, VALUE self) {
+  re2_matchdata *m;
+  re2_pattern *p;
+  re2::StringPiece *match;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  if (nth < 0 || nth >= m->number_of_matches) {
+    return Qnil;
+  } else {
+    match = &m->matches[nth];
+
+    if (match->empty()) {
+      return Qnil;
+    } else {
+      return ENCODED_STR_NEW(match->data(), match->size(),
+          p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+    }
+  }
+}
+
+static VALUE re2_matchdata_named_match(const char* name, VALUE self) {
+  int idx;
+  re2_matchdata *m;
+  re2_pattern *p;
+  map<string, int> groups;
+  string name_as_string(name);
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  groups = p->pattern->NamedCapturingGroups();
+
+  if (groups.count(name_as_string) == 1) {
+    idx = groups[name_as_string];
+    return re2_matchdata_nth_match(idx, self);
+  } else {
+    return Qnil;
+  }
+}
+
+/*
+ * Retrieve zero, one or more matches by index or name.
+ *
+ * @return [Array<String, nil>, String, Boolean]
+ *
+ * @overload [](index)
+ *   Access a particular match by index.
+ *
+ *   @param [Integer] index the index of the match to fetch
+ *   @return [String, nil] the specified match
+ *   @example
+ *     m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *     m[0]    #=> "123"
+ *
+ * @overload [](start, length)
+ *   Access a range of matches by starting index and length.
+ *
+ *   @param [Integer] start the index from which to start
+ *   @param [Integer] length the number of elements to fetch
+ *   @return [Array<String, nil>] the specified matches
+ *   @example
+ *     m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *     m[0, 1]    #=> ["123"]
+ *
+ * @overload [](range)
+ *   Access a range of matches by index.
+ *
+ *   @param [Range] range the range of match indexes to fetch
+ *   @return [Array<String, nil>] the specified matches
+ *   @example
+ *     m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *     m[0..1]    #=> "[123", "123"]
+ *
+ * @overload [](name)
+ *   Access a particular match by name.
+ *
+ *   @param [String, Symbol] name the name of the match to fetch
+ *   @return [String, nil] the specific match
+ *   @example
+ *     m = RE2::Regexp.new('(?P<number>\d+)').match("bob 123")
+ *     m["number"] #=> "123"
+ *     m[:number]  #=> "123"
+ */
+static VALUE re2_matchdata_aref(int argc, VALUE *argv, VALUE self) {
+  VALUE idx, rest;
+  rb_scan_args(argc, argv, "11", &idx, &rest);
+
+  if (TYPE(idx) == T_STRING) {
+    return re2_matchdata_named_match(StringValuePtr(idx), self);
+  } else if (SYMBOL_P(idx)) {
+    return re2_matchdata_named_match(rb_id2name(SYM2ID(idx)), self);
+  } else if (!NIL_P(rest) || !FIXNUM_P(idx) || FIX2INT(idx) < 0) {
+    return rb_ary_aref(argc, argv, re2_matchdata_to_a(self));
+  } else {
+    return re2_matchdata_nth_match(FIX2INT(idx), self);
+  }
+}
+
+/*
+ * Returns the entire matched string.
+ *
+ * @return [String] the entire matched string
+ */
+static VALUE re2_matchdata_to_s(VALUE self) {
+  return re2_matchdata_nth_match(0, self);
+}
+
+/*
+ * Returns a printable version of the match.
+ *
+ * @return [String] a printable version of the match
+ * @example
+ *   m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *   m.inspect    #=> "#<RE2::MatchData \"123\" 1:\"123\">"
+ */
+static VALUE re2_matchdata_inspect(VALUE self) {
+  int i;
+  re2_matchdata *m;
+  re2_pattern *p;
+  VALUE match, result;
+  ostringstream output;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  output << "#<RE2::MatchData";
+
+  for (i = 0; i < m->number_of_matches; i++) {
+    output << " ";
+
+    if (i > 0) {
+      output << i << ":";
+    }
+
+    match = re2_matchdata_nth_match(i, self);
+
+    if (match == Qnil) {
+      output << "nil";
+    } else {
+      output << "\"" << StringValuePtr(match) << "\"";
+    }
+  }
+
+  output << ">";
+
+  result = ENCODED_STR_NEW(output.str().data(), output.str().length(),
+      p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+
+  return result;
+}
+
+/*
+ * Returns the array of submatches for pattern matching.
+ *
+ * @return [Array<String, nil>] the array of submatches
+ * @example
+ *   m = RE2::Regexp.new('(\d+)').match("bob 123")
+ *   m.deconstruct    #=> ["123"]
+ *
+ * @example pattern matching
+ *   case RE2::Regexp.new('(\d+) (\d+)').match("bob 123 456")
+ *   in x, y
+ *     puts "Matched #{x} #{y}"
+ *   else
+ *     puts "Unrecognised match"
+ *   end
+ */
+static VALUE re2_matchdata_deconstruct(VALUE self) {
+  int i;
+  re2_matchdata *m;
+  re2_pattern *p;
+  re2::StringPiece *match;
+  VALUE array;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  array = rb_ary_new2(m->number_of_matches - 1);
+  for (i = 1; i < m->number_of_matches; i++) {
+    match = &m->matches[i];
+
+    if (match->empty()) {
+      rb_ary_push(array, Qnil);
+    } else {
+      rb_ary_push(array, ENCODED_STR_NEW(match->data(), match->size(),
+            p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1"));
+    }
+  }
+
+  return array;
+}
+
+/*
+ * Returns a hash of capturing group names to submatches for pattern matching.
+ *
+ * As this is used by Ruby's pattern matching, it will return an empty hash if given
+ * more keys than there are capturing groups. Given keys will populate the hash in
+ * order but an invalid name will cause the hash to be immediately returned.
+ *
+ * @return [Hash] a hash of capturing group names to submatches
+ * @param [Array<Symbol>, nil] keys an array of Symbol capturing group names or nil to return all names
+ * @example
+ *   m = RE2::Regexp.new('(?P<numbers>\d+) (?P<letters>[a-zA-Z]+)').match('123 abc')
+ *   m.deconstruct_keys(nil)                  #=> {:numbers => "123", :letters => "abc"}
+ *   m.deconstruct_keys([:numbers])           #=> {:numbers => "123"}
+ *   m.deconstruct_keys([:fruit])             #=> {}
+ *   m.deconstruct_keys([:letters, :fruit])   #=> {:letters => "abc"}
+ *
+ * @example pattern matching
+ *   case RE2::Regexp.new('(?P<numbers>\d+) (?P<letters>[a-zA-Z]+)').match('123 abc')
+ *   in numbers:, letters:
+ *     puts "Numbers: #{numbers}, letters: #{letters}"
+ *   else
+ *     puts "Unrecognised match"
+ *   end
+ */
+static VALUE re2_matchdata_deconstruct_keys(VALUE self, VALUE keys) {
+  int i;
+  VALUE capturing_groups, key;
+  re2_matchdata *m;
+  re2_pattern *p;
+  map<string, int> groups;
+  map<string, int>::iterator iterator;
+
+  Data_Get_Struct(self, re2_matchdata, m);
+  Data_Get_Struct(m->regexp, re2_pattern, p);
+
+  groups = p->pattern->NamedCapturingGroups();
+  capturing_groups = rb_hash_new();
+
+  if (NIL_P(keys)) {
+    for (iterator = groups.begin(); iterator != groups.end(); iterator++) {
+      rb_hash_aset(capturing_groups,
+          ID2SYM(rb_intern(iterator->first.data())),
+          re2_matchdata_nth_match(iterator->second, self));
+    }
+  } else {
+    Check_Type(keys, T_ARRAY);
+
+    if (p->pattern->NumberOfCapturingGroups() >= RARRAY_LEN(keys)) {
+      for (i = 0; i < RARRAY_LEN(keys); i++) {
+        key = rb_ary_entry(keys, i);
+        Check_Type(key, T_SYMBOL);
+        string name(rb_id2name(SYM2ID(key)));
+
+        if (groups.count(name) == 0) {
+          break;
+        }
+
+        rb_hash_aset(capturing_groups, key, re2_matchdata_nth_match(groups[name], self));
+      }
+    }
+  }
+
+  return capturing_groups;
+}
+
+/*
+ * Returns a new RE2 object with a compiled version of
+ * +pattern+ stored inside. Equivalent to +RE2::Regexp.new+.
+ *
+ * @see RE2::Regexp#initialize
+ *
+ */
+static VALUE re2_re2(int argc, VALUE *argv, VALUE self) {
+  UNUSED(self);
+  return rb_class_new_instance(argc, argv, re2_cRegexp);
+}
+
+/*
+ * Returns a new {RE2::Regexp} object with a compiled version of
+ * +pattern+ stored inside.
+ *
+ * @return [RE2::Regexp]
+ *
+ * @overload initialize(pattern)
+ *   Returns a new {RE2::Regexp} object with a compiled version of
+ *   +pattern+ stored inside with the default options.
+ *
+ *   @param [String] pattern the pattern to compile
+ *   @return [RE2::Regexp] an RE2::Regexp with the specified pattern
+ *   @raise [NoMemoryError] if memory could not be allocated for the compiled
+ *                          pattern
+ *
+ * @overload initialize(pattern, options)
+ *   Returns a new {RE2::Regexp} object with a compiled version of
+ *   +pattern+ stored inside with the specified options.
+ *
+ *   @param [String] pattern the pattern to compile
+ *   @param [Hash] options the options with which to compile the pattern
+ *   @option options [Boolean] :utf8 (true) text and pattern are UTF-8; otherwise Latin-1
+ *   @option options [Boolean] :posix_syntax (false) restrict regexps to POSIX egrep syntax
+ *   @option options [Boolean] :longest_match (false) search for longest match, not first match
+ *   @option options [Boolean] :log_errors (true) log syntax and execution errors to ERROR
+ *   @option options [Integer] :max_mem approx. max memory footprint of RE2
+ *   @option options [Boolean] :literal (false) interpret string as literal, not regexp
+ *   @option options [Boolean] :never_nl (false) never match \n, even if it is in regexp
+ *   @option options [Boolean] :case_sensitive (true) match is case-sensitive (regexp can override with (?i) unless in posix_syntax mode)
+ *   @option options [Boolean] :perl_classes (false) allow Perl's \d \s \w \D \S \W when in posix_syntax mode
+ *   @option options [Boolean] :word_boundary (false) allow \b \B (word boundary and not) when in posix_syntax mode
+ *   @option options [Boolean] :one_line (false) ^ and $ only match beginning and end of text when in posix_syntax mode
+ *   @return [RE2::Regexp] an RE2::Regexp with the specified pattern and options
+ *   @raise [NoMemoryError] if memory could not be allocated for the compiled pattern
+ */
+static VALUE re2_regexp_initialize(int argc, VALUE *argv, VALUE self) {
+  VALUE pattern, options;
+  re2_pattern *p;
+
+  rb_scan_args(argc, argv, "11", &pattern, &options);
+  Data_Get_Struct(self, re2_pattern, p);
+
+  if (RTEST(options)) {
+    RE2::Options re2_options;
+    parse_re2_options(re2_options, options);
+
+    p->pattern = new(nothrow) RE2(StringValuePtr(pattern), re2_options);
+  } else {
+    p->pattern = new(nothrow) RE2(StringValuePtr(pattern));
+  }
+
+  if (p->pattern == 0) {
+    rb_raise(rb_eNoMemError, "not enough memory to allocate RE2 object");
+  }
+
+  return self;
+}
+
+/*
+ * Returns a printable version of the regular expression +re2+.
+ *
+ * @return [String] a printable version of the regular expression
+ * @example
+ *   re2 = RE2::Regexp.new("woo?")
+ *   re2.inspect    #=> "#<RE2::Regexp /woo?/>"
+ */
+static VALUE re2_regexp_inspect(VALUE self) {
+  re2_pattern *p;
+  VALUE result;
+  ostringstream output;
+
+  Data_Get_Struct(self, re2_pattern, p);
+
+  output << "#<RE2::Regexp /" << p->pattern->pattern() << "/>";
+
+  result = ENCODED_STR_NEW(output.str().data(), output.str().length(),
+      p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+
+  return result;
+}
+
+/*
+ * Returns a string version of the regular expression +re2+.
+ *
+ * @return [String] a string version of the regular expression
+ * @example
+ *   re2 = RE2::Regexp.new("woo?")
+ *   re2.to_s    #=> "woo?"
+ */
+static VALUE re2_regexp_to_s(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return ENCODED_STR_NEW(p->pattern->pattern().data(),
+      p->pattern->pattern().size(),
+      p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled successfully or not.
+ *
+ * @return [Boolean] whether or not compilation was successful
+ * @example
+ *   re2 = RE2::Regexp.new("woo?")
+ *   re2.ok?    #=> true
+ */
+static VALUE re2_regexp_ok(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->ok());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the utf8 option set to true.
+ *
+ * @return [Boolean] the utf8 option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :utf8 => true)
+ *   re2.utf8?    #=> true
+ */
+static VALUE re2_regexp_utf8(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().encoding() == RE2::Options::EncodingUTF8);
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the posix_syntax option set to true.
+ *
+ * @return [Boolean] the posix_syntax option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :posix_syntax => true)
+ *   re2.posix_syntax?    #=> true
+ */
+static VALUE re2_regexp_posix_syntax(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().posix_syntax());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the longest_match option set to true.
+ *
+ * @return [Boolean] the longest_match option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :longest_match => true)
+ *   re2.longest_match?    #=> true
+ */
+static VALUE re2_regexp_longest_match(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().longest_match());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the log_errors option set to true.
+ *
+ * @return [Boolean] the log_errors option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :log_errors => true)
+ *   re2.log_errors?    #=> true
+ */
+static VALUE re2_regexp_log_errors(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().log_errors());
+}
+
+/*
+ * Returns the max_mem setting for the regular expression
+ * +re2+.
+ *
+ * @return [Integer] the max_mem option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :max_mem => 1024)
+ *   re2.max_mem    #=> 1024
+ */
+static VALUE re2_regexp_max_mem(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return INT2FIX(p->pattern->options().max_mem());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the literal option set to true.
+ *
+ * @return [Boolean] the literal option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :literal => true)
+ *   re2.literal?    #=> true
+ */
+static VALUE re2_regexp_literal(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().literal());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the never_nl option set to true.
+ *
+ * @return [Boolean] the never_nl option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :never_nl => true)
+ *   re2.never_nl?    #=> true
+ */
+static VALUE re2_regexp_never_nl(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().never_nl());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the case_sensitive option set to true.
+ *
+ * @return [Boolean] the case_sensitive option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :case_sensitive => true)
+ *   re2.case_sensitive?    #=> true
+ */
+static VALUE re2_regexp_case_sensitive(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().case_sensitive());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the case_sensitive option set to false.
+ *
+ * @return [Boolean] the inverse of the case_sensitive option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :case_sensitive => true)
+ *   re2.case_insensitive?    #=> false
+ *   re2.casefold?    #=> false
+ */
+static VALUE re2_regexp_case_insensitive(VALUE self) {
+  return BOOL2RUBY(re2_regexp_case_sensitive(self) != Qtrue);
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the perl_classes option set to true.
+ *
+ * @return [Boolean] the perl_classes option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :perl_classes => true)
+ *   re2.perl_classes?    #=> true
+ */
+static VALUE re2_regexp_perl_classes(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().perl_classes());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the word_boundary option set to true.
+ *
+ * @return [Boolean] the word_boundary option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :word_boundary => true)
+ *   re2.word_boundary?    #=> true
+ */
+static VALUE re2_regexp_word_boundary(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().word_boundary());
+}
+
+/*
+ * Returns whether or not the regular expression +re2+
+ * was compiled with the one_line option set to true.
+ *
+ * @return [Boolean] the one_line option
+ * @example
+ *   re2 = RE2::Regexp.new("woo?", :one_line => true)
+ *   re2.one_line?    #=> true
+ */
+static VALUE re2_regexp_one_line(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return BOOL2RUBY(p->pattern->options().one_line());
+}
+
+/*
+ * If the RE2 could not be created properly, returns an
+ * error string otherwise returns nil.
+ *
+ * @return [String, nil] the error string or nil
+ */
+static VALUE re2_regexp_error(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  if (p->pattern->ok()) {
+    return Qnil;
+  } else {
+    return rb_str_new(p->pattern->error().data(), p->pattern->error().size());
+  }
+}
+
+/*
+ * If the RE2 could not be created properly, returns
+ * the offending portion of the regexp otherwise returns nil.
+ *
+ * @return [String, nil] the offending portion of the regexp or nil
+ */
+static VALUE re2_regexp_error_arg(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  if (p->pattern->ok()) {
+    return Qnil;
+  } else {
+    return ENCODED_STR_NEW(p->pattern->error_arg().data(),
+        p->pattern->error_arg().size(),
+        p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+  }
+}
+
+/*
+ * Returns the program size, a very approximate measure
+ * of a regexp's "cost". Larger numbers are more expensive
+ * than smaller numbers.
+ *
+ * @return [Integer] the regexp "cost"
+ */
+static VALUE re2_regexp_program_size(VALUE self) {
+  re2_pattern *p;
+  Data_Get_Struct(self, re2_pattern, p);
+  return INT2FIX(p->pattern->ProgramSize());
+}
+
+/*
+ * Returns a hash of the options currently set for
+ * +re2+.
+ *
+ * @return [Hash] the options
+ */
+static VALUE re2_regexp_options(VALUE self) {
+  VALUE options;
+  re2_pattern *p;
+
+  Data_Get_Struct(self, re2_pattern, p);
+  options = rb_hash_new();
+
+  rb_hash_aset(options, ID2SYM(id_utf8),
+      BOOL2RUBY(p->pattern->options().encoding() == RE2::Options::EncodingUTF8));
+
+  rb_hash_aset(options, ID2SYM(id_posix_syntax),
+      BOOL2RUBY(p->pattern->options().posix_syntax()));
+
+  rb_hash_aset(options, ID2SYM(id_longest_match),
+      BOOL2RUBY(p->pattern->options().longest_match()));
+
+  rb_hash_aset(options, ID2SYM(id_log_errors),
+      BOOL2RUBY(p->pattern->options().log_errors()));
+
+  rb_hash_aset(options, ID2SYM(id_max_mem),
+      INT2FIX(p->pattern->options().max_mem()));
+
+  rb_hash_aset(options, ID2SYM(id_literal),
+      BOOL2RUBY(p->pattern->options().literal()));
+
+  rb_hash_aset(options, ID2SYM(id_never_nl),
+      BOOL2RUBY(p->pattern->options().never_nl()));
+
+  rb_hash_aset(options, ID2SYM(id_case_sensitive),
+      BOOL2RUBY(p->pattern->options().case_sensitive()));
+
+  rb_hash_aset(options, ID2SYM(id_perl_classes),
+      BOOL2RUBY(p->pattern->options().perl_classes()));
+
+  rb_hash_aset(options, ID2SYM(id_word_boundary),
+      BOOL2RUBY(p->pattern->options().word_boundary()));
+
+  rb_hash_aset(options, ID2SYM(id_one_line),
+      BOOL2RUBY(p->pattern->options().one_line()));
+
+  /* This is a read-only hash after all... */
+  rb_obj_freeze(options);
+
+  return options;
+}
+
+/*
+ * Returns the number of capturing subpatterns, or -1 if the regexp
+ * wasn't valid on construction. The overall match ($0) does not
+ * count: if the regexp is "(a)(b)", returns 2.
+ *
+ * @return [Integer] the number of capturing subpatterns
+ */
+static VALUE re2_regexp_number_of_capturing_groups(VALUE self) {
+  re2_pattern *p;
+
+  Data_Get_Struct(self, re2_pattern, p);
+  return INT2FIX(p->pattern->NumberOfCapturingGroups());
+}
+
+/*
+ * Returns a hash of names to capturing indices of groups.
+ *
+ * @return [Hash] a hash of names to capturing indices
+ */
+static VALUE re2_regexp_named_capturing_groups(VALUE self) {
+  VALUE capturing_groups;
+  re2_pattern *p;
+  map<string, int> groups;
+  map<string, int>::iterator iterator;
+
+  Data_Get_Struct(self, re2_pattern, p);
+  groups = p->pattern->NamedCapturingGroups();
+  capturing_groups = rb_hash_new();
+
+  for (iterator = groups.begin(); iterator != groups.end(); iterator++) {
+    rb_hash_aset(capturing_groups,
+        ENCODED_STR_NEW(iterator->first.data(), iterator->first.size(),
+          p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1"),
+        INT2FIX(iterator->second));
+  }
+
+  return capturing_groups;
+}
+
+/*
+ * Match the pattern against the given +text+ and return either
+ * a boolean (if no submatches are required) or a {RE2::MatchData}
+ * instance.
+ *
+ * @return [Boolean, RE2::MatchData]
+ *
+ * @overload match(text)
+ *   Returns an {RE2::MatchData} containing the matching
+ *   pattern and all subpatterns resulting from looking for
+ *   the regexp in +text+.
+ *
+ *   @param [String] text the text to search
+ *   @return [RE2::MatchData] the matches
+ *   @raise [NoMemoryError] if there was not enough memory to allocate the matches
+ *   @example
+ *     r = RE2::Regexp.new('w(o)(o)')
+ *     r.match('woo')    #=> #<RE2::MatchData "woo" 1:"o" 2:"o">
+ *
+ * @overload match(text, 0)
+ *   Returns either true or false indicating whether a
+ *   successful match was made.
+ *
+ *   @param [String] text the text to search
+ *   @return [Boolean] whether the match was successful
+ *   @raise [NoMemoryError] if there was not enough memory to allocate the matches
+ *   @example
+ *     r = RE2::Regexp.new('w(o)(o)')
+ *     r.match('woo', 0) #=> true
+ *     r.match('bob', 0) #=> false
+ *
+ * @overload match(text, number_of_matches)
+ *   See +match(text)+ but with a specific number of
+ *   matches returned (padded with nils if necessary).
+ *
+ *   @param [String] text the text to search
+ *   @param [Integer] number_of_matches the number of matches to return
+ *   @return [RE2::MatchData] the matches
+ *   @raise [ArgumentError] if given a negative number of matches
+ *   @raise [NoMemoryError] if there was not enough memory to allocate the matches
+ *   @example
+ *     r = RE2::Regexp.new('w(o)(o)')
+ *     r.match('woo', 1) #=> #<RE2::MatchData "woo" 1:"o">
+ *     r.match('woo', 3) #=> #<RE2::MatchData "woo" 1:"o" 2:"o" 3:nil>
+ */
+static VALUE re2_regexp_match(int argc, VALUE *argv, VALUE self) {
+  int n;
+  bool matched;
+  re2_pattern *p;
+  re2_matchdata *m;
+  VALUE text, number_of_matches, matchdata;
+
+  rb_scan_args(argc, argv, "11", &text, &number_of_matches);
+
+  /* Ensure text is a string. */
+  text = StringValue(text);
+
+  Data_Get_Struct(self, re2_pattern, p);
+
+  if (RTEST(number_of_matches)) {
+    n = NUM2INT(number_of_matches);
+
+    if (n < 0) {
+      rb_raise(rb_eArgError, "number of matches should be >= 0");
+    }
+  } else {
+    if (!p->pattern->ok()) {
+      return Qnil;
+    }
+
+    n = p->pattern->NumberOfCapturingGroups();
+  }
+
+  if (n == 0) {
+    matched = match(p->pattern, StringValuePtr(text), 0,
+        static_cast<int>(RSTRING_LEN(text)), RE2::UNANCHORED, 0, 0);
+    return BOOL2RUBY(matched);
+  } else {
+
+    /* Because match returns the whole match as well. */
+    n += 1;
+
+    matchdata = rb_class_new_instance(0, 0, re2_cMatchData);
+    Data_Get_Struct(matchdata, re2_matchdata, m);
+    m->matches = new(nothrow) re2::StringPiece[n];
+    m->regexp = self;
+    m->text = rb_str_dup(text);
+    rb_str_freeze(m->text);
+
+    if (m->matches == 0) {
+      rb_raise(rb_eNoMemError,
+               "not enough memory to allocate StringPieces for matches");
+    }
+
+    m->number_of_matches = n;
+
+    matched = match(p->pattern, StringValuePtr(m->text), 0,
+                    static_cast<int>(RSTRING_LEN(m->text)),
+                    RE2::UNANCHORED, m->matches, n);
+
+    if (matched) {
+      return matchdata;
+    } else {
+      return Qnil;
+    }
+  }
+}
+
+/*
+ * Returns true or false to indicate a successful match.
+ * Equivalent to +re2.match(text, 0)+.
+ *
+ * @return [Boolean] whether the match was successful
+ */
+static VALUE re2_regexp_match_p(VALUE self, VALUE text) {
+  VALUE argv[2];
+  argv[0] = text;
+  argv[1] = INT2FIX(0);
+
+  return re2_regexp_match(2, argv, self);
+}
+
+/*
+ * Returns a {RE2::Scanner} for scanning the given text incrementally.
+ *
+ * @example
+ *   c = RE2::Regexp.new('(\w+)').scan("Foo bar baz")
+ */
+static VALUE re2_regexp_scan(VALUE self, VALUE text) {
+  re2_pattern *p;
+  re2_scanner *c;
+  VALUE scanner;
+
+  Data_Get_Struct(self, re2_pattern, p);
+  scanner = rb_class_new_instance(0, 0, re2_cScanner);
+  Data_Get_Struct(scanner, re2_scanner, c);
+
+  c->input = new(nothrow) re2::StringPiece(StringValuePtr(text));
+  c->regexp = self;
+  c->text = text;
+
+  if (p->pattern->ok()) {
+    c->number_of_capturing_groups = p->pattern->NumberOfCapturingGroups();
+  } else {
+    c->number_of_capturing_groups = 0;
+  }
+
+  c->eof = false;
+
+  return scanner;
+}
+
+/*
+ * Returns a copy of +str+ with the first occurrence +pattern+
+ * replaced with +rewrite+.
+ *
+ * @param [String] str the string to modify
+ * @param [String, RE2::Regexp] pattern a regexp matching text to be replaced
+ * @param [String] rewrite the string to replace with
+ * @return [String] the resulting string
+ * @example
+ *   RE2.Replace("hello there", "hello", "howdy") #=> "howdy there"
+ *   re2 = RE2::Regexp.new("hel+o")
+ *   RE2.Replace("hello there", re2, "yo")        #=> "yo there"
+ */
+static VALUE re2_Replace(VALUE self, VALUE str, VALUE pattern,
+    VALUE rewrite) {
+  UNUSED(self);
+  re2_pattern *p;
+
+  /* Convert all the inputs to be pumped into RE2::Replace. */
+  string str_as_string(StringValuePtr(str));
+
+  /* Do the replacement. */
+  if (rb_obj_is_kind_of(pattern, re2_cRegexp)) {
+    Data_Get_Struct(pattern, re2_pattern, p);
+    RE2::Replace(&str_as_string, *p->pattern, StringValuePtr(rewrite));
+
+    return ENCODED_STR_NEW(str_as_string.data(), str_as_string.size(),
+        p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+  } else {
+    RE2::Replace(&str_as_string, StringValuePtr(pattern),
+        StringValuePtr(rewrite));
+
+    return ENCODED_STR_NEW2(str_as_string.data(), str_as_string.size(),
+        pattern);
+  }
+
+}
+
+/*
+ * Return a copy of +str+ with +pattern+ replaced by +rewrite+.
+ *
+ * @param [String] str the string to modify
+ * @param [String, RE2::Regexp] pattern a regexp matching text to be replaced
+ * @param [String] rewrite the string to replace with
+ * @return [String] the resulting string
+ * @example
+ *   re2 = RE2::Regexp.new("oo?")
+ *   RE2.GlobalReplace("whoops-doops", re2, "e")  #=> "wheps-deps"
+ *   RE2.GlobalReplace("hello there", "e", "i")   #=> "hillo thiri"
+ */
+static VALUE re2_GlobalReplace(VALUE self, VALUE str, VALUE pattern,
+                               VALUE rewrite) {
+  UNUSED(self);
+
+  /* Convert all the inputs to be pumped into RE2::GlobalReplace. */
+  re2_pattern *p;
+  string str_as_string(StringValuePtr(str));
+
+  /* Do the replacement. */
+  if (rb_obj_is_kind_of(pattern, re2_cRegexp)) {
+    Data_Get_Struct(pattern, re2_pattern, p);
+    RE2::GlobalReplace(&str_as_string, *p->pattern, StringValuePtr(rewrite));
+
+    return ENCODED_STR_NEW(str_as_string.data(), str_as_string.size(),
+        p->pattern->options().encoding() == RE2::Options::EncodingUTF8 ? "UTF-8" : "ISO-8859-1");
+  } else {
+    RE2::GlobalReplace(&str_as_string, StringValuePtr(pattern),
+                       StringValuePtr(rewrite));
+
+    return ENCODED_STR_NEW2(str_as_string.data(), str_as_string.size(),
+        pattern);
+  }
+}
+
+/*
+ * Returns a version of str with all potentially meaningful regexp
+ * characters escaped. The returned string, used as a regular
+ * expression, will exactly match the original string.
+ *
+ * @param [String] unquoted the unquoted string
+ * @return [String] the escaped string
+ * @example
+ *   RE2::Regexp.escape("1.5-2.0?")    #=> "1\.5\-2\.0\?"
+ */
+static VALUE re2_QuoteMeta(VALUE self, VALUE unquoted) {
+  UNUSED(self);
+  string quoted_string = RE2::QuoteMeta(StringValuePtr(unquoted));
+  return rb_str_new(quoted_string.data(), quoted_string.size());
+}
+
+void re2_set_free(re2_set *self) {
+  if (self->set) {
+    delete self->set;
+  }
+  free(self);
+}
+
+static VALUE re2_set_allocate(VALUE klass) {
+  re2_set *s;
+  VALUE result = Data_Make_Struct(klass, re2_set, 0, re2_set_free, s);
+  return result;
+}
+
+/*
+ * Returns a new {RE2::Set} object, a collection of patterns that can be
+ * searched for simultaneously.
+ *
+ * @return [RE2::Set]
+ *
+ * @overload initialize
+ *   Returns a new {RE2::Set} object for unanchored patterns with the default
+ *   options.
+ *
+ *   @raise [NoMemoryError] if memory could not be allocated for the compiled pattern
+ *   @return [RE2::Set]
+ *
+ * @overload initialize(anchor)
+ *   Returns a new {RE2::Set} object for the specified anchor with the default
+ *   options.
+ *
+ *   @param [Symbol] anchor One of :unanchored, :anchor_start, :anchor_both
+ *   @raise [ArgumentError] if anchor is not :unanchored, :anchor_start or :anchor_both
+ *   @raise [NoMemoryError] if memory could not be allocated for the compiled pattern
+ *
+ * @overload initialize(anchor, options)
+ *   Returns a new {RE2::Set} object with the specified options.
+ *
+ *   @param [Symbol] anchor One of :unanchored, :anchor_start, :anchor_both
+ *   @param [Hash] options the options with which to compile the pattern
+ *   @option options [Boolean] :utf8 (true) text and pattern are UTF-8; otherwise Latin-1
+ *   @option options [Boolean] :posix_syntax (false) restrict regexps to POSIX egrep syntax
+ *   @option options [Boolean] :longest_match (false) search for longest match, not first match
+ *   @option options [Boolean] :log_errors (true) log syntax and execution errors to ERROR
+ *   @option options [Integer] :max_mem approx. max memory footprint of RE2
+ *   @option options [Boolean] :literal (false) interpret string as literal, not regexp
+ *   @option options [Boolean] :never_nl (false) never match \n, even if it is in regexp
+ *   @option options [Boolean] :case_sensitive (true) match is case-sensitive (regexp can override with (?i) unless in posix_syntax mode)
+ *   @option options [Boolean] :perl_classes (false) allow Perl's \d \s \w \D \S \W when in posix_syntax mode
+ *   @option options [Boolean] :word_boundary (false) allow \b \B (word boundary and not) when in posix_syntax mode
+ *   @option options [Boolean] :one_line (false) ^ and $ only match beginning and end of text when in posix_syntax mode
+ *   @return [RE2::Set] an RE2::Set with the specified anchor and options
+ *   @raise [ArgumentError] if anchor is not one of the accepted choices
+ *   @raise [NoMemoryError] if memory could not be allocated for the compiled pattern
+ */
+static VALUE re2_set_initialize(int argc, VALUE *argv, VALUE self) {
+  VALUE anchor, options;
+  re2_set *s;
+  RE2::Anchor re2_anchor;
+  RE2::Options re2_options;
+
+  rb_scan_args(argc, argv, "02", &anchor, &options);
+  Data_Get_Struct(self, re2_set, s);
+
+  if (RTEST(options)) {
+    parse_re2_options(re2_options, options);
+  }
+  if (NIL_P(anchor)) {
+    re2_anchor = RE2::UNANCHORED;
+  } else {
+    Check_Type(anchor, T_SYMBOL);
+    ID id_anchor = SYM2ID(anchor);
+    if (id_anchor == id_unanchored) {
+      re2_anchor = RE2::UNANCHORED;
+    } else if (id_anchor == id_anchor_start) {
+      re2_anchor = RE2::ANCHOR_START;
+    } else if (id_anchor == id_anchor_both) {
+      re2_anchor = RE2::ANCHOR_BOTH;
+    } else {
+      rb_raise(rb_eArgError, "anchor should be one of: :unanchored, :anchor_start, :anchor_both");
+    }
+  }
+
+  s->set = new(nothrow) RE2::Set(re2_options, re2_anchor);
+  if (s->set == 0) {
+    rb_raise(rb_eNoMemError, "not enough memory to allocate RE2::Set object");
+  }
+
+  return self;
+}
+
+/*
+ * Adds a pattern to the set. Returns the index that will identify the pattern
+ * in the output of #match. Cannot be called after #compile has been called.
+ *
+ * @param [String] pattern the regex pattern
+ * @return [Integer] the index of the pattern in the set
+ * @raise [ArgumentError] if called after compile or the pattern is rejected
+ * @example
+ *   set = RE2::Set.new
+ *   set.add("abc")    #=> 0
+ *   set.add("def")    #=> 1
+ */
+static VALUE re2_set_add(VALUE self, VALUE pattern) {
+  Check_Type(pattern, T_STRING);
+  re2::StringPiece regex(RSTRING_PTR(pattern), RSTRING_LEN(pattern));
+  std::string err;
+  re2_set *s;
+  Data_Get_Struct(self, re2_set, s);
+  int index = s->set->Add(regex, &err);
+  if (index < 0) {
+    rb_raise(rb_eArgError, "str rejected by RE2::Set->Add(): %s", err.c_str());
+  }
+
+  return INT2FIX(index);
+}
+
+/*
+ * Compiles a Set so it can be used to match against. Must be called after #add
+ * and before #match.
+ *
+ * @return [Bool] whether compilation was a success
+ * @example
+ *   set = RE2::Set.new
+ *   set.add("abc")
+ *   set.compile    # => true
+ */
+static VALUE re2_set_compile(VALUE self) {
+  re2_set *s;
+  Data_Get_Struct(self, re2_set, s);
+
+  return BOOL2RUBY(s->set->Compile());
+}
+
+/*
+ * Returns whether the underlying re2 version outputs error information from
+ * RE2::Set::Match. If not, #match will raise an error if attempting to set its
+ * :exception option to true.
+ *
+ * @return [Bool] whether the underlying re2 outputs error information from Set matches
+ */
+static VALUE re2_set_match_raises_errors_p(VALUE self) {
+  UNUSED(self);
+#ifdef HAVE_ERROR_INFO_ARGUMENT
+  return Qtrue;
+#else
+  return Qfalse;
+#endif
+}
+
+/*
+ * Matches the given text against patterns in the set, returning an array of
+ * integer indices of the matching patterns if matched or an empty array if
+ * there are no matches.
+ *
+ * @return [Array<Integer>]
+ *
+ * @overload match(str)
+ *   Returns an array of integer indices of patterns matching the given string
+ *   (if any). Raises exceptions if there are any errors while matching.
+ *
+ *   @param [String] str the text to match against
+ *   @return [Array<Integer>] the indices of matching regexps
+ *   @raise [MatchError] if an error occurs while matching
+ *   @raise [UnsupportedError] if the underlying version of re2 does not output error information
+ *   @example
+ *     set = RE2::Set.new
+ *     set.add("abc")
+ *     set.add("def")
+ *     set.compile
+ *     set.match("abcdef")    # => [0, 1]
+ *
+ * @overload match(str, options)
+ *   Returns an array of integer indices of patterns matching the given string
+ *   (if any). Raises exceptions if there are any errors while matching and the
+ *   :exception option is set to true.
+ *
+ *   @param [String] str the text to match against
+ *   @param [Hash] options the options with which to match
+ *   @option options [Boolean] :exception (true) whether to raise exceptions with re2's error information (not supported on ABI version 0 of re2)
+ *   @return [Array<Integer>] the indices of matching regexps
+ *   @raise [MatchError] if an error occurs while matching
+ *   @raise [UnsupportedError] if the underlying version of re2 does not output error information
+ *   @example
+ *     set = RE2::Set.new
+ *     set.add("abc")
+ *     set.add("def")
+ *     set.compile
+ *     set.match("abcdef", :exception => true)    # => [0, 1]
+ */
+static VALUE re2_set_match(int argc, VALUE *argv, VALUE self) {
+  VALUE str, options, exception_option;
+  bool raise_exception = true;
+  rb_scan_args(argc, argv, "11", &str, &options);
+  Check_Type(str, T_STRING);
+  re2::StringPiece data(RSTRING_PTR(str), RSTRING_LEN(str));
+  std::vector<int> v;
+  re2_set *s;
+  Data_Get_Struct(self, re2_set, s);
+
+  if (RTEST(options)) {
+    Check_Type(options, T_HASH);
+
+    exception_option = rb_hash_aref(options, ID2SYM(id_exception));
+    if (!NIL_P(exception_option)) {
+      raise_exception = RTEST(exception_option);
+    }
+  }
+
+  if (raise_exception) {
+#ifdef HAVE_ERROR_INFO_ARGUMENT
+    RE2::Set::ErrorInfo e;
+    bool match_failed = !s->set->Match(data, &v, &e);
+    VALUE result = rb_ary_new2(v.size());
+
+    if (match_failed) {
+      switch (e.kind) {
+        case RE2::Set::kNoError:
+          break;
+        case RE2::Set::kNotCompiled:
+          rb_raise(re2_eSetMatchError, "#match must not be called before #compile");
+        case RE2::Set::kOutOfMemory:
+          rb_raise(re2_eSetMatchError, "The DFA ran out of memory");
+        case RE2::Set::kInconsistent:
+          rb_raise(re2_eSetMatchError, "RE2::Prog internal error");
+        default:  // Just in case a future version of libre2 adds new ErrorKinds
+          rb_raise(re2_eSetMatchError, "Unknown RE2::Set::ErrorKind: %d", e.kind);
+      }
+    } else {
+      for (size_t i = 0; i < v.size(); i++) {
+        rb_ary_push(result, INT2FIX(v[i]));
+      }
+    }
+
+    return result;
+#else
+    rb_raise(re2_eSetUnsupportedError, "current version of RE2::Set::Match() does not output error information, :exception option can only be set to false");
+#endif
+  } else {
+    bool matched = s->set->Match(data, &v);
+    VALUE result = rb_ary_new2(v.size());
+
+    if (matched) {
+      for (size_t i = 0; i < v.size(); i++) {
+        rb_ary_push(result, INT2FIX(v[i]));
+      }
+    }
+
+    return result;
+  }
+}
+
+/* Forward declare Init_re2 to be called by C code but define it separately so
+ * that YARD can parse it.
+ */
+extern "C" void Init_re2(void);
+
+void Init_re2(void) {
+  re2_mRE2 = rb_define_module("RE2");
+  re2_cRegexp = rb_define_class_under(re2_mRE2, "Regexp", rb_cObject);
+  re2_cMatchData = rb_define_class_under(re2_mRE2, "MatchData", rb_cObject);
+  re2_cScanner = rb_define_class_under(re2_mRE2, "Scanner", rb_cObject);
+  re2_cSet = rb_define_class_under(re2_mRE2, "Set", rb_cObject);
+  re2_eSetMatchError = rb_define_class_under(re2_cSet, "MatchError",
+      rb_const_get(rb_cObject, rb_intern("StandardError")));
+  re2_eSetUnsupportedError = rb_define_class_under(re2_cSet, "UnsupportedError",
+      rb_const_get(rb_cObject, rb_intern("StandardError")));
+
+  rb_define_alloc_func(re2_cRegexp, (VALUE (*)(VALUE))re2_regexp_allocate);
+  rb_define_alloc_func(re2_cMatchData,
+      (VALUE (*)(VALUE))re2_matchdata_allocate);
+  rb_define_alloc_func(re2_cScanner,
+      (VALUE (*)(VALUE))re2_scanner_allocate);
+  rb_define_alloc_func(re2_cSet, (VALUE (*)(VALUE))re2_set_allocate);
+
+  rb_define_method(re2_cMatchData, "string",
+      RUBY_METHOD_FUNC(re2_matchdata_string), 0);
+  rb_define_method(re2_cMatchData, "regexp",
+      RUBY_METHOD_FUNC(re2_matchdata_regexp), 0);
+  rb_define_method(re2_cMatchData, "to_a",
+      RUBY_METHOD_FUNC(re2_matchdata_to_a), 0);
+  rb_define_method(re2_cMatchData, "size",
+      RUBY_METHOD_FUNC(re2_matchdata_size), 0);
+  rb_define_method(re2_cMatchData, "length",
+      RUBY_METHOD_FUNC(re2_matchdata_size), 0);
+  rb_define_method(re2_cMatchData, "begin",
+      RUBY_METHOD_FUNC(re2_matchdata_begin), 1);
+  rb_define_method(re2_cMatchData, "end",
+      RUBY_METHOD_FUNC(re2_matchdata_end), 1);
+  rb_define_method(re2_cMatchData, "[]", RUBY_METHOD_FUNC(re2_matchdata_aref),
+      -1);
+  rb_define_method(re2_cMatchData, "to_s",
+        RUBY_METHOD_FUNC(re2_matchdata_to_s), 0);
+  rb_define_method(re2_cMatchData, "inspect",
+      RUBY_METHOD_FUNC(re2_matchdata_inspect), 0);
+  rb_define_method(re2_cMatchData, "deconstruct",
+      RUBY_METHOD_FUNC(re2_matchdata_deconstruct), 0);
+  rb_define_method(re2_cMatchData, "deconstruct_keys",
+      RUBY_METHOD_FUNC(re2_matchdata_deconstruct_keys), 1);
+
+  rb_define_method(re2_cScanner, "string",
+      RUBY_METHOD_FUNC(re2_scanner_string), 0);
+  rb_define_method(re2_cScanner, "eof?",
+      RUBY_METHOD_FUNC(re2_scanner_eof), 0);
+  rb_define_method(re2_cScanner, "regexp",
+      RUBY_METHOD_FUNC(re2_scanner_regexp), 0);
+  rb_define_method(re2_cScanner, "scan",
+      RUBY_METHOD_FUNC(re2_scanner_scan), 0);
+  rb_define_method(re2_cScanner, "rewind",
+      RUBY_METHOD_FUNC(re2_scanner_rewind), 0);
+
+  rb_define_method(re2_cRegexp, "initialize",
+      RUBY_METHOD_FUNC(re2_regexp_initialize), -1);
+  rb_define_method(re2_cRegexp, "ok?", RUBY_METHOD_FUNC(re2_regexp_ok), 0);
+  rb_define_method(re2_cRegexp, "error", RUBY_METHOD_FUNC(re2_regexp_error),
+      0);
+  rb_define_method(re2_cRegexp, "error_arg",
+      RUBY_METHOD_FUNC(re2_regexp_error_arg), 0);
+  rb_define_method(re2_cRegexp, "program_size",
+      RUBY_METHOD_FUNC(re2_regexp_program_size), 0);
+  rb_define_method(re2_cRegexp, "options",
+      RUBY_METHOD_FUNC(re2_regexp_options), 0);
+  rb_define_method(re2_cRegexp, "number_of_capturing_groups",
+      RUBY_METHOD_FUNC(re2_regexp_number_of_capturing_groups), 0);
+  rb_define_method(re2_cRegexp, "named_capturing_groups",
+      RUBY_METHOD_FUNC(re2_regexp_named_capturing_groups), 0);
+  rb_define_method(re2_cRegexp, "match", RUBY_METHOD_FUNC(re2_regexp_match),
+      -1);
+  rb_define_method(re2_cRegexp, "match?",
+      RUBY_METHOD_FUNC(re2_regexp_match_p), 1);
+  rb_define_method(re2_cRegexp, "=~",
+      RUBY_METHOD_FUNC(re2_regexp_match_p), 1);
+  rb_define_method(re2_cRegexp, "===",
+      RUBY_METHOD_FUNC(re2_regexp_match_p), 1);
+  rb_define_method(re2_cRegexp, "scan",
+      RUBY_METHOD_FUNC(re2_regexp_scan), 1);
+  rb_define_method(re2_cRegexp, "to_s", RUBY_METHOD_FUNC(re2_regexp_to_s), 0);
+  rb_define_method(re2_cRegexp, "to_str", RUBY_METHOD_FUNC(re2_regexp_to_s),
+      0);
+  rb_define_method(re2_cRegexp, "pattern", RUBY_METHOD_FUNC(re2_regexp_to_s),
+      0);
+  rb_define_method(re2_cRegexp, "source", RUBY_METHOD_FUNC(re2_regexp_to_s),
+      0);
+  rb_define_method(re2_cRegexp, "inspect",
+      RUBY_METHOD_FUNC(re2_regexp_inspect), 0);
+  rb_define_method(re2_cRegexp, "utf8?", RUBY_METHOD_FUNC(re2_regexp_utf8),
+      0);
+  rb_define_method(re2_cRegexp, "posix_syntax?",
+      RUBY_METHOD_FUNC(re2_regexp_posix_syntax), 0);
+  rb_define_method(re2_cRegexp, "longest_match?",
+      RUBY_METHOD_FUNC(re2_regexp_longest_match), 0);
+  rb_define_method(re2_cRegexp, "log_errors?",
+      RUBY_METHOD_FUNC(re2_regexp_log_errors), 0);
+  rb_define_method(re2_cRegexp, "max_mem",
+      RUBY_METHOD_FUNC(re2_regexp_max_mem), 0);
+  rb_define_method(re2_cRegexp, "literal?",
+      RUBY_METHOD_FUNC(re2_regexp_literal), 0);
+  rb_define_method(re2_cRegexp, "never_nl?",
+      RUBY_METHOD_FUNC(re2_regexp_never_nl), 0);
+  rb_define_method(re2_cRegexp, "case_sensitive?",
+      RUBY_METHOD_FUNC(re2_regexp_case_sensitive), 0);
+  rb_define_method(re2_cRegexp, "case_insensitive?",
+      RUBY_METHOD_FUNC(re2_regexp_case_insensitive), 0);
+  rb_define_method(re2_cRegexp, "casefold?",
+      RUBY_METHOD_FUNC(re2_regexp_case_insensitive), 0);
+  rb_define_method(re2_cRegexp, "perl_classes?",
+      RUBY_METHOD_FUNC(re2_regexp_perl_classes), 0);
+  rb_define_method(re2_cRegexp, "word_boundary?",
+      RUBY_METHOD_FUNC(re2_regexp_word_boundary), 0);
+  rb_define_method(re2_cRegexp, "one_line?",
+      RUBY_METHOD_FUNC(re2_regexp_one_line), 0);
+
+  rb_define_singleton_method(re2_cSet, "match_raises_errors?",
+      RUBY_METHOD_FUNC(re2_set_match_raises_errors_p), 0);
+  rb_define_method(re2_cSet, "initialize",
+      RUBY_METHOD_FUNC(re2_set_initialize), -1);
+  rb_define_method(re2_cSet, "add", RUBY_METHOD_FUNC(re2_set_add), 1);
+  rb_define_method(re2_cSet, "compile", RUBY_METHOD_FUNC(re2_set_compile), 0);
+  rb_define_method(re2_cSet, "match", RUBY_METHOD_FUNC(re2_set_match), -1);
+
+  rb_define_module_function(re2_mRE2, "Replace",
+      RUBY_METHOD_FUNC(re2_Replace), 3);
+  rb_define_module_function(re2_mRE2, "GlobalReplace",
+      RUBY_METHOD_FUNC(re2_GlobalReplace), 3);
+  rb_define_module_function(re2_mRE2, "QuoteMeta",
+      RUBY_METHOD_FUNC(re2_QuoteMeta), 1);
+  rb_define_singleton_method(re2_cRegexp, "escape",
+      RUBY_METHOD_FUNC(re2_QuoteMeta), 1);
+  rb_define_singleton_method(re2_cRegexp, "quote",
+      RUBY_METHOD_FUNC(re2_QuoteMeta), 1);
+  rb_define_singleton_method(re2_cRegexp, "compile",
+      RUBY_METHOD_FUNC(rb_class_new_instance), -1);
+
+  rb_define_global_function("RE2", RUBY_METHOD_FUNC(re2_re2), -1);
+
+  /* Create the symbols used in options. */
+  id_utf8 = rb_intern("utf8");
+  id_posix_syntax = rb_intern("posix_syntax");
+  id_longest_match = rb_intern("longest_match");
+  id_log_errors = rb_intern("log_errors");
+  id_max_mem = rb_intern("max_mem");
+  id_literal = rb_intern("literal");
+  id_never_nl = rb_intern("never_nl");
+  id_case_sensitive = rb_intern("case_sensitive");
+  id_perl_classes = rb_intern("perl_classes");
+  id_word_boundary = rb_intern("word_boundary");
+  id_one_line = rb_intern("one_line");
+  id_unanchored = rb_intern("unanchored");
+  id_anchor_start = rb_intern("anchor_start");
+  id_anchor_both = rb_intern("anchor_both");
+  id_exception = rb_intern("exception");
+}