/*

** string.c - String class

**

** See Copyright Notice in mruby.h

*/

#include <ctype.h>

#include <float.h>

#include <limits.h>

#include <stddef.h>

#include <stdlib.h>

#include <string.h>

#include "mruby.h"

#include "mruby/array.h"

#include "mruby/class.h"

#include "mruby/range.h"

#include "mruby/string.h"

#include "mruby/re.h"

const char mrb_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";

typedef struct mrb_shared_string {

mrb_bool nofree : 1;

int refcnt;

char *ptr;

mrb_int len;

} mrb_shared_string;

static mrb_value str_replace(mrb_state *mrb, struct RString *s1, struct RString *s2);

static mrb_value mrb_str_subseq(mrb_state *mrb, mrb_value str, mrb_int beg, mrb_int len);

mrb_int

mrb_str_strlen(mrb_state *mrb, struct RString *s)

{

mrb_int i, max = RSTR_LEN(s);

char *p = RSTR_PTR(s);

if (!p) return 0;

for (i=0; i<max; i++) {

if (p[i] == '\0') {

mrb_raise(mrb, E_ARGUMENT_ERROR, "string contains null byte");

}

}

return max;

}

static inline void

resize_capa(mrb_state *mrb, struct RString *s, mrb_int capacity)

{

if (RSTR_EMBED_P(s)) {

if (RSTRING_EMBED_LEN_MAX < capacity) {

char *const tmp = (char *)mrb_malloc(mrb, capacity+1);

const mrb_int len = RSTR_EMBED_LEN(s);

memcpy(tmp, s->as.ary, len);

RSTR_UNSET_EMBED_FLAG(s);

s->as.heap.ptr = tmp;

s->as.heap.len = len;

s->as.heap.aux.capa = capacity;

}

}

else {

s->as.heap.ptr = (char *)mrb_realloc(mrb, RSTR_PTR(s), capacity+1);

s->as.heap.aux.capa = capacity;

}

}

static void

str_decref(mrb_state *mrb, mrb_shared_string *shared)

{

shared->refcnt--;

if (shared->refcnt == 0) {

if (!shared->nofree) {

mrb_free(mrb, shared->ptr);

}

mrb_free(mrb, shared);

}

}

void

mrb_str_modify(mrb_state *mrb, struct RString *s)

{

if (RSTR_SHARED_P(s)) {

mrb_shared_string *shared = s->as.heap.aux.shared;

if (shared->refcnt == 1 && s->as.heap.ptr == shared->ptr) {

s->as.heap.ptr = shared->ptr;

s->as.heap.aux.capa = shared->len;

RSTR_PTR(s)[s->as.heap.len] = '\0';

mrb_free(mrb, shared);

}

else {

char *ptr, *p;

mrb_int len;

p = RSTR_PTR(s);

len = s->as.heap.len;

ptr = (char *)mrb_malloc(mrb, (size_t)len + 1);

if (p) {

memcpy(ptr, p, len);

}

ptr[len] = '\0';

s->as.heap.ptr = ptr;

s->as.heap.aux.capa = len;

str_decref(mrb, shared);

}

RSTR_UNSET_SHARED_FLAG(s);

return;

}

if (RSTR_NOFREE_P(s)) {

char *p = s->as.heap.ptr;

s->as.heap.ptr = (char *)mrb_malloc(mrb, (size_t)s->as.heap.len+1);

if (p) {

memcpy(RSTR_PTR(s), p, s->as.heap.len);

}

RSTR_PTR(s)[s->as.heap.len] = '\0';

s->as.heap.aux.capa = s->as.heap.len;

RSTR_UNSET_NOFREE_FLAG(s);

return;

}

}

mrb_value

mrb_str_resize(mrb_state *mrb, mrb_value str, mrb_int len)

