ruby2d 0.12.1 → 1.0.0

data/assets/xcode/ios/MRuby.framework/Headers/mruby/gc.h

@@ -1,91 +0,0 @@
-/*
-** mruby/gc.h - garbage collector for mruby
-**
-** See Copyright Notice in mruby.h
-*/
-
-#ifndef MRUBY_GC_H
-#define MRUBY_GC_H
-
-#include "common.h"
-
-/**
- * Uncommon memory management stuffs.
- */
-MRB_BEGIN_DECL
-
-
-struct mrb_state;
-
-#define MRB_EACH_OBJ_OK 0
-#define MRB_EACH_OBJ_BREAK 1
-typedef int (mrb_each_object_callback)(struct mrb_state *mrb, struct RBasic *obj, void *data);
-void mrb_objspace_each_objects(struct mrb_state *mrb, mrb_each_object_callback *callback, void *data);
-MRB_API void mrb_free_context(struct mrb_state *mrb, struct mrb_context *c);
-
-#ifndef MRB_GC_ARENA_SIZE
-#define MRB_GC_ARENA_SIZE 100
-#endif
-
-typedef enum {
-  MRB_GC_STATE_ROOT = 0,
-  MRB_GC_STATE_MARK,
-  MRB_GC_STATE_SWEEP
-} mrb_gc_state;
-
-/* Disable MSVC warning "C4200: nonstandard extension used: zero-sized array
- * in struct/union" when in C++ mode */
-#ifdef _MSC_VER
-#pragma warning(push)
-#pragma warning(disable : 4200)
-#endif
-
-typedef struct mrb_heap_page {
-  struct RBasic *freelist;
-  struct mrb_heap_page *prev;
-  struct mrb_heap_page *next;
-  struct mrb_heap_page *free_next;
-  struct mrb_heap_page *free_prev;
-  mrb_bool old:1;
-  void *objects[];
-} mrb_heap_page;
-
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-
-typedef struct mrb_gc {
-  mrb_heap_page *heaps;                /* heaps for GC */
-  mrb_heap_page *sweeps;
-  mrb_heap_page *free_heaps;
-  size_t live; /* count of live objects */
-#ifdef MRB_GC_FIXED_ARENA
-  struct RBasic *arena[MRB_GC_ARENA_SIZE]; /* GC protection array */
-#else
-  struct RBasic **arena;                   /* GC protection array */
-  int arena_capa;
-#endif
-  int arena_idx;
-
-  mrb_gc_state state; /* state of gc */
-  int current_white_part; /* make white object by white_part */
-  struct RBasic *gray_list; /* list of gray objects to be traversed incrementally */
-  struct RBasic *atomic_gray_list; /* list of objects to be traversed atomically */
-  size_t live_after_mark;
-  size_t threshold;
-  int interval_ratio;
-  int step_ratio;
-  mrb_bool iterating     :1;
-  mrb_bool disabled      :1;
-  mrb_bool full          :1;
-  mrb_bool generational  :1;
-  mrb_bool out_of_memory :1;
-  size_t majorgc_old_threshold;
-} mrb_gc;
-
-MRB_API mrb_bool
-mrb_object_dead_p(struct mrb_state *mrb, struct RBasic *object);
-
-MRB_END_DECL
-
-#endif  /* MRUBY_GC_H */

data/assets/xcode/ios/MRuby.framework/Headers/mruby/hash.h

