red_grape 0.0.8 → 0.0.9

data/lib/ext/array_ext.rb

@@ -3,8 +3,7 @@ class Array
     loops = context.loops
     map! do |e| 
       context.loops = loops
-      #pipe.pass e._, context # TODO
-      pipe.pass e, context # TODO
+      pipe.pass e, context
     end
     context.loops = loops
     normalize_for_graph

data/lib/red_grape/pipe/base.rb

@@ -23,7 +23,7 @@ module RedGrape
     end
 
     class Base
-      attr_accessor :opts, :prev, :next, :value
+      attr_accessor :opts, :prev, :next, :value, :it
 
       def initialize(prev, *opts, &block)
         @prev = prev
@@ -56,7 +56,6 @@ module RedGrape
 
       def take(context=Context.new)
         if first?
-          #context = Context.new
           val = @prev.pass_through self, context
           if context.aggregating?
             context.resume_from_aggregating
@@ -87,6 +86,11 @@ module RedGrape
         end
       end
 
+      def pipe_eval(params={}, &block)
+        params.each {|k, v| self.send "#{k}=", v}
+        instance_eval(&block)
+      end
+
       def to_s
         Pipe.auto_take ? take.to_s : super
       end

data/lib/red_grape/pipe/context.rb

@@ -76,7 +76,7 @@ module RedGrape
       end
 
       def resume_from_grouping
-        obj, pipe = *@grouping_items.first # TODO: is '.first' ok?
+        obj, pipe = *@grouping_items.first # TODO: '.first' is used to get next_pipe.
         if pipe
           push_history obj do |ctx|
             obj.pass_through(pipe, ctx)

data/lib/red_grape/pipe/copy_split_pipe.rb

@@ -9,7 +9,7 @@ module RedGrape
       end
 
       def pass(obj, context)
-        #pipelines = self.opts
+        #pipelines = self.opts.map do |pipeline|
         pipelines = @opts2.map do |pipeline| # TODO: opts2??
           pipe = pipeline.first_pipe
           pipe.prev = obj

data/lib/red_grape/pipe/group_count_pipe.rb

@@ -5,7 +5,11 @@ module RedGrape
     class GroupCountPipe < Pipe::Base
       def pass(obj, context)
         if self.opts.empty?
+          #context.group({obj => 1}, self.next)
           context.group obj, self.next
+        elsif self.opts.first.is_a? Proc
+          #context.group({pipe_eval(it:obj, &self.opts.first) => 1}, self.next)
+          context.group pipe_eval(it:obj, &self.opts.first), self.next
         else
           self.opts.first[obj] ||= 0
           self.opts.first[obj] += 1

data/lib/red_grape/tools/irg.rb

@@ -55,7 +55,7 @@ Subcommands:
       def start(port=nil, &block)
         Kernel.module_eval %Q{
           def redgrape?(key=nil)
-            RedGrape::IRG::Help.redgrape? key
+            RedGrape::Tools::IRG::Help.redgrape? key
           end
           alias rg? redgrape?
         }

data/lib/red_grape.rb

@@ -11,8 +11,10 @@ require 'red_grape/pipe/except_pipe'
 require 'red_grape/pipe/exhaust_merge_pipe'
 require 'red_grape/pipe/fill_pipe'
 require 'red_grape/pipe/filter_pipe'
+require 'red_grape/pipe/group_by_pipe'
 require 'red_grape/pipe/group_count_pipe'
 require 'red_grape/pipe/has_pipe'
+require 'red_grape/pipe/has_not_pipe'
 require 'red_grape/pipe/if_then_else_pipe'
 require 'red_grape/pipe/in_pipe'
 require 'red_grape/pipe/in_e_pipe'
@@ -31,6 +33,8 @@ require 'red_grape/pipe/e_pipe'
 require 'red_grape/graph'
 
 module RedGrape
+  VERSION = "0.0.9"
+
   module_function
   def set_auto_take(val=true)
     Pipe.set_auto_take val

data/red_grape.gemspec

@@ -1,6 +1,7 @@
 # -*- encoding: utf-8 -*-
 $:.push File.expand_path("../lib", __FILE__)
-require "red_grape/version"
+#require "red_grape/version"
+require "red_grape"
 
 Gem::Specification.new do |s|
   s.name        = "red_grape"

data/test/test_traversal_patterns.rb

@@ -3,28 +3,28 @@ require 'red_grape'
 
 class TraversalPatternsTest < Test::Unit::TestCase
   def setup
-    @graph = RedGrape.load_graph 'data/graph-example-1.xml'
+    @g1 = RedGrape.load_graph 'data/graph-example-1.xml'
   end
 
   # https://github.com/tinkerpop/gremlin/wiki/Backtrack-Pattern
   def test_backtrack_pattern
-    assert_equal [29], @graph.V.out('knows').has('age', :gt, 30).back(2).age.take
-    assert_equal [29], @graph.V.as('x').outE('knows').inV.has('age', :gt, 30).back('x').age.take
+    assert_equal [29], @g1.V.out('knows').has('age', :gt, 30).back(2).age.take
+    assert_equal [29], @g1.V.as('x').outE('knows').inV.has('age', :gt, 30).back('x').age.take
   end
 
   # 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
+    assert_equal %w(2 3 4), @g1.v(1).out.take.map(&:id).sort
+    assert_equal %w(3 5), @g1.v(1).out.out.take.map(&:id).sort
+    assert_equal %w(5), @g1.v(1).out.aggregate(:x).out.except(:x).take.map(&:id).sort
+    assert_equal %w(3), @g1.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').take.map(&:id).sort
+    assert_equal %w(3 5), @g1.V('lang', 'java').take.map(&:id).sort
     software = []
-    @graph.V('lang', 'java').fill(software).take
+    @g1.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(
@@ -39,7 +39,7 @@ class TraversalPatternsTest < Test::Unit::TestCase
 
   # https://github.com/tinkerpop/gremlin/wiki/Path-Pattern
   def test_path_pattern
-    v1 = @graph.vertex(1)
+    v1 = @g1.vertex(1)
 
     assert_equal %w(josh lop vadas), v1.out.name.take.sort
 
@@ -58,9 +58,9 @@ class TraversalPatternsTest < Test::Unit::TestCase
   end
 
   def test_loop_pattern
-    g = RedGrape.load_graph 'data/graph-example-2.xml'
-    v89 = g.vertex 89
-    assert_equal 36, g.v(89).outE.inV.path.take.size
+    @g2 ||= RedGrape.load_graph 'data/graph-example-2.xml'
+    v89 = @g2.vertex 89
+    assert_equal 36, v89.outE.inV.path.take.size
     
     path = v89.outE.inV.loop(2){it.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
@@ -86,15 +86,48 @@ class TraversalPatternsTest < Test::Unit::TestCase
     assert_equal RedGrape::Edge, path[3].class
     assert_equal RedGrape::Vertex, path[4].class
 
-    #assert_equal 70307, v89.out.loop(1, proc{it.loops < 4}).take.size #=> OK
-    #assert_equal 71972, v89.out.loop(1, proc{it.loops < 4}, proc{true}).take.size #=> 70307
-    #assert_equal 582, v89.out.loop(1, proc{it.loops < 4}, proc{it.object.id == '89'}).take.size #=> 564
+    #assert_equal(
+    #  70307, 
+    #  v89.out.loop(1, proc{it.loops < 4}).take.size
+    #) #=> OK
+
+    #assert_equal(
+    #  71972, 
+    #  v89.out.loop(1, proc{it.loops < 4}, proc{true}).take.size
+    #) #=> 70307
+
+    #assert_equal(
+    #  582, 
+    #  v89.out.loop(1, proc{it.loops < 4}, proc{it.object.id == '89'}).take.size 
+    #) #=> 564
   end
 
   # https://github.com/tinkerpop/gremlin/wiki/Split-Merge-Pattern
-  def test_split_marge
-    v1 = @graph.vertex 1
-    #assert_equal ['ripple', 27, 'lop', 32], v1.out('knows').copy_split(_.out('created').name, _.age).fair_merge.take # TODO: not yet
-    assert_equal [27, 'ripple', 'lop', 32], v1.out('knows').copy_split(_.out('created').name, _.age).exhaust_merge.take
+  def test_split_marge_pattern
+    v1 = @g1.vertex 1
+
+    #assert_equal(
+    #  ['ripple', 27, 'lop', 32], 
+    #  v1.out('knows').copy_split(_.out('created').name, _.age).fair_merge.take
+    #) # TODO: not yet
+
+    assert_equal(
+      [27, 'ripple', 'lop', 32], 
+      v1.out('knows').copy_split(_.out('created').name, _.age).exhaust_merge.take
+    )
+  end
+
+  def test_map_reduce_pattern
+    @g2 ||= RedGrape.load_graph 'data/graph-example-2.xml'
+    assert_equal(
+      {'cover'=>313, 'original'=>184}, 
+      @g2.V.has_not('song_type', nil).group_count(proc{it.song_type}).cap.take
+    )
+=begin
+    assert_equal(
+      {},
+      @g2.V.has_not('song_type', nil).group_by(proc{it.song_type}, proc{it}).cap.take
+    )
+=end
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: red_grape
 version: !ruby/object:Gem::Version
-  version: 0.0.8
+  version: 0.0.9
   prerelease: 
 platform: ruby
 authors:
@@ -9,11 +9,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-06-14 00:00:00.000000000 Z
+date: 2012-06-15 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: nokogiri
-  requirement: &70196102597160 !ruby/object:Gem::Requirement
+  requirement: &70205221723480 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -21,7 +21,7 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70196102597160
+  version_requirements: *70205221723480
 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 any
   serious purpose.
@@ -33,7 +33,6 @@ executables:
 extensions: []
 extra_rdoc_files: []
 files:
-- .autotest
 - .gitignore
 - Gemfile
 - README.md

data/.autotest

@@ -1,23 +0,0 @@
-# -*- ruby -*-
-
-require 'autotest/restart'
-
-# Autotest.add_hook :initialize do |at|
-#   at.extra_files << "../some/external/dependency.rb"
-#
-#   at.libs << ":../some/external"
-#
-#   at.add_exception 'vendor'
-#
-#   at.add_mapping(/dependency.rb/) do |f, _|
-#     at.files_matching(/test_.*rb$/)
-#   end
-#
-#   %w(TestA TestB).each do |klass|
-#     at.extra_class_map[klass] = "test/test_misc.rb"
-#   end
-# end
-
-# Autotest.add_hook :run_command do |at|
-#   system "rake build"
-# end