enclave 0.1.0

data/ext/enclave/mruby/mrbgems/mruby-string-ext/src/string.c

@@ -0,0 +1,2290 @@
+#include <string.h>
+#include <mruby.h>
+#include <mruby/array.h>
+#include <mruby/class.h>
+#include <mruby/string.h>
+#include <mruby/range.h>
+#include <mruby/internal.h>
+#include <mruby/presym.h>
+
+#define ENC_ASCII_8BIT "ASCII-8BIT"
+#define ENC_BINARY     "BINARY"
+#define ENC_UTF8       "UTF-8"
+
+static mrb_value
+int_chr_binary(mrb_state *mrb, mrb_value num)
+{
+  mrb_int cp = mrb_as_int(mrb, num);
+
+  if (cp < 0 || 0xff < cp) {
+    mrb_raisef(mrb, E_RANGE_ERROR, "%v out of char range", num);
+  }
+  char c = (char)cp;
+  mrb_value str = mrb_str_new(mrb, &c, 1);
+  RSTR_SET_ASCII_FLAG(mrb_str_ptr(str));
+  return str;
+}
+
+#ifdef MRB_UTF8_STRING
+static mrb_value
+int_chr_utf8(mrb_state *mrb, mrb_value num)
+{
+  mrb_int cp = mrb_int(mrb, num);
+  char utf8[4];
+  mrb_int len;
+  mrb_value str;
+
+  if (cp < 0 || 0x10FFFF < cp) {
+    mrb_raisef(mrb, E_RANGE_ERROR, "%v out of char range", num);
+  }
+  len = mrb_utf8_to_buf(utf8, (uint32_t)cp);
+  str = mrb_str_new(mrb, utf8, len);
+  if (len == 1) {
+    RSTR_SET_ASCII_FLAG(mrb_str_ptr(str));
+  }
+  return str;
+}
+#endif
+
+/*
+ *  call-seq:
+ *     str.swapcase!   -> str or nil
+ *
+ *  Equivalent to `String#swapcase`, but modifies the receiver in
+ *  place, returning *str*, or `nil` if no changes were made.
+ *  Note: case conversion is effective only in ASCII region.
+ */
+static mrb_value
+str_swapcase_bang(mrb_state *mrb, mrb_value str)
+{
+  int modify = 0;
+  struct RString *s = mrb_str_ptr(str);
+
+  mrb_str_modify(mrb, s);
+  char *p = RSTRING_PTR(str);
+  char *pend = p + RSTRING_LEN(str);
+  while (p < pend) {
+    if (ISUPPER(*p)) {
+      *p = TOLOWER(*p);
+      modify = 1;
+    }
+    else if (ISLOWER(*p)) {
+      *p = TOUPPER(*p);
+      modify = 1;
+    }
+    p++;
+  }
+
+  if (modify) return str;
+  return mrb_nil_value();
+}
+
+/*
+ *  call-seq:
+ *     str.swapcase   -> new_str
+ *
+ *  Returns a copy of *str* with uppercase alphabetic characters converted
+ *  to lowercase and lowercase characters converted to uppercase.
+ *  Note: case conversion is effective only in ASCII region.
+ *
+ *     "Hello".swapcase          #=> "hELLO"
+ *     "cYbEr_PuNk11".swapcase   #=> "CyBeR_pUnK11"
+ */
+static mrb_value
+str_swapcase(mrb_state *mrb, mrb_value self)
+{
+  mrb_value str = mrb_str_dup(mrb, self);
+  str_swapcase_bang(mrb, str);
+  return str;
+}
+
+static void
+str_concat(mrb_state *mrb, mrb_value self, mrb_value str, mrb_bool binary)
+{
+  if (mrb_integer_p(str) || mrb_float_p(str)) {
+#ifdef MRB_UTF8_STRING
+    if (binary) {
+      str = int_chr_binary(mrb, str);
+    }
+    else {
+      str = int_chr_utf8(mrb, str);
+    }
+#else
+    str = int_chr_binary(mrb, str);
+#endif
+  }
+  else
+    mrb_ensure_string_type(mrb, str);
+  mrb_str_cat_str(mrb, self, str);
+}
+
+static mrb_value
+str_concat0(mrb_state *mrb, mrb_value self, mrb_bool binary)
+{
+  if (mrb_get_argc(mrb) == 1) {
+    str_concat(mrb, self, mrb_get_arg1(mrb), binary);
+    return self;
+  }
+
+  mrb_value *args;
+  mrb_int alen;
+
+  mrb_get_args(mrb, "*", &args, &alen);
+  for (mrb_int i=0; i<alen; i++) {
+    str_concat(mrb, self, args[i], binary);
+  }
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str << obj           -> str
+ *     str.concat(*obj)     -> str
+ *
+ *    s = 'foo'
+ *    s.concat('bar', 'baz') # => "foobarbaz"
+ *    s                      # => "foobarbaz"
+ *
+ *  For each given object `object` that is an \Integer,
+ *  the value is considered a codepoint and converted to a character before concatenation:
+ *
+ *    s = 'foo'
+ *    s.concat(32, 'bar', 32, 'baz') # => "foo bar baz"
+ *
+ */
+static mrb_value
+str_concat_m(mrb_state *mrb, mrb_value self)
+{
+  mrb_bool binary = RSTR_BINARY_P(mrb_str_ptr(self));
+  return str_concat0(mrb, self, binary);
+}
+
+/*
+ *  call-seq:
+ *     str.append_as_bytes(*obj)     -> str
+ *
+ *  Works like `concat` but consider arguments as binary strings.
+ *
+ */
+static mrb_value
+str_append_as_bytes(mrb_state *mrb, mrb_value self)
+{
+  return str_concat0(mrb, self, TRUE);
+}
+
+/*
+ *  call-seq:
+ *     str.start_with?([prefixes]+)   -> true or false
+ *
+ *  Returns true if `str` starts with one of the `prefixes` given.
+ *
+ *    "hello".start_with?("hell")               #=> true
+ *
+ *    # returns true if one of the prefixes matches.
+ *    "hello".start_with?("heaven", "hell")     #=> true
+ *    "hello".start_with?("heaven", "paradise") #=> false
+ *    "h".start_with?("heaven", "hell")         #=> false
+ */
+static mrb_value
+str_start_with(mrb_state *mrb, mrb_value self)
+{
+  const mrb_value *argv;
+  mrb_int argc;
+  mrb_get_args(mrb, "*", &argv, &argc);
+
+  for (mrb_int i = 0; i < argc; i++) {
+    int ai = mrb_gc_arena_save(mrb);
+    mrb_value sub = argv[i];
+    mrb_ensure_string_type(mrb, sub);
+    mrb_gc_arena_restore(mrb, ai);
+    size_t len_l = RSTRING_LEN(self);
+    size_t len_r = RSTRING_LEN(sub);
+    if (len_l >= len_r) {
+      if (memcmp(RSTRING_PTR(self), RSTRING_PTR(sub), len_r) == 0) {
+        return mrb_true_value();
+      }
+    }
+  }
+  return mrb_false_value();
+}
+
+/*
+ *  call-seq:
+ *     str.end_with?([suffixes]+)   -> true or false
+ *
+ *  Returns true if `str` ends with one of the `suffixes` given.
+ */
+static mrb_value
+str_end_with(mrb_state *mrb, mrb_value self)
+{
+  const mrb_value *argv;
+  mrb_int argc;
+  mrb_get_args(mrb, "*", &argv, &argc);
+
+  for (mrb_int i = 0; i < argc; i++) {
+    int ai = mrb_gc_arena_save(mrb);
+    mrb_value sub = argv[i];
+    mrb_ensure_string_type(mrb, sub);
+    mrb_gc_arena_restore(mrb, ai);
+    size_t len_l = RSTRING_LEN(self);
+    size_t len_r = RSTRING_LEN(sub);
+    if (len_l >= len_r) {
+      if (memcmp(RSTRING_PTR(self) + (len_l - len_r),
+                 RSTRING_PTR(sub),
+                 len_r) == 0) {
+        return mrb_true_value();
+      }
+    }
+  }
+  return mrb_false_value();
+}
+
+enum tr_pattern_type {
+  TR_UNINITIALIZED = 0,
+  TR_IN_ORDER  = 1,
+  TR_RANGE = 2,
+};
+
+/*
+  #tr Pattern syntax
+
+  <syntax> ::= (<pattern>)* | '^' (<pattern>)*
+  <pattern> ::= <in order> | <range>
+  <in order> ::= (<ch>)+
+  <range> ::= <ch> '-' <ch>
+*/
+struct tr_pattern {
+  uint8_t type;                 // 1:in-order, 2:range
+  mrb_bool flag_reverse : 1;
+  mrb_bool flag_on_heap : 1;
+  uint16_t n;
+  union {
+    uint16_t start_pos;
+    char ch[2];
+  } val;
+  struct tr_pattern *next;
+};
+
+#define STATIC_TR_PATTERN { 0 }
+
+static inline void
+tr_free_pattern(mrb_state *mrb, struct tr_pattern *pat)
+{
+  while (pat) {
+    struct tr_pattern *p = pat->next;
+    if (pat->flag_on_heap) {
+      mrb_free(mrb, pat);
+    }
+    pat = p;
+  }
+}
+
+static struct tr_pattern*
+tr_parse_pattern(mrb_state *mrb, struct tr_pattern *ret, const mrb_value v_pattern, mrb_bool flag_reverse_enable, struct tr_pattern *pat0)
+{
+  const char *pattern = RSTRING_PTR(v_pattern);
+  mrb_int pattern_length = RSTRING_LEN(v_pattern);
+  mrb_bool flag_reverse = FALSE;
+  mrb_int i = 0;
+
+  if (flag_reverse_enable && pattern_length >= 2 && pattern[0] == '^') {
+    flag_reverse = TRUE;
+    i++;
+  }
+
+  while (i < pattern_length) {
+    /* is range pattern ? */
+    mrb_bool const ret_uninit = (ret->type == TR_UNINITIALIZED);
+    struct tr_pattern *pat1 = ret_uninit ? ret
+                              : (struct tr_pattern*)mrb_malloc_simple(mrb, sizeof(struct tr_pattern));
+    if (pat1 == NULL) {
+      if (pat0) tr_free_pattern(mrb, pat0);
+      tr_free_pattern(mrb, ret);
+      mrb_exc_raise(mrb, mrb_obj_value(mrb->nomem_err));
+      return NULL;            /* not reached */
+    }
+    if ((i+2) < pattern_length && pattern[i] != '\\' && pattern[i+1] == '-') {
+      pat1->type = TR_RANGE;
+      pat1->flag_reverse = flag_reverse;
+      pat1->flag_on_heap = !ret_uninit;
+      pat1->n = pattern[i+2] - pattern[i] + 1;
+      pat1->next = NULL;
+      pat1->val.ch[0] = pattern[i];
+      pat1->val.ch[1] = pattern[i+2];
+      i += 3;
+    }
+    else {
+      /* in order pattern. */
+      mrb_int start_pos = i++;
+
+      while (i < pattern_length) {
+        if ((i+2) < pattern_length && pattern[i] != '\\' && pattern[i+1] == '-')
+          break;
+        i++;
+      }
+
+      mrb_int len = i - start_pos;
+      if (len > UINT16_MAX) {
+        if (pat0) tr_free_pattern(mrb, pat0);
+        tr_free_pattern(mrb, ret);
+        if (ret != pat1) mrb_free(mrb, pat1);
+        mrb_raise(mrb, E_ARGUMENT_ERROR, "tr pattern too long (max 65535)");
+      }
+      pat1->type = TR_IN_ORDER;
+      pat1->flag_reverse = flag_reverse;
+      pat1->flag_on_heap = !ret_uninit;
+      pat1->n = (uint16_t)len;
+      pat1->next = NULL;
+      pat1->val.start_pos = (uint16_t)start_pos;
+    }
+
+    if (!ret_uninit) {
+      struct tr_pattern *p = ret;
+      while (p->next != NULL) {
+        p = p->next;
+      }
+      p->next = pat1;
+    }
+  }
+
+  return ret;
+}
+
+static inline mrb_int
+tr_find_character(const struct tr_pattern *pat, const char *pat_str, int ch)
+{
+  mrb_int ret = -1;
+  mrb_int n_sum = 0;
+  mrb_int flag_reverse = pat ? pat->flag_reverse : 0;
+
+  while (pat != NULL) {
+    if (pat->type == TR_IN_ORDER) {
+      for (int i = 0; i < pat->n; i++) {
+        if (pat_str[pat->val.start_pos + i] == ch) ret = n_sum + i;
+      }
+    }
+    else if (pat->type == TR_RANGE) {
+      if (pat->val.ch[0] <= ch && ch <= pat->val.ch[1])
+        ret = n_sum + ch - pat->val.ch[0];
+    }
+    else {
+      mrb_assert(pat->type == TR_UNINITIALIZED);
+    }
+    n_sum += pat->n;
+    pat = pat->next;
+  }
+
+  if (flag_reverse) {
+    return (ret < 0) ? MRB_INT_MAX : -1;
+  }
+  return ret;
+}
+
+static inline mrb_int
+tr_get_character(const struct tr_pattern *pat, const char *pat_str, mrb_int n_th)
+{
+  mrb_int n_sum = 0;
+
+  while (pat != NULL) {
+    if (n_th < (n_sum + pat->n)) {
+      mrb_int i = (n_th - n_sum);
+
+      switch (pat->type) {
+      case TR_IN_ORDER:
+        return pat_str[pat->val.start_pos + i];
+      case TR_RANGE:
+        return pat->val.ch[0]+i;
+      case TR_UNINITIALIZED:
+        return -1;
+      }
+    }
+    if (pat->next == NULL) {
+      switch (pat->type) {
+      case TR_IN_ORDER:
+        return pat_str[pat->val.start_pos + pat->n - 1];
+      case TR_RANGE:
+        return pat->val.ch[1];
+      case TR_UNINITIALIZED:
+        return -1;
+      }
+    }
+    n_sum += pat->n;
+    pat = pat->next;
+  }
+
+  return -1;
+}
+
+static inline void
+tr_bitmap_set(uint8_t bitmap[32], uint8_t ch)
+{
+  uint8_t idx1 = ch / 8;
+  uint8_t idx2 = ch % 8;
+  bitmap[idx1] |= (1<<idx2);
+}
+
+static inline mrb_bool
+tr_bitmap_detect(uint8_t bitmap[32], uint8_t ch)
+{
+  uint8_t idx1 = ch / 8;
+  uint8_t idx2 = ch % 8;
+  if (bitmap[idx1] & (1<<idx2))
+    return TRUE;
+  return FALSE;
+}
+
+/* compile pattern to bitmap */
+static void
+tr_compile_pattern(const struct tr_pattern *pat, mrb_value pstr, uint8_t bitmap[32])
+{
+  const char *pattern = RSTRING_PTR(pstr);
+  mrb_int flag_reverse = pat ? pat->flag_reverse : 0;
+  int i;
+
+  for (int i=0; i<32; i++) {
+    bitmap[i] = 0;
+  }
+  while (pat != NULL) {
+    if (pat->type == TR_IN_ORDER) {
+      for (i = 0; i < pat->n; i++) {
+        tr_bitmap_set(bitmap, pattern[pat->val.start_pos + i]);
+      }
+    }
+    else if (pat->type == TR_RANGE) {
+      for (i = pat->val.ch[0]; i < pat->val.ch[1]; i++) {
+        tr_bitmap_set(bitmap, i);
+      }
+    }
+    else {
+      mrb_assert(pat->type == TR_UNINITIALIZED);
+    }
+    pat = pat->next;
+  }
+
+  if (flag_reverse) {
+    for (i=0; i<32; i++) {
+      bitmap[i] ^= 0xff;
+    }
+  }
+}
+
+static mrb_bool
+str_tr(mrb_state *mrb, mrb_value str, mrb_value p1, mrb_value p2, mrb_bool squeeze)
+{
+  struct tr_pattern pat = STATIC_TR_PATTERN;
+  struct tr_pattern rep = STATIC_TR_PATTERN;
+  mrb_bool flag_changed = FALSE;
+  mrb_int lastch = -1;
+
+  mrb_str_modify(mrb, mrb_str_ptr(str));
+  tr_parse_pattern(mrb, &pat, p1, TRUE, NULL);
+  tr_parse_pattern(mrb, &rep, p2, FALSE, &pat);
+  char *s = RSTRING_PTR(str);
+  mrb_int len = RSTRING_LEN(str);
+
+  /* Hoist pointer retrieval outside loop to avoid repeated conditionals */
+  const char *p1_ptr = RSTRING_PTR(p1);
+  const char *p2_ptr = RSTRING_PTR(p2);
+  mrb_int i, j;
+  for (i=j=0; i<len; i++,j++) {
+    mrb_int n = tr_find_character(&pat, p1_ptr, s[i]);
+
+    if (i>j) s[j] = s[i];
+    if (n >= 0) {
+      flag_changed = TRUE;
+      mrb_int c = tr_get_character(&rep, p2_ptr, n);
+
+      if (c < 0 || (squeeze && c == lastch)) {
+        j--;
+        continue;
+      }
+      if (c > 0x80) {
+        tr_free_pattern(mrb, &pat);
+        tr_free_pattern(mrb, &rep);
+        mrb_raisef(mrb, E_ARGUMENT_ERROR, "character (%i) out of range", c);
+      }
+      lastch = c;
+      s[i] = (char)c;
+    }
+  }
+
+  tr_free_pattern(mrb, &pat);
+  tr_free_pattern(mrb, &rep);
+
+  if (flag_changed) {
+    RSTR_SET_LEN(RSTRING(str), j);
+    RSTRING_PTR(str)[j] = 0;
+  }
+  return flag_changed;
+}
+
+/*
+ * call-seq:
+ *   str.tr(from_str, to_str)   => new_str
+ *
+ * Returns a copy of str with the characters in from_str replaced by the
+ * corresponding characters in to_str.  If to_str is shorter than from_str,
+ * it is padded with its last character in order to maintain the
+ * correspondence.
+ *
+ *  "hello".tr('el', 'ip')      #=> "hippo"
+ *  "hello".tr('aeiou', '*')    #=> "h*ll*"
+ *  "hello".tr('aeiou', 'AA*')  #=> "hAll*"
+ *
+ * Both strings may use the c1-c2 notation to denote ranges of characters,
+ * and from_str may start with a ^, which denotes all characters except
+ * those listed.
+ *
+ *  "hello".tr('a-y', 'b-z')    #=> "ifmmp"
+ *  "hello".tr('^aeiou', '*')   #=> "*e**o"
+ *
+ * The backslash character \ can be used to escape ^ or - and is otherwise
+ * ignored unless it appears at the end of a range or the end of the
+ * from_str or to_str:
+ *
+ *
+ *  "hello^world".tr("\\^aeiou", "*") #=> "h*ll**w*rld"
+ *  "hello-world".tr("a\\-eo", "*")   #=> "h*ll**w*rld"
+ *
+ *  "hello\r\nworld".tr("\r", "")   #=> "hello\nworld"
+ *  "hello\r\nworld".tr("\\r", "")  #=> "hello\r\nwold"
+ *  "hello\r\nworld".tr("\\\r", "") #=> "hello\nworld"
+ *
+ *  "X['\\b']".tr("X\\", "")   #=> "['b']"
+ *  "X['\\b']".tr("X-\\]", "") #=> "'b'"
+ *
+ *  Note: conversion is effective only in ASCII region.
+ */
+static mrb_value
+str_tr_m(mrb_state *mrb, mrb_value str)
+{
+  mrb_value p1, p2;
+
+  mrb_get_args(mrb, "SS", &p1, &p2);
+  mrb_value dup = mrb_str_dup(mrb, str);
+  str_tr(mrb, dup, p1, p2, FALSE);
+  return dup;
+}
+
+/*
+ * call-seq:
+ *   str.tr!(from_str, to_str)   -> str or nil
+ *
+ * Translates str in place, using the same rules as String#tr.
+ * Returns str, or nil if no changes were made.
+ */
+static mrb_value
+str_tr_bang(mrb_state *mrb, mrb_value str)
+{
+  mrb_value p1, p2;
+
+  mrb_get_args(mrb, "SS", &p1, &p2);
+  if (str_tr(mrb, str, p1, p2, FALSE)) {
+    return str;
+  }
+  return mrb_nil_value();
+}
+
+/*
+ * call-seq:
+ *   str.tr_s(from_str, to_str)   -> new_str
+ *
+ * Processes a copy of str as described under String#tr, then removes
+ * duplicate characters in regions that were affected by the translation.
+ *
+ *  "hello".tr_s('l', 'r')     #=> "hero"
+ *  "hello".tr_s('el', '*')    #=> "h*o"
+ *  "hello".tr_s('el', 'hx')   #=> "hhxo"
+ */
+static mrb_value
+str_tr_s(mrb_state *mrb, mrb_value str)
+{
+  mrb_value p1, p2;
+
+  mrb_get_args(mrb, "SS", &p1, &p2);
+  mrb_value dup = mrb_str_dup(mrb, str);
+  str_tr(mrb, dup, p1, p2, TRUE);
+  return dup;
+}
+
+/*
+ * call-seq:
+ *   str.tr_s!(from_str, to_str)   -> str or nil
+ *
+ * Performs String#tr_s processing on str in place, returning
+ * str, or nil if no changes were made.
+ */
+static mrb_value
+str_tr_s_bang(mrb_state *mrb, mrb_value str)
+{
+  mrb_value p1, p2;
+
+  mrb_get_args(mrb, "SS", &p1, &p2);
+  if (str_tr(mrb, str, p1, p2, TRUE)) {
+    return str;
+  }
+  return mrb_nil_value();
+}
+
+static mrb_bool
+str_squeeze(mrb_state *mrb, mrb_value str, mrb_value v_pat)
+{
+  struct tr_pattern pat_storage = STATIC_TR_PATTERN;
+  struct tr_pattern *pat = NULL;
+  mrb_int i, j;
+  mrb_bool flag_changed = FALSE;
+  mrb_int lastch = -1;
+  uint8_t bitmap[32];
+
+  mrb_str_modify(mrb, mrb_str_ptr(str));
+  if (!mrb_nil_p(v_pat)) {
+    pat = tr_parse_pattern(mrb, &pat_storage, v_pat, TRUE, NULL);
+    tr_compile_pattern(pat, v_pat, bitmap);
+    tr_free_pattern(mrb, pat);
+  }
+  char *s = RSTRING_PTR(str);
+  mrb_int len = RSTRING_LEN(str);
+
+  if (pat) {
+    for (i=j=0; i<len; i++,j++) {
+      if (i>j) s[j] = s[i];
+      if (tr_bitmap_detect(bitmap, s[i]) && s[i] == lastch) {
+        flag_changed = TRUE;
+        j--;
+      }
+      lastch = s[i];
+    }
+  }
+  else {
+    for (i=j=0; i<len; i++,j++) {
+      if (i>j) s[j] = s[i];
+      if (s[i] >= 0 && s[i] == lastch) {
+        flag_changed = TRUE;
+        j--;
+      }
+      lastch = s[i];
+    }
+  }
+
+  if (flag_changed) {
+    RSTR_SET_LEN(RSTRING(str), j);
+    RSTRING_PTR(str)[j] = 0;
+  }
+  return flag_changed;
+}
+
+/*
+ * call-seq:
+ *   str.squeeze([other_str])    -> new_str
+ *
+ * Builds a set of characters from the other_str
+ * parameter(s) using the procedure described for String#count. Returns a
+ * new string where runs of the same character that occur in this set are
+ * replaced by a single character. If no arguments are given, all runs of
+ * identical characters are replaced by a single character.
+ *
+ *  "yellow moon".squeeze                  #=> "yelow mon"
+ *  "  now   is  the".squeeze(" ")         #=> " now is the"
+ *  "putters shoot balls".squeeze("m-z")   #=> "puters shot balls"
+ */
+static mrb_value
+str_squeeze_m(mrb_state *mrb, mrb_value str)
+{
+  mrb_value pat = mrb_nil_value();
+
+  mrb_get_args(mrb, "|S", &pat);
+  mrb_value dup = mrb_str_dup(mrb, str);
+  str_squeeze(mrb, dup, pat);
+  return dup;
+}
+
+/*
+ * call-seq:
+ *   str.squeeze!([other_str])   -> str or nil
+ *
+ * Squeezes str in place, returning either str, or nil if no
+ * changes were made.
+ */
+static mrb_value
+str_squeeze_bang(mrb_state *mrb, mrb_value str)
+{
+  mrb_value pat = mrb_nil_value();
+
+  mrb_get_args(mrb, "|S", &pat);
+  if (str_squeeze(mrb, str, pat)) {
+    return str;
+  }
+  return mrb_nil_value();
+}
+
+static mrb_bool
+str_delete(mrb_state *mrb, mrb_value str, mrb_value v_pat)
+{
+  struct tr_pattern pat = STATIC_TR_PATTERN;
+  mrb_bool flag_changed = FALSE;
+  uint8_t bitmap[32];
+
+  mrb_str_modify(mrb, mrb_str_ptr(str));
+  tr_parse_pattern(mrb, &pat, v_pat, TRUE, NULL);
+  tr_compile_pattern(&pat, v_pat, bitmap);
+  tr_free_pattern(mrb, &pat);
+
+  char *s = RSTRING_PTR(str);
+  mrb_int len = RSTRING_LEN(str);
+  mrb_int i, j;
+
+  for (i=j=0; i<len; i++,j++) {
+    if (i>j) s[j] = s[i];
+    if (tr_bitmap_detect(bitmap, s[i])) {
+      flag_changed = TRUE;
+      j--;
+    }
+  }
+  if (flag_changed) {
+    RSTR_SET_LEN(RSTRING(str), j);
+    RSTRING_PTR(str)[j] = 0;
+  }
+  return flag_changed;
+}
+
+/* Internal helper for String#delete - returns new string with pattern characters removed */
+static mrb_value
+str_delete_m(mrb_state *mrb, mrb_value str)
+{
+  mrb_value pat;
+
+  mrb_get_args(mrb, "S", &pat);
+  mrb_value dup = mrb_str_dup(mrb, str);
+  str_delete(mrb, dup, pat);
+  return dup;
+}
+
+/* Internal helper for String#delete! - removes pattern characters in place */
+static mrb_value
+str_delete_bang(mrb_state *mrb, mrb_value str)
+{
+  mrb_value pat;
+
+  mrb_get_args(mrb, "S", &pat);
+  if (str_delete(mrb, str, pat)) {
+    return str;
+  }
+  return mrb_nil_value();
+}
+
+/*
+ * call_seq:
+ *   str.count([other_str])   -> integer
+ *
+ * Each other_str parameter defines a set of characters to count.  The
+ * intersection of these sets defines the characters to count in str.  Any
+ * other_str that starts with a caret ^ is negated.  The sequence c1-c2
+ * means all characters between c1 and c2.  The backslash character \ can
+ * be used to escape ^ or - and is otherwise ignored unless it appears at
+ * the end of a sequence or the end of a other_str.
+ */
+static mrb_value
+str_count(mrb_state *mrb, mrb_value str)
+{
+  mrb_value v_pat = mrb_nil_value();
+  struct tr_pattern pat = STATIC_TR_PATTERN;
+  uint8_t bitmap[32];
+
+  mrb_get_args(mrb, "S", &v_pat);
+  tr_parse_pattern(mrb, &pat, v_pat, TRUE, NULL);
+  tr_compile_pattern(&pat, v_pat, bitmap);
+  tr_free_pattern(mrb, &pat);
+
+  char *s = RSTRING_PTR(str);
+  mrb_int len = RSTRING_LEN(str);
+  mrb_int count = 0;
+  for (mrb_int i = 0; i < len; i++) {
+    if (tr_bitmap_detect(bitmap, s[i])) count++;
+  }
+  return mrb_fixnum_value(count);
+}
+
+/* Internal helper for String#hex - converts hex string to integer */
+static mrb_value
+str_hex(mrb_state *mrb, mrb_value self)
+{
+  return mrb_str_to_integer(mrb, self, 16, FALSE);
+}
+
+/* Internal helper for String#oct - converts octal string to integer */
+static mrb_value
+str_oct(mrb_state *mrb, mrb_value self)
+{
+  return mrb_str_to_integer(mrb, self, 8, FALSE);
+}
+
+/*
+ *  call-seq:
+ *     string.chr    ->  string
+ *
+ *  Returns a one-character string at the beginning of the string.
+ *
+ *     a = "abcde"
+ *     a.chr    #=> "a"
+ */
+static mrb_value
+str_chr(mrb_state *mrb, mrb_value self)
+{
+  return mrb_str_substr(mrb, self, 0, 1);
+}
+
+/*
+ *  call-seq:
+ *     int.chr([encoding])  ->  string
+ *
+ *  Returns a string containing the character represented by the `int`'s value
+ *  according to `encoding`. +"ASCII-8BIT"+ (+"BINARY"+) and +"UTF-8"+ (only
+ *  with `MRB_UTF8_STRING`) can be specified as `encoding` (default is
+ *  +"ASCII-8BIT"+).
+ *
+ *     65.chr                  #=> "A"
+ *     230.chr                 #=> "\xE6"
+ *     230.chr("ASCII-8BIT")   #=> "\xE6"
+ *     230.chr("UTF-8")        #=> "\u00E6"
+ */
+static mrb_value
+int_chr(mrb_state *mrb, mrb_value num)
+{
+  mrb_value enc;
+  mrb_bool enc_given;
+
+  mrb_get_args(mrb, "|S?", &enc, &enc_given);
+  if (!enc_given ||
+      MRB_STR_CASECMP_P(enc, ENC_ASCII_8BIT) ||
+      MRB_STR_CASECMP_P(enc, ENC_BINARY)) {
+    return int_chr_binary(mrb, num);
+  }
+#ifdef MRB_UTF8_STRING
+  else if (MRB_STR_CASECMP_P(enc, ENC_UTF8)) {
+    return int_chr_utf8(mrb, num);
+  }
+#endif
+  else {
+    mrb_raisef(mrb, E_ARGUMENT_ERROR, "unknown encoding name - %v", enc);
+  }
+  /* not reached */
+  return mrb_nil_value();
+}
+
+/*
+ *  call-seq:
+ *     string.succ    ->  string
+ *
+ *  Returns next sequence of the string;
+ *
+ *     a = "bed"
+ *     a.succ    #=> "bee"
+ */
+static mrb_value
+str_succ_bang(mrb_state *mrb, mrb_value self)
+{
+  mrb_value result;
+  const char *prepend;
+  struct RString *s = mrb_str_ptr(self);
+
+  if (RSTRING_LEN(self) == 0)
+    return self;
+
+  mrb_str_modify(mrb, s);
+  mrb_int l = RSTRING_LEN(self);
+  unsigned char *p, *e, *b, *t;
+  b = p = (unsigned char*) RSTRING_PTR(self);
+  t = e = p + l;
+  *(e--) = 0;
+
+  // find trailing ascii/number
+  while (e >= b) {
+    if (ISALNUM(*e))
+      break;
+    e--;
+  }
+  if (e < b) {
+    e = p + l - 1;
+    result = mrb_str_new_lit(mrb, "");
+  }
+  else {
+    // find leading letter of the ascii/number
+    b = e;
+    while (b > p) {
+      if (!ISALNUM(*b) || (ISALNUM(*b) && *b != '9' && *b != 'z' && *b != 'Z'))
+        break;
+      b--;
+    }
+    if (!ISALNUM(*b))
+      b++;
+    result = mrb_str_new(mrb, (char*) p, b - p);
+  }
+
+  while (e >= b) {
+    if (!ISALNUM(*e)) {
+      if (*e == 0xff) {
+        mrb_str_cat_lit(mrb, result, "\x01");
+        (*e) = 0;
+      }
+      else
+        (*e)++;
+      break;
+    }
+    prepend = NULL;
+    if (*e == '9') {
+      if (e == b) prepend = "1";
+      *e = '0';
+    }
+    else if (*e == 'z') {
+      if (e == b) prepend = "a";
+      *e = 'a';
+    }
+    else if (*e == 'Z') {
+      if (e == b) prepend = "A";
+      *e = 'A';
+    }
+    else {
+      (*e)++;
+      break;
+    }
+    if (prepend) mrb_str_cat_cstr(mrb, result, prepend);
+    e--;
+  }
+  result = mrb_str_cat(mrb, result, (char*) b, t - b);
+  l = RSTRING_LEN(result);
+  mrb_str_resize(mrb, self, l);
+  memcpy(RSTRING_PTR(self), RSTRING_PTR(result), l);
+  return self;
+}
+
+static mrb_value
+str_succ(mrb_state *mrb, mrb_value self)
+{
+  mrb_value str = mrb_str_dup(mrb, self);
+  str_succ_bang(mrb, str);
+  return str;
+}
+
+#ifdef MRB_UTF8_STRING
+extern const char mrb_utf8len_table[];
+
+MRB_INLINE mrb_int
+utf8code(mrb_state* mrb, const unsigned char* p, const unsigned char *e)
+{
+  if (p[0] < 0x80) return p[0];
+
+  mrb_int len = mrb_utf8len_table[p[0]>>3];
+  if (p+len <= e && len > 1 && (p[1] & 0xc0) == 0x80) {
+    if (len == 2)
+      return ((p[0] & 0x1f) << 6) + (p[1] & 0x3f);
+    if ((p[2] & 0xc0) == 0x80) {
+      if (len == 3)
+        return ((p[0] & 0x0f) << 12) + ((p[1] & 0x3f) << 6)
+          + (p[2] & 0x3f);
+      if ((p[3] & 0xc0) == 0x80) {
+        if (len == 4)
+          return ((p[0] & 0x07) << 18) + ((p[1] & 0x3f) << 12)
+            + ((p[2] & 0x3f) << 6) + (p[3] & 0x3f);
+      }
+    }
+  }
+  mrb_raise(mrb, E_ARGUMENT_ERROR, "invalid UTF-8 byte sequence");
+  /* not reached */
+  return -1;
+}
+
+static mrb_value
+str_ord(mrb_state* mrb, mrb_value str)
+{
+  struct RString *s = mrb_str_ptr(str);
+  const unsigned char *p = (unsigned char*)RSTR_PTR(s);
+  const unsigned char *e = p + RSTR_LEN(s);
+  mrb_int c;
+
+  if (p == e) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "empty string");
+  }
+  if (RSTR_SINGLE_BYTE_P(s) || RSTR_BINARY_P(s)) {
+    c = p[0];
+  }
+  else {
+    c = utf8code(mrb, p, e);
+  }
+  return mrb_fixnum_value(c);
+}
+
+/* Internal helper for String#codepoints - returns array of character codepoints */
+static mrb_value
+str_codepoints(mrb_state *mrb, mrb_value str)
+{
+  struct RString *s = mrb_str_ptr(str);
+  const unsigned char *p = (unsigned char*)RSTR_PTR(s);
+  const unsigned char *e = p + RSTR_LEN(s);
+
+  mrb->c->ci->mid = 0;
+  mrb_value result = mrb_ary_new(mrb);
+  if (RSTR_SINGLE_BYTE_P(s) || RSTR_BINARY_P(s)) {
+    while (p < e) {
+      mrb_ary_push(mrb, result, mrb_int_value(mrb, (mrb_int)*p));
+      p++;
+    }
+  }
+  else {
+    while (p < e) {
+      mrb_int c = utf8code(mrb, p, e);
+      mrb_ary_push(mrb, result, mrb_int_value(mrb, c));
+      p += mrb_utf8len_table[p[0]>>3];
+    }
+  }
+  return result;
+}
+#else
+static mrb_value
+str_ord(mrb_state* mrb, mrb_value str)
+{
+  if (RSTRING_LEN(str) == 0)
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "empty string");
+  return mrb_fixnum_value((unsigned char)RSTRING_PTR(str)[0]);
+}
+
+static mrb_value
+str_codepoints(mrb_state *mrb, mrb_value self)
+{
+  char *p = RSTRING_PTR(self);
+  char *e = p + RSTRING_LEN(self);
+
+  mrb->c->ci->mid = 0;
+  mrb_value result = mrb_ary_new(mrb);
+  while (p < e) {
+    mrb_ary_push(mrb, result, mrb_int_value(mrb, (mrb_int)*p));
+    p++;
+  }
+  return result;
+}
+#endif
+
+static mrb_bool
+str_prefix_p(mrb_state *mrb, mrb_value str, const char *prefix_ptr, mrb_int prefix_len)
+{
+  mrb_int str_len = RSTRING_LEN(str);
+  if (prefix_len > str_len) return FALSE;
+  return memcmp(RSTRING_PTR(str), prefix_ptr, prefix_len) == 0;
+}
+
+/*
+ *  call-seq:
+ *     str.delete_prefix!(prefix) -> self or nil
+ *
+ *  Deletes leading `prefix` from *str*, returning
+ *  `nil` if no change was made.
+ *
+ *     "hello".delete_prefix!("hel") #=> "lo"
+ *     "hello".delete_prefix!("llo") #=> nil
+ */
+static mrb_value
+str_del_prefix_bang(mrb_state *mrb, mrb_value self)
+{
+  mrb_int plen;
+  const char *ptr;
+
+  mrb_get_args(mrb, "s", &ptr, &plen);
+  struct RString *str = RSTRING(self);
+  mrb_int slen = RSTR_LEN(str);
+  if (plen > slen) return mrb_nil_value();
+  char *s = RSTR_PTR(str);
+  if (!str_prefix_p(mrb, self, ptr, plen)) return mrb_nil_value();
+  if (!mrb_frozen_p(str) && (RSTR_SHARED_P(str) || RSTR_FSHARED_P(str))) {
+    str->as.heap.ptr += plen;
+  }
+  else {
+    mrb_str_modify(mrb, str);
+    s = RSTR_PTR(str);
+    memmove(s, s+plen, slen-plen);
+  }
+  RSTR_SET_LEN(str, slen-plen);
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str.delete_prefix(prefix) -> new_str
+ *
+ *  Returns a copy of *str* with leading `prefix` deleted.
+ *
+ *     "hello".delete_prefix("hel") #=> "lo"
+ *     "hello".delete_prefix("llo") #=> "hello"
+ */
+static mrb_value
+str_del_prefix(mrb_state *mrb, mrb_value self)
+{
+  mrb_int plen;
+  const char *ptr;
+
+  mrb_get_args(mrb, "s", &ptr, &plen);
+  mrb_int slen = RSTRING_LEN(self);
+  if (plen > slen) return mrb_str_dup(mrb, self);
+  if (!str_prefix_p(mrb, self, ptr, plen))
+    return mrb_str_dup(mrb, self);
+  return mrb_str_substr(mrb, self, plen, slen-plen);
+}
+
+static mrb_bool
+str_suffix_p(mrb_state *mrb, mrb_value str, const char *suffix_ptr, mrb_int suffix_len)
+{
+  mrb_int str_len = RSTRING_LEN(str);
+  if (suffix_len > str_len) return FALSE;
+  return memcmp(RSTRING_PTR(str) + (str_len - suffix_len), suffix_ptr, suffix_len) == 0;
+}
+
+/*
+ *  call-seq:
+ *     str.delete_suffix!(suffix) -> self or nil
+ *
+ *  Deletes trailing `suffix` from *str*, returning
+ *  `nil` if no change was made.
+ *
+ *     "hello".delete_suffix!("llo") #=> "he"
+ *     "hello".delete_suffix!("hel") #=> nil
+ */
+static mrb_value
+str_del_suffix_bang(mrb_state *mrb, mrb_value self)
+{
+  mrb_int plen;
+  const char *ptr;
+
+  mrb_get_args(mrb, "s", &ptr, &plen);
+  struct RString *str = RSTRING(self);
+  mrb_check_frozen(mrb, str);
+  mrb_int slen = RSTR_LEN(str);
+  if (plen > slen) return mrb_nil_value();
+  if (!str_suffix_p(mrb, self, ptr, plen)) return mrb_nil_value();
+  RSTR_SET_LEN(str, slen-plen);
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str.delete_suffix(suffix) -> new_str
+ *
+ *  Returns a copy of *str* with leading `suffix` deleted.
+ *
+ *     "hello".delete_suffix("hel") #=> "lo"
+ *     "hello".delete_suffix("llo") #=> "hello"
+ */
+static mrb_value
+str_del_suffix(mrb_state *mrb, mrb_value self)
+{
+  mrb_int plen;
+  const char *ptr;
+
+  mrb_get_args(mrb, "s", &ptr, &plen);
+  mrb_int slen = RSTRING_LEN(self);
+  if (plen > slen) return mrb_str_dup(mrb, self);
+  if (!str_suffix_p(mrb, self, ptr, plen))
+    return mrb_str_dup(mrb, self);
+  return mrb_str_substr(mrb, self, 0, slen-plen);
+}
+
+#define lesser(a,b) (((a)>(b))?(b):(a))
+
+/*
+ * call-seq:
+ *   str.casecmp(other_str)   -> -1, 0, +1 or nil
+ *
+ * Case-insensitive version of `String#<=>`.
+ *
+ *   "abcdef".casecmp("abcde")     #=> 1
+ *   "aBcDeF".casecmp("abcdef")    #=> 0
+ *   "abcdef".casecmp("abcdefg")   #=> -1
+ *   "abcdef".casecmp("ABCDEF")    #=> 0
+ */
+static mrb_value
+str_casecmp(mrb_state *mrb, mrb_value self)
+{
+  mrb_value str = mrb_get_arg1(mrb);
+
+  if (!mrb_string_p(str)) return mrb_nil_value();
+
+  struct RString *s1 = mrb_str_ptr(self);
+  struct RString *s2 = mrb_str_ptr(str);
+
+  mrb_int len1 = RSTR_LEN(s1);
+  mrb_int len2 = RSTR_LEN(s2);
+  mrb_int len = lesser(len1, len2);
+  char *p1 = RSTR_PTR(s1);
+  char *p2 = RSTR_PTR(s2);
+  if (p1 == p2) return mrb_fixnum_value(0);
+
+  for (mrb_int i=0; i<len; i++) {
+    int c1 = p1[i], c2 = p2[i];
+    if (ISASCII(c1) && ISUPPER(c1)) c1 = TOLOWER(c1);
+    if (ISASCII(c2) && ISUPPER(c2)) c2 = TOLOWER(c2);
+    if (c1 > c2) return mrb_fixnum_value(1);
+    if (c1 < c2) return mrb_fixnum_value(-1);
+  }
+  if (len1 == len2) return mrb_fixnum_value(0);
+  if (len1 > len2)  return mrb_fixnum_value(1);
+  return mrb_fixnum_value(-1);
+}
+#undef lesser
+
+/*
+ * call-seq:
+ *   str.casecmp?(other)  -> true, false, or nil
+ *
+ * Returns true if str and other_str are equal after case folding,
+ * false if they are not equal, and nil if other is not a string.
+ */
+static mrb_value
+str_casecmp_p(mrb_state *mrb, mrb_value self)
+{
+  mrb_value c = str_casecmp(mrb, self);
+  if (mrb_nil_p(c)) return c;
+  return mrb_bool_value(mrb_fixnum(c) == 0);
+}
+
+/* Internal helper for String#lines - splits string into array of lines */
+static mrb_value
+str_lines(mrb_state *mrb, mrb_value self)
+{
+  char *b = RSTRING_PTR(self);
+  char *p = b, *t;
+  char *e = b + RSTRING_LEN(self);
+
+  mrb->c->ci->mid = 0;
+  mrb_value result = mrb_ary_new(mrb);
+  int ai = mrb_gc_arena_save(mrb);
+  while (p < e) {
+    t = p;
+    while (p < e && *p != '\n') p++;
+    if (*p == '\n') p++;
+    mrb_int len = (mrb_int) (p - t);
+    mrb_ary_push(mrb, result, mrb_str_new(mrb, t, len));
+    mrb_gc_arena_restore(mrb, ai);
+  }
+  return result;
+}
+
+/*
+ * call-seq:
+ *   +string -> new_string or self
+ *
+ * Returns `self` if `self` is not frozen.
+ *
+ * Otherwise returns `self.dup`, which is not frozen.
+ */
+static mrb_value
+str_uplus(mrb_state *mrb, mrb_value str)
+{
+  if (mrb_frozen_p(mrb_obj_ptr(str))) {
+    return mrb_str_dup(mrb, str);
+  }
+  else {
+    return str;
+  }
+}
+
+/*
+ * call-seq:
+ *   -string -> frozen_string
+ *
+ * Returns a frozen, possibly pre-existing copy of the string.
+ *
+ */
+static mrb_value
+str_uminus(mrb_state *mrb, mrb_value str)
+{
+  if (mrb_frozen_p(mrb_obj_ptr(str))) {
+    return str;
+  }
+  return mrb_obj_freeze(mrb, mrb_str_dup(mrb, str));
+}
+
+/* Internal helper for String#ascii_only? - checks if string contains only ASCII characters */
+static mrb_value
+str_ascii_only_p(mrb_state *mrb, mrb_value str)
+{
+  struct RString *s = mrb_str_ptr(str);
+  const char *p = RSTR_PTR(s);
+  const char *e = p + RSTR_LEN(s);
+
+  while (p < e) {
+    if (*p & 0x80) return mrb_false_value();
+    p++;
+  }
+  mrb_str_ptr(str)->flags |= MRB_STR_SINGLE_BYTE;
+  return mrb_true_value();
+}
+
+/* Internal helper for String#b - returns binary encoded copy of string */
+static mrb_value
+str_b(mrb_state *mrb, mrb_value self)
+{
+  mrb_value str = mrb_str_dup(mrb, self);
+  mrb_str_ptr(str)->flags |= MRB_STR_BINARY;
+  return str;
+}
+
+/*
+ * Check if character is whitespace (space, tab, newline, carriage return, form feed, vertical tab)
+ */
+static inline mrb_bool
+is_whitespace(char c)
+{
+  return (c == ' ' || c == '\t' || c == '\n' || c == '\r' || c == '\f' || c == '\v');
+}
+
+/*
+ * Check if character is whitespace or null (for rstrip)
+ */
+static inline mrb_bool
+is_whitespace_or_null(char c)
+{
+  return (c == ' ' || c == '\t' || c == '\n' || c == '\r' || c == '\f' || c == '\v' || c == '\0');
+}
+
+/*
+ *  call-seq:
+ *     str.lstrip   -> new_str
+ *
+ *  Returns a copy of str with leading whitespace removed.
+ *
+ *     "  hello  ".lstrip   #=> "hello  "
+ *     "hello".lstrip       #=> "hello"
+ */
+static mrb_value
+str_lstrip(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  const char *ptr = RSTR_PTR(s);
+  mrb_int len = RSTR_LEN(s);
+  mrb_int start = 0;
+
+  /* Find first non-whitespace character */
+  while (start < len && is_whitespace(ptr[start])) {
+    start++;
+  }
+
+  /* Return empty string if all whitespace */
+  if (start >= len) {
+    return mrb_str_new_lit(mrb, "");
+  }
+
+  /* Return substring from first non-whitespace to end */
+  return mrb_str_substr(mrb, self, start, len - start);
+}
+
+/*
+ *  call-seq:
+ *     str.rstrip   -> new_str
+ *
+ *  Returns a copy of str with trailing whitespace removed.
+ *
+ *     "  hello  ".rstrip   #=> "  hello"
+ *     "hello".rstrip       #=> "hello"
+ */
+static mrb_value
+str_rstrip(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  const char *ptr = RSTR_PTR(s);
+  mrb_int len = RSTR_LEN(s);
+  mrb_int end = len;
+
+  /* Find last non-whitespace character */
+  while (end > 0 && is_whitespace_or_null(ptr[end - 1])) {
+    end--;
+  }
+
+  /* Return empty string if all whitespace */
+  if (end <= 0) {
+    return mrb_str_new_lit(mrb, "");
+  }
+
+  /* Return substring from start to last non-whitespace */
+  return mrb_str_substr(mrb, self, 0, end);
+}
+
+/*
+ *  call-seq:
+ *     str.strip   -> new_str
+ *
+ *  Returns a copy of str with leading and trailing whitespace removed.
+ *
+ *     "    hello    ".strip   #=> "hello"
+ *     "\tgoodbye\r\n".strip   #=> "goodbye"
+ */
+static mrb_value
+str_strip(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  const char *ptr = RSTR_PTR(s);
+  mrb_int len = RSTR_LEN(s);
+  mrb_int start = 0;
+  mrb_int end = len;
+
+  /* Find first non-whitespace character */
+  while (start < len && is_whitespace(ptr[start])) {
+    start++;
+  }
+
+  /* Find last non-whitespace character */
+  while (end > start && is_whitespace_or_null(ptr[end - 1])) {
+    end--;
+  }
+
+  /* Return empty string if all whitespace */
+  if (start >= end) {
+    return mrb_str_new_lit(mrb, "");
+  }
+
+  /* Return substring from first to last non-whitespace */
+  return mrb_str_substr(mrb, self, start, end - start);
+}
+
+/*
+ *  call-seq:
+ *     str.lstrip!   -> self or nil
+ *
+ *  Removes leading whitespace from str, returning nil if no change was made.
+ *
+ *     "  hello  ".lstrip!   #=> "hello  "
+ *     "hello".lstrip!       #=> nil
+ */
+static mrb_value
+str_lstrip_bang(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  char *ptr = RSTR_PTR(s);
+  mrb_int len = RSTR_LEN(s);
+  mrb_int start = 0;
+
+  mrb_check_frozen(mrb, mrb_obj_ptr(self));
+  mrb_str_modify(mrb, s);
+
+  /* Find first non-whitespace character */
+  while (start < len && is_whitespace(ptr[start])) {
+    start++;
+  }
+
+  /* No change needed */
+  if (start == 0) {
+    return mrb_nil_value();
+  }
+
+  /* Move remaining characters to beginning */
+  if (start < len) {
+    memmove(ptr, ptr + start, len - start);
+    RSTR_SET_LEN(s, len - start);
+    ptr[len - start] = '\0';
+  }
+  else {
+    /* All whitespace - make empty */
+    RSTR_SET_LEN(s, 0);
+    ptr[0] = '\0';
+  }
+
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str.rstrip!   -> self or nil
+ *
+ *  Removes trailing whitespace from str, returning nil if no change was made.
+ *
+ *     "  hello  ".rstrip!   #=> "  hello"
+ *     "hello".rstrip!       #=> nil
+ */
+static mrb_value
+str_rstrip_bang(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  char *ptr = RSTR_PTR(s);
+  mrb_int len = RSTR_LEN(s);
+  mrb_int end = len;
+
+  mrb_check_frozen(mrb, mrb_obj_ptr(self));
+  mrb_str_modify(mrb, s);
+
+  /* Find last non-whitespace character */
+  while (end > 0 && is_whitespace_or_null(ptr[end - 1])) {
+    end--;
+  }
+
+  /* No change needed */
+  if (end == len) {
+    return mrb_nil_value();
+  }
+
+  /* Truncate string */
+  RSTR_SET_LEN(s, end);
+  ptr[end] = '\0';
+
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str.strip!   -> self or nil
+ *
+ *  Removes leading and trailing whitespace from str, returning nil if no change was made.
+ *
+ *     "    hello    ".strip!   #=> "hello"
+ *     "hello".strip!           #=> nil
+ */
+static mrb_value
+str_strip_bang(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  char *ptr = RSTR_PTR(s);
+  mrb_int len = RSTR_LEN(s);
+  mrb_int start = 0;
+  mrb_int end = len;
+  mrb_bool changed = FALSE;
+
+  mrb_check_frozen(mrb, mrb_obj_ptr(self));
+  mrb_str_modify(mrb, s);
+
+  /* Find first non-whitespace character */
+  while (start < len && is_whitespace(ptr[start])) {
+    start++;
+  }
+
+  /* Find last non-whitespace character */
+  while (end > start && is_whitespace_or_null(ptr[end - 1])) {
+    end--;
+  }
+
+  /* Check if any changes needed */
+  if (start > 0) {
+    changed = TRUE;
+    if (start < end) {
+      memmove(ptr, ptr + start, end - start);
+    }
+  }
+
+  if (end != len) {
+    changed = TRUE;
+  }
+
+  if (!changed) {
+    return mrb_nil_value();
+  }
+
+  /* Set new length */
+  RSTR_SET_LEN(s, end - start);
+  ptr[end - start] = '\0';
+
+  return self;
+}
+
+/* Internal helper to count UTF-8 characters in a string using mruby's standard function */
+static mrb_int
+str_char_count(mrb_value str)
+{
+#ifdef MRB_UTF8_STRING
+  struct RString *s = mrb_str_ptr(str);
+
+  if (RSTR_SINGLE_BYTE_P(s) || RSTR_BINARY_P(s)) {
+    /* ASCII/Binary: each byte is a character */
+    return RSTR_LEN(s);
+  }
+
+  /* UTF-8: use mruby's standard UTF-8 character counting function */
+  return mrb_utf8_strlen(RSTR_PTR(s), RSTR_LEN(s));
+#else
+  /* Non-UTF8 build: treat as single bytes */
+  return RSTRING_LEN(str);
+#endif
+}
+
+/* Internal fast path for String#chars - returns array of individual characters */
+static mrb_value
+str_chars_ary(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  const unsigned char *p = (unsigned char*)RSTR_PTR(s);
+  const unsigned char *e = p + RSTR_LEN(s);
+
+  /* Estimate character count for array pre-allocation */
+  mrb_int estimated_chars = RSTR_LEN(s);
+  if (!RSTR_SINGLE_BYTE_P(s) && !RSTR_BINARY_P(s)) {
+    estimated_chars = estimated_chars / 2; /* rough estimate for UTF-8 */
+  }
+  mrb_value result = mrb_ary_new_capa(mrb, estimated_chars);
+
+  if (RSTR_SINGLE_BYTE_P(s) || RSTR_BINARY_P(s)) {
+    /* ASCII/Binary: each byte is a character */
+    while (p < e) {
+      mrb_value char_str = mrb_str_new(mrb, (char*)p, 1);
+      mrb_ary_push(mrb, result, char_str);
+      p++;
+    }
+  }
+  else {
+#ifdef MRB_UTF8_STRING
+    /* UTF-8: handle multi-byte characters */
+    while (p < e) {
+      mrb_int char_len = mrb_utf8len_table[p[0] >> 3];
+      if (char_len == 0 || char_len > 4 || p + char_len > e) {
+        /* Invalid UTF-8, treat as single byte */
+        char_len = 1;
+      }
+      else {
+        /* Validate UTF-8 sequence */
+        mrb_bool valid = TRUE;
+        if (char_len > 1) {
+          for (mrb_int i = 1; i < char_len; i++) {
+            if ((p[i] & 0xC0) != 0x80) {
+              valid = FALSE;
+              break;
+            }
+          }
+        }
+        if (!valid) {
+          char_len = 1;
+        }
+      }
+      mrb_value char_str = mrb_str_new(mrb, (char*)p, char_len);
+      mrb_ary_push(mrb, result, char_str);
+      p += char_len;
+    }
+#else
+    /* Non-UTF8 build: treat as single bytes */
+    while (p < e) {
+      mrb_value char_str = mrb_str_new(mrb, (char*)p, 1);
+      mrb_ary_push(mrb, result, char_str);
+      p++;
+    }
+#endif
+  }
+
+  return result;
+}
+
+/*
+ *  call-seq:
+ *     str.ljust(integer, padstr=' ')   -> new_str
+ *
+ *  If integer is greater than the length of str, returns a new
+ *  String of length integer with str left justified and padded with padstr;
+ *  otherwise, returns str.
+ */
+static mrb_value
+str_ljust_core(mrb_state *mrb, mrb_value self)
+{
+  mrb_int width;
+  mrb_value padstr = mrb_str_new_lit(mrb, " ");
+
+  mrb_get_args(mrb, "i|S", &width, &padstr);
+
+  if (RSTRING_LEN(padstr) == 0) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "zero width padding");
+  }
+
+  mrb_int char_len = str_char_count(self);
+  if (width <= char_len) {
+    return mrb_str_dup(mrb, self);
+  }
+
+  mrb_int padsize = width - char_len;
+  mrb_int pad_char_len = str_char_count(padstr);
+  if (pad_char_len == 0) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "zero width padding");
+  }
+
+  /* Build padding string by repeating padstr */
+  mrb_value padding = mrb_str_new_lit(mrb, "");
+  mrb_int chars_needed = padsize;
+  while (chars_needed > 0) {
+    if (chars_needed >= pad_char_len) {
+      mrb_str_cat_str(mrb, padding, padstr);
+      chars_needed -= pad_char_len;
+    }
+    else {
+      /* Need partial padding - use substr to get exact characters */
+      mrb_value partial = mrb_str_substr(mrb, padstr, 0, chars_needed);
+      mrb_str_cat_str(mrb, padding, partial);
+      chars_needed = 0;
+    }
+  }
+
+  return mrb_str_cat_str(mrb, mrb_str_dup(mrb, self), padding);
+}
+
+/*
+ *  call-seq:
+ *     str.rjust(integer, padstr=' ')   -> new_str
+ *
+ *  If integer is greater than the length of str, returns a new
+ *  String of length integer with str right justified and padded with padstr;
+ *  otherwise, returns str.
+ */
+static mrb_value
+str_rjust_core(mrb_state *mrb, mrb_value self)
+{
+  mrb_int width;
+  mrb_value padstr = mrb_str_new_lit(mrb, " ");
+
+  mrb_get_args(mrb, "i|S", &width, &padstr);
+
+  if (RSTRING_LEN(padstr) == 0) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "zero width padding");
+  }
+
+  mrb_int char_len = str_char_count(self);
+  if (width <= char_len) {
+    return mrb_str_dup(mrb, self);
+  }
+
+  mrb_int padsize = width - char_len;
+  mrb_int pad_char_len = str_char_count(padstr);
+  if (pad_char_len == 0) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "zero width padding");
+  }
+
+  /* Build padding string by repeating padstr */
+  mrb_value padding = mrb_str_new_lit(mrb, "");
+  mrb_int chars_needed = padsize;
+  while (chars_needed > 0) {
+    if (chars_needed >= pad_char_len) {
+      mrb_str_cat_str(mrb, padding, padstr);
+      chars_needed -= pad_char_len;
+    }
+    else {
+      /* Need partial padding - use substr to get exact characters */
+      mrb_value partial = mrb_str_substr(mrb, padstr, 0, chars_needed);
+      mrb_str_cat_str(mrb, padding, partial);
+      chars_needed = 0;
+    }
+  }
+
+  return mrb_str_cat_str(mrb, padding, self);
+}
+
+/*
+ *  call-seq:
+ *     str.center(width, padstr=' ')   -> new_str
+ *
+ *  Centers str in width. If width is greater than the length of str,
+ *  returns a new String of length width with str centered and padded with
+ *  padstr; otherwise, returns str.
+ */
+static mrb_value
+str_center_core(mrb_state *mrb, mrb_value self)
+{
+  mrb_int width;
+  mrb_value padstr = mrb_str_new_lit(mrb, " ");
+
+  mrb_get_args(mrb, "i|S", &width, &padstr);
+
+  if (RSTRING_LEN(padstr) == 0) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "zero width padding");
+  }
+
+  mrb_int char_len = str_char_count(self);
+  if (width <= char_len) {
+    return mrb_str_dup(mrb, self);
+  }
+
+  mrb_int total_pad = width - char_len;
+  mrb_int left_pad = total_pad / 2;
+  mrb_int right_pad = total_pad - left_pad;
+
+  mrb_int pad_char_len = str_char_count(padstr);
+  if (pad_char_len == 0) {
+    mrb_raise(mrb, E_ARGUMENT_ERROR, "zero width padding");
+  }
+
+  /* Build left padding */
+  mrb_value left_padding = mrb_str_new_lit(mrb, "");
+  mrb_int chars_needed = left_pad;
+  while (chars_needed > 0) {
+    if (chars_needed >= pad_char_len) {
+      mrb_str_cat_str(mrb, left_padding, padstr);
+      chars_needed -= pad_char_len;
+    }
+    else {
+      mrb_value partial = mrb_str_substr(mrb, padstr, 0, chars_needed);
+      mrb_str_cat_str(mrb, left_padding, partial);
+      chars_needed = 0;
+    }
+  }
+
+  /* Build right padding */
+  mrb_value right_padding = mrb_str_new_lit(mrb, "");
+  chars_needed = right_pad;
+  while (chars_needed > 0) {
+    if (chars_needed >= pad_char_len) {
+      mrb_str_cat_str(mrb, right_padding, padstr);
+      chars_needed -= pad_char_len;
+    }
+    else {
+      mrb_value partial = mrb_str_substr(mrb, padstr, 0, chars_needed);
+      mrb_str_cat_str(mrb, right_padding, partial);
+      chars_needed = 0;
+    }
+  }
+
+  mrb_value result = mrb_str_cat_str(mrb, left_padding, self);
+  return mrb_str_cat_str(mrb, result, right_padding);
+}
+
+#ifdef MRB_UTF8_STRING
+/*
+ * Given a character index, find the byte offset in a UTF-8 string.
+ * Returns -1 if the character index is out of bounds.
+ */
+static mrb_int
+str_char_to_byte_offset(mrb_value str, mrb_int char_index)
+{
+  struct RString *s = mrb_str_ptr(str);
+  const char *p = RSTR_PTR(s);
+  mrb_int byte_len = RSTR_LEN(s);
+
+  if (RSTR_SINGLE_BYTE_P(s) || RSTR_BINARY_P(s)) {
+    return char_index;
+  }
+
+  if (char_index < 0) return -1;
+
+  mrb_int byte_offset = 0;
+  mrb_int current_char_index = 0;
+  while (byte_offset < byte_len && current_char_index < char_index) {
+    mrb_int char_len = mrb_utf8len(p + byte_offset, p + byte_len - byte_offset);
+    if (char_len == 0) break;
+    byte_offset += char_len;
+    current_char_index++;
+  }
+
+  if (current_char_index < char_index) return -1;
+  return byte_offset;
+}
+
+/*
+ * Given a starting character index and a character length, find the byte length.
+ */
+static mrb_int
+str_chars_to_byte_len(mrb_value str, mrb_int char_start, mrb_int char_len)
+{
+  struct RString *s = mrb_str_ptr(str);
+  const char *p = RSTR_PTR(s);
+  mrb_int str_byte_len = RSTR_LEN(s);
+
+  if (RSTR_SINGLE_BYTE_P(s) || RSTR_BINARY_P(s)) {
+    return char_len;
+  }
+
+  mrb_int start_byte_offset = str_char_to_byte_offset(str, char_start);
+  if (start_byte_offset == -1) return 0;
+
+  mrb_int byte_offset = start_byte_offset;
+  mrb_int current_char_len = 0;
+  while (byte_offset < str_byte_len && current_char_len < char_len) {
+    mrb_int cl = mrb_utf8len(p + byte_offset, p + str_byte_len - byte_offset);
+    if (cl == 0) break;
+    byte_offset += cl;
+    current_char_len++;
+  }
+
+  return byte_offset - start_byte_offset;
+}
+#endif
+
+static mrb_value
+mrb_str_slice_bang(mrb_state *mrb, mrb_value self)
+{
+  mrb_check_frozen(mrb, mrb_obj_ptr(self));
+
+  mrb_value arg1, arg2;
+  mrb_int argc = mrb_get_args(mrb, "o|o", &arg1, &arg2);
+
+  struct RString *str = mrb_str_ptr(self);
+  const char *ptr = RSTRING_PTR(self);
+
+#ifdef MRB_UTF8_STRING
+  mrb_int str_len = str_char_count(self);
+#else
+  mrb_int str_len = RSTRING_LEN(self);
+#endif
+
+  mrb_int beg, len;
+
+  if (argc == 1) {
+    if (mrb_string_p(arg1)) {
+      mrb_int pos = mrb_str_index(mrb, self, RSTRING_PTR(arg1), RSTRING_LEN(arg1), 0);
+      if (pos == -1) return mrb_nil_value();
+#ifdef MRB_UTF8_STRING
+      beg = str_char_count(mrb_str_substr(mrb, self, 0, pos));
+      len = str_char_count(arg1);
+#else
+      beg = pos;
+      len = RSTRING_LEN(arg1);
+#endif
+    }
+    else if (mrb_range_p(arg1)) {
+      if (mrb_range_beg_len(mrb, arg1, &beg, &len, str_len, TRUE) != MRB_RANGE_OK) {
+        return mrb_nil_value();
+      }
+    }
+    else {
+      beg = mrb_as_int(mrb, arg1);
+      if (beg < 0) beg += str_len;
+      if (beg < 0 || beg >= str_len) return mrb_nil_value();
+      len = 1;
+    }
+  }
+  else { // argc == 2
+    beg = mrb_as_int(mrb, arg1);
+    len = mrb_as_int(mrb, arg2);
+    if (beg < 0) beg += str_len;
+    if (len < 0) return mrb_nil_value();
+    if (beg < 0 || beg > str_len) return mrb_nil_value();
+  }
+
+  if (beg > str_len) return mrb_nil_value();
+  if (beg + len > str_len) {
+    len = str_len - beg;
+  }
+  if (len < 0) len = 0;
+
+#ifdef MRB_UTF8_STRING
+  mrb_int byte_beg = str_char_to_byte_offset(self, beg);
+  mrb_int byte_len = str_chars_to_byte_len(self, beg, len);
+#else
+  mrb_int byte_beg = beg;
+  mrb_int byte_len = len;
+#endif
+
+  if (byte_beg < 0 || byte_beg > RSTRING_LEN(self) || byte_beg + byte_len > RSTRING_LEN(self)) {
+    return mrb_nil_value();
+  }
+
+  mrb_value result = mrb_str_new(mrb, RSTRING_PTR(self) + byte_beg, byte_len);
+
+  mrb_str_modify(mrb, str);
+  ptr = RSTRING_PTR(self);
+  memmove((char*)ptr + byte_beg, ptr + byte_beg + byte_len, RSTRING_LEN(self) - byte_beg - byte_len);
+  RSTR_SET_LEN(str, RSTRING_LEN(self) - byte_len);
+
+  return result;
+}
+
+/*
+ *  call-seq:
+ *     string.clear    ->  string
+ *
+ *  Makes string empty.
+ *
+ *     a = "abcde"
+ *     a.clear    #=> ""
+ */
+static mrb_value
+str_clear(mrb_state *mrb, mrb_value self)
+{
+  struct RString *s = mrb_str_ptr(self);
+  mrb_str_modify(mrb, s);
+  RSTR_SET_LEN(s, 0);
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str.partition(sep) -> [head, sep, tail]
+ *
+ *  Searches for the first occurrence of `sep` in `str`. If `sep` is found,
+ *  returns a 3-element array containing the part of `str` before `sep`,
+ *  `sep` itself, and the part of `str` after `sep`.
+ *
+ *  If `sep` is not found, returns a 3-element array containing `str`,
+ *  an empty string, and an empty string.
+ *
+ *     "hello world".partition(" ")   #=> ["hello", " ", "world"]
+ *     "hello world".partition("o")   #=> ["hell", "o", " world"]
+ *     "hello world".partition("x")   #=> ["hello world", "", ""]
+ */
+static mrb_value
+str_partition(mrb_state *mrb, mrb_value self)
+{
+  mrb_value sep;
+  mrb_get_args(mrb, "S", &sep);
+
+  mrb_int self_len = RSTRING_LEN(self);
+  mrb_int sep_len = RSTRING_LEN(sep);
+  const char *self_ptr = RSTRING_PTR(self);
+  const char *sep_ptr = RSTRING_PTR(sep);
+
+  mrb_value result_ary = mrb_ary_new_capa(mrb, 3);
+
+  if (sep_len == 0) {
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    mrb_ary_push(mrb, result_ary, mrb_str_dup(mrb, self));
+    return result_ary;
+  }
+
+  const char *found_ptr = NULL;
+  for (mrb_int i = 0; i <= self_len - sep_len; ++i) {
+    if (memcmp(self_ptr + i, sep_ptr, sep_len) == 0) {
+      found_ptr = self_ptr + i;
+      break;
+    }
+  }
+
+  if (found_ptr) {
+    mrb_int pre_len = found_ptr - self_ptr;
+    mrb_int post_len = self_len - pre_len - sep_len;
+
+    mrb_ary_push(mrb, result_ary, mrb_str_new(mrb, self_ptr, pre_len));
+    mrb_ary_push(mrb, result_ary, mrb_str_dup(mrb, sep));
+    mrb_ary_push(mrb, result_ary, mrb_str_new(mrb, found_ptr + sep_len, post_len));
+  }
+  else {
+    mrb_ary_push(mrb, result_ary, mrb_str_dup(mrb, self));
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+  }
+
+  return result_ary;
+}
+
+/*
+ *  call-seq:
+ *     str.rpartition(sep) -> [head, sep, tail]
+ *
+ *  Searches for the last occurrence of `sep` in `str`. If `sep` is found,
+ *  returns a 3-element array containing the part of `str` before `sep`,
+ *  `sep` itself, and the part of `str` after `sep`.
+ *
+ *  If `sep` is not found, returns a 3-element array containing an empty string,
+ *  an empty string, and `str`.
+ *
+ *     "hello world".rpartition(" ")   #=> ["hello", " ", "world"]
+ *     "hello world".rpartition("o")   #=> ["hello w", "o", "rld"]
+ *     "hello world".rpartition("x")   #=> ["", "", "hello world"]
+ */
+static mrb_value
+str_rpartition(mrb_state *mrb, mrb_value self)
+{
+  mrb_value sep;
+  mrb_get_args(mrb, "S", &sep);
+
+  mrb_int self_len = RSTRING_LEN(self);
+  mrb_int sep_len = RSTRING_LEN(sep);
+  const char *self_ptr = RSTRING_PTR(self);
+  const char *sep_ptr = RSTRING_PTR(sep);
+
+  mrb_value result_ary = mrb_ary_new_capa(mrb, 3);
+
+  if (sep_len == 0) {
+    mrb_ary_push(mrb, result_ary, mrb_str_dup(mrb, self));
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    return result_ary;
+  }
+
+  const char *found_ptr = NULL;
+  for (mrb_int i = self_len - sep_len; i >= 0; --i) {
+    if (memcmp(self_ptr + i, sep_ptr, sep_len) == 0) {
+      found_ptr = self_ptr + i;
+      break;
+    }
+  }
+
+  if (found_ptr) {
+    mrb_int pre_len = found_ptr - self_ptr;
+    mrb_int post_len = self_len - pre_len - sep_len;
+
+    mrb_ary_push(mrb, result_ary, mrb_str_new(mrb, self_ptr, pre_len));
+    mrb_ary_push(mrb, result_ary, mrb_str_dup(mrb, sep));
+    mrb_ary_push(mrb, result_ary, mrb_str_new(mrb, found_ptr + sep_len, post_len));
+  }
+  else {
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    mrb_ary_push(mrb, result_ary, mrb_str_new_lit(mrb, ""));
+    mrb_ary_push(mrb, result_ary, mrb_str_dup(mrb, self));
+  }
+
+  return result_ary;
+}
+
+/*
+ *  call-seq:
+ *     str.insert(index, other_str)   -> str
+ *
+ *  Inserts *other_str* before the character at the given
+ *  *index*, modifying *str*. Negative indices count from the
+ *  end of the string, and insert <em>after</em> the given character.
+ *  The intent is insert *aString* so that it starts at the given
+ *  *index*.
+ *
+ *     "abcd".insert(0, 'X')    #=> "Xabcd"
+ *     "abcd".insert(3, 'X')    #=> "abcXd"
+ *     "abcd".insert(4, 'X')    #=> "abcdX"
+ *     "abcd".insert(-3, 'X')   #=> "abXcd"
+ *     "abcd".insert(-1, 'X')   #=> "abcdX"
+ */
+static mrb_value
+str_insert(mrb_state *mrb, mrb_value self)
+{
+  mrb_int idx;
+  mrb_value str_to_insert;
+  mrb_get_args(mrb, "iS", &idx, &str_to_insert);
+
+  struct RString *s = mrb_str_ptr(self);
+  mrb_int self_len = RSTR_LEN(s);
+  mrb_int insert_len = RSTRING_LEN(str_to_insert);
+
+  mrb_check_frozen(mrb, s);
+
+  if (idx < 0) {
+    idx = self_len + idx + 1;
+  }
+
+  if (idx < 0 || idx > self_len) {
+    mrb_raisef(mrb, E_INDEX_ERROR, "index %S out of string", mrb_int_value(mrb, idx));
+  }
+
+  mrb_str_modify(mrb, s);
+  mrb_str_resize(mrb, self, self_len + insert_len);
+
+  char *p = RSTRING_PTR(self);
+  memmove(p + idx + insert_len, p + idx, self_len - idx);
+  memcpy(p + idx, RSTRING_PTR(str_to_insert), insert_len);
+
+  return self;
+}
+
+/*
+ *  call-seq:
+ *     str.prepend(*other_str)   -> str
+ *
+ *  Prepend---Prepend the given strings to *str*.
+ *
+ *     a = "world"
+ *     a.prepend("hello ") #=> "hello world"
+ *     a                   #=> "hello world"
+ *
+ *  Multiple arguments are prepended in order:
+ *
+ *     a = "world"
+ *     a.prepend("hello ", "beautiful ") #=> "hello beautiful world"
+ */
+static mrb_value
+str_prepend(mrb_state *mrb, mrb_value self)
+{
+  mrb_value *argv;
+  mrb_int argc;
+  mrb_get_args(mrb, "*", &argv, &argc);
+
+  if (argc == 0) {
+    return self;
+  }
+
+  struct RString *s = mrb_str_ptr(self);
+  mrb_check_frozen(mrb, s);
+
+  /* Calculate total length needed for all prepended strings */
+  mrb_int total_prepend_len = 0;
+  for (mrb_int i = 0; i < argc; i++) {
+    mrb_ensure_string_type(mrb, argv[i]);
+    total_prepend_len += RSTRING_LEN(argv[i]);
+  }
+
+  if (total_prepend_len == 0) {
+    return self;
+  }
+
+  mrb_int self_len = RSTRING_LEN(self);
+  mrb_str_modify(mrb, s);
+  mrb_str_resize(mrb, self, self_len + total_prepend_len);
+
+  char *p = RSTRING_PTR(self);
+
+  /* Move original content to the end */
+  memmove(p + total_prepend_len, p, self_len);
+
+  /* Copy prepended strings in order */
+  mrb_int offset = 0;
+  for (mrb_int i = 0; i < argc; i++) {
+    mrb_int arg_len = RSTRING_LEN(argv[i]);
+    if (arg_len > 0) {
+      memcpy(p + offset, RSTRING_PTR(argv[i]), arg_len);
+      offset += arg_len;
+    }
+  }
+
+  return self;
+}
+
+/* ---------------------------*/
+static const mrb_mt_entry string_ext_rom_entries[] = {
+  MRB_MT_ENTRY(mrb_str_dump,        MRB_SYM(dump),            MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_swapcase_bang,   MRB_SYM_B(swapcase),      MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(mrb_str_slice_bang,  MRB_SYM_B(slice),         MRB_ARGS_ARG(1,1)),
+  MRB_MT_ENTRY(str_swapcase,        MRB_SYM(swapcase),        MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_clear,           MRB_SYM(clear),           MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_concat_m,        MRB_OPSYM(lshift),        MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_concat_m,        MRB_SYM(concat),          MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_append_as_bytes, MRB_SYM(append_as_bytes), MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_count,           MRB_SYM(count),           MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_tr_m,            MRB_SYM(tr),              MRB_ARGS_REQ(2)),
+  MRB_MT_ENTRY(str_partition,       MRB_SYM(partition),       MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_rpartition,      MRB_SYM(rpartition),      MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_insert,          MRB_SYM(insert),          MRB_ARGS_REQ(2)),
+  MRB_MT_ENTRY(str_prepend,         MRB_SYM(prepend),         MRB_ARGS_REST()),
+  MRB_MT_ENTRY(str_tr_bang,         MRB_SYM_B(tr),            MRB_ARGS_REQ(2)),
+  MRB_MT_ENTRY(str_tr_s,            MRB_SYM(tr_s),            MRB_ARGS_REQ(2)),
+  MRB_MT_ENTRY(str_tr_s_bang,       MRB_SYM_B(tr_s),          MRB_ARGS_REQ(2)),
+  MRB_MT_ENTRY(str_squeeze_m,       MRB_SYM(squeeze),         MRB_ARGS_OPT(1)),
+  MRB_MT_ENTRY(str_squeeze_bang,    MRB_SYM_B(squeeze),       MRB_ARGS_OPT(1)),
+  MRB_MT_ENTRY(str_delete_m,        MRB_SYM(delete),          MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_delete_bang,     MRB_SYM_B(delete),        MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_start_with,      MRB_SYM_Q(start_with),    MRB_ARGS_REST()),
+  MRB_MT_ENTRY(str_end_with,        MRB_SYM_Q(end_with),      MRB_ARGS_REST()),
+  MRB_MT_ENTRY(str_hex,             MRB_SYM(hex),             MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_oct,             MRB_SYM(oct),             MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_chr,             MRB_SYM(chr),             MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_succ,            MRB_SYM(succ),            MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_succ_bang,       MRB_SYM_B(succ),          MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_succ,            MRB_SYM(next),            MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_succ_bang,       MRB_SYM_B(next),          MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_ord,             MRB_SYM(ord),             MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_del_prefix_bang, MRB_SYM_B(delete_prefix), MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_del_prefix,      MRB_SYM(delete_prefix),   MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_del_suffix_bang, MRB_SYM_B(delete_suffix), MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_del_suffix,      MRB_SYM(delete_suffix),   MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_casecmp,         MRB_SYM(casecmp),         MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_casecmp_p,       MRB_SYM_Q(casecmp),       MRB_ARGS_REQ(1)),
+  MRB_MT_ENTRY(str_uplus,           MRB_OPSYM(plus),          MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_uminus,          MRB_OPSYM(minus),         MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_ascii_only_p,    MRB_SYM_Q(ascii_only),    MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_b,               MRB_SYM(b),               MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_lines,           MRB_SYM(__lines),         MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_codepoints,      MRB_SYM(__codepoints),    MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_lstrip,          MRB_SYM(lstrip),          MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_rstrip,          MRB_SYM(rstrip),          MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_strip,           MRB_SYM(strip),           MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_lstrip_bang,     MRB_SYM_B(lstrip),        MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_rstrip_bang,     MRB_SYM_B(rstrip),        MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_strip_bang,      MRB_SYM_B(strip),         MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_chars_ary,       MRB_SYM(__chars),         MRB_ARGS_NONE()),
+  MRB_MT_ENTRY(str_ljust_core,      MRB_SYM(ljust),           MRB_ARGS_ARG(1,1)),
+  MRB_MT_ENTRY(str_rjust_core,      MRB_SYM(rjust),           MRB_ARGS_ARG(1,1)),
+  MRB_MT_ENTRY(str_center_core,     MRB_SYM(center),          MRB_ARGS_ARG(1,1)),
+};
+
+void
+mrb_mruby_string_ext_gem_init(mrb_state* mrb)
+{
+  struct RClass *s = mrb->string_class;
+
+  MRB_MT_INIT_ROM(mrb, s, string_ext_rom_entries);
+  mrb_define_method_id(mrb, mrb->integer_class, MRB_SYM(chr), int_chr, MRB_ARGS_NONE()|MRB_ARGS_OPT(1));
+}
+
+void
+mrb_mruby_string_ext_gem_final(mrb_state* mrb)
+{
+}