@@ -1,215 +0,0 @@
-/*
-** mruby/hash.h - Hash class
-**
-** See Copyright Notice in mruby.h
-*/
-
-#ifndef MRUBY_HASH_H
-#define MRUBY_HASH_H
-
-#include "common.h"
-#include <mruby/khash.h>
-
-/**
- * Hash class
- */
-MRB_BEGIN_DECL
-
-struct RHash {
-  MRB_OBJECT_HEADER;
-  struct iv_tbl *iv;
-  struct htable *ht;
-};
-
-#define mrb_hash_ptr(v)    ((struct RHash*)(mrb_ptr(v)))
-#define mrb_hash_value(p)  mrb_obj_value((void*)(p))
-
-MRB_API mrb_value mrb_hash_new_capa(mrb_state*, mrb_int);
-MRB_API mrb_value mrb_ensure_hash_type(mrb_state *mrb, mrb_value hash);
-MRB_API mrb_value mrb_check_hash_type(mrb_state *mrb, mrb_value hash);
-
-/*
- * Initializes a new hash.
- *
- * Equivalent to:
- *
- *      Hash.new
- *
- * @param mrb The mruby state reference.
- * @return The initialized hash.
- */
-MRB_API mrb_value mrb_hash_new(mrb_state *mrb);
-
-/*
- * Sets a keys and values to hashes.
- *
- * Equivalent to:
- *
- *      hash[key] = val
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @param key The key to set.
- * @param val The value to set.
- * @return The value.
- */
-MRB_API void mrb_hash_set(mrb_state *mrb, mrb_value hash, mrb_value key, mrb_value val);
-
-/*
- * Gets a value from a key. If the key is not found, the default of the
- * hash is used.
- *
- * Equivalent to:
- *
- *     hash[key]
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @param key The key to get.
- * @return The found value.
- */
-MRB_API mrb_value mrb_hash_get(mrb_state *mrb, mrb_value hash, mrb_value key);
-
-/*
- * Gets a value from a key. If the key is not found, the default parameter is
- * used.
- *
- * Equivalent to:
- *
- *     hash.key?(key) ? hash[key] : def
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @param key The key to get.
- * @param def The default value.
- * @return The found value.
- */
-MRB_API mrb_value mrb_hash_fetch(mrb_state *mrb, mrb_value hash, mrb_value key, mrb_value def);
-
-/*
- * Deletes hash key and value pair.
- *
- * Equivalent to:
- *
- *     hash.delete(key)
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @param key The key to delete.
- * @return The deleted value.
- */
-MRB_API mrb_value mrb_hash_delete_key(mrb_state *mrb, mrb_value hash, mrb_value key);
-
-/*
- * Gets an array of keys.
- *
- * Equivalent to:
- *
- *     hash.keys
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @return An array with the keys of the hash.
- */
-MRB_API mrb_value mrb_hash_keys(mrb_state *mrb, mrb_value hash);
-/*
- * Check if the hash has the key.
- *
- * Equivalent to:
- *
- *     hash.key?(key)
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @param key The key to check existence.
- * @return True if the hash has the key
- */
-MRB_API mrb_bool mrb_hash_key_p(mrb_state *mrb, mrb_value hash, mrb_value key);
-
-/*
- * Check if the hash is empty
- *
- * Equivalent to:
- *
- *     hash.empty?
- *
- * @param mrb The mruby state reference.
- * @param self The target hash.
- * @return True if the hash is empty, false otherwise.
- */
-MRB_API mrb_bool mrb_hash_empty_p(mrb_state *mrb, mrb_value self);
-
-/*
- * Gets an array of values.
- *
- * Equivalent to:
- *
- *     hash.values
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @return An array with the values of the hash.
- */
-MRB_API mrb_value mrb_hash_values(mrb_state *mrb, mrb_value hash);
-
-/*
- * Clears the hash.
- *
- * Equivalent to:
- *
- *     hash.clear
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @return The hash
- */
-MRB_API mrb_value mrb_hash_clear(mrb_state *mrb, mrb_value hash);
-
-/*
- * Copies the hash.
- *
- *
- * @param mrb The mruby state reference.
- * @param hash The target hash.
- * @return The copy of the hash
- */
-MRB_API mrb_value mrb_hash_dup(mrb_state *mrb, mrb_value hash);
-
-/*
- * Merges two hashes. The first hash will be modified by the
- * second hash.
- *
- * @param mrb The mruby state reference.
- * @param hash1 The target hash.
- * @param hash2 Updating hash
- */
-MRB_API void mrb_hash_merge(mrb_state *mrb, mrb_value hash1, mrb_value hash2);
-
-/* declaration of struct kh_ht */
-/* be careful when you touch the internal */
-typedef struct {
-  mrb_value v;
-  mrb_int n;
-} mrb_hash_value;
-
-KHASH_DECLARE(ht, mrb_value, mrb_hash_value, TRUE)
-
-/* RHASH_TBL allocates st_table if not available. */
-#define RHASH(obj)   ((struct RHash*)(mrb_ptr(obj)))
-#define RHASH_TBL(h)          (RHASH(h)->ht)
-#define RHASH_IFNONE(h)       mrb_iv_get(mrb, (h), mrb_intern_lit(mrb, "ifnone"))
-#define RHASH_PROCDEFAULT(h)  RHASH_IFNONE(h)
-
-#define MRB_HASH_DEFAULT      1
-#define MRB_HASH_PROC_DEFAULT 2
-#define MRB_RHASH_DEFAULT_P(h) (RHASH(h)->flags & MRB_HASH_DEFAULT)
-#define MRB_RHASH_PROCDEFAULT_P(h) (RHASH(h)->flags & MRB_HASH_PROC_DEFAULT)
-
-/* GC functions */
-void mrb_gc_mark_hash(mrb_state*, struct RHash*);
-size_t mrb_gc_mark_hash_size(mrb_state*, struct RHash*);
-void mrb_gc_free_hash(mrb_state*, struct RHash*);
-
-MRB_END_DECL
-
-#endif  /* MRUBY_HASH_H */

