abstract_graph 1.1.0 → 1.2.1

checksums.yaml

@@ -1,7 +1,15 @@
 ---
-SHA1:
-  metadata.gz: 7a6bbd7d12e215a907b79ebaef777d9282f4e283
-  data.tar.gz: 8207dfe01745e9a6c50a75bc59f79a2f1248045f
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    NTk2OWI3Y2Y4YmU0NDAyNjBkNjI2N2RhMTk2OGY2NjAzM2Y4YmQ5OQ==
+  data.tar.gz: !binary |-
+    OTFmYmYwOTFjNzQ3OThlNGU4OTM0MjFkY2MzN2U1MmM5ODQ5YWNjYw==
 SHA512:
-  metadata.gz: f7c6d5082e389a24a6db96e4c103825803ecfd8ebc1f41117192093a349dfe7104329d14d7c7b1098f04a783f225cfbbffd25242514a0cad5e2b569e61564e3c
-  data.tar.gz: 406b2b87218d98b9832fe479791192c38098ca7453a8e9fcb3bb68e9a7050ffee51aa4a4a2fdc97a7a7ab84d268ec1ee80fe35faeca8a1d9745cc90633911e06
+  metadata.gz: !binary |-
+    Mzg5OGFkMDY1ZmMwMzFiYjJlMDA5MDljZTljNGE0ZGE1NTU3ZDNlODQ4MTBj
+    Mzc1MTQ1MWY2OGRkOTcwZDE1M2FmZjI1NWQ5NGU2ZjVhODJiMzM3NGE4ZDI5
+    Yzc0N2Y0NDU3YWQzNTRjNmM1MDAzM2YyMjY2ZTExYmMyZGFkODE=
+  data.tar.gz: !binary |-
+    Yjk5NWMwMDRkMWM0ZWVkNGM3YmQxZGM5N2I2ZjUwMWZhN2Q4YWMwNzc3YWZj
+    MjIxNGJjOGY1NzU3YTRiN2RhYjc2MWM2MWNjOGVkMDJhMDU3YzVlMWRjNzEx
+    YmY2NmQ3ZTE2ZTFjMWEzNGY5OTAzZjUwMzc2MTdmODEwZmU3ZmU=

data/Rakefile

@@ -1,6 +1,11 @@
 #!/usr/bin/env rake
-require "bundler/gem_tasks"
 
+# Add paths
+$:.unshift File.expand_path('..', __FILE__)
+$:.unshift File.expand_path('../lib', __FILE__)
+
+require "lib/abstract_graph"
+require "bundler/gem_tasks"
 require "rspec/core/rake_task"
 
 desc "Run specs"
@@ -12,3 +17,8 @@ task :default => :spec
 
 desc "Run tests (same as rake spec)"
 task :test => :spec
+
+require "tasks/create_method"
+require "tasks/list_methods"
+require "tasks/benchmark"
+

data/lib/abstract_graph.rb

@@ -1,3 +1,4 @@
+require "set"
 require "abstract_graph/version"
 require "abstract_graph/composition"
 require "abstract_graph/graph"

data/lib/abstract_graph/composition.rb

@@ -2,7 +2,7 @@
 
 require "abstract_graph/composition/vertex"
 require "abstract_graph/composition/edge"
-require "abstract_graph/composition/uniquenamecollection"
+require "abstract_graph/composition/unique_name_collection"
 
 module AbstractGraph
   module Composition

data/lib/abstract_graph/composition/edge.rb

@@ -8,6 +8,11 @@ module AbstractGraph
       attr_reader :name
       attr_accessor :vertices
 
+      # d: Set the name of edge.
+      # a: Throw an ArgumentError if the name is not a string
+      # t: constant
+      # p: name should be string
+      # r: The name
       def name=(name)
         raise ArgumentError if name.class != String
         @name = name

data/lib/abstract_graph/composition/edge/initialize.rb

@@ -4,6 +4,12 @@ module AbstractGraph
   module Composition
     class Edge
 
+      # d: Create an edge with a name and two vertices
+      # a: Check if a string is passed, otherwise, the next two must be the vertices
+      # t: constant
+      # p: name if we want to name our edge, otherwise it'll be ""
+      #   The next two args are the two vertices that this edge connects
+      # r: Edge object
       def initialize ( *args )
         if args[0].class == String
           @name = args[0]

data/lib/abstract_graph/composition/edge/is_coincident.rb

@@ -4,10 +4,13 @@ module AbstractGraph
   module Composition
     class Edge
 
-      # returns whether or not e covers the same two vertices
+      # d: Check if two edges are covering the same vertices.
+      # a: Compare the object_id, by extracting them and sorting them.
+      # t: constant
       # p: Edge e is the comparing edge
+      # r: true or false depending on coincident
       def is_coincident? e
-        return ( ( e.vertices | @vertices ) - ( e.vertices & @vertices ) ).empty?
+        return e.vertices.map{|v| v.object_id}.sort == @vertices.map{|v| v.object_id}.sort
       end
 
     end

data/lib/abstract_graph/composition/unique_name_collection.rb

@@ -0,0 +1,28 @@
+# required in "abstract_graph/composition"
+
+module AbstractGraph
+  module Composition
+
+    # public UniqueNameCollection class
+    # Note that the collection of this
+    #   class must implement #name
+    class UniqueNameCollection
+      attr_accessor :collection
+      attr_accessor :namespace_ticket
+      @@namespace = {}
+      @@namespace_counter = 0
+    end
+
+  end
+end
+
+require "abstract_graph/composition/unique_name_collection/initialize"
+require "abstract_graph/composition/unique_name_collection/add"
+require "abstract_graph/composition/unique_name_collection/dup"
+require "abstract_graph/composition/unique_name_collection/method_missing"
+require "abstract_graph/composition/unique_name_collection/link"
+require "abstract_graph/composition/unique_name_collection/rename"
+require "abstract_graph/composition/unique_name_collection/each"
+require "abstract_graph/composition/unique_name_collection/ticket"
+require "abstract_graph/composition/unique_name_collection/delete"
+require "abstract_graph/composition/unique_name_collection/find"

data/lib/abstract_graph/composition/unique_name_collection/add.rb

@@ -0,0 +1,23 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Adds the object to our UNC.
+      # a: Ensure that our namespace doesn't already have the object name and
+      #   then add the object to namespace and collection.
+      # t: constant
+      # p: Object o that implements #name
+      # r: The object o itself
+      def add( o )
+        set = @@namespace[@namespace_ticket.get][0]
+        raise IndexError if set.include? o.name
+        set << o.name
+        @collection[o.name] = o
+        self
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/delete.rb

@@ -0,0 +1,20 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Delete the object from the collection
+      # a: Delete the object from the collection and from the nameserver
+      # t: constant
+      # p: name of object we want to delete
+      # r: object that was deleted
+      def delete( name )
+        return nil unless @collection[name]
+        @@namespace[@namespace_ticket.get][0].delete name
+        @collection.delete name
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/dup.rb

@@ -0,0 +1,24 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Deep copies our object.
+      # a: Does a deep copy of the object, in otherwords
+      #   copies every object in the collection.
+      # t: |collection|
+      # p:
+      # r: the copy of the UNC
+      def dup
+        other = self.class.new
+        # copy each object in our collection over
+        @collection.each_value do |o|
+          other.add o.dup
+        end
+        other
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/each.rb

@@ -0,0 +1,18 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Iterate through all objects.
+      # a: Enumerates through every object.
+      # t: constant
+      # p: block that we pass in each object
+      # r: Enumerable if no block, collection if yes block
+      def each( &block )
+        @collection.each_value( &block )
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/find.rb

@@ -0,0 +1,18 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Finds a stored object given the name.
+      # a: Goes into collection and retrieves based on key.
+      # t: constant
+      # p: name of object
+      # r: object
+      def find(name)
+        @collection[name]
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/initialize.rb

@@ -0,0 +1,22 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Initializes the UNC.
+      # a: Assign itself a namespace_ticket and start the collection by adding
+      #   the namespace a set of names and backreference of tickets
+      # t: constant
+      # p:
+      # r: new UNC
+      def initialize
+        @collection = Hash.new
+        @@namespace_counter += 1
+        @namespace_ticket = Ticket.new(@@namespace_counter)
+        @@namespace[@@namespace_counter] = [Set.new, Set.new([@namespace_ticket])]
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/link.rb

@@ -0,0 +1,42 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Links the UNC so they have unique namespace.
+      # a: check the intersection of namespace so that there's no collision, then
+      #   reset the namespace to contain the shared namespaces and update tickets
+      # t: |intersection and size of ticket|
+      # p: UniqueNameCollection unc is the other collection we want to link
+      # r: false if the two collections are not already mutually unique
+      #   UNC if it succeeds
+      def link( unc )
+        our_ticket = @namespace_ticket.get
+        other_ticket = unc.namespace_ticket.get
+        our_namespace = @@namespace[our_ticket]
+        other_namespace = @@namespace[other_ticket]
+
+        namespace_intersection = our_namespace[0] & other_namespace[0]
+        return nil unless namespace_intersection.empty?
+
+        # Create the assumption that |our_namespace| >= |other_namespace|
+        if other_namespace[0].size > our_namespace[0].size
+          our_namespace, other_namespace = other_namespace, our_namespace
+          our_ticket, other_ticket = other_ticket, our_ticket
+        end
+
+        # Assume it is fine to link now, add to the larger namespace
+        our_namespace[0].merge other_namespace[0]
+        other_namespace[1].map do |ticket|
+          ticket.set our_ticket
+        end
+        our_namespace[1].merge other_namespace[1]
+
+        @@namespace.delete other_ticket
+        self
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/method_missing.rb

@@ -0,0 +1,18 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Handles everything.
+      # a: Pass all methods into the hash.
+      # t:
+      # p:
+      # r:
+      def method_missing( m, *args, &block )
+        @collection.values.send( m.to_sym, *args, &block )
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/rename.rb

@@ -0,0 +1,34 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: Change the name of a vertex in our graph.
+      # a: Check the namespace otherwise, set collection and add to namespace
+      # t: constant
+      # p: String oldname represents the current vertex's name
+      #   String newname represents the new name of our vertex
+      # r: UNC itself
+      def rename( oldname, newname )
+        return nil unless @collection.has_key? oldname
+
+        nameserver = @@namespace[@namespace_ticket.get][0]
+        throw Exception if nameserver.include? newname
+
+        # change the nameserver
+        nameserver.delete oldname
+        nameserver << newname
+
+        # rename the object itself
+        @collection[oldname].name = newname
+        # remap the name
+        @collection[newname] = @collection[oldname]
+        # clear the old name
+        @collection.delete oldname
+        self
+      end
+
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/ticket.rb

@@ -0,0 +1,18 @@
+# required in "abstract_graph/composition/unique_name_collection"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+
+      # d: This is the ticket for the nameserver in UNC
+      class Ticket
+        attr_accessor :number
+      end
+
+    end
+  end
+end
+
+require "abstract_graph/composition/unique_name_collection/ticket/initialize"
+require "abstract_graph/composition/unique_name_collection/ticket/get"
+require "abstract_graph/composition/unique_name_collection/ticket/set"

data/lib/abstract_graph/composition/unique_name_collection/ticket/get.rb

@@ -0,0 +1,20 @@
+# required in "abstract_graph/composition/unique_name_collection/ticket"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+      class Ticket
+
+        # d: Returns the number
+        # a:
+        # t: constant
+        # p:
+        # r: @number
+        def get
+          @number
+        end
+
+      end
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/ticket/initialize.rb

@@ -0,0 +1,20 @@
+# required in "abstract_graph/composition/unique_name_collection/ticket"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+      class Ticket
+
+        # d: Returns the Ticket object
+        # a: Sets number
+        # t: constant
+        # p: number to initialize with
+        # r: self
+        def initialize( number )
+          @number = number
+        end
+
+      end
+    end
+  end
+end

data/lib/abstract_graph/composition/unique_name_collection/ticket/set.rb

@@ -0,0 +1,20 @@
+# required in "abstract_graph/composition/unique_name_collection/ticket"
+
+module AbstractGraph
+  module Composition
+    class UniqueNameCollection
+      class Ticket
+
+        # d: Sets the Ticket number.
+        # a: Sets number
+        # t: constant
+        # p: number to set to
+        # r: self
+        def set( number )
+          @number = number
+        end
+
+      end
+    end
+  end
+end