wewoo 0.1.5

data/spec/wewoo/edge_spec.rb

@@ -0,0 +1,43 @@
+require 'spec_helper'
+
+module Wewoo
+  describe Vertex do
+    before :all do
+      @g = Graph.new(:test_graph)
+      build_test_graph( @g )
+    end
+
+    context 'equality' do
+      it 'validates two egdes are the same' do
+        expect( @v1.outE(:love) == @v1.outE(:love) ).to eq true
+      end
+
+      it 'validates two egdes are different' do
+        e1, e2 = @v1.outE(:friend).first, @v1.outE(:friend).last
+
+        expect( e1 == e2 ).to eq false
+      end
+
+      it 'validates anything against null' do
+        expect( @v1.outE(:love) == nil ).to be false
+      end
+    end
+
+    context 'vertices' do
+      it "fetches edge head correctly" do
+        expect( @e1.in ).to eq @v2
+      end
+
+      it "fetches edge tail correctly" do
+        expect( @e1.out ).to eq @v1
+      end
+
+      it 'deletes an edge correctly' do
+        before = @g.E.count()
+        @e1.destroy
+
+        expect( @g.E.count() ).to eq before-1
+      end
+    end
+  end
+end

data/spec/wewoo/graph_spec.rb

@@ -0,0 +1,265 @@
+require 'spec_helper'
+
+module Wewoo
+  describe Graph do
+    before :all do
+      @g = Graph.new( :test_graph )
+      build_test_graph( @g )
+    end
+
+    context "Graphs" do
+      it "show all available graphs" do
+        expect( Graph.available_graphs ).to_not be_empty
+      end
+
+      it 'opens a graph correctly' do
+        expect( @g.V ).to have(4).items
+        expect( @g.E ).to have(5).items
+      end
+
+      it 'errors out if a graph does not exist' do
+        expect{ Graph.new( :test_yo ) }.to raise_error
+      end
+    end
+
+    context 'Query' do
+      it 'retrieves frienships correctly' do
+        edges = @g.query( "g.v(#{@v1.id}).outE('friend')" )
+
+        expect( edges ).to    have(2).items
+        expect( edges ).to eq [@e1, @e2]
+      end
+
+      it 'retrieves friends correctly' do
+        vertices = @g.query( "g.v(#{@v1.id}).out('friend')" )
+
+        expect( vertices ).to    have(2).items
+        expect( vertices ).to eq [@v2, @v3]
+      end
+
+      it 'retrieves friends of friends correctly' do
+        vertices = @g.query( "g.v(#{@v1.id}).out('friend').out('friend')" )
+
+        expect( vertices ).to    have(2).items
+        expect( vertices ).to eq [@v3, @v4]
+      end
+
+      it "paginates results correctly" do
+        vertices = @g.query( "g.V", page:1, per_page:2 )
+
+        expect( vertices ).to have(2).items
+      end
+    end
+
+    context 'Vertex' do
+      it 'checks for vertex existance correctly' do
+        v1 = @g.find_first_vertex( :gid, 1 )
+
+        expect( @g.vertex_exists?( v1.id ) ).to eq true
+        expect( @g.vertex_exists?( 1234 ) ).to  eq false
+      end
+
+      it 'creates a vertex correctly' do
+        v  = @g.add_vertex( name:'test', age:20, gid: 100 )
+        vg = @g.find_vertex( v.id )
+
+        expect( vg ).to_not        be_nil
+        expect( vg.props.age ).to  eq 20
+        expect( vg.props.name ).to eq 'test'
+      end
+
+      it 'updates a vertex correctly' do
+        v       = @g.find_first_vertex( :gid, 100 )
+        v_prime = @g.update_vertex( v.id, age: 30, blee:'testola', weight: 160.5 )
+
+        expect( v_prime ).to_not          be_nil
+        expect( v_prime.props.weight ).to eq 160.5
+        expect( v_prime.props.name ).to   eq 'test'
+        expect( v_prime.props.blee ).to   eq 'testola'
+        expect( v_prime.gid ).to          eq 100
+        expect( v_prime.props.age ).to    eq 30
+      end
+
+      context 'mine types' do
+        it 'coerve floats correctly' do
+          v = @g.add_vertex( weight: 18.5 )
+
+          expect( v.props.weight ).to eq 18.5
+        end
+
+        it 'coerce integer correctly' do
+          v = @g.add_vertex( age: 30 )
+
+          expect( v.props.age ).to eq 30
+        end
+
+        it 'coerce boolean correctly' do
+          v = @g.add_vertex( dead: false )
+
+          expect( v.props.dead ).to eq false
+        end
+
+        it 'coerce array correctly' do
+          v = @g.add_vertex( blees: [1,2,3] )
+
+          expect( v.props.blees ).to eq [1,2,3]
+        end
+
+        it 'coerce hash correctly' do
+          hash = {a:1,b:2,c:3}
+          v    = @g.add_vertex( blees: hash )
+
+          expect( v.properties.blees ).to eq hash
+        end
+
+        it 'coerce complex types correctly' do
+          hash = {a:[1,2,3],b:2.0,c:3}
+          v    = @g.add_vertex( blees: hash )
+
+          expect( v.properties.blees ).to eq hash
+        end
+      end
+
+      context 'finders' do
+        it 'finds a vertex by id correctly' do
+          expect( @g.find_vertex( @v1.id ) ).to eq @v1
+        end
+
+        it 'finds a vertex by gid correctly' do
+          expect( @g.find_vertex_by_gid( @v1.gid ) ).to eq @v1
+        end
+
+        it 'finds the first vertex matching a prop' do
+          expect( @g.find_first_vertex( :name, 'fred' ) ).to eq @v1
+        end
+
+        it 'finds the first vertex matching a an int prop' do
+          expect( @g.find_first_vertex( :age, 50 ) ).to eq @v4
+        end
+
+        it 'finds the first vertex matching a a float prop' do
+          expect( @g.find_first_vertex( :rating, 5.5 ) ).to eq @v4
+        end
+
+        it 'finds the first vertex matching a boolean prop' do
+          expect( @g.find_first_vertex( :busy, false ) ).to eq @v2
+        end
+      end
+    end
+    #   context 'deletes' do
+    #     it 'deletes a node correctly' do
+    #       v1 = g.add_vertex( age:18 )
+    #       expect( g.vertices ).to have(1).item
+    #
+    #       g.remove_vertex( v1.id )
+    #
+    #       expect( g.V ).to be_empty
+    #     end
+    #   end
+    #
+    #   context 'connected' do
+    #     let!(:v2) { g.add_vertex( name:'blee', age:50 ) }
+    #     let!(:e1) { g.add_edge( v1.id, v2.id, :friend ) }
+    #
+    #     it 'deletes an origin node correctly' do
+    #       g.remove_vertex( v1.id )
+    #
+    #       expect( g.E ).to be_empty
+    #       expect( g.V ).to have(1).item
+    #     end
+    #
+    #     it 'deletes an destination node correctly' do
+    #       g.remove_vertex( v2.id )
+    #
+    #       expect( g.E ).to be_empty
+    #       expect( g.V ).to have(1).item
+    #     end
+    #   end
+    # end
+
+    context 'Edge' do
+      it 'checks for edge existance correctly' do
+        expect( @g.edge_exists?( @e1.id ) ).to eq true
+        expect( @g.edge_exists?( 1234 ) ).to  eq false
+      end
+
+      it 'creates an edge correctly' do
+        e6   = @g.add_edge( @v1, @v2, :test, city: "Denver", state: "CO")
+        edge = @g.find_edge( e6.id )
+
+        expect( edge.label ).to       eq 'test'
+        expect( edge.from_id ).to     eq @v1.id
+        expect( edge.to_id ).to       eq @v2.id
+        expect( edge.props.city ).to  eq 'Denver'
+        expect( edge.props.state ).to eq 'CO'
+      end
+
+      it 'updates an edge correctly' do
+        e       = @g.find_first_edge( :state, "CO" )
+        e_prime = @g.update_edge( e.id, name: :testola, approved: true )
+
+        expect( e_prime ).to_not            be_nil
+        expect( e_prime.props.name ).to     eq 'testola'
+        expect( e_prime.props.approved ).to eq true
+        expect( e_prime.props.city ).to     eq "Denver"
+      end
+
+      it 'deletes an edge correctly' do
+        e = @g.find_first_edge( :city, "Denver" )
+        @g.remove_edge( e.id )
+
+        lambda{ @g.e( e.id ) }.should raise_error Graph::GraphElementNotFoundError
+      end
+
+      context 'find' do
+        it 'find an edge by id correctly' do
+         edge = @g.e( @e1.id )
+
+         expect( edge ).to eq @e1
+        end
+
+        it 'find first edge by property correctly' do
+         edge = @g.find_first_edge( :rating, 2.5 )
+
+         expect( edge ).to eq @e2
+        end
+
+        it 'find an edge by property correctly' do
+         edges = @g.find_edges( :rating, 5.5 )
+
+         expect( edges ).to have(2).items
+        end
+      end
+    end
+
+    context 'load/save' do
+      it 'saves a graph correctly' do
+        expect( @g.save( '/tmp/test_graph.xml' ) ).to       be_true
+        expect( File.exists?( '/tmp/test_graph.xml' ) ).to  be_true
+      end
+
+      it 'create sub dirs if necessary before save' do
+        expect( @g.save( '/tmp/graphs/test_graph.xml' ) ).to      be_true
+        expect( File.exists?( '/tmp/graphs/test_graph.xml' ) ).to be_true
+      end
+
+      it 'loads a graph correctly' do
+        b_count = @g.V.count
+
+        expect( @g.load( '/tmp/test_graph.xml') ).to be_true
+        expect( @g.V.count ).to eq b_count
+      end
+
+      it 'appends a graph correctly' do
+        b_count = @g.V.count
+
+        expect( @g.load( '/tmp/test_graph.xml', append:true) ).to be_true
+        expect( @g.V.count ).to eq 2*b_count
+      end
+
+      it 'raise exeption if not graphs' do
+        expect{ @g.load( '/tmp/test_graphico.xml')}.to raise_error
+      end
+    end
+  end
+end

data/spec/wewoo/gremlin_spec.rb

@@ -0,0 +1,434 @@
+require 'spec_helper'
+require 'support/graph_sets'
+
+module Wewoo
+  describe 'Gremlin' do
+    before :all do
+      @g = Graph.new( :test_graph )
+      build_sample_graph( @g )
+    end
+
+    context 'Transforms' do
+      it 'Both' do
+        q = "g.v(#{@v4.id}).both('knows','created')"
+
+        expect( @g.q( q ) ).to eq [@v1,@v5,@v3]
+      end
+
+      it 'BothE' do
+        q = "g.v(#{@v4.id}).bothE('knows','created')"
+
+        expect( @g.q( q ) ).to eq [@e8,@e10,@e11]
+      end
+
+      it 'BothV' do
+        q = "g.e('#{@e12.id}').bothV"
+
+        expect( @g.q( q ) ).to eq [@v6,@v3]
+      end
+
+      it 'Cap' do
+        q = "g.V('lang', 'java').in('created').name.groupCount.cap"
+
+        expect( @g.q( q ) ).to eq( {"marko"=>1, "peter"=>1, "josh"=>2} )
+      end
+
+      it 'E' do
+        q = "g.E.weight"
+
+        expect( @g.q( q ).sort ).to eq [0.2, 0.4, 0.4, 0.5, 1, 1]
+      end
+
+      it 'Gather' do
+        q = "g.v(#{@v1.id}).out.gather"
+
+        expect( @g.q( q ) ).to eq [@v2,@v4,@v3]
+      end
+
+      it "Id" do
+        q = "g.v(#{@v1.id}).id"
+
+        expect( @g.q( q ) ).to eq [@v1.id]
+      end
+
+      it "In" do
+        q = "g.v(#{@v3.id}).in('created')"
+
+        expect( @g.q( q ) ).to eq [@v4, @v1, @v6]
+      end
+
+      it "InE" do
+        q = "g.v(#{@v3.id}).inE('created')"
+
+        expect( @g.q( q ) ).to eq [@e11, @e9, @e12]
+      end
+
+      it "InV" do
+        q = "g.e('#{@e12.id}').inV"
+
+        expect( @g.q( q ) ).to eq [@v3]
+      end
+
+      it "Out" do
+        q = "g.v(#{@v6.id}).out('created')"
+
+        expect( @g.q( q ) ).to eq [@v3]
+      end
+
+      it "OutE" do
+        q = "g.v(#{@v6.id}).outE('created')"
+
+        expect( @g.q( q ) ).to eq [@e12]
+      end
+
+      it "OutV" do
+        q = "g.e('#{@e12.id}').outV"
+
+        expect( @g.q( q ) ).to eq [@v6]
+      end
+
+      it "Key" do
+        q = "g.v(#{@v3.id}).getProperty('name')"
+
+        expect( @g.q( q ) ).to eq ['lop']
+      end
+
+      it "Label" do
+        q = "g.e('#{@e7.id}').label"
+
+        expect( @g.q( q ) ).to eq ['knows']
+      end
+
+      # pending 'LinkBoth'
+
+      it 'Map' do
+        q = "g.v('#{@v1.id}').map"
+
+        expect( @g.q( q ) ).to eq( {'age' => 29, 'name' => 'marko', 'gid' => @v1.id} )
+      end
+
+      it 'Memoize' do
+        q = ["m=[:]"]
+        q << "g.V.out.out.memoize(1)"
+        q << "g.V.out.out.memoize(1,m).name"
+
+        expect( @g.q( q.join(';') ) ).to eq( ['ripple', 'lop'] )
+      end
+
+      it "Order" do
+        q = "g.V.name.order{it.b <=> it.a}"
+
+        expect( @g.q( q ) ).to eq %w[vadas ripple peter marko lop josh]
+      end
+
+      it "GroupCount" do
+        q = "g.V.both.groupCount.cap.orderMap(T.decr)"
+
+        expect( @g.q( q ).sort{ |a,b| a.id <=> b.id } ).to eq [@v1, @v2, @v3, @v4, @v5, @v6]
+      end
+
+      it "Path" do
+        q = "g.v(#{@v1.id}).out.path"
+        expect( @g.q( q ) ).to eq [[@v1, @v2], [@v1, @v4], [@v1, @v3]]
+
+        q = "g.v(#{@v1.id}).out.path{it.name}"
+        expect( @g.q( q ) ).to eq [["marko", "vadas"], ["marko", "josh"], ["marko", "lop"]]
+
+        q = "g.v(#{@v1.id}).out.path{it.id}{it.name}"
+        expect( @g.q( q ) ).to eq [[@v1.id, "vadas"], [@v1.id, "josh"], [@v1.id, "lop"]]
+      end
+
+      it "Scatter" do
+        q = "g.v(#{@v1.id}).out.gather{it[1..2]}"
+        expect( @g.q( q ) ).to eq [@v4,@v3]
+
+        q = "g.v(#{@v1.id}).out.gather{it[1..2]}.scatter"
+        expect( @g.q( q ) ).to eq [@v4,@v3]
+      end
+
+      # BOZO!! WTF x:fred ??
+      pending "Select", "Don't know to implement this??" do
+        q = "g.v(#{@v1.id}).as('x').out('knows').as('y').select"
+        expect( @g.q( q ) ).to eq [@v4,@v3]
+      end
+
+      it "Shuffle" do
+        q = "g.v(#{@v1.id}).out.shuffle"
+        expect( @g.q( q ) ).to have(3).items
+      end
+
+      it "Transform" do
+        q = "g.E.has('weight', T.gt, 0.5f).outV.age.transform{it+2}"
+        expect( @g.q( q ).sort ).to eq [31,34]
+
+        q = "g.E.has('weight',T.gt,0.5d).outV.transform{[name:it.name,age:it.age]}"
+        expect( @g.q(q).sort{ |a,b| a['name'] <=> b['name']} ).to eq(
+        [{'name'=>'josh','age'=>32}, {'name'=>'marko','age'=>29}] )
+      end
+
+      it "V" do
+        q = "g.V"
+        expect( @g.q( q ) ).to have(6).items
+
+        q = "g.V( 'name', 'marko')"
+        expect( @g.q( q ) ).to eq [@v1]
+
+        q = "g.V( 'name', 'marko').name"
+        expect( @g.q( q ) ).to eq [@v1.props.name]
+      end
+
+      it 'fetch vertex names correctly' do
+        script = 'g.V.both.groupCount.cap.orderMap(T.decr)[0..1].name'
+
+        expect( @g.q(script) ).to have(2).items
+      end
+    end
+
+    context "Filter" do
+      it '[]' do
+        script = 'g.V[0].name'
+        expect( @g.q(script) ).to have(1).item
+      end
+
+      it '[..]' do
+        script = 'g.V[0..2].name'
+        expect( @g.q(script) ).to have(3).items
+      end
+
+      it 'And' do
+        script = 'g.V.and(_().both("knows"), _().both("created"))'
+        expect( @g.q(script).sort ).to eq [@v1,@v4]
+      end
+
+
+      it 'Back' do
+        script = "g.V.as('x').outE('knows').inV.has('age', T.gt, 30).name.back('x')"
+        expect( @g.q(script) ).to eq [@v1]
+      end
+
+      it 'Dedup' do
+        script = "g.v(#{@v1.id}).out.in.dedup()"
+        expect( @g.q(script) ).to eq [@v1, @v4, @v6]
+      end
+
+      it 'Except' do
+        q = ["x = [g.v(#{@v1.id}), g.v(#{@v2.id}), g.v(#{@v3.id})]"]
+        q << "g.V.except(x)"
+        expect( @g.q(q.join(";")).sort ).to eq [@v4, @v5, @v6]
+      end
+
+      it 'Filter' do
+        script = "g.V.filter{it.age > 29}.name"
+        expect( @g.q( script ).sort ).to eq %w[josh peter]
+      end
+
+      it 'Has' do
+        script = "g.v(#{@v1.id}).outE.has('weight', T.gte, 0.5f).weight"
+        expect( @g.q( script ).sort ).to eq [0.5, 1.0]
+      end
+
+      # BOZO !! No support for full filter ??
+      it 'HasNot' do
+        script = "g.v(#{@v1.id}).outE.hasNot('name', 'marko').weight"
+        expect( @g.q( script ).sort ).to eq [0.4, 0.5, 1.0]
+      end
+
+      it 'Interval' do
+        script = "g.E.interval('weight', 0.3f, 0.9f).weight"
+        expect( @g.q( script ).sort ).to eq [0.4, 0.4, 0.5]
+      end
+
+      it 'Or' do
+        script = "g.V.or(_().both('knows'), _().both('created'))"
+        expect( @g.q( script ).sort ).to eq [@v1, @v2, @v3, @v4, @v5, @v6]
+      end
+
+      it 'Random' do
+        script = "g.V.random(0.9)"
+        expect( @g.q( script ) ).to_not be_empty
+      end
+
+      it 'Retain' do
+        q = ["x = [g.v(#{@v1.id}), g.v(#{@v2.id}), g.v(#{@v3.id})]"]
+        q << 'g.V.retain(x)'
+        expect( @g.q( q.join(';') ).sort ).to eq [@v1, @v2, @v3]
+      end
+
+      it 'SimplePath' do
+        script = "g.v(#{@v1.id}).out.in.simplePath"
+        expect( @g.q( script ).sort ).to eq [@v4, @v6]
+      end
+    end
+
+    context 'Side Effect' do
+      it 'Aggregate' do
+        script = "x=[];g.v(#{@v1.id}).out.aggregate(x)"
+        expect( @g.q( script ).sort ).to eq [@v2,@v3,@v4]
+      end
+
+      it 'As' do
+        script = "g.V.as('x').outE('knows').inV.has('age', T.gt, 30).back('x').age"
+        expect( @g.q( script ).sort ).to eq [29]
+      end
+
+      it 'GroupBy' do
+        exp = {
+          @v1 => [@v2, @v4, @v3],
+          @v2 => [],
+          @v3 => [],
+          @v4 => [@v5,@v3],
+          @v5 => [],
+          @v6 => [@v3]
+        }
+        @g.q( "g.V.groupBy{it}{it.out}.cap" ).each_pair { |k,v|
+          expect( v ).to eq exp[k]
+        }
+      end
+
+      it 'GroupCount' do
+        exp = {
+          @v2 => 1,
+          @v4 => 1,
+          @v3 => 3,
+          @v5 => 1
+        }
+        q = "x=[:];g.V.out.groupCount(x).cap"
+        @g.q( q ).each_pair { |k,v| expect( v ).to eq exp[k] }
+      end
+
+      it 'Optional' do
+        script = "g.V.as('x').outE('knows').inV.has('age', T.gt, 30).optional('x')"
+        expect( @g.q( script ).sort ).to eq [@v1,@v2,@v3,@v4,@v5,@v6]
+      end
+
+      pending 'SideEffect' do
+        q = ["y = 1000"]
+        q << "g.V.has('age').sideEffect{y=y>it.age?it.age:y}"
+        q << "y"
+        expect( @g.q( q.join(";") ) ).to eq 27
+      end
+
+      it 'Store' do
+        q = "x=[];g.v(#{@v1.id}).out.store(x).next();x"
+        expect( @g.q( q ) ).to eq [@v2]
+      end
+
+      pending 'Table' do
+        q = "t= new Table();g.V.as('x').name.as('name').back('x').age.as('age').table(t);t"
+        expect( @g.q( q ) ).to eq [@v2]
+      end
+
+      pending 'Tree'
+    end
+
+    context 'Branch' do
+      it 'CopySplit'do
+        q = "g.v(#{@v1.id}).out('knows').copySplit(_().out('created').name, _().age)"
+        expect( @g.q( q ) ).to eq [@v2,@v4]
+      end
+
+      it 'ExhaustMerge' do
+        q = "g.v(#{@v1.id}).out('knows').copySplit(_().out('created').name, _().age).exhaustMerge"
+        expect( @g.q( q ) ).to eq ['ripple', 'lop', 27, 32]
+      end
+
+      it 'FairMerge' do
+        q = "g.v(#{@v1.id}).out('knows').copySplit(_().out('created').name, _().age).fairMerge"
+        expect( @g.q( q ) ).to eq ['ripple', 27, 'lop', 32]
+      end
+
+      it 'IfThenElse' do
+        q = "g.v(#{@v1.id}).out.ifThenElse{it.name=='josh'}{it.age}{it.name}"
+        expect( @g.q( q ) ).to eq ['vadas', 32, 'lop']
+      end
+
+      it 'Loop' do
+        q = "g.v(#{@v1.id}).out.loop(1){it.loops<3}{it.object.name=='josh'} "
+        expect( @g.q( q ) ).to eq [@v4]
+      end
+    end
+
+    context 'Methods' do
+      it 'Keys' do
+        q = "g.v(#{@v1.id}).keys()"
+        expect( @g.q( q ) ).to eq %w[name age gid]
+      end
+
+      it 'Remove' do
+        expect( @g.q( "g.E.has('label','test').remove()" ) ).to be true
+      end
+
+      it 'Values' do
+        q = "g.v(#{@v1.id}).values()"
+        expect( @g.q( q ) ).to eq ['marko', 29, @v1.id]
+      end
+
+      it 'AddEdge' do
+        q = "v1=g.v(#{@v1.id});v2=g.v(#{@v2.id});g.addEdge(v1, v2, 'test')"
+        expect( @g.q(q) ).to have(1).item
+      end
+
+      it 'RemoveEdge' do
+        q = "g.removeEdge( g.E.has('label', 'test').next() )"
+        expect( @g.q(q) ).to eq true
+      end
+
+      it 'AddVertex' do
+        q = "g.addVertex( name: 'Fred' )"
+        expect( @g.q(q) ).to have(1).item
+      end
+
+      it 'RemoveVertex' do
+        q = "g.removeVertex( g.V.has('name', 'Fred').next() )"
+        expect( @g.q(q) ).to eq true
+      end
+
+      pending 'idx'
+      pending 'CreateIndex' do
+        q = "g.createIndex('test_index', Vertex.class)"
+        expect( @g.q(q) ).to eq []
+      end
+
+      it 'e' do
+        q = "g.e('#{@e9.id}', '#{@e10.id}', '#{@e11.id}')"
+        expect( @g.q( q ) ).to eq [@e9,@e10,@e11]
+      end
+
+      it 'v' do
+        q = "g.v(#{@v1.id}, #{@v2.id}, #{@v3.id})"
+        expect( @g.q( q ) ).to eq [@v1,@v2,@v3]
+      end
+
+      it 'EnablePath' do
+        q = "g.v(#{@v1.id}).out.loop(1){it.loops < 3}{it.path.contains(g.v(#{@v4.id}))}.enablePath()"
+        expect( @g.q(q) ).to eq [@v5,@v3]
+      end
+
+      it 'Fill' do
+        q = "x=[];g.v(#{@v1.id}).out.fill(x)"
+        expect( @g.q(q) ).to eq [@v2,@v4,@v3]
+      end
+
+      it 'Iterate' do
+        q = "g.V.sideEffect{it.name='same'}.iterate();g.V.name"
+        expect( @g.q(q) ).to eq %w[same]*6
+      end
+
+      it 'Next' do
+        q = "g.V.sideEffect{it.name='same'}.next(3);g.V.name"
+        expect( @g.q(q) ).to eq %w[same]*6
+      end
+
+      it 'Save' do
+        @g.q( "g.saveGraphML('/tmp/graph_test.xml')" )
+        expect( File.exists?( '/tmp/graph_test.xml') ).to eq true
+      end
+
+      it 'Load' do
+        @g.clear
+        @g.q( "g.loadGraphML('/tmp/graph_test.xml')")
+        expect( @g.V.count ).to eq 6
+      end
+    end
+  end
+end