data/assets/xcode/ios/MRuby.framework/Headers/mruby/irep.h

@@ -1,75 +0,0 @@
-/*
-** mruby/irep.h - mrb_irep structure
-**
-** See Copyright Notice in mruby.h
-*/
-
-#ifndef MRUBY_IREP_H
-#define MRUBY_IREP_H
-
-#include "common.h"
-#include <mruby/compile.h>
-
-/**
- * Compiled mruby scripts.
- */
-MRB_BEGIN_DECL
-
-enum irep_pool_type {
-  IREP_TT_STRING,
-  IREP_TT_FIXNUM,
-  IREP_TT_FLOAT,
-};
-
-struct mrb_locals {
-  mrb_sym name;
-  uint16_t r;
-};
-
-/* Program data array struct */
-typedef struct mrb_irep {
-  uint16_t nlocals;        /* Number of local variables */
-  uint16_t nregs;          /* Number of register variables */
-  uint8_t flags;
-
-  mrb_code *iseq;
-  mrb_value *pool;
-  mrb_sym *syms;
-  struct mrb_irep **reps;
-
-  struct mrb_locals *lv;
-  /* debug info */
-  struct mrb_irep_debug_info* debug_info;
-
-  uint16_t ilen, plen, slen, rlen;
-  uint32_t refcnt;
-} mrb_irep;
-
-#define MRB_ISEQ_NO_FREE 1
-
-MRB_API mrb_irep *mrb_add_irep(mrb_state *mrb);
-
-/* @param [const uint8_t*] irep code, expected as a literal */
-MRB_API mrb_value mrb_load_irep(mrb_state*, const uint8_t*);
-
-/* @param [const uint8_t*] irep code, expected as a literal */
-MRB_API mrb_value mrb_load_irep_cxt(mrb_state*, const uint8_t*, mrbc_context*);
-
-void mrb_irep_free(mrb_state*, struct mrb_irep*);
-void mrb_irep_incref(mrb_state*, struct mrb_irep*);
-void mrb_irep_decref(mrb_state*, struct mrb_irep*);
-void mrb_irep_cutref(mrb_state*, struct mrb_irep*);
-void mrb_irep_remove_lv(mrb_state *mrb, mrb_irep *irep);
-
-struct mrb_insn_data {
-  uint8_t insn;
-  uint16_t a;
-  uint16_t b;
-  uint8_t c;
-};
-
-struct mrb_insn_data mrb_decode_insn(mrb_code *pc);
-
-MRB_END_DECL
-
-#endif  /* MRUBY_IREP_H */