{

mrb_int slen;

struct RString *s = mrb_str_ptr(str);

mrb_str_modify(mrb, s);

slen = RSTR_LEN(s);

if (len != slen) {

if (slen < len || slen - len > 256) {

resize_capa(mrb, s, len);

}

RSTR_SET_LEN(s, len);

RSTR_PTR(s)[len] = '\0'; /* sentinel */

}

return str;

}

#define mrb_obj_alloc_string(mrb) ((struct RString*)mrb_obj_alloc((mrb), MRB_TT_STRING, (mrb)->string_class))

static struct RString*

str_new(mrb_state *mrb, const char *p, size_t len)

{

struct RString *s;

s = mrb_obj_alloc_string(mrb);

if (len < RSTRING_EMBED_LEN_MAX) {

RSTR_SET_EMBED_FLAG(s);

RSTR_SET_EMBED_LEN(s,len);

if (p) {

memcpy(s->as.ary, p, len);

}

} else {

if (len >= MRB_INT_MAX) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "string size too big");

}

s->as.heap.len = len;

s->as.heap.aux.capa = len;

s->as.heap.ptr = (char *)mrb_malloc(mrb, len+1);

if (p) {

memcpy(s->as.heap.ptr, p, len);

}

}

RSTR_PTR(s)[len] = '\0';

return s;

}

static void

str_with_class(mrb_state *mrb, struct RString *s, mrb_value obj)

{

s->c = mrb_str_ptr(obj)->c;

}

static mrb_value

mrb_str_new_empty(mrb_state *mrb, mrb_value str)

{

struct RString *s = str_new(mrb, 0, 0);

str_with_class(mrb, s, str);

return mrb_obj_value(s);

}

#ifndef MRB_STR_BUF_MIN_SIZE

# define MRB_STR_BUF_MIN_SIZE 128

#endif

mrb_value

mrb_str_buf_new(mrb_state *mrb, size_t capa)

{

struct RString *s;

s = mrb_obj_alloc_string(mrb);

if (capa >= MRB_INT_MAX) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "string capacity size too big");

}

if (capa < MRB_STR_BUF_MIN_SIZE) {

capa = MRB_STR_BUF_MIN_SIZE;

}

s->as.heap.len = 0;

s->as.heap.aux.capa = capa;

s->as.heap.ptr = (char *)mrb_malloc(mrb, capa+1);

RSTR_PTR(s)[0] = '\0';

return mrb_obj_value(s);

}

static void

str_buf_cat(mrb_state *mrb, struct RString *s, const char *ptr, size_t len)

{

size_t capa;

size_t total;

ptrdiff_t off = -1;

if (len == 0) return;

mrb_str_modify(mrb, s);

if (ptr >= RSTR_PTR(s) && ptr <= RSTR_PTR(s) + (size_t)RSTR_LEN(s)) {

off = ptr - RSTR_PTR(s);

}

if (RSTR_EMBED_P(s))

capa = RSTRING_EMBED_LEN_MAX;

else

capa = s->as.heap.aux.capa;

if (RSTR_LEN(s) >= MRB_INT_MAX - (mrb_int)len) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "string size too big");

}

total = RSTR_LEN(s)+len;

if (capa <= total) {

while (total > capa) {

if (capa + 1 >= MRB_INT_MAX / 2) {

capa = (total + 4095) / 4096;

break;

}

capa = (capa + 1) * 2;

}

resize_capa(mrb, s, capa);

}

if (off != -1) {

ptr = RSTR_PTR(s) + off;

}

memcpy(RSTR_PTR(s) + RSTR_LEN(s), ptr, len);

mrb_assert_int_fit(size_t, total, mrb_int, MRB_INT_MAX);

RSTR_SET_LEN(s, total);

RSTR_PTR(s)[total] = '\0'; /* sentinel */

}

mrb_value

mrb_str_new(mrb_state *mrb, const char *p, size_t len)

{

return mrb_obj_value(str_new(mrb, p, len));

}

/*

* call-seq: (Caution! NULL string)

* String.new(str="") => new_str

*

* Returns a new string object containing a copy of <i>str</i>.

*/

mrb_value

mrb_str_new_cstr(mrb_state *mrb, const char *p)

{

struct RString *s;

size_t len;

if (p) {

len = strlen(p);

}

else {

len = 0;

}

s = str_new(mrb, p, len);

return mrb_obj_value(s);

}

mrb_value

mrb_str_new_static(mrb_state *mrb, const char *p, size_t len)

{

struct RString *s;

if (len >= MRB_INT_MAX) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "string size too big");

}

s = mrb_obj_alloc_string(mrb);

s->as.heap.len = len;

s->as.heap.aux.capa = 0; /* nofree */

s->as.heap.ptr = (char *)p;

s->flags = MRB_STR_NOFREE;

return mrb_obj_value(s);

}

void

mrb_gc_free_str(mrb_state *mrb, struct RString *str)

{

if (RSTR_EMBED_P(str))

/* no code */;

else if (RSTR_SHARED_P(str))

str_decref(mrb, str->as.heap.aux.shared);

else if (!RSTR_NOFREE_P(str))

mrb_free(mrb, str->as.heap.ptr);

}

char *

mrb_str_to_cstr(mrb_state *mrb, mrb_value str0)

{

struct RString *s;

if (!mrb_string_p(str0)) {

mrb_raise(mrb, E_TYPE_ERROR, "expected String");

}

s = str_new(mrb, RSTRING_PTR(str0), RSTRING_LEN(str0));

if ((strlen(RSTR_PTR(s)) ^ RSTR_LEN(s)) != 0) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "string contains null byte");

}

return RSTR_PTR(s);

}

static void

str_make_shared(mrb_state *mrb, struct RString *s)

{

if (!RSTR_SHARED_P(s)) {

mrb_shared_string *shared = (mrb_shared_string *)mrb_malloc(mrb, sizeof(mrb_shared_string));

shared->refcnt = 1;

if (RSTR_EMBED_P(s)) {

const mrb_int len = RSTR_EMBED_LEN(s);

char *const tmp = (char *)mrb_malloc(mrb, len+1);

memcpy(tmp, s->as.ary, len);

tmp[len] = '\0';

RSTR_UNSET_EMBED_FLAG(s);

s->as.heap.ptr = tmp;

s->as.heap.len = len;

shared->nofree = FALSE;

shared->ptr = s->as.heap.ptr;

}

else if (RSTR_NOFREE_P(s)) {

shared->nofree = TRUE;

shared->ptr = s->as.heap.ptr;

RSTR_UNSET_NOFREE_FLAG(s);

}

else {

shared->nofree = FALSE;

if (s->as.heap.aux.capa > s->as.heap.len) {

s->as.heap.ptr = shared->ptr = (char *)mrb_realloc(mrb, s->as.heap.ptr, s->as.heap.len+1);

}

else {

shared->ptr = s->as.heap.ptr;

}

}

shared->len = s->as.heap.len;

s->as.heap.aux.shared = shared;

RSTR_SET_SHARED_FLAG(s);

}

}

/*

* call-seq:

* char* str = String("abcd"), len=strlen("abcd")

*

* Returns a new string object containing a copy of <i>str</i>.

*/

const char*

mrb_str_body(mrb_value str, int *len_p)

{

struct RString *s = mrb_str_ptr(str);

*len_p = RSTR_LEN(s);

return RSTR_PTR(s);

}

/*

* call-seq: (Caution! String("abcd") change)

* String("abcdefg") = String("abcd") + String("efg")

*

* Returns a new string object containing a copy of <i>str</i>.

*/

void

mrb_str_concat(mrb_state *mrb, mrb_value self, mrb_value other)

{

struct RString *s1 = mrb_str_ptr(self), *s2;

mrb_int len;

mrb_str_modify(mrb, s1);

if (!mrb_string_p(other)) {

other = mrb_str_to_str(mrb, other);

}

s2 = mrb_str_ptr(other);

len = RSTR_LEN(s1) + RSTR_LEN(s2);

if (RSTRING_CAPA(self) < len) {

resize_capa(mrb, s1, len);

}

memcpy(RSTR_PTR(s1)+RSTR_LEN(s1), RSTR_PTR(s2), RSTR_LEN(s2));

RSTR_SET_LEN(s1, len);

RSTR_PTR(s1)[len] = '\0';

}

/*

* call-seq: (Caution! String("abcd") remain)

* String("abcdefg") = String("abcd") + String("efg")

*

* Returns a new string object containing a copy of <i>str</i>.

*/

mrb_value

mrb_str_plus(mrb_state *mrb, mrb_value a, mrb_value b)

{

struct RString *s = mrb_str_ptr(a);

struct RString *s2 = mrb_str_ptr(b);

struct RString *t;

t = str_new(mrb, 0, RSTR_LEN(s) + RSTR_LEN(s2));

memcpy(RSTR_PTR(t), RSTR_PTR(s), RSTR_LEN(s));

memcpy(RSTR_PTR(t) + RSTR_LEN(s), RSTR_PTR(s2), RSTR_LEN(s2));

return mrb_obj_value(t);

}

/* 15.2.10.5.2 */

/*

* call-seq: (Caution! String("abcd") remain) for stack_argument

* String("abcdefg") = String("abcd") + String("efg")

*

* Returns a new string object containing a copy of <i>str</i>.

*/

static mrb_value

mrb_str_plus_m(mrb_state *mrb, mrb_value self)

{

mrb_value str;

mrb_get_args(mrb, "S", &str);

return mrb_str_plus(mrb, self, str);

}

/*

* call-seq:

* len = strlen(String("abcd"))

*

* Returns a new string object containing a copy of <i>str</i>.

*/

static mrb_value

mrb_str_bytesize(mrb_state *mrb, mrb_value self)

{

struct RString *s = mrb_str_ptr(self);

return mrb_fixnum_value(RSTR_LEN(s));

}

/* 15.2.10.5.26 */

/* 15.2.10.5.33 */

/*

* call-seq:

* len = strlen(String("abcd"))

*

* Returns a new string object containing a copy of <i>str</i>.

*/

mrb_value

mrb_str_size(mrb_state *mrb, mrb_value self)

{

struct RString *s = mrb_str_ptr(self);

return mrb_fixnum_value(RSTR_LEN(s));

}

/* 15.2.10.5.1 */

/*

* call-seq:

* str * integer => new_str

*

* Copy---Returns a new <code>String</code> containing <i>integer</i> copies of

* the receiver.

*

* "Ho! " * 3 #=> "Ho! Ho! Ho! "

*/

static mrb_value

mrb_str_times(mrb_state *mrb, mrb_value self)

{

mrb_int n,len,times;

struct RString *str2;

char *p;

mrb_get_args(mrb, "i", &times);

if (times < 0) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "negative argument");

}

if (times && MRB_INT_MAX / times < RSTRING_LEN(self)) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "argument too big");

}

len = RSTRING_LEN(self)*times;

str2 = str_new(mrb, 0, len);

str_with_class(mrb, str2, self);

p = RSTR_PTR(str2);

if (len > 0) {

n = RSTRING_LEN(self);

memcpy(p, RSTRING_PTR(self), n);

while (n <= len/2) {

memcpy(p + n, p, n);

n *= 2;

}

memcpy(p + n, p, len-n);

}

p[RSTR_LEN(str2)] = '\0';

return mrb_obj_value(str2);

}

/* -------------------------------------------------------------- */

#define lesser(a,b) (((a)>(b))?(b):(a))

/* ---------------------------*/

/*

* call-seq:

* mrb_value str1 <=> mrb_value str2 => int

* > 1

* = 0

* < -1

*/

int

mrb_str_cmp(mrb_state *mrb, mrb_value str1, mrb_value str2)

{

mrb_int len;

mrb_int retval;

struct RString *s1 = mrb_str_ptr(str1);

struct RString *s2 = mrb_str_ptr(str2);

len = lesser(RSTR_LEN(s1), RSTR_LEN(s2));

retval = memcmp(RSTR_PTR(s1), RSTR_PTR(s2), len);

if (retval == 0) {

if (RSTR_LEN(s1) == RSTR_LEN(s2)) return 0;

if (RSTR_LEN(s1) > RSTR_LEN(s2)) return 1;

return -1;

}

if (retval > 0) return 1;

return -1;

}

/* 15.2.10.5.3 */

/*

* call-seq:

* str <=> other_str => -1, 0, +1

*

* Comparison---Returns -1 if <i>other_str</i> is less than, 0 if

* <i>other_str</i> is equal to, and +1 if <i>other_str</i> is greater than

* <i>str</i>. If the strings are of different lengths, and the strings are

* equal when compared up to the shortest length, then the longer string is

* considered greater than the shorter one. If the variable <code>$=</code> is

* <code>false</code>, the comparison is based on comparing the binary values

* of each character in the string. In older versions of Ruby, setting

* <code>$=</code> allowed case-insensitive comparisons; this is now deprecated

* in favor of using <code>String#casecmp</code>.

*

* <code><=></code> is the basis for the methods <code><</code>,

* <code><=</code>, <code>></code>, <code>>=</code>, and <code>between?</code>,

* included from module <code>Comparable</code>. The method

* <code>String#==</code> does not use <code>Comparable#==</code>.

*

* "abcdef" <=> "abcde" #=> 1

* "abcdef" <=> "abcdef" #=> 0

* "abcdef" <=> "abcdefg" #=> -1

* "abcdef" <=> "ABCDEF" #=> 1

*/

static mrb_value

mrb_str_cmp_m(mrb_state *mrb, mrb_value str1)

{

mrb_value str2;

mrb_int result;

mrb_get_args(mrb, "o", &str2);

if (!mrb_string_p(str2)) {

if (!mrb_respond_to(mrb, str2, mrb_intern_lit(mrb, "to_s"))) {

return mrb_nil_value();

}

else if (!mrb_respond_to(mrb, str2, mrb_intern_lit(mrb, "<=>"))) {

return mrb_nil_value();

}

else {

mrb_value tmp = mrb_funcall(mrb, str2, "<=>", 1, str1);

if (mrb_nil_p(tmp)) return mrb_nil_value();

if (!mrb_fixnum(tmp)) {

return mrb_funcall(mrb, mrb_fixnum_value(0), "-", 1, tmp);

}

result = -mrb_fixnum(tmp);

}

}

else {

result = mrb_str_cmp(mrb, str1, str2);

}

return mrb_fixnum_value(result);

}

static mrb_bool

str_eql(mrb_state *mrb, const mrb_value str1, const mrb_value str2)

{

const mrb_int len = RSTRING_LEN(str1);

if (len != RSTRING_LEN(str2)) return FALSE;

if (memcmp(RSTRING_PTR(str1), RSTRING_PTR(str2), (size_t)len) == 0)

return TRUE;

return FALSE;

}

mrb_bool

mrb_str_equal(mrb_state *mrb, mrb_value str1, mrb_value str2)

{

if (mrb_immediate_p(str2)) return FALSE;

if (!mrb_string_p(str2)) {

if (mrb_nil_p(str2)) return FALSE;

if (!mrb_respond_to(mrb, str2, mrb_intern_lit(mrb, "to_str"))) {

return FALSE;

}

str2 = mrb_funcall(mrb, str2, "to_str", 0);

return mrb_equal(mrb, str2, str1);

}

return str_eql(mrb, str1, str2);

}

/* 15.2.10.5.4 */

/*

* call-seq:

* str == obj => true or false

*

* Equality---

* If <i>obj</i> is not a <code>String</code>, returns <code>false</code>.

* Otherwise, returns <code>false</code> or <code>true</code>

*

* caution:if <i>str</i> <code><=></code> <i>obj</i> returns zero.

*/

static mrb_value

mrb_str_equal_m(mrb_state *mrb, mrb_value str1)

{

mrb_value str2;

mrb_get_args(mrb, "o", &str2);

return mrb_bool_value(mrb_str_equal(mrb, str1, str2));

}

/* ---------------------------------- */

mrb_value

mrb_str_to_str(mrb_state *mrb, mrb_value str)

{

mrb_value s;

if (!mrb_string_p(str)) {

s = mrb_check_convert_type(mrb, str, MRB_TT_STRING, "String", "to_str");

if (mrb_nil_p(s)) {

s = mrb_convert_type(mrb, str, MRB_TT_STRING, "String", "to_s");

}

return s;

}

return str;

}

char *

mrb_string_value_ptr(mrb_state *mrb, mrb_value ptr)

{

mrb_value str = mrb_str_to_str(mrb, ptr);

return RSTRING_PTR(str);

}

static mrb_value

noregexp(mrb_state *mrb, mrb_value self)

{

mrb_raise(mrb, E_NOTIMP_ERROR, "Regexp class not implemented");

return mrb_nil_value();

}

static void

regexp_check(mrb_state *mrb, mrb_value obj)

{

if (mrb_regexp_p(mrb, obj)) {

noregexp(mrb, obj);

}

}

static inline mrb_int

mrb_memsearch_qs(const unsigned char *xs, mrb_int m, const unsigned char *ys, mrb_int n)

{

const unsigned char *x = xs, *xe = xs + m;

const unsigned char *y = ys;

int i, qstable[256];

/* Preprocessing */

for (i = 0; i < 256; ++i)

qstable[i] = m + 1;

for (; x < xe; ++x)

qstable[*x] = xe - x;

/* Searching */

for (; y + m <= ys + n; y += *(qstable + y[m])) {

if (*xs == *y && memcmp(xs, y, m) == 0)

return y - ys;

}

return -1;

}

static mrb_int

mrb_memsearch(const void *x0, mrb_int m, const void *y0, mrb_int n)

{

const unsigned char *x = (const unsigned char *)x0, *y = (const unsigned char *)y0;

if (m > n) return -1;

else if (m == n) {

return memcmp(x0, y0, m) == 0 ? 0 : -1;

}

else if (m < 1) {

return 0;

}

else if (m == 1) {

const unsigned char *ys = y, *ye = ys + n;

for (; y < ye; ++y) {

if (*x == *y)

return y - ys;

}

return -1;

}

return mrb_memsearch_qs((const unsigned char *)x0, m, (const unsigned char *)y0, n);

}

static mrb_int

mrb_str_index(mrb_state *mrb, mrb_value str, mrb_value sub, mrb_int offset)

{

mrb_int pos;

char *s, *sptr;

mrb_int len, slen;

len = RSTRING_LEN(str);

slen = RSTRING_LEN(sub);

if (offset < 0) {

offset += len;

if (offset < 0) return -1;

}

if (len - offset < slen) return -1;

s = RSTRING_PTR(str);

if (offset) {

s += offset;

}

if (slen == 0) return offset;

/* need proceed one character at a time */

sptr = RSTRING_PTR(sub);

slen = RSTRING_LEN(sub);

len = RSTRING_LEN(str) - offset;

pos = mrb_memsearch(sptr, slen, s, len);

if (pos < 0) return pos;

return pos + offset;

}

mrb_value

mrb_str_dup(mrb_state *mrb, mrb_value str)

{

struct RString *s = mrb_str_ptr(str);

struct RString *dup = str_new(mrb, 0, 0);

str_with_class(mrb, dup, str);

return str_replace(mrb, dup, s);

}

static mrb_value

mrb_str_aref(mrb_state *mrb, mrb_value str, mrb_value indx)

{

mrb_int idx;

regexp_check(mrb, indx);

switch (mrb_type(indx)) {

case MRB_TT_FIXNUM:

idx = mrb_fixnum(indx);

num_index:

str = mrb_str_substr(mrb, str, idx, 1);

if (!mrb_nil_p(str) && RSTRING_LEN(str) == 0) return mrb_nil_value();

return str;

case MRB_TT_STRING:

if (mrb_str_index(mrb, str, indx, 0) != -1)

return mrb_str_dup(mrb, indx);

return mrb_nil_value();

case MRB_TT_RANGE:

/* check if indx is Range */

{

mrb_int beg, len;

len = RSTRING_LEN(str);

if (mrb_range_beg_len(mrb, indx, &beg, &len, len)) {

return mrb_str_subseq(mrb, str, beg, len);

}

else {

return mrb_nil_value();

}

}

default:

idx = mrb_fixnum(indx);

goto num_index;

}

return mrb_nil_value(); /* not reached */

}

/* 15.2.10.5.6 */

/* 15.2.10.5.34 */

/*

* call-seq:

* str[fixnum] => fixnum or nil

* str[fixnum, fixnum] => new_str or nil

* str[range] => new_str or nil

* str[regexp] => new_str or nil

* str[regexp, fixnum] => new_str or nil

* str[other_str] => new_str or nil

* str.slice(fixnum) => fixnum or nil

* str.slice(fixnum, fixnum) => new_str or nil

* str.slice(range) => new_str or nil

* str.slice(other_str) => new_str or nil

*

* Element Reference---If passed a single <code>Fixnum</code>, returns the code

* of the character at that position. If passed two <code>Fixnum</code>

* objects, returns a substring starting at the offset given by the first, and

* a length given by the second. If given a range, a substring containing

* characters at offsets given by the range is returned. In all three cases, if

* an offset is negative, it is counted from the end of <i>str</i>. Returns

* <code>nil</code> if the initial offset falls outside the string, the length

* is negative, or the beginning of the range is greater than the end.

*

* If a <code>String</code> is given, that string is returned if it occurs in

* <i>str</i>. In both cases, <code>nil</code> is returned if there is no

* match.

*

* a = "hello there"

* a[1] #=> 101(1.8.7) "e"(1.9.2)

* a[1,3] #=> "ell"

* a[1..3] #=> "ell"

* a[-3,2] #=> "er"

* a[-4..-2] #=> "her"

* a[12..-1] #=> nil

* a[-2..-4] #=> ""

* a["lo"] #=> "lo"

* a["bye"] #=> nil

*/

static mrb_value

mrb_str_aref_m(mrb_state *mrb, mrb_value str)

{

mrb_value a1, a2;

int argc;

argc = mrb_get_args(mrb, "o|o", &a1, &a2);

if (argc == 2) {

regexp_check(mrb, a1);

return mrb_str_substr(mrb, str, mrb_fixnum(a1), mrb_fixnum(a2));

}

if (argc != 1) {

mrb_raisef(mrb, E_ARGUMENT_ERROR, "wrong number of arguments (%S for 1)", mrb_fixnum_value(argc));

}

return mrb_str_aref(mrb, str, a1);

}

/* 15.2.10.5.8 */

/*

* call-seq:

* str.capitalize! => str or nil

*

* Modifies <i>str</i> by converting the first character to uppercase and the

* remainder to lowercase. Returns <code>nil</code> if no changes are made.

*

* a = "hello"

* a.capitalize! #=> "Hello"

* a #=> "Hello"

* a.capitalize! #=> nil

*/

static mrb_value

mrb_str_capitalize_bang(mrb_state *mrb, mrb_value str)

{

char *p, *pend;

mrb_bool modify = FALSE;

struct RString *s = mrb_str_ptr(str);

mrb_str_modify(mrb, s);

if (RSTR_LEN(s) == 0 || !RSTR_PTR(s)) return mrb_nil_value();

p = RSTR_PTR(s); pend = RSTR_PTR(s) + RSTR_LEN(s);

if (ISLOWER(*p)) {

*p = TOUPPER(*p);

modify = TRUE;

}

while (++p < pend) {

if (ISUPPER(*p)) {

*p = TOLOWER(*p);

modify = TRUE;

}

}

if (modify) return str;

return mrb_nil_value();

}

/* 15.2.10.5.7 */

/*

* call-seq:

* str.capitalize => new_str

*

* Returns a copy of <i>str</i> with the first character converted to uppercase

* and the remainder to lowercase.

*

* "hello".capitalize #=> "Hello"

* "HELLO".capitalize #=> "Hello"

* "123ABC".capitalize #=> "123abc"

*/

static mrb_value

mrb_str_capitalize(mrb_state *mrb, mrb_value self)

{

mrb_value str;

str = mrb_str_dup(mrb, self);

mrb_str_capitalize_bang(mrb, str);

return str;

}

/* 15.2.10.5.10 */

/*

* call-seq:

* str.chomp!(separator=$/) => str or nil

*

* Modifies <i>str</i> in place as described for <code>String#chomp</code>,

* returning <i>str</i>, or <code>nil</code> if no modifications were made.

*/

static mrb_value

mrb_str_chomp_bang(mrb_state *mrb, mrb_value str)

{

mrb_value rs;

mrb_int newline;

char *p, *pp;

mrb_int rslen;

mrb_int len;

struct RString *s = mrb_str_ptr(str);

mrb_str_modify(mrb, s);

len = RSTR_LEN(s);

if (mrb_get_args(mrb, "|S", &rs) == 0) {

if (len == 0) return mrb_nil_value();

smart_chomp:

if (RSTR_PTR(s)[len-1] == '\n') {

RSTR_SET_LEN(s, RSTR_LEN(s) - 1);

if (RSTR_LEN(s) > 0 &&

RSTR_PTR(s)[RSTR_LEN(s)-1] == '\r') {

RSTR_SET_LEN(s, RSTR_LEN(s) - 1);

}

}

else if (RSTR_PTR(s)[len-1] == '\r') {

RSTR_SET_LEN(s, RSTR_LEN(s) - 1);

}

else {

return mrb_nil_value();

}

RSTR_PTR(s)[RSTR_LEN(s)] = '\0';

return str;

}

if (len == 0 || mrb_nil_p(rs)) return mrb_nil_value();

p = RSTR_PTR(s);

rslen = RSTRING_LEN(rs);

if (rslen == 0) {

while (len>0 && p[len-1] == '\n') {

len--;

if (len>0 && p[len-1] == '\r')

len--;

}

if (len < RSTR_LEN(s)) {

RSTR_SET_LEN(s, len);

p[len] = '\0';

return str;

}

return mrb_nil_value();

}

if (rslen > len) return mrb_nil_value();

newline = RSTRING_PTR(rs)[rslen-1];

if (rslen == 1 && newline == '\n')

newline = RSTRING_PTR(rs)[rslen-1];

if (rslen == 1 && newline == '\n')

goto smart_chomp;

pp = p + len - rslen;

if (p[len-1] == newline &&

(rslen <= 1 ||

memcmp(RSTRING_PTR(rs), pp, rslen) == 0)) {

RSTR_SET_LEN(s, len - rslen);

p[RSTR_LEN(s)] = '\0';

return str;

}

return mrb_nil_value();

}

/* 15.2.10.5.9 */

/*

* call-seq:

* str.chomp(separator=$/) => new_str

*

* Returns a new <code>String</code> with the given record separator removed

* from the end of <i>str</i> (if present). If <code>$/</code> has not been

* changed from the default Ruby record separator, then <code>chomp</code> also