skiplist 0.0.1

data/History.txt

@@ -0,0 +1,3 @@
+=== 0.0.1 2010-Aug-13
+
+* Initial release

data/Manifest.txt

@@ -0,0 +1,14 @@
+History.txt
+Manifest.txt
+README.rdoc
+Rakefile
+ext/skiplist/extconf.rb
+ext/skiplist/skiplist_mlink.c
+lib/skiplist.rb
+lib/skiplist/loop.rb
+lib/skiplist/sentinelelement.rb
+script/console
+script/destroy
+script/generate
+test/test_helper.rb
+test/test_skiplist.rb

data/README.rdoc

@@ -0,0 +1,49 @@
+= skiplist
+
+* http://github.com/metanest/ruby-skiplist
+
+== DESCRIPTION:
+
+Lock-free skip list implementation by ruby.
+
+== FEATURES/PROBLEMS:
+
+* FIX (list of features or problems)
+
+== SYNOPSIS:
+
+  FIX (code sample of usage)
+
+== REQUIREMENTS:
+
+* ruby 1.9
+
+== INSTALL:
+
+* (sudo) gem install
+
+== LICENSE:
+
+(other than loop.rb )
+(The MIT License)
+
+Copyright (c) 2010 KISHIMOTO, Makoto
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/Rakefile

@@ -0,0 +1,29 @@
+require 'rubygems'
+gem 'hoe', '>= 2.1.0'
+require 'hoe'
+require 'fileutils'
+require './lib/skiplist'
+
+Hoe.plugin :newgem
+# Hoe.plugin :website
+# Hoe.plugin :cucumberfeatures
+
+# Generate all the Rake tasks
+# Run 'rake -T' to see list of generated tasks (from gem root directory)
+$hoe = Hoe.spec 'skiplist' do
+  self.developer 'KISHIMOTO, Makoto', 'ksmakoto@dd.iij4u.or.jp'
+  # self.post_install_message = 'PostInstall.txt' # TODO remove if post-install message not required
+  self.rubyforge_name       = self.name # TODO this is default value
+  # self.extra_deps         = [['activesupport','>= 2.0.2']]
+
+  self.spec_extras = {
+    :extensions => ['ext/skiplist/extconf.rb'],
+  }
+end
+
+require 'newgem/tasks'
+Dir['tasks/**/*.rake'].each { |t| load t }
+
+# TODO - want other tests/tasks run by default? Add them to the list
+# remove_task :default
+# task :default => [:spec, :features]

data/ext/skiplist/extconf.rb

@@ -0,0 +1,3 @@
+require "mkmf"
+
+create_makefile "skiplist/skiplist_mlink"

data/ext/skiplist/skiplist_mlink.c

@@ -0,0 +1,150 @@
+/* vi:set ts=3 sw=3:
+ * vim:set sts=0 noet:
+ */
+/*
+ * Copyright (c) 2010 KISHIMOTO, Makoto
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <ruby.h>
+
+static __inline__ int
+cas(VALUE *addr, VALUE oldp, VALUE newp)
+{
+	return __sync_bool_compare_and_swap(addr, oldp, newp);
+}
+
+struct mlink {
+	VALUE link;
+};
+
+static void
+mlink_mark(struct mlink *lnkp)
+{
+	VALUE p = lnkp->link & ~1;
+
+	rb_gc_mark(p);
+}
+
+static VALUE
+mlink_alloc(VALUE klass)
+{
+	struct mlink *lnkp;
+	VALUE obj = Data_Make_Struct(klass, struct mlink, mlink_mark, -1, lnkp);
+
+	lnkp->link = 0;
+
+	return obj;
+}
+
+static VALUE
+mlink_initialize(VALUE obj, VALUE link)
+{
+	struct mlink *lnkp;
+
+	if (link & 1) {
+		rb_raise(rb_eArgError, "link must not be a Fixnum");
+	}
+
+	Data_Get_Struct(obj, struct mlink, lnkp);
+
+	lnkp->link = link;
+
+	return Qnil;
+}
+
+static VALUE
+mlink_compare_and_set(VALUE obj, VALUE oldlink, VALUE newlink, VALUE oldmark, VALUE newmark)
+{
+	struct mlink *lnkp;
+	VALUE olink, nlink;
+
+	if ((oldlink & 1) || (newlink & 1)) {
+		rb_raise(rb_eArgError, "link must not be a Fixnum");
+	}
+	if (((oldmark != Qfalse) && (oldmark != Qtrue)) ||
+	    ((newmark != Qfalse) && (newmark != Qtrue))) {
+		rb_raise(rb_eArgError, "mark must be a boolean");
+	}
+
+	Data_Get_Struct(obj, struct mlink, lnkp);
+
+	olink = oldlink | !!oldmark;
+	nlink = newlink | !!newmark;
+
+	return cas(&lnkp->link, olink, nlink) ? Qtrue : Qfalse ;
+}
+
+static VALUE
+mlink_get(VALUE obj)
+{
+	struct mlink *lnkp;
+	VALUE link, mark;
+
+	Data_Get_Struct(obj, struct mlink, lnkp);
+
+	link = lnkp->link;
+	mark = link & 1 ? Qtrue : Qfalse ;
+	link &= ~1;
+
+	return rb_ary_new3(2, link, mark);
+}
+
+static VALUE
+mlink_get_link(VALUE obj)
+{
+	struct mlink *lnkp;
+
+	Data_Get_Struct(obj, struct mlink, lnkp);
+
+	return lnkp->link & ~1;
+}
+
+static VALUE
+mlink_print_debug(VALUE obj)
+{
+	VALUE link_mark, arg[1], link, mark;
+
+	link_mark = mlink_get(obj);
+	arg[0] = INT2FIX(0);
+	link = rb_ary_aref(1, arg, link_mark);
+	arg[0] = INT2FIX(1);
+	mark = rb_ary_aref(1, arg, link_mark);
+
+	rb_funcall(obj, rb_intern("puts"), 1,
+		rb_funcall(rb_str_new2("#<MLink: @mark = %s, @link = 0x%014x>"), rb_intern("%"), 1,
+			rb_ary_new3(2, mark, rb_funcall(link, rb_intern("object_id"), 0)) ));
+
+	return Qnil;
+}
+
+void
+Init_skiplist_mlink(void)
+{
+	VALUE cSkipList = rb_define_class("SkipList", rb_cObject);
+	VALUE cMLink = rb_define_class_under(cSkipList, "MLink", rb_cObject);
+
+	rb_define_alloc_func(cMLink, &mlink_alloc);
+
+	rb_define_method(cMLink, "initialize", &mlink_initialize, 1);
+	rb_define_method(cMLink, "compare_and_set", &mlink_compare_and_set, 4);
+	rb_define_method(cMLink, "get", &mlink_get, 0);
+	rb_define_method(cMLink, "get_link", &mlink_get_link, 0);
+	rb_define_method(cMLink, "print_debug", &mlink_print_debug, 0);
+}

data/lib/skiplist.rb

@@ -0,0 +1,375 @@
+# coding:utf-8
+# vi:set ts=3 sw=3:
+# vim:set sts=0 noet:
+
+$:.unshift(File.dirname(__FILE__)) unless
+  $:.include?(File.dirname(__FILE__)) || $:.include?(File.expand_path(File.dirname(__FILE__)))
+
+require "skiplist/loop"
+require "skiplist/sentinelelement"
+require "skiplist/skiplist_mlink"
+
+=begin
+Copyright (c) 2010 KISHIMOTO, Makoto
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+=end
+
+#
+#= Lock-Free Skip List
+#
+#Authors::   KISHIMOTO, Makoto
+#Version::   0.0.1 2010-Aug-13
+#Copyright:: Copyright (c) 2010 KISHIMOTO, Makoto
+#License::   (other than loop.rb ) X License
+#
+#=== References
+#
+#- The Art of Multiprocessor Programming, Chap. 14
+#
+class SkipList
+	VERSION = '0.0.1'
+
+	#
+	# Node of SkipList, inner use only
+	#
+	class Node
+		attr_accessor :toplevel, :key, :val
+
+		def initialize toplevel, key, val
+			@toplevel = toplevel
+			@key = key
+			@val = val
+			@links = Array.new(@toplevel + 1)
+		end
+
+		def print_debug
+			puts "object_id = 0x%014x" % [object_id]
+			puts "@toplevel = #{@toplevel}"
+			puts "@key = #{@key}"
+			puts "@val = #{@val}"
+			puts "@links = "
+			@links.each_index{|i|
+				print "[#{i}] "
+				@links[i].print_debug
+			}
+		end
+
+		def [] level
+			@links[level]
+		end
+
+		def []= level, node
+			@links[level] = node
+		end
+	end
+
+	attr_reader :size
+
+	#
+	# Create a SkipList object.
+	#
+	# level_max :: If this list will have approximately N elements, you sholud set this log_2 N.
+	#
+	def initialize level_max, cmp_op=:<=>, max_element=nil
+		if level_max < 0 then
+			raise ArgumentError.new "level_max must not be negative"
+		end
+		@level_max = level_max
+		@cmp_op = cmp_op
+		max = if max_element then max_element else SentinelElement::MAX end
+		@tail = Node.new @level_max, max, nil
+		(0).upto(@level_max){|i|
+			@tail[i] = MLink.new nil
+		}
+		@head = Node.new @level_max, nil, nil
+		(0).upto(@level_max){|i|
+			@head[i] = MLink.new @tail
+		}
+		@randgen = Random.new
+		@size_lock = Mutex.new
+		@size = 0
+	end
+
+	# for debug use
+	def print_debug
+		puts "@level_max = #{@level_max}"
+		puts "@cmp_op = #{@cmp_op}"
+		puts "@randgen = #{@randgen}"
+		puts "@size = #{@size}"
+		puts ""
+		puts "Nodes"
+		puts ""
+		p = @head
+		while p do
+			p.print_debug
+			puts ""
+			p = p[0].get_link
+		end
+	end
+
+	# this returns one of 0..ex, approx of 0 is 1/2, 1 is 1/4, 2 is 1/8, ...
+	def rand2exp ex
+		mask = 1 << (ex + 1)
+		r = 1 + @randgen.rand(mask - 1)
+		mask >>= 1
+		i = 0
+		while r & mask == 0 do
+			mask >>= 1
+			i += 1
+		end
+		i
+	end
+	private :rand2exp
+
+	#
+	# call-seq:
+	#     lst.empty? -> true or false
+	#
+	# Returns <code>true</code> if <i>lst</i> contains no elements.
+	#
+	def empty?
+		@head[0].get_link.equal? @tail
+	end
+
+	#
+	# call-seq:
+	#     lst.to_a -> array
+	#
+	# Converts <i>lst</i> to a array of <code>[</code> <i>key, value</i>
+	# <code>]</code> arrays.
+	#
+	#     lst = SkipList.new 5
+	#     lst["foo"] = 1
+	#     lst["bar"] = 2
+	#     lst["baz"] = 3
+	#     lst.to_a  #=> [["bar", 2], ["baz", 3], ["foo", 1]]
+	#
+	def to_a
+		arr = []
+		p, m = @head[0].get
+		while p do
+			if not m then
+				arr.push [p.key, p.val]
+			end
+			p, m = p[0].get
+		end
+		arr.pop
+		arr
+	end
+
+	# for inner use
+	def find key, before_list, after_list
+		Loop.loop {|tag|
+			pp = nil
+			p = @head
+			@level_max.downto(0){|level|
+				pp = p[level].get_link
+				loop {
+					ppp, mark = pp[level].get
+					while mark do
+						snip = p[level].compare_and_set pp, ppp, false, false
+						unless snip then
+							tag.next
+						end
+						#pp = ppp  # ?
+						pp = p[level].get_link
+						ppp, mark = pp[level].get
+					end
+					if pp.key < key then
+						p = pp
+						pp = ppp
+					else
+						break
+					end
+				}
+				before_list[level] = p
+				after_list[level] = pp
+			}
+			if pp.key == key then
+				tag.break pp
+			else
+				tag.break nil
+			end
+		}
+	end
+	private :find
+
+	#
+	# call-seq:
+	#     lst[key] = val -> val
+	#
+	# Insert new node that key is <i>key</i> and value is <i>val</i>.
+	# If already exist the node with key == <i>key</i>, assign new <i>val</i>.
+	# This method returns <i>val</i>.
+	#
+	#     lst = SkipList.new 5
+	#     lst["foo"] = 1
+	#     lst["bar"] = 2
+	#     lst["baz"] = 3
+	#     lst.to_a  #=> [["bar", 2], ["baz", 3], ["foo", 1]]
+	#
+	def []= key, val
+		before_list = Array.new(@level_max + 1)
+		after_list = Array.new(@level_max + 1)
+		loop {
+			if p = find(key, before_list, after_list) then
+				p.val = val
+				break
+			end
+			toplevel = rand2exp @level_max
+			node = Node.new toplevel, key, val
+			(0).upto(toplevel){|level|
+				node[level] = MLink.new after_list[level]
+			}
+			unless before_list[0][0].compare_and_set after_list[0], node, false, false then
+				next
+			end
+			@size_lock.synchronize {
+				@size += 1
+			}
+			(1).upto(toplevel){|level|
+				loop {
+					if before_list[level][level].compare_and_set after_list[level], node, false, false then
+						break
+					end
+					find key, before_list, after_list
+				}
+			}
+			break
+		}
+		val
+	end
+
+	#
+	# call-seq:
+	#     lst[key] -> value
+	#
+	# Element reference. 
+	#
+	#     lst = SkipList.new 5
+	#     lst["foo"] = 1
+	#     lst["bar"] = 2
+	#     lst["baz"] = 3
+	#     lst["foo"]  #=> 1
+	#     lst["bar"]  #=> 2
+	#     lst["baz"]  #=> 3
+	#
+	def [] key
+		pp = nil
+		p = @head
+		@level_max.downto(0){|level|
+			pp = p[level].get_link  # ?
+			loop {
+				ppp, mark = pp[level].get
+				while mark do
+					#pp = ppp  # ?
+					pp = pp[level].get_link
+					ppp, mark = pp[level].get
+				end
+				if pp.key < key then
+					p = pp
+					pp = ppp
+				else
+					break
+				end
+			}
+		}
+		if pp.key == key then
+			pp.val
+		else
+			nil
+		end
+	end
+
+	#
+	# call-seq:
+	#     lst.delete[key] -> value
+	#
+	# Element deletion. Returns a value of deleted element.
+	#
+	#     lst = SkipList.new 5
+	#     lst["foo"] = 1
+	#     lst["foo"]  #=> 1
+	#     lst.delete["foo"]  #=> 1
+	#     lst["foo"]  #=> nil
+	#     lst.delete["bar"]  #=> nil
+	#
+	def delete key
+		before_list = Array.new(@level_max + 1)
+		after_list = Array.new(@level_max + 1)
+		unless p = find(key, before_list, after_list) then
+			return nil
+		end
+		p.toplevel.downto(1){|level|
+			pp, mark = p[level].get
+			until mark do
+				p[level].compare_and_set pp, pp, false, true
+				pp, mark = p[level].get
+			end
+		}
+		pp, mark = p[0].get
+		loop {
+			i_marked_it = p[0].compare_and_set pp, pp, false, true
+			pp, mark = p[0].get
+			if i_marked_it then
+				@size_lock.synchronize {
+					@size -= 1
+				}
+				#find key, before_list, after_list
+				break p.val
+			elsif mark then
+				break nil
+			end
+		}
+	end
+end
+
+#
+
+if $0 == __FILE__ then
+	puts "------------------------"
+	list = SkipList.new 5
+	list["foo"] = "foo"
+	list["bar"] = "bar"
+	list["baz"] = "baz"
+	list.print_debug
+	puts "------------------------"
+	list = SkipList.new 5
+	list["foo"] = "foo"
+	list["bar"] = "bar"
+	list["baz"] = "baz"
+	list.delete "foo"
+	list.print_debug
+	puts "------------------------"
+	list = SkipList.new 5
+	list["foo"] = "foo"
+	list["bar"] = "bar"
+	list["baz"] = "baz"
+	list.delete "bar"
+	list.print_debug
+	puts "------------------------"
+	list = SkipList.new 5
+	list["foo"] = "foo"
+	list["bar"] = "bar"
+	list["baz"] = "baz"
+	list.delete "baz"
+	list.print_debug
+	puts "------------------------"
+end

data/lib/skiplist/loop.rb

@@ -0,0 +1,35 @@
+# coding:utf-8
+# vi:set ts=3 sw=3:
+# vim:set sts=0 noet:
+
+# by Nobuyoshi Nakada [ruby-dev:41909]
+
+class Loop
+	def loop
+		begin
+			t, val = catch(self){
+				yield self
+				true
+			}
+		end while t
+		val
+	end
+
+	def next val=nil
+		throw self, [true, val]
+	end
+
+	def break val=nil
+		throw self, [false, val]
+	end
+
+	def self.loop &block
+		new.loop(&block)
+	end
+
+	private
+
+	def self.new
+		super
+	end
+end

data/lib/skiplist/sentinelelement.rb

@@ -0,0 +1,66 @@
+# coding:utf-8
+# vi:set ts=3 sw=3:
+# vim:set sts=0 noet:
+
+=begin
+Copyright (c) 2010 KISHIMOTO, Makoto
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+=end
+
+class SentinelElement
+	include Comparable
+
+	MAX = new
+	MIN = new
+
+	private
+
+	def self.new
+		super
+	end
+end
+
+class << SentinelElement::MAX
+	def <=> other
+		if equal? other then
+			0
+		else
+			1
+		end
+	end
+
+	def coerce other
+		[MIN, self]
+	end
+end
+
+class << SentinelElement::MIN
+	def <=> other
+		if equal? other then
+			0
+		else
+			-1
+		end
+	end
+
+	def coerce other
+		[MAX, self]
+	end
+end

data/script/console

@@ -0,0 +1,10 @@
+#!/usr/bin/env ruby
+# File: script/console
+irb = RUBY_PLATFORM =~ /(:?mswin|mingw)/ ? 'irb.bat' : 'irb'
+
+libs =  " -r irb/completion"
+# Perhaps use a console_lib to store any extra methods I may want available in the cosole
+# libs << " -r #{File.dirname(__FILE__) + '/../lib/console_lib/console_logger.rb'}"
+libs <<  " -r #{File.dirname(__FILE__) + '/../lib/skiplist.rb'}"
+puts "Loading skiplist gem"
+exec "#{irb} #{libs} --simple-prompt"

data/script/destroy

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+APP_ROOT = File.expand_path(File.join(File.dirname(__FILE__), '..'))
+
+begin
+  require 'rubigen'
+rescue LoadError
+  require 'rubygems'
+  require 'rubigen'
+end
+require 'rubigen/scripts/destroy'
+
+ARGV.shift if ['--help', '-h'].include?(ARGV[0])
+RubiGen::Base.use_component_sources! [:rubygems, :newgem, :newgem_theme, :test_unit]
+RubiGen::Scripts::Destroy.new.run(ARGV)

data/script/generate

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+APP_ROOT = File.expand_path(File.join(File.dirname(__FILE__), '..'))
+
+begin
+  require 'rubigen'
+rescue LoadError
+  require 'rubygems'
+  require 'rubigen'
+end
+require 'rubigen/scripts/generate'
+
+ARGV.shift if ['--help', '-h'].include?(ARGV[0])
+RubiGen::Base.use_component_sources! [:rubygems, :newgem, :newgem_theme, :test_unit]
+RubiGen::Scripts::Generate.new.run(ARGV)

data/test/test_helper.rb

@@ -0,0 +1,3 @@
+require 'stringio'
+require 'test/unit'
+require File.dirname(__FILE__) + '/../lib/skiplist'

data/test/test_skiplist.rb

@@ -0,0 +1,11 @@
+require File.dirname(__FILE__) + '/test_helper.rb'
+
+class TestSkiplist < Test::Unit::TestCase
+
+  def setup
+  end
+  
+  def test_truth
+    assert true
+  end
+end

metadata

@@ -0,0 +1,110 @@
+--- !ruby/object:Gem::Specification 
+name: skiplist
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- KISHIMOTO, Makoto
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-08-13 00:00:00 +09:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rubyforge
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 2
+        - 0
+        - 4
+        version: 2.0.4
+  type: :development
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 2
+        - 6
+        - 1
+        version: 2.6.1
+  type: :development
+  version_requirements: *id002
+description: Lock-free skip list implementation by ruby.
+email: 
+- ksmakoto@dd.iij4u.or.jp
+executables: []
+
+extensions: 
+- ext/skiplist/extconf.rb
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+files: 
+- History.txt
+- Manifest.txt
+- README.rdoc
+- Rakefile
+- ext/skiplist/extconf.rb
+- ext/skiplist/skiplist_mlink.c
+- lib/skiplist.rb
+- lib/skiplist/loop.rb
+- lib/skiplist/sentinelelement.rb
+- script/console
+- script/destroy
+- script/generate
+- test/test_helper.rb
+- test/test_skiplist.rb
+has_rdoc: true
+homepage: http://github.com/metanest/ruby-skiplist
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --main
+- README.rdoc
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: skiplist
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Lock-free skip list implementation by ruby.
+test_files: 
+- test/test_helper.rb
+- test/test_skiplist.rb