data/assets/xcode/ios/MRuby.framework/Headers/mruby/istruct.h

@@ -1,47 +0,0 @@
-/*
-** mruby/istruct.h - Inline structures
-**
-** See Copyright Notice in mruby.h
-*/
-
-#ifndef MRUBY_ISTRUCT_H
-#define MRUBY_ISTRUCT_H
-
-#include "common.h"
-#include <string.h>
-
-/**
- * Inline structures that fit in RVALUE
- *
- * They cannot have finalizer, and cannot have instance variables.
- */
-MRB_BEGIN_DECL
-
-#define ISTRUCT_DATA_SIZE (sizeof(void*) * 3)
-
-struct RIstruct {
-  MRB_OBJECT_HEADER;
-  char inline_data[ISTRUCT_DATA_SIZE];
-};
-
-#define RISTRUCT(obj)         ((struct RIstruct*)(mrb_ptr(obj)))
-#define ISTRUCT_PTR(obj)      (RISTRUCT(obj)->inline_data)
-
-MRB_INLINE mrb_int mrb_istruct_size()
-{
-  return ISTRUCT_DATA_SIZE;
-}
-
-MRB_INLINE void* mrb_istruct_ptr(mrb_value object)
-{
-  return ISTRUCT_PTR(object);
-}
-
-MRB_INLINE void mrb_istruct_copy(mrb_value dest, mrb_value src)
-{
-  memcpy(ISTRUCT_PTR(dest), ISTRUCT_PTR(src), ISTRUCT_DATA_SIZE);
-}
-
-MRB_END_DECL
-
-#endif /* MRUBY_ISTRUCT_H */

data/assets/xcode/ios/MRuby.framework/Headers/mruby/khash.h

@@ -1,274 +0,0 @@
-/*
-** mruby/khash.c - Hash for mruby
-**
-** See Copyright Notice in mruby.h
-*/
-
-#ifndef MRUBY_KHASH_H
-#define MRUBY_KHASH_H
-
-#include <string.h>
-
-#include <mruby.h>
-#include "common.h"
-
-/**
- * khash definitions used in mruby's hash table.
- */
-MRB_BEGIN_DECL
-
-typedef uint32_t khint_t;
-typedef khint_t khiter_t;
-
-#ifndef KHASH_DEFAULT_SIZE
-# define KHASH_DEFAULT_SIZE 32
-#endif
-#define KHASH_MIN_SIZE 8
-
-#define UPPER_BOUND(x) ((x)>>2|(x)>>1)
-
-/* extern uint8_t __m[]; */
-
-/* mask for flags */
-static const uint8_t __m_empty[]  = {0x02, 0x08, 0x20, 0x80};
-static const uint8_t __m_del[]    = {0x01, 0x04, 0x10, 0x40};
-static const uint8_t __m_either[] = {0x03, 0x0c, 0x30, 0xc0};
-
-
-#define __ac_isempty(ed_flag, i) (ed_flag[(i)/4]&__m_empty[(i)%4])
-#define __ac_isdel(ed_flag, i) (ed_flag[(i)/4]&__m_del[(i)%4])
-#define __ac_iseither(ed_flag, i) (ed_flag[(i)/4]&__m_either[(i)%4])
-#define khash_power2(v) do { \
-  v--;\
-  v |= v >> 1;\
-  v |= v >> 2;\
-  v |= v >> 4;\
-  v |= v >> 8;\
-  v |= v >> 16;\
-  v++;\
-} while (0)
-#define khash_mask(h) ((h)->n_buckets-1)
-#define khash_upper_bound(h) (UPPER_BOUND((h)->n_buckets))
-
-/* declare struct kh_xxx and kh_xxx_funcs
-
-   name: hash name
-   khkey_t: key data type
-   khval_t: value data type
-   kh_is_map: (0: hash set / 1: hash map)
-*/
-#define KHASH_DECLARE(name, khkey_t, khval_t, kh_is_map)                \
-  typedef struct kh_##name {                                            \
-    khint_t n_buckets;                                                  \
-    khint_t size;                                                       \
-    khint_t n_occupied;                                                 \
-    uint8_t *ed_flags;                                                  \
-    khkey_t *keys;                                                      \
-    khval_t *vals;                                                      \
-  } kh_##name##_t;                                                      \
-  void kh_alloc_##name(mrb_state *mrb, kh_##name##_t *h);               \
-  kh_##name##_t *kh_init_##name##_size(mrb_state *mrb, khint_t size);   \
-  kh_##name##_t *kh_init_##name(mrb_state *mrb);                        \
-  void kh_destroy_##name(mrb_state *mrb, kh_##name##_t *h);             \
-  void kh_clear_##name(mrb_state *mrb, kh_##name##_t *h);               \
-  khint_t kh_get_##name(mrb_state *mrb, kh_##name##_t *h, khkey_t key);           \
-  khint_t kh_put_##name(mrb_state *mrb, kh_##name##_t *h, khkey_t key, int *ret); \
-  void kh_resize_##name(mrb_state *mrb, kh_##name##_t *h, khint_t new_n_buckets); \
-  void kh_del_##name(mrb_state *mrb, kh_##name##_t *h, khint_t x);                \
-  kh_##name##_t *kh_copy_##name(mrb_state *mrb, kh_##name##_t *h);
-
-static inline void
-kh_fill_flags(uint8_t *p, uint8_t c, size_t len)
-{
-  while (len-- > 0) {
-    *p++ = c;
-  }
-}
-
-/* define kh_xxx_funcs
-
-   name: hash name
-   khkey_t: key data type
-   khval_t: value data type
-   kh_is_map: (0: hash set / 1: hash map)
-   __hash_func: hash function
-   __hash_equal: hash comparation function
-*/
-#define KHASH_DEFINE(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
-  void kh_alloc_##name(mrb_state *mrb, kh_##name##_t *h)                \
-  {                                                                     \
-    khint_t sz = h->n_buckets;                                          \
-    size_t len = sizeof(khkey_t) + (kh_is_map ? sizeof(khval_t) : 0);   \
-    uint8_t *p = (uint8_t*)mrb_malloc(mrb, sizeof(uint8_t)*sz/4+len*sz); \
-    h->size = h->n_occupied = 0;                                        \
-    h->keys = (khkey_t *)p;                                             \
-    h->vals = kh_is_map ? (khval_t *)(p+sizeof(khkey_t)*sz) : NULL;     \
-    h->ed_flags = p+len*sz;                                             \
-    kh_fill_flags(h->ed_flags, 0xaa, sz/4);                             \
-  }                                                                     \
-  kh_##name##_t *kh_init_##name##_size(mrb_state *mrb, khint_t size) {  \
-    kh_##name##_t *h = (kh_##name##_t*)mrb_calloc(mrb, 1, sizeof(kh_##name##_t)); \
-    if (size < KHASH_MIN_SIZE)                                          \
-      size = KHASH_MIN_SIZE;                                            \
-    khash_power2(size);                                                 \
-    h->n_buckets = size;                                                \
-    kh_alloc_##name(mrb, h);                                            \
-    return h;                                                           \
-  }                                                                     \
-  kh_##name##_t *kh_init_##name(mrb_state *mrb) {                       \
-    return kh_init_##name##_size(mrb, KHASH_DEFAULT_SIZE);              \
-  }                                                                     \
-  void kh_destroy_##name(mrb_state *mrb, kh_##name##_t *h)              \
-  {                                                                     \
-    if (h) {                                                            \
-      mrb_free(mrb, h->keys);                                           \
-      mrb_free(mrb, h);                                                 \
-    }                                                                   \
-  }                                                                     \
-  void kh_clear_##name(mrb_state *mrb, kh_##name##_t *h)                \
-  {                                                                     \
-    (void)mrb;                                                          \
-    if (h && h->ed_flags) {                                             \
-      kh_fill_flags(h->ed_flags, 0xaa, h->n_buckets/4);                 \
-      h->size = h->n_occupied = 0;                                      \
-    }                                                                   \
-  }                                                                     \
-  khint_t kh_get_##name(mrb_state *mrb, kh_##name##_t *h, khkey_t key)  \
-  {                                                                     \
-    khint_t k = __hash_func(mrb,key) & khash_mask(h), step = 0;         \
-    (void)mrb;                                                          \
-    while (!__ac_isempty(h->ed_flags, k)) {                             \
-      if (!__ac_isdel(h->ed_flags, k)) {                                \
-        if (__hash_equal(mrb,h->keys[k], key)) return k;                \
-      }                                                                 \
-      k = (k+(++step)) & khash_mask(h);                                 \
-    }                                                                   \
-    return kh_end(h);                                                   \
-  }                                                                     \
-  void kh_resize_##name(mrb_state *mrb, kh_##name##_t *h, khint_t new_n_buckets) \
-  {                                                                     \
-    if (new_n_buckets < KHASH_MIN_SIZE)                                 \
-      new_n_buckets = KHASH_MIN_SIZE;                                   \
-    khash_power2(new_n_buckets);                                        \
-    {                                                                   \
-      kh_##name##_t hh;                                                 \
-      uint8_t *old_ed_flags = h->ed_flags;                              \
-      khkey_t *old_keys = h->keys;                                      \
-      khval_t *old_vals = h->vals;                                      \
-      khint_t old_n_buckets = h->n_buckets;                             \
-      khint_t i;                                                        \
-      hh.n_buckets = new_n_buckets;                                     \
-      kh_alloc_##name(mrb, &hh);                                        \
-      /* relocate */                                                    \
-      for (i=0 ; i<old_n_buckets ; i++) {                               \
-        if (!__ac_iseither(old_ed_flags, i)) {                          \
-          khint_t k = kh_put_##name(mrb, &hh, old_keys[i], NULL);       \
-          if (kh_is_map) kh_value(&hh,k) = old_vals[i];                 \
-        }                                                               \
-      }                                                                 \
-      /* copy hh to h */                                                \
-      *h = hh;                                                          \
-      mrb_free(mrb, old_keys);                                          \
-    }                                                                   \
-  }                                                                     \
-  khint_t kh_put_##name(mrb_state *mrb, kh_##name##_t *h, khkey_t key, int *ret) \
-  {                                                                     \
-    khint_t k, del_k, step = 0;                                         \
-    if (h->n_occupied >= khash_upper_bound(h)) {                        \
-      kh_resize_##name(mrb, h, h->n_buckets*2);                         \
-    }                                                                   \
-    k = __hash_func(mrb,key) & khash_mask(h);                           \
-    del_k = kh_end(h);                                                  \
-    while (!__ac_isempty(h->ed_flags, k)) {                             \
-      if (!__ac_isdel(h->ed_flags, k)) {                                \
-        if (__hash_equal(mrb,h->keys[k], key)) {                        \
-          if (ret) *ret = 0;                                            \
-          return k;                                                     \
-        }                                                               \
-      }                                                                 \
-      else if (del_k == kh_end(h)) {                                    \
-        del_k = k;                                                      \
-      }                                                                 \
-      k = (k+(++step)) & khash_mask(h);                                 \
-    }                                                                   \
-    if (del_k != kh_end(h)) {                                           \
-      /* put at del */                                                  \
-      h->keys[del_k] = key;                                             \
-      h->ed_flags[del_k/4] &= ~__m_del[del_k%4];                        \
-      h->size++;                                                        \
-      if (ret) *ret = 2;                                                \
-      return del_k;                                                     \
-    }                                                                   \
-    else {                                                              \
-      /* put at empty */                                                \
-      h->keys[k] = key;                                                 \
-      h->ed_flags[k/4] &= ~__m_empty[k%4];                              \
-      h->size++;                                                        \
-      h->n_occupied++;                                                  \
-      if (ret) *ret = 1;                                                \
-      return k;                                                         \
-    }                                                                   \
-  }                                                                     \
-  void kh_del_##name(mrb_state *mrb, kh_##name##_t *h, khint_t x)       \
-  {                                                                     \
-    (void)mrb;                                                          \
-    mrb_assert(x != h->n_buckets && !__ac_iseither(h->ed_flags, x));    \
-    h->ed_flags[x/4] |= __m_del[x%4];                                   \
-    h->size--;                                                          \
-  }                                                                     \
-  kh_##name##_t *kh_copy_##name(mrb_state *mrb, kh_##name##_t *h)       \
-  {                                                                     \
-    kh_##name##_t *h2;                                                  \
-    khiter_t k, k2;                                                     \
-                                                                        \
-    h2 = kh_init_##name(mrb);                                           \
-    for (k = kh_begin(h); k != kh_end(h); k++) {                        \
-      if (kh_exist(h, k)) {                                             \
-        k2 = kh_put_##name(mrb, h2, kh_key(h, k), NULL);                \
-        if (kh_is_map) kh_value(h2, k2) = kh_value(h, k);               \
-      }                                                                 \
-    }                                                                   \
-    return h2;                                                          \
-  }
-
-
-#define khash_t(name) kh_##name##_t
-
-#define kh_init_size(name,mrb,size) kh_init_##name##_size(mrb,size)
-#define kh_init(name,mrb) kh_init_##name(mrb)
-#define kh_destroy(name, mrb, h) kh_destroy_##name(mrb, h)
-#define kh_clear(name, mrb, h) kh_clear_##name(mrb, h)
-#define kh_resize(name, mrb, h, s) kh_resize_##name(mrb, h, s)
-#define kh_put(name, mrb, h, k) kh_put_##name(mrb, h, k, NULL)
-#define kh_put2(name, mrb, h, k, r) kh_put_##name(mrb, h, k, r)
-#define kh_get(name, mrb, h, k) kh_get_##name(mrb, h, k)
-#define kh_del(name, mrb, h, k) kh_del_##name(mrb, h, k)
-#define kh_copy(name, mrb, h) kh_copy_##name(mrb, h)
-
-#define kh_exist(h, x) (!__ac_iseither((h)->ed_flags, (x)))
-#define kh_key(h, x) ((h)->keys[x])
-#define kh_val(h, x) ((h)->vals[x])
-#define kh_value(h, x) ((h)->vals[x])
-#define kh_begin(h) (khint_t)(0)
-#define kh_end(h) ((h)->n_buckets)
-#define kh_size(h) ((h)->size)
-#define kh_n_buckets(h) ((h)->n_buckets)
-
-#define kh_int_hash_func(mrb,key) (khint_t)((key)^((key)<<2)^((key)>>2))
-#define kh_int_hash_equal(mrb,a, b) (a == b)
-#define kh_int64_hash_func(mrb,key) (khint_t)((key)>>33^(key)^(key)<<11)
-#define kh_int64_hash_equal(mrb,a, b) (a == b)
-static inline khint_t __ac_X31_hash_string(const char *s)
-{
-    khint_t h = *s;
-    if (h) for (++s ; *s; ++s) h = (h << 5) - h + *s;
-    return h;
-}
-#define kh_str_hash_func(mrb,key) __ac_X31_hash_string(key)
-#define kh_str_hash_equal(mrb,a, b) (strcmp(a, b) == 0)
-
-typedef const char *kh_cstr_t;
-
-MRB_END_DECL
-
-#endif  /* MRUBY_KHASH_H */