hyperactive 0.1.1 → 0.2.2

data/README

@@ -16,6 +16,7 @@ Hyperactive::Tree:: A collection class that contains any number of Hyperactive::
 To define a Record subclass that has the properties @active and @city that are indexed in two ways:
 
  class MyClass < Hyperactive::Record
+   attr_accessor :active, :city
    select(:active_records, Proc.new do |record|
    			      record.active == true
                            end)

data/lib/hyperactive/list.rb

@@ -0,0 +1,154 @@
+# Archipelago - a distributed computing toolkit for ruby
+# Copyright (C) 2006  Martin Kihlgren <zond at troja dot ath dot cx>
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of 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.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
+
+
+require 'rubygems'
+require 'archipelago'
+
+module Hyperactive
+
+  #
+  # A package that simplifies putting dumb linked lists in the distributed database.
+  #
+  module List
+
+    #
+    # A List element.
+    #
+    class Element < Hyperactive::Record::Bass
+      attr_accessor :previous, :next, :value
+    end
+
+    #
+    # A List head.
+    #
+    class Head < Hyperactive::Record::Bass
+      attr_reader :first_element, :last_element, :size
+
+      #
+      # Create a Head.
+      #
+      # NB: As usual, dont call this. Use Head.get_instance instead.
+      #
+      def initialize
+        @size = 0
+        @first_element = @last_element = nil
+      end
+
+      #
+      # Return the first value of the list.
+      #
+      def first
+        @first_element.value
+      end
+
+      #
+      # Return the last value of the list. 
+      #
+      def last
+        @last_element.value
+      end
+      
+      #
+      # Push +v+ onto the end of this list.
+      #
+      def <<(v)
+        if @first_element
+          new_element = Element.get_instance
+          new_element.value = v
+          new_element.previous = @last_element
+          @last_element.next = new_element
+          @last_element = new_element
+        else
+          start(v)
+        end
+        @size += 1
+        return v
+      end
+
+      #
+      # Push +v+ onto the beginning of this list.
+      #
+      def unshift(v)
+        if @first_element
+          new_element = Element.get_instance
+          new_element.value = v
+          new_element.next = @first_element
+          @first_element.previous = new_element
+          @first_element = new_element
+        else
+          start(v)
+        end 
+        @size += 1
+        return v
+      end
+      
+      #
+      # Remove the last value from this list and return it.
+      #
+      def pop
+        v = nil
+        if size > 1
+          element = @last_element
+          @last_element = element.previous
+          @last_element.next = nil
+          v = element.value
+          element.destroy
+        else
+          v = @first_element.value
+          @first_element.destroy
+          @first_element = @last_element = nil
+        end
+        @size -= 1
+        return v
+      end
+
+      #
+      # Remove the first value from this list and return it. 
+      #
+      def shift
+        v = nil
+        if size > 1
+          element = @first_element
+          @first_element = element.next
+          @first_element.previous = nil
+          v = element.value
+          element.destroy
+        else
+          v = @first_element.value
+          @first_element.destroy
+          @first_element = @last_element = nil
+        end
+        @size -= 1
+        return v
+      end
+      
+      private
+
+      #
+      # Start this list with +v+ when it has no other values.
+      #
+      def start(v)
+        @first_element = @last_element = Element.get_instance
+        @first_element.value = v
+      end
+
+    end
+
+  end
+
+end