swiftiply 0.6.1.1 → 1.0.0

data/ext/splaytree/extconf.rb

@@ -0,0 +1,161 @@
+# $Id: extconf.rb 4526 2007-07-03 18:04:34Z francis $
+#
+#----------------------------------------------------------------------------
+#
+# Copyright (C) 2006-07 by Francis Cianfrocca. All Rights Reserved.
+# Gmail: garbagecat10
+# 
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of either: 1) the GNU General Public License
+# as published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version; or 2) Ruby's License.
+# 
+# See the file COPYING for complete licensing information.
+#
+#---------------------------------------------------------------------------
+#
+# extconf.rb for Fast File Reader
+# We have to munge LDSHARED because this code needs a C++ link.
+#
+
+require 'mkmf'
+
+flags = []
+
+case RUBY_PLATFORM.split('-',2)[1]
+when 'mswin32', 'mingw32', 'bccwin32'
+  unless have_header('windows.h') and
+      have_header('winsock.h') and
+      have_library('kernel32') and
+      have_library('rpcrt4') and
+      have_library('gdi32')
+    exit
+  end
+
+  flags << "-D OS_WIN32"
+  flags << '-D BUILD_FOR_RUBY'
+  flags << "-EHs"
+  flags << "-GR"
+
+#  dir_config('ssl')
+#  if have_library('ssleay32') and
+#	  have_library('libeay32') and
+#	  have_header('openssl/ssl.h') and
+#	  have_header('openssl/err.h')
+#    flags << '-D WITH_SSL'
+#  else
+#    flags << '-D WITHOUT_SSL'
+#  end
+
+when /solaris/
+#  unless have_library('pthread') and
+#	have_library('nsl') and
+#	have_library('socket')
+#	  exit
+#  end
+
+  flags << '-D OS_UNIX'
+  flags << '-D OS_SOLARIS8'
+  flags << '-D BUILD_FOR_RUBY'
+
+#  dir_config('ssl')
+#  if have_library('ssl') and
+#	  have_library('crypto') and
+#	  have_header('openssl/ssl.h') and
+#	  have_header('openssl/err.h')
+#    flags << '-D WITH_SSL'
+#  else
+#    flags << '-D WITHOUT_SSL'
+#  end
+
+  # on Unix we need a g++ link, not gcc.
+  CONFIG['LDSHARED'] = "$(CXX) -shared"
+
+when /darwin/
+  flags << '-DOS_UNIX'
+  flags << '-DBUILD_FOR_RUBY'
+
+#  dir_config('ssl')
+#  if have_library('ssl') and
+#	  have_library('crypto') and
+#	  have_library('C') and
+#	  have_header('openssl/ssl.h') and
+#	  have_header('openssl/err.h')
+#    flags << '-DWITH_SSL'
+#  else
+#    flags << '-DWITHOUT_SSL'
+#  end
+  # on Unix we need a g++ link, not gcc.
+  # Ff line contributed by Daniel Harple.
+  CONFIG['LDSHARED'] = "$(CXX) " + CONFIG['LDSHARED'].split[1..-1].join(' ')
+
+when /linux/
+  unless have_library('pthread')
+	  exit
+  end
+
+  flags << '-DOS_UNIX'
+  flags << '-DBUILD_FOR_RUBY'
+
+  # Original epoll test is inadequate because 2.4 kernels have the header
+  # but not the code.
+#  #flags << '-DHAVE_EPOLL' if have_header('sys/epoll.h')
+#  if have_header('sys/epoll.h')
+#	  File.open("hasEpollTest.c", "w") {|f|
+#		  f.puts "#include <sys/epoll.h>"
+#		  f.puts "int main() { epoll_create(1024); return 0;}"
+#	  }
+#	  (e = system( "gcc hasEpollTest.c -o hasEpollTest " )) and (e = $?.to_i)
+#	  `rm -f hasEpollTest.c hasEpollTest`
+#	  flags << '-DHAVE_EPOLL' if e == 0
+#  end
+#
+#  dir_config('ssl')
+#  if have_library('ssl') and
+#	  have_library('crypto') and
+#	  have_header('openssl/ssl.h') and
+#	  have_header('openssl/err.h')
+#    flags << '-DWITH_SSL'
+#  else
+#    flags << '-DWITHOUT_SSL'
+#  end
+  # on Unix we need a g++ link, not gcc.
+  CONFIG['LDSHARED'] = "$(CXX) -shared"
+
+  # Modify the mkmf constant LINK_SO so the generated shared object is stripped.
+  # You might think modifying CONFIG['LINK_SO'] would be a better way to do this,
+  # but it doesn't work because mkmf doesn't look at CONFIG['LINK_SO'] again after
+  # it initializes.
+  #linkso = Object.send :remove_const, "LINK_SO"
+  #LINK_SO = linkso + "; strip $@"
+
+else
+#  unless have_library('pthread')
+#	  exit
+#  end
+
+  flags << '-DOS_UNIX'
+  flags << '-DBUILD_FOR_RUBY'
+
+#  dir_config('ssl')
+#  if have_library('ssl') and
+#	  have_library('crypto') and
+#	  have_header('openssl/ssl.h') and
+#	  have_header('openssl/err.h')
+#    flags << '-DWITH_SSL'
+#  else
+#    flags << '-DWITHOUT_SSL'
+#  end
+  # on Unix we need a g++ link, not gcc.
+  CONFIG['LDSHARED'] = "$(CXX) -shared"
+
+end
+
+if $CPPFLAGS
+  $CPPFLAGS += ' ' + flags.join(' ')
+else
+  $CFLAGS += ' ' + flags.join(' ')
+end
+
+
+create_makefile("swiftcore/splaytreemap","swiftcore")

data/ext/splaytree/swiftcore/rubymain.cpp

@@ -0,0 +1,580 @@
+#include "splay_map.h"
+#include <iostream>
+#include <string>
+#include "string.h"
+using namespace std;
+
+#include <ruby.h>
+
+static VALUE SwiftcoreModule;
+static VALUE SplayTreeMapClass;
+
+struct classcomp {
+  bool operator() (const char *s1, const char *s2) const
+	{
+		if ( strcmp(s1,s2) < 0) {
+			return true;
+		} else {
+			return false;
+		}
+	}
+};
+
+typedef swiftcore::splay_map<char *,VALUE,classcomp> rb_splaymap;
+typedef swiftcore::splay_map<char *,VALUE,classcomp>::iterator rb_splaymap_iterator;
+
+static void sptm_mark (rb_splaymap* st)
+{
+	rb_splaymap_iterator q_iterator;
+	if (st) {
+		for ( q_iterator = (*st).begin(); q_iterator != (*st).end(); q_iterator++ ) {
+			rb_gc_mark(q_iterator->second);
+		}
+	}
+}
+
+static void sptm_free (rb_splaymap* st)
+{
+	if (st)
+		delete st;
+}
+
+static VALUE sptm_alloc (VALUE klass)
+{
+	rb_splaymap* st = new rb_splaymap;
+	VALUE v = Data_Wrap_Struct (klass, sptm_mark, sptm_free, st);
+	return v;
+}
+
+static VALUE sptm_initialize (VALUE self)
+{
+	return Qnil;
+}
+
+static VALUE sptm_parent (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if ((*st).empty()) {
+		return Qnil;
+	} else {
+		rb_splaymap_iterator parent = (*st).parent();
+		VALUE r = rb_ary_new();
+
+		rb_ary_push(r,rb_str_new2(parent->first));
+		rb_ary_push(r,parent->second);
+		return r;
+	}
+}
+
+static VALUE sptm_pop_front (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if ((*st).empty()) {
+		return Qnil;
+	} else {
+		rb_splaymap_iterator front = (*st).begin();
+		VALUE r = rb_ary_new();
+		
+		rb_ary_push(r,rb_str_new2(front->first));
+		rb_ary_push(r,front->second);
+		(*st).erase(front);
+		return r;
+	}
+}
+
+static VALUE sptm_pop_back (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if ((*st).empty()) {
+		return Qnil;
+	} else {
+		rb_splaymap_iterator back = (*st).end();
+		back--;
+		VALUE r = rb_ary_new();
+		rb_ary_push(r,rb_str_new2(back->first));
+		rb_ary_push(r,back->second);
+		(*st).erase(back);
+		return r;
+	}
+}
+
+
+static VALUE sptm_size (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	return INT2NUM((*st).size());
+}
+
+
+static VALUE sptm_max_capacity (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	return INT2NUM((*st).max_size());
+}
+
+static VALUE sptm_clear (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	(*st).clear();
+	return self;
+}
+
+static VALUE sptm_empty (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if ((*st).empty()) {
+		return Qtrue;
+	} else {
+		return Qfalse;
+	}
+}
+
+static VALUE sptm_to_s (VALUE self)
+{
+	VALUE s = rb_str_new2("");
+
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	for ( q_iterator = (*st).begin(); q_iterator != (*st).end(); q_iterator++ ) {
+		rb_str_concat(s,rb_str_new2(q_iterator->first));
+		rb_str_concat(s,rb_convert_type(q_iterator->second, T_STRING, "String", "to_str"));
+	} 
+
+	return rb_str_to_str(s);
+}
+	
+static VALUE sptm_to_a (VALUE self)
+{
+	VALUE ary = rb_ary_new();
+
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	for ( q_iterator = (*st).begin(); q_iterator != (*st).end(); q_iterator++ ) {
+		rb_ary_push(ary,rb_str_new2(q_iterator->first));
+		rb_ary_push(ary,q_iterator->second);
+	}
+
+	return ary;
+}
+
+static VALUE sptm_inspect (VALUE self)
+{
+	VALUE s = rb_str_new2("{");
+	VALUE arrow = rb_str_new2("=>");
+	VALUE comma = rb_str_new2(",");
+
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+	rb_splaymap_iterator before_last_q_iterator;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	before_last_q_iterator = last_q_iterator = (*st).end();
+	before_last_q_iterator--;
+
+	for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		rb_str_concat(s,rb_inspect(rb_str_new2(q_iterator->first)));
+		rb_str_concat(s,arrow);
+		rb_str_concat(s,rb_inspect(q_iterator->second));
+		if (q_iterator != before_last_q_iterator)
+			rb_str_concat(s,comma);
+	}
+	rb_str_concat(s,rb_str_new2("}"));
+
+	return rb_str_to_str(s);
+}
+
+static VALUE sptm_first (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if ((*st).empty()) {
+		return Qnil;
+	} else {
+		rb_splaymap_iterator front = (*st).begin();
+		VALUE r = rb_ary_new();
+		rb_ary_push(r,rb_str_new2(front->first));
+		rb_ary_push(r,front->second);
+		return r;
+	}
+}
+
+static VALUE sptm_last (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	Data_Get_Struct(self, rb_splaymap, st);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if ((*st).empty()) {
+		return Qnil;
+	} else {
+		rb_splaymap_iterator back = (*st).end();
+		back--;
+		VALUE r = rb_ary_new();
+		rb_ary_push(r,rb_str_new2(back->first));
+		rb_ary_push(r,back->second);
+		return r;
+	}
+}
+
+static VALUE sptm_replace (VALUE self, VALUE new_st)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap* nst = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+	Data_Get_Struct(self, rb_splaymap, st);
+	Data_Get_Struct(new_st, rb_splaymap, nst);
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	if (!nst)
+		rb_raise (rb_eException, "No SplayTreeMap object to copy");
+
+	(*st).clear();
+	last_q_iterator = (*st).end();
+	for ( q_iterator = (*nst).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		(*st).insert(*q_iterator);
+	}
+
+	return self;
+}
+
+static VALUE sptm_insert (VALUE self, VALUE key, VALUE val)
+{
+	rb_splaymap* st = NULL;
+	std::pair<rb_splaymap_iterator, bool> rv;
+	std::pair<char *,VALUE> sp;
+	char * skey;
+	char * svp;
+
+	svp = StringValuePtr(key);
+	skey = new char[strlen(svp)+1];
+	strcpy(skey,svp);
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	sp = make_pair(skey,val);
+	rv = (*st).insert(sp);
+	if (!rv.second) {
+		(*st).erase(rv.first);
+		(*st).insert(sp);
+	}
+
+	return self;
+}
+
+static VALUE sptm_at (VALUE self, VALUE key)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+
+	char * skey = StringValuePtr(key);
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	q_iterator = (*st).find(skey);
+	if (q_iterator == (*st).end()) {
+		return Qnil;
+	} else {
+		return q_iterator->second;
+	}
+}
+
+static VALUE sptm_has_key (VALUE self, VALUE key)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	
+	char * skey = StringValuePtr(key);
+	
+	Data_Get_Struct(self, rb_splaymap, st);
+	
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+		
+	q_iterator = (*st).find(skey);
+	if (q_iterator == (*st).end()) {
+		return Qnil;
+	} else {
+		return key;
+	}
+}
+
+static VALUE sptm_delete (VALUE self, VALUE key)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+
+	char * skey = StringValuePtr(key);
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	q_iterator = (*st).find(skey);
+	if (q_iterator == (*st).end()) {
+		return Qnil;
+	} else {
+		(*st).erase(q_iterator);
+	}
+
+	return self;
+}
+
+/*
+static VALUE sptm_delete_value (VALUE self, VALUE obj)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	last_q_iterator = (*st).end();
+	for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		if (rb_equal(q_iterator->second, obj)) {
+			(*st).erase(q_iterator);
+			break;
+		}
+	}
+
+	return self;
+}
+*/
+ 
+static VALUE sptm_each (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+	
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	last_q_iterator = (*st).end();
+	for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		rb_yield_values(2,rb_str_new2(q_iterator->first),q_iterator->second);
+	}
+	
+	return self;
+}
+
+static VALUE sptm_index (VALUE self, VALUE match_obj)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	last_q_iterator = (*st).end();
+	for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		if (rb_equal(q_iterator->second, match_obj)) {
+			return rb_str_new2(q_iterator->first);
+		}
+	}
+	return Qnil;
+}
+
+static VALUE sptm_keys (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	last_q_iterator = (*st).end();
+	VALUE r = rb_ary_new();
+	for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		rb_ary_push(r,rb_str_new2(q_iterator->first));
+	}
+
+	return r;
+}
+
+static VALUE sptm_values (VALUE self)
+{
+	rb_splaymap* st = NULL;
+	rb_splaymap_iterator q_iterator;
+	rb_splaymap_iterator last_q_iterator;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	last_q_iterator = (*st).end();
+	VALUE r = rb_ary_new();
+	for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+		rb_ary_push(r,q_iterator->second);
+	}
+
+	return r;
+}
+
+static VALUE sptm_erase_childfree(VALUE self)
+{
+	rb_splaymap* st = NULL;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	(*st).erase_childfree_nodes();
+
+	return Qnil;
+}
+
+static VALUE sptm_get_max_size(VALUE self) {
+	rb_splaymap* st = NULL;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	return INT2FIX((*st).get_max_permitted_size());
+}
+
+static VALUE sptm_set_max_size(VALUE self, VALUE sz) {
+	int n = FIX2INT(sz);
+  rb_splaymap* st = NULL;
+
+	Data_Get_Struct(self, rb_splaymap, st);
+
+	if (n < 0)
+		rb_raise (rb_eException, "Size can not be less than zero.");
+
+	if (!st)
+		rb_raise (rb_eException, "No SplayTreeMap Object");
+
+	(*st).set_max_permitted_size(n);
+
+	while ((*st).size() > n) {
+		(*st).erase_childfree_nodes();
+	}
+
+	return sz;
+}
+
+/**********************
+Init_sptm
+**********************/
+
+extern "C" void Init_splaytreemap()
+{
+	SwiftcoreModule = rb_define_module ("Swiftcore");
+	SplayTreeMapClass = rb_define_class_under (SwiftcoreModule, "SplayTreeMap", rb_cObject);
+
+	rb_define_alloc_func (SplayTreeMapClass, sptm_alloc);
+	rb_define_method (SplayTreeMapClass, "initialize", (VALUE(*)(...))sptm_initialize,0);
+	// ==
+	rb_define_method (SplayTreeMapClass, "[]", (VALUE(*)(...))sptm_at,1);
+	rb_define_method (SplayTreeMapClass, "[]=", (VALUE(*)(...))sptm_insert,2);
+	rb_define_method (SplayTreeMapClass, "at", (VALUE(*)(...))sptm_at,1);
+	rb_define_method (SplayTreeMapClass, "clear", (VALUE(*)(...))sptm_clear,0);
+	rb_define_method (SplayTreeMapClass, "clear_childfree", (VALUE(*)(...))sptm_erase_childfree,0);
+	rb_define_method (SplayTreeMapClass, "delete", (VALUE(*)(...))sptm_delete,1);
+	// delete_if
+	// delete_values
+	rb_define_method (SplayTreeMapClass, "each", (VALUE(*)(...))sptm_each,0);
+	// each_key
+	rb_define_method (SplayTreeMapClass, "each_pair", (VALUE(*)(...))sptm_each,0);
+	// each_value
+	rb_define_method (SplayTreeMapClass, "empty?", (VALUE(*)(...))sptm_empty,0);
+	rb_define_method (SplayTreeMapClass, "fetch", (VALUE(*)(...))sptm_at,1);
+	rb_define_method (SplayTreeMapClass, "first", (VALUE(*)(...))sptm_first,0);
+	rb_define_method (SplayTreeMapClass, "has_key?", (VALUE(*)(...))sptm_has_key,1);
+	// has_value?
+	rb_define_method (SplayTreeMapClass, "include?", (VALUE(*)(...))sptm_has_key,1);
+	rb_define_method (SplayTreeMapClass, "index", (VALUE(*)(...))sptm_index,1);
+	// indices
+	rb_define_method (SplayTreeMapClass, "insert", (VALUE(*)(...))sptm_insert,2);
+	rb_define_method (SplayTreeMapClass, "inspect", (VALUE(*)(...))sptm_inspect,0);
+	// invert
+	rb_define_method (SplayTreeMapClass, "key?", (VALUE(*)(...))sptm_has_key,1);
+	rb_define_method (SplayTreeMapClass, "keys", (VALUE(*)(...))sptm_keys,0);
+	rb_define_method (SplayTreeMapClass, "last", (VALUE(*)(...))sptm_last,0);
+	rb_define_method (SplayTreeMapClass, "length", (VALUE(*)(...))sptm_size,0);
+	rb_define_method (SplayTreeMapClass, "max_capacity", (VALUE(*)(...))sptm_max_capacity,0);
+	rb_define_method (SplayTreeMapClass, "max_size", (VALUE(*)(...))sptm_get_max_size,0);
+	rb_define_method (SplayTreeMapClass, "max_size=", (VALUE(*)(...))sptm_set_max_size,1);
+	rb_define_method (SplayTreeMapClass, "member?", (VALUE(*)(...))sptm_has_key,1);
+	rb_define_method (SplayTreeMapClass, "parent", (VALUE(*)(...))sptm_parent,0);
+	rb_define_method (SplayTreeMapClass, "pop", (VALUE(*)(...))sptm_pop_back,0);
+	rb_define_method (SplayTreeMapClass, "replace", (VALUE(*)(...))sptm_replace,1);
+	rb_define_method (SplayTreeMapClass, "shift", (VALUE(*)(...))sptm_pop_front,0);
+	rb_define_method (SplayTreeMapClass, "size", (VALUE(*)(...))sptm_size,0);
+	rb_define_method (SplayTreeMapClass, "to_a", (VALUE(*)(...))sptm_to_a,0);
+	rb_define_method (SplayTreeMapClass, "to_s", (VALUE(*)(...))sptm_to_s,0);
+	rb_define_method (SplayTreeMapClass, "values", (VALUE(*)(...))sptm_values,0);
+	// values_at
+
+	rb_include_module (SplayTreeMapClass, rb_mEnumerable);
+
+/*    ==   []   []   []=   clear   default   default=   default_proc   delete   delete_if   each   each_key   each_pair   each_value   empty?   fetch   has_key?   has_value?   include?   index   indexes   indices   initialize_copy   inspect   invert   key?   keys   length   member?   merge   merge!   new   pretty_print   pretty_print_cycle   rehash   reject   reject!   replace   select   shift   size   sort   store   to_a   to_hash   to_s   to_yaml   update   value?   values   values_at  */
+//	rb_include_module (SplayTreeMapClass, rb_mEnumerable);
+}