red_grape 0.0.5 → 0.0.6

data/README.md

@@ -2,25 +2,25 @@
 
 * https://github.com/technohippy/red-grape
 
-## DESCRIPTION:
+## 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.
+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.
 
-## FEATURES/PROBLEMS:
+## Features/Problems:
 
 * REPL
 * load GraphML
 * construct a graph programmatically
 * traverse nodes and edges
 
-## SYNOPSIS:
+## Synopsis:
 
     g1 = RedGrape.load_graph 'data/graph-example-1.xml'
     g1.v(1).out('knows').filter{it.age < 30}.name.transform{it.size}.take
     # => [5]
 
     g2 = RedGrape.load_graph 'data/graph-example-2.xml'
-    g2.v(89).as('x').outE.inV.loop('x'){loops < 3}.path.take
+    g2.v(89).as('x').outE.inV.loop('x'){it.loops < 3}.path.take
     # => [[v[89], e[7006][89-followed_by->127], v[127], e[7786][127-sung_by->340], v[340]], [v[89], 
 
 ## REPL:
@@ -63,9 +63,9 @@ RedGrape is an in-memory graph database written in ruby. I made this in order to
 
 In REPL, the `take' method which invokes all pipes is automatically called.
 
-## CLIENT/SERVER:
+## Server/Client:
 
-### SERVER:
+### Server:
 
     $ ./bin/trellis
       +=================+
@@ -76,45 +76,45 @@ In REPL, the `take' method which invokes all pipes is automatically called.
     Start server: druby://localhost:28282
     [Ctrl+C to stop]
 
-### CLIENT:
+### Client:
 
     $ ./bin/redgrape 
              T
            oOOOo
             oOo
     -------- O --------
-    ruby-1.9.3-head :001 > store = RedGrape::GraphStore.open
+    ruby :001 > $store
      => #<RedGrape::GraphStore:0x007fb615137a90> 
-    ruby-1.9.3-head :002 > store.graphs
+    ruby :002 > $store.graphs
      => [:tinker] 
-    ruby-1.9.3-head :003 > g = store.graph :tinker
+    ruby :003 > g = $store.graph :tinker
      => redgrape[vertices:6 edges:6] 
-    ruby-1.9.3-head :004 > g.add_vertex 7
+    ruby :004 > g.add_vertex 7
      => redgrape[vertices:7 edges:6] 
-    ruby-1.9.3-head :005 > store.put_graph :tinker, g
+    ruby :005 > store.put_graph :tinker, g
      => redgrape[vertices:7 edges:6] 
 
 Changes on a graph are not committed until the put_graph method called.
 
-## REQUIREMENTS:
+## Requirements:
 
 * Nokogiri (http://nokogiri.org/)
 
-## DEVELOPERS:
+## Developers:
 
-After checking out the source, run:
+after checking out the source, run:
 
     $ rake newb
 
 This task will install any missing dependencies, run the tests/specs,
 and generate the RDoc.
 
-## REFERENCES:
+## References:
 
 * [Gremlin](https://github.com/tinkerpop/gremlin/wiki)
 * [Pipes](https://github.com/tinkerpop/pipes/wiki/)
 
-## LICENSE:
+## License:
 
 (The MIT License)
 

data/lib/red_grape/graph.rb

@@ -1,4 +1,3 @@
-require 'nokogiri'
 require 'red_grape/vertex'
 require 'red_grape/edge'
 require 'red_grape/property_description'
@@ -11,6 +10,7 @@ module RedGrape
         self.new.load filename
       end
 
+      # Returns the default graph which has 6 vertices and 6 edges.
       def create_tinker_graph
         self.new do |g|
           v1 = g.add_vertex 1, name:'marko', age:29
@@ -28,6 +28,7 @@ module RedGrape
         end
       end
 
+      # Returns the features as a hash
       def features
         {
           ignores_supplied_ids:false,
@@ -63,6 +64,9 @@ module RedGrape
 
     attr_accessor :serializer
       
+    # Returns a new instance
+    # _block_ :: a block which is given the instance as the first argument 
+    # to initialize it
     def initialize(&block)
       @serializer = Serializer::GraphMLSerializer.new self
       @vertices = {}
@@ -71,7 +75,7 @@ module RedGrape
       block.call self if block
     end
 
-    def items(type, *id)
+    def items(type, *id) # :nodoc:
       items = case type
         when :vertex, :vertices
           @vertices

data/lib/red_grape/pipe/context.rb

@@ -88,6 +88,12 @@ module RedGrape
 
       def eval(args={}, &block)
         args.each {|k, v| self.send "#{k}=", v}
+        if @it
+          # so aggressive way...
+          def @it.loops=(l); @loops = l end
+          def @it.loops; @loops end
+          @it.loops = @loops
+        end
         instance_eval(&block)
       end
     end

data/lib/red_grape/version.rb

@@ -1,3 +1,3 @@
 module RedGrape
-  VERSION = "0.0.5"
+  VERSION = "0.0.6"
 end

data/test/test_traversal_patterns.rb

@@ -59,8 +59,7 @@ class TraversalPatternsTest < Test::Unit::TestCase
     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
+    path = g.v(89).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
     assert_equal RedGrape::Vertex, path[0].class
     assert_equal RedGrape::Edge, path[1].class
@@ -68,7 +67,7 @@ class TraversalPatternsTest < Test::Unit::TestCase
     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
+    path = g.v(89).as('x').outE.inV.loop('x'){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
     assert_equal RedGrape::Vertex, path[0].class
     assert_equal RedGrape::Edge, path[1].class

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: red_grape
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
   prerelease: 
 platform: ruby
 authors:
@@ -9,11 +9,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-06-08 00:00:00.000000000 Z
+date: 2012-06-09 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: nokogiri
-  requirement: &70107699251780 !ruby/object:Gem::Requirement
+  requirement: &70169527487200 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -21,7 +21,7 @@ dependencies:
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *70107699251780
+  version_requirements: *70169527487200
 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.