red_grape 0.0.1 → 0.0.2

data/test/test_on_the_nature_of_pipes.rb

@@ -9,10 +9,10 @@ class OnTheNatureOfPipesTest < Test::Unit::TestCase
 
   def test_basic
     assert_equal '1',
-      @graph.v(1)._id
+      @graph.v(1).id
 
     assert_equal %w(2 3 4), 
-      @graph.v(1).out.take.map(&:_id).sort
+      @graph.v(1).out.take.map(&:id).sort
 
     assert_equal %w(josh lop vadas), 
       @graph.v(1).out.name.take.sort
@@ -30,12 +30,12 @@ class OnTheNatureOfPipesTest < Test::Unit::TestCase
 
   def test_filter
     assert_equal %w(2 4), 
-      @graph.v(1).out('knows').take.map(&:_id).sort
+      @graph.v(1).out('knows').take.map(&:id).sort
 
-    assert_equal %W(2), 
-      @graph.v(1).out('knows').filter{it.age < 30}.take.map(&:_id).sort
+    assert_equal %w(2), 
+      @graph.v(1).out('knows').filter{it.age < 30}.take.map(&:id).sort
 
-    assert_equal %W(vadas),
+    assert_equal %w(vadas),
       @graph.v(1).out('knows').filter{it.age < 30}.name.take.sort
 
     assert_equal [5], 
@@ -50,13 +50,13 @@ class OnTheNatureOfPipesTest < Test::Unit::TestCase
       @graph.v(1).side_effect{@x = it}.take.name
 
     assert_equal %w(3), 
-      @graph.v(1).side_effect{@x = it}.out('created').take.map(&:_id).sort
+      @graph.v(1).side_effect{@x = it}.out('created').take.map(&:id).sort
 
     assert_equal %w(1 4 6), 
-      @graph.v(1).side_effect{@x = it}.out('created').in('created').take.map(&:_id).sort
+      @graph.v(1).side_effect{@x = it}.out('created').in('created').take.map(&:id).sort
 
     assert_equal %w(4 6), 
-      @graph.v(1).side_effect{@x = it}.out('created').in('created').filter{it != @x}.take.map(&:_id).sort
+      @graph.v(1).side_effect{@x = it}.out('created').in('created').filter{it != @x}.take.map(&:id).sort
 
     assert_equal %w(SideEffectPipe OutPipe(created) InPipe(created) FilterPipe), 
       @graph.v(1).side_effect{@x = it}.out('created').in('created').filter{it != @x}.to_a
@@ -76,21 +76,21 @@ class OnTheNatureOfPipesTest < Test::Unit::TestCase
       @graph.v(1).out('knows').name.filter{it[0] == 'v'}.take.to_a
 
     assert_equal %w(2),
-      @graph.v(1).out('knows').name.filter{it[0] == 'v'}.back(2).take.to_a.map(&:_id)
+      @graph.v(1).out('knows').name.filter{it[0] == 'v'}.back(2).take.to_a.map(&:id)
 
     assert_equal %w(OutPipe(knows) PropertyPipe(name) FilterPipe BackPipe),
       @graph.v(1).out('knows').name.filter{it[0] == 'v'}.back(2).to_a
 
     assert_equal %w(2 4),
-      @graph.v(1).out('knows').as('here').name.filter{it[0] == 'v'}.back('here').take.to_a.map(&:_id)
+      @graph.v(1).out('knows').as('here').name.filter{it[0] == 'v'}.back('here').take.to_a.map(&:id)
   end
 
   def test_loop
     assert_equal %w(3 5),
-      @graph.v(1).out.out.take.to_a.map(&:_id).sort
+      @graph.v(1).out.out.take.to_a.map(&:id).sort
 
     assert_equal %w(3 5),
-      @graph.v(1).out.loop(1){loops < 3}.take.to_a.map(&:_id).sort
+      @graph.v(1).out.loop(1){loops < 3}.take.to_a.map(&:id).sort
 
     assert_equal %w(lop ripple),
       @graph.v(1).out.loop(1){loops < 3}.name.take.sort

data/test/test_pipe.rb

@@ -0,0 +1,16 @@
+require 'test/unit'
+require 'red_grape'
+
+class PipeTest < Test::Unit::TestCase
+  def setup
+    @graph = RedGrape.load_graph 'data/graph-example-1.xml'
+  end
+  
+  def test_set_auto_take
+    assert !RedGrape::Pipe.auto_take
+    RedGrape::Pipe.set_auto_take
+    assert RedGrape::Pipe.auto_take
+    RedGrape::Pipe.set_auto_take false
+    assert !RedGrape::Pipe.auto_take
+  end
+end

data/test/test_pipe_base.rb

@@ -0,0 +1,17 @@
+require 'test/unit'
+require 'red_grape'
+
+class PipeBaseTest < Test::Unit::TestCase
+  def setup
+    @graph = RedGrape.load_graph 'data/graph-example-1.xml'
+  end
+  
+  def test_to_s
+    assert !RedGrape::Pipe.auto_take
+    assert(@graph.v(1).out.name.to_s =~ /#<RedGrape::Pipe::PropertyPipe:0x.*>/)
+    RedGrape::Pipe.set_auto_take
+    assert_equal %w(vadas josh lop).to_s, @graph.v(1).out.name.to_s
+    RedGrape::Pipe.set_auto_take false
+  end
+end
+

data/test/test_traversal_patterns.rb

@@ -14,5 +14,74 @@ class TraversalPatternsTest < Test::Unit::TestCase
 
   # https://github.com/tinkerpop/gremlin/wiki/Except-Retain-Pattern
   def test_except_retain_pattern
+    assert_equal %w(2 3 4), @graph.v(1).out.take.map(&:id).sort
+    assert_equal %w(3 5), @graph.v(1).out.out.take.map(&:id).sort
+    assert_equal %w(5), @graph.v(1).out.aggregate(:x).out.except(:x).take.map(&:id).sort
+    assert_equal %w(3), @graph.v(1).out.aggregate(:x).out.retain(:x).take.map(&:id).sort
+  end
+
+  # https://github.com/tinkerpop/gremlin/wiki/Flow-Rank-Pattern
+  def test_flow_rank_pattern
+    assert_equal %w(3 5), @graph.V('lang', 'java').map(&:id).sort
+    software = []
+    @graph.V('lang', 'java').fill(software).take
+    assert_equal %w(3 5), software.map(&:id).sort
+    assert_equal %w(marko josh peter josh), software._.in('created').name.take
+    assert_equal(
+      {'marko' => 1, 'josh' => 2, 'peter' => 1}, 
+      software._.in('created').name.groupCount.cap.take
+    )
+
+    m = {}
+    assert_equal %w(marko josh peter josh), software._.in('created').name.groupCount(m).take
+    assert_equal({'marko' => 1, 'josh' => 2, 'peter' => 1}, m)
+  end
+
+  # https://github.com/tinkerpop/gremlin/wiki/Path-Pattern
+  def test_path_pattern
+    assert_equal %w(josh lop vadas), @graph.v(1).out.name.take.sort
+
+    path = @graph.v(1).out.name.path.take
+    assert_equal 3, path.size
+    assert_equal 3, path.first.size
+    assert_equal '[[v[1], v[2], "vadas"], [v[1], v[4], "josh"], [v[1], v[3], "lop"]]', path.to_s
+
+    path = @graph.v(1).outE.inV.name.path.take
+    assert_equal '[[v[1], e[7][1-knows->2], v[2], "vadas"], [v[1], e[8][1-knows->4], v[4], "josh"], [v[1], e[9][1-created->3], v[3], "lop"]]', path.to_s
+
+    assert_equal(
+      [["marko", 0.5, "vadas"], ["marko", 1.0, "josh"], ["marko", 0.4, "lop"]].to_s, 
+      @graph.v(1).outE.inV.path(proc{it.name}, proc{it.weight}, proc{it.name}).take.to_s
+    )
+  end
+
+  def test_loop_pattern
+    g = RedGrape.load_graph 'data/graph-example-2.xml'
+    assert_equal 36, g.v(89).outE.inV.path.take.size
+    
+    #path = g.v(89).outE.inV.loop(2){it.loops < 3}.path.take #TODO: it.
+    path = g.v(89).outE.inV.loop(2){loops < 3}.path.take.first
+    assert_equal '[v[89], e[7006][89-followed_by->127], v[127], e[7786][127-sung_by->340], v[340]]', path.to_s
+    assert_equal RedGrape::Vertex, path[0].class
+    assert_equal RedGrape::Edge, path[1].class
+    assert_equal RedGrape::Vertex, path[2].class
+    assert_equal RedGrape::Edge, path[3].class
+    assert_equal RedGrape::Vertex, path[4].class
+
+    path = g.v(89).as('x').outE.inV.loop('x'){loops < 3}.path.take.first
+    assert_equal '[v[89], e[7006][89-followed_by->127], v[127], e[7786][127-sung_by->340], v[340]]', path.to_s
+    assert_equal RedGrape::Vertex, path[0].class
+    assert_equal RedGrape::Edge, path[1].class
+    assert_equal RedGrape::Vertex, path[2].class
+    assert_equal RedGrape::Edge, path[3].class
+    assert_equal RedGrape::Vertex, path[4].class
+
+    path = g.v(89).outE.inV.outE.inV.path.take.first
+    assert_equal '[v[89], e[7006][89-followed_by->127], v[127], e[7786][127-sung_by->340], v[340]]', path.to_s
+    assert_equal RedGrape::Vertex, path[0].class
+    assert_equal RedGrape::Edge, path[1].class
+    assert_equal RedGrape::Vertex, path[2].class
+    assert_equal RedGrape::Edge, path[3].class
+    assert_equal RedGrape::Vertex, path[4].class
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: red_grape
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
   prerelease: 
 platform: ruby
 authors:
@@ -9,11 +9,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-05-19 00:00:00.000000000 Z
+date: 2012-06-04 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rdoc
-  requirement: &70266408089740 !ruby/object:Gem::Requirement
+  requirement: &70172128259100 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -21,10 +21,10 @@ dependencies:
         version: '3.10'
   type: :development
   prerelease: false
-  version_requirements: *70266408089740
+  version_requirements: *70172128259100
 - !ruby/object:Gem::Dependency
   name: hoe
-  requirement: &70266408089300 !ruby/object:Gem::Requirement
+  requirement: &70172128258660 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -32,50 +32,65 @@ dependencies:
         version: '3.0'
   type: :development
   prerelease: false
-  version_requirements: *70266408089300
-description: RedGrape is an in-memory graph database written in ruby.
+  version_requirements: *70172128258660
+description: RedGrape is an in-memory graph database written in ruby. I made this
+  in order to learn how graph databases work so that please do not use this for serious
+  purposes.
 email:
 - andyjpn@gmail.com
 executables:
-- red_grape
+- redgrape
 extensions: []
 extra_rdoc_files:
-- History.txt
 - Manifest.txt
 - README.txt
+- History.txt
 files:
 - .autotest
-- History.txt
 - Manifest.txt
-- README.txt
 - Rakefile
-- bin/red_grape
+- README.txt
+- History.txt
+- bin/redgrape
 - data/graph-example-1.xml
+- data/graph-example-2.xml
+- lib/ext/array_ext.rb
+- lib/ext/object_ext.rb
+- lib/red_grape.rb
+- lib/red_grape/vertex.rb
 - lib/red_grape/edge.rb
+- lib/red_grape/element.rb
 - lib/red_grape/graph.rb
 - lib/red_grape/path_group.rb
+- lib/red_grape/pipe/aggregate_pipe.rb
 - lib/red_grape/pipe/as_pipe.rb
 - lib/red_grape/pipe/back_pipe.rb
 - lib/red_grape/pipe/base.rb
+- lib/red_grape/pipe/cap_pipe.rb
 - lib/red_grape/pipe/context.rb
+- lib/red_grape/pipe/except_pipe.rb
+- lib/red_grape/pipe/fill_pipe.rb
 - lib/red_grape/pipe/filter_pipe.rb
+- lib/red_grape/pipe/group_count_pipe.rb
+- lib/red_grape/pipe/has_pipe.rb
 - lib/red_grape/pipe/if_then_else_pipe.rb
 - lib/red_grape/pipe/in_pipe.rb
+- lib/red_grape/pipe/in_v_pipe.rb
 - lib/red_grape/pipe/loop_pipe.rb
+- lib/red_grape/pipe/out_e_pipe.rb
 - lib/red_grape/pipe/out_pipe.rb
 - lib/red_grape/pipe/paths_pipe.rb
 - lib/red_grape/pipe/property_pipe.rb
+- lib/red_grape/pipe/retain_pipe.rb
 - lib/red_grape/pipe/side_effect_pipe.rb
 - lib/red_grape/pipe/transform_pipe.rb
-- lib/red_grape/propertied_object.rb
 - lib/red_grape/property_description.rb
-- lib/red_grape/vertex.rb
-- lib/red_grape/vertex_group.rb
-- lib/red_grape.rb
-- test/test_on_the_nature_of_pipes.rb
-- test/test_red_grape.rb
+- lib/red_grape/serializer/graphml_serializer.rb
+- test/test_element.rb
 - test/test_graph.rb
-- test/test_propertied_object.rb
+- test/test_on_the_nature_of_pipes.rb
+- test/test_pipe.rb
+- test/test_pipe_base.rb
 - test/test_traversal_patterns.rb
 - test/test_vertex.rb
 - .gemtest
@@ -104,11 +119,12 @@ rubyforge_project: red_grape
 rubygems_version: 1.8.10
 signing_key: 
 specification_version: 3
-summary: RedGrape is an in-memory graph database written in ruby.
+summary: RedGrape is an in-memory graph database written in ruby
 test_files:
+- test/test_element.rb
 - test/test_graph.rb
 - test/test_on_the_nature_of_pipes.rb
-- test/test_propertied_object.rb
-- test/test_red_grape.rb
+- test/test_pipe.rb
+- test/test_pipe_base.rb
 - test/test_traversal_patterns.rb
 - test/test_vertex.rb

data/bin/red_grape

@@ -1,3 +0,0 @@
-#!/usr/bin/env ruby
-
-abort "you need to write me"

data/lib/red_grape/vertex_group.rb

@@ -1,72 +0,0 @@
-require 'red_grape/vertex'
-
-#TODO delegate to array
-module RedGrape
-  class VertexGroup < Vertex
-    def initialize(group=[])
-      @group = group
-    end
-
-    def _group
-      @group
-    end
-
-    def pass_through(pipe, context) 
-      @group.map! do |v|
-        pipe.pass v, context
-      end
-      @group.reject! do |v|
-        v.nil? or (v.respond_to?(:empty?) and v.empty?) # TODO
-      end
-      @group.map! do |v|
-        v.is_a?(self.class) ? v._group : v
-      end
-      #@group.flatten!
-      flatten_group!
-      @group.all? {|e| e.is_a? self.class} ? self : @group
-    end
-
-    def flatten_group
-      ret = []
-      @group.each do |v|
-        case v
-        when Array
-          ret += v.flatten
-        when self.class
-          ret += v._group.flatten_group
-        else
-          ret << v
-        end
-      end
-      ret
-    end
-
-    def flatten_group!
-      @group = flatten_group
-    end
-
-    def size
-      @group.size
-    end
-
-    def map(&block)
-      @group.map(&block)
-    end
-
-    def sort(&block)
-      @group.sort
-    end
-
-    def empty?
-      @group.empty?
-    end
-
-    def to_a
-      @group.dup.map{|e| e.is_a?(self.class) ? e.to_a : e}
-    end
-
-    def to_s
-      "[#{@group.map(&:to_s).join ', '}]"
-    end
-  end
-end

data/test/test_red_grape.rb

@@ -1,8 +0,0 @@
-require "test/unit"
-require "red_grape"
-
-class TestRedGrape < Test::Unit::TestCase
-  def test_sanity
-    #flunk "write tests or I will kneecap you"
-  end
-end