red_grape 0.0.10 → 0.0.11

data/bin/redgrape

@@ -2,9 +2,9 @@
 $: << File.expand_path('../../lib', __FILE__)
 
 require 'optparse'
+require 'red_grape'
 require 'red_grape/tools/graph_store'
 require 'red_grape/tools/irg'
-require 'red_grape/version'
 
 # interprete options
 ::Version = RedGrape::VERSION

data/bin/trellis

@@ -2,8 +2,8 @@
 $: << File.expand_path('../../lib', __FILE__)
 
 require 'optparse'
+require 'red_grape'
 require 'red_grape/tools/graph_store'
-require 'red_grape/version'
 
 # interprete options
 ::Version = RedGrape::VERSION

data/lib/red_grape.rb

@@ -1,5 +1,5 @@
 module RedGrape
-  VERSION = '0.0.10'
+  VERSION = '0.0.11'
 end
 
 require 'ext/nil_class_ext'

data/test/test_on_the_nature_of_pipes.rb

@@ -65,7 +65,7 @@ class OnTheNatureOfPipesTest < Test::Unit::TestCase
   def test_if_then_else
     #assert_equal ['vadas', ['ripple', 'lop']], 
     assert_equal ['vadas', 'ripple', 'lop'], 
-      @graph.v(1).out('knows').if_then_else(proc{it.age < 30}, proc{it.name}, proc{it.out('created').name}).take.to_a
+      @graph.v(1).out('knows').if_then_else(_{it.age < 30}, _{it.name}, _{it.out('created').name}).take.to_a
   end
 
   def test_back

data/test/test_traversal_patterns.rb

@@ -53,7 +53,7 @@ class TraversalPatternsTest < Test::Unit::TestCase
 
     assert_equal(
       [["marko", 0.5, "vadas"], ["marko", 1.0, "josh"], ["marko", 0.4, "lop"]].to_s, 
-      v1.outE.inV.path(proc{it.name}, proc{it.weight}, proc{it.name}).take.to_s
+      v1.outE.inV.path(_{it.name}, _{it.weight}, _{it.name}).take.to_s
     )
   end
 
@@ -88,22 +88,22 @@ class TraversalPatternsTest < Test::Unit::TestCase
 
     #assert_equal(
     #  70307, 
-    #  v89.out.loop(1, proc{it.loops < 4}).take.size
+    #  v89.out.loop(1, _{it.loops < 4}).take.size
     #) #=> OK
 
     #assert_equal(
     #  71972, 
-    #  v89.out.loop(1, proc{it.loops < 4}, proc{true}).take.size
+    #  v89.out.loop(1, _{it.loops < 4}, _{true}).take.size
     #) #=> 70307
 
     #assert_equal(
     #  582, 
-    #  v89.out.loop(1, proc{it.loops < 4}, proc{it.object.id == '89'}).take.size 
+    #  v89.out.loop(1, _{it.loops < 4}, _{it.object.id == '89'}).take.size 
     #) #=> 564
   end
 
   # https://github.com/tinkerpop/gremlin/wiki/Split-Merge-Pattern
-  def test_split_marge_pattern
+  def test_split_merge_pattern
     v1 = @g1.vertex 1
 
     #assert_equal(
@@ -122,10 +122,10 @@ class TraversalPatternsTest < Test::Unit::TestCase
     @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
+      @g2.V.has_not('song_type', nil).group_count(_{it.song_type}).cap.take
     )
 
-    ret = @g2.V.has_not('song_type', nil).group_by(proc{it.song_type}, proc{it}).cap.take
+    ret = @g2.V.has_not('song_type', nil).group_by(_{it.song_type}, _{it}).cap.take
     assert_equal 2, ret.keys.size
     assert_equal 313, ret.values[0].size
     assert ret.values[0].all?{|e| e.is_a? RedGrape::Vertex}

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: red_grape
 version: !ruby/object:Gem::Version
-  version: 0.0.10
+  version: 0.0.11
   prerelease: 
 platform: ruby
 authors:
@@ -13,7 +13,7 @@ date: 2012-06-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: nokogiri
-  requirement: &70324009053140 !ruby/object:Gem::Requirement
+  requirement: &70365490452460 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -21,7 +21,7 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70324009053140
+  version_requirements: *70365490452460
 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.