pacer 2.0.10.pre-java → 2.0.12-java

data/spec/pacer/filter/property_filter_spec.rb

@@ -79,11 +79,20 @@ Run.tg(:read_only) do
       subject { graph.v(Tackle::SimpleMixin, :name => 'pangloss') }
       its(:count) { should == 1 }
       its(:extensions) { should == [Tackle::SimpleMixin] }
+      it 'should produce an equivalent predecate' do
+        p = subject.filters.to_predicate
+        graph.v.to_a.select(&p).should == subject.to_a
+      end
     end
 
     context 'reversed params' do
       subject { graph.v.v(TP::Pangloss, Tackle::SimpleMixin) }
       its(:count) { should == 1 }
+      it 'should produce an equivalent predecate' do
+        pending 'does not work for self.route style.'
+        #p = subject.filters.to_predicate
+        #graph.v.to_a.select(&p).should == subject.to_a
+      end
     end
 
     context 'reversed params' do
@@ -109,6 +118,10 @@ Run.tg(:read_only) do
         it { should_not be_empty }
         its('first.class') { should_not == wrapper_class }
         its('first.class.extensions') { should == exts + [Pacer::Utils::TSort] }
+        it 'should produce an equivalent predecate' do
+          p = subject.filters.to_predicate
+          graph.v.to_a.select(&p).should == subject.to_a
+        end
       end
 
       describe 'v(wrapper_class, :name => "pacer")' do
@@ -119,6 +132,10 @@ Run.tg(:read_only) do
         its(:first) { should be_a wrapper_class }
         its(:filters) { should_not be_nil }
         its('filters.wrapper') { should == wrapper_class }
+        it 'should produce an equivalent predecate' do
+          p = subject.filters.to_predicate
+          graph.v.to_a.select(&p).should == subject.to_a
+        end
       end
     end
   end

data/spec/pacer/transform/path_spec.rb

@@ -15,6 +15,16 @@ describe Pacer::Transform::Path do
             [@g.vertex(5), @g.edge(12), @g.vertex(3)]]
     end
 
+    it 'should be the same as above with a detached route' do
+      p = @g.v.detach { |v| v.filter(:type => 'person').out_e.in_v(:type => 'project').paths }
+      p = p.build(@g, true)
+      Set[*@g.v.to_a.flat_map { |x| p.read x }.map(&:to_a)].should ==
+        Set[[@g.vertex(0), @g.edge(0), @g.vertex(1)],
+            [@g.vertex(5), @g.edge(1), @g.vertex(4)],
+            [@g.vertex(5), @g.edge(13), @g.vertex(2)],
+            [@g.vertex(5), @g.edge(12), @g.vertex(3)]]
+    end
+
     it 'should include all elements traversed' do
       @g.v.out_e.in_v.paths.each do |path|
         path[0].should be_a(Pacer::Wrappers::VertexWrapper)

data/spec/pacer/transform/sort_section_spec.rb

@@ -10,6 +10,13 @@ Run.tg :read_only do
       graph.v.section(:x).out.out.sort_section(:x) { |a, b| a[:name] <=> b[:name] }
     end
 
+    it 'should be sorted' do
+      sorted = graph.v.flat_map do |v|
+        v.out.out[:name].to_a.sort
+      end.to_a
+      by_custom[:name].to_a.should == sorted
+    end
+
     it 'should have the same elements' do
       by_custom.group_count.should == unsorted.group_count
     end
@@ -22,7 +29,7 @@ Run.tg :read_only do
 
     it 'should put groups into the correct order' do
       # depends on the order of graph.v(type: 'project') ...
-      route = graph.v(type: 'project').section(:proj).out[:name].custom_sort_section(:proj) { |a, b| a <=> b }
+      route = graph.v(type: 'project').section(:proj).out[:name].sort_section(:proj) { |a, b| a <=> b }
       route.to_a.should == %w[
         blueprints
         blueprints

metadata

@@ -1,45 +1,58 @@
 --- !ruby/object:Gem::Specification
 name: pacer
 version: !ruby/object:Gem::Version
-  version: 2.0.10.pre
+  version: 2.0.12
 platform: java
 authors:
 - Darrick Wiebe
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2014-12-31 00:00:00.000000000 Z
+date: 2015-01-09 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: lock_jar
-  requirement: !ruby/object:Gem::Requirement
+  version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
         version: 0.10.2
-  type: :runtime
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
+  requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
         version: 0.10.2
+  prerelease: false
+  type: :runtime
 - !ruby/object:Gem::Dependency
   name: xn_gem_release_tasks
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
-  type: :development
   prerelease: false
+  type: :development
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ~>
       - !ruby/object:Gem::Version
-        version: '0'
-description: Pacer defines composeable routes through a graph and then traverses them
-  very quickly.
+        version: 0.9.2
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.9.2
+  prerelease: false
+  type: :development
+description: Pacer defines composeable routes through a graph and then traverses them very quickly.
 email: dw@xnlogic.com
 executables: []
 extensions: []
@@ -66,7 +79,34 @@ files:
 - bin/yard
 - bin/yardoc
 - blog/2012-09-18-pacer-1.0.md
+- blog/detach_benchmarks.txt
+- ext/.classpath
+- ext/.gitignore
+- ext/.project
+- ext/pom.xml
+- ext/src/main/java/com/xnlogic/pacer/pipes/BlackboxPipeline.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/CollectionFilterPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/EdgesPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/ExpandablePipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/IdCollectionFilterPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/IsEmptyPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/IsUniquePipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/LabelCollectionFilterPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/LabelPrefixPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/NeverPipe.java
+- ext/src/main/java/com/xnlogic/pacer/pipes/VerticesPipe.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/BlackboxPipelineTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/CollectionFilterPipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/EdgesPipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/ExpandablePipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/IdCollectionFilterPipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/IsUniquePipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/LabelCollectionFilterPipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/LabelPrefixPipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/NeverPipeTest.java
+- ext/src/test/java/com/xnlogic/pacer/pipes/VerticesPipeTest.java
 - ideas.rb
+- lib/pacer-ext.jar
 - lib/pacer.rb
 - lib/pacer/blueprints/group_vertex.rb
 - lib/pacer/blueprints/payload_elements.rb
@@ -111,22 +151,12 @@ files:
 - lib/pacer/graph/simple_encoder.rb
 - lib/pacer/graph/yaml_encoder.rb
 - lib/pacer/loader.rb
-- lib/pacer/pipe/blackbox_pipeline.rb
 - lib/pacer/pipe/block_filter_pipe.rb
-- lib/pacer/pipe/collection_filter_pipe.rb
 - lib/pacer/pipe/cross_product_transform_pipe.rb
-- lib/pacer/pipe/edges_pipe.rb
 - lib/pacer/pipe/enumerable_pipe.rb
-- lib/pacer/pipe/expandable_pipe.rb
-- lib/pacer/pipe/id_collection_filter_pipe.rb
-- lib/pacer/pipe/is_empty_pipe.rb
-- lib/pacer/pipe/is_unique_pipe.rb
-- lib/pacer/pipe/label_collection_filter_pipe.rb
-- lib/pacer/pipe/label_prefix_pipe.rb
 - lib/pacer/pipe/loop_pipe.rb
 - lib/pacer/pipe/multi_pipe.rb
 - lib/pacer/pipe/naked_pipe.rb
-- lib/pacer/pipe/never_pipe.rb
 - lib/pacer/pipe/path_wrapping_pipe.rb
 - lib/pacer/pipe/process_pipe.rb
 - lib/pacer/pipe/property_comparison_pipe.rb
@@ -137,7 +167,6 @@ files:
 - lib/pacer/pipe/type_filter_pipe.rb
 - lib/pacer/pipe/unary_transform_pipe.rb
 - lib/pacer/pipe/unwrapping_pipe.rb
-- lib/pacer/pipe/vertices_pipe.rb
 - lib/pacer/pipe/visitor_pipe.rb
 - lib/pacer/pipe/wrapping_pipe.rb
 - lib/pacer/pipes.rb
@@ -256,24 +285,24 @@ homepage: http://github.com/pangloss/pacer
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>'
+  - - '>='
     - !ruby/object:Gem::Version
-      version: 1.3.1
+      version: '0'
 requirements: []
-rubyforge_project: 
+rubyforge_project:
 rubygems_version: 2.4.5
-signing_key: 
+signing_key:
 specification_version: 4
 summary: A very efficient and easy to use graph traversal engine.
 test_files:

data/lib/pacer/pipe/blackbox_pipeline.rb

@@ -1,55 +0,0 @@
-module Pacer::Pipes
-  # Same concept as the regular pipeline, but this one
-  # does not touch the intermediate pipes. They must be
-  # wired together before being passed in to this object.
-  # This allows me to build a pipeline in Pacer and then
-  # pass it on to a pipe like FutureFilterPipe that only
-  # knows how to act on a single pipe.
-  class BlackboxPipeline
-    include com.tinkerpop.pipes.Pipe
-
-    attr_reader :pathEnabled
-
-    def initialize(start_pipe, end_pipe)
-      @start_pipe = start_pipe
-      @end_pipe = end_pipe
-    end
-
-    def setStarts(pipe)
-      if pipe.respond_to? :iterator
-        @start_pipe.setStarts pipe.iterator
-      else
-        @start_pipe.setStarts pipe
-      end
-    end
-
-    def next
-      @end_pipe.next
-    end
-
-    def hasNext
-      @end_pipe.hasNext
-    end
-
-    def reset
-      @end_pipe.reset
-    end
-
-    def enablePath(b)
-      @pathEnabled = b
-      @end_pipe.enablePath b
-    end
-
-    def getCurrentPath
-      @end_pipe.getCurrentPath
-    end
-
-    def iterator
-      @end_pipe.iterator
-    end
-
-    def to_s
-      "[#{ @start_pipe }...#{ @end_pipe }]"
-    end
-  end
-end

data/lib/pacer/pipe/collection_filter_pipe.rb

@@ -1,12 +0,0 @@
-module Pacer
-  module Pipes
-    module Renamed
-      AbstractCollectionFilterPipe = com.tinkerpop.pipes.filter.CollectionFilterPipe
-    end
-
-    # This seemingly-useless class only exists because the class in Pipes
-    # is marked abstract despite being complete.
-    class CollectionFilterPipe < Renamed::AbstractCollectionFilterPipe
-    end
-  end
-end

data/lib/pacer/pipe/edges_pipe.rb

@@ -1,22 +0,0 @@
-module Pacer::Pipes
-  class EdgesPipe < AbstractPipe
-    attr_reader :starts
-
-    def setStarts(starts)
-      @starts = starts.first
-      self.iter = @starts.getEdges.iterator
-    end
-
-    def processNextStart
-      iter.next
-    end
-
-    def reset
-      self.iter = @starts.getEdges.iterator
-    end
-
-    private
-
-    attr_accessor :iter
-  end
-end

data/lib/pacer/pipe/expandable_pipe.rb

@@ -1,51 +0,0 @@
-module Pacer::Pipes
-  class ExpandablePipe < RubyPipe
-    def initialize
-      super()
-      @queue = java.util.LinkedList.new
-    end
-
-    def add(element, metadata = nil, path = nil)
-      @queue.add [element, metadata, path]
-    end
-
-    def metadata
-      @metadata
-    end
-
-    def next
-      super
-    ensure
-      @path = @next_path
-      @metadata = @next_metadata
-    end
-
-    protected
-
-    def processNextStart
-      if @queue.isEmpty
-        @next_metadata = nil
-        r = @starts.next
-        if pathEnabled and @starts.respond_to? :getCurrentPath
-          @next_path = @starts.getCurrentPath
-        else
-          @next_path = java.util.ArrayList.new
-        end
-        r
-      else
-        element, @next_metadata, @next_path = @queue.remove
-        element
-      end
-    end
-
-    def getPathToHere
-      path = java.util.ArrayList.new
-      if @path
-        @path.each do |e|
-          path.add e
-        end
-      end
-      path
-    end
-  end
-end

data/lib/pacer/pipe/id_collection_filter_pipe.rb

@@ -1,37 +0,0 @@
-module Pacer::Pipes
-  class IdCollectionFilterPipe < RubyPipe
-    import com.tinkerpop.blueprints.Contains
-    attr_reader :contains_in
-
-    def initialize(ids, comparison)
-      super()
-      @ids = Set[*ids]
-      if comparison == Contains::IN
-        @contains_in = true
-      elsif
-        comparison == Contains::NOT_IN
-        @contains_in = false
-      else
-        fail InternalError, "Unknown comparison type for ID collection filter"
-      end
-    end
-
-    def processNextStart
-      if contains_in
-        while true
-          element = @starts.next
-          if element and @ids.include? element.getId
-            return element
-          end
-        end
-      else
-        while true
-          element = @starts.next
-          if element and not @ids.include? element.getId
-            return element
-          end
-        end
-      end
-    end
-  end
-end

data/lib/pacer/pipe/is_empty_pipe.rb

@@ -1,23 +0,0 @@
-module Pacer::Pipes
-  class IsEmptyPipe < RubyPipe
-    def initialize
-      super
-      @raise = false
-    end
-
-    def processNextStart
-      raise EmptyPipe.instance if @raise
-      starts.next
-      @raise = true
-    rescue EmptyPipe, java.util.NoSuchElementException
-      true
-    else
-      raise EmptyPipe.instance
-    end
-
-    def reset
-      @raise = false
-      super()
-    end
-  end
-end

data/lib/pacer/pipe/is_unique_pipe.rb

@@ -1,51 +0,0 @@
-module Pacer::Pipes
-  class IsUniquePipe < RubyPipe
-    import java.util.ArrayList
-    import com.tinkerpop.pipes.sideeffect.SideEffectPipe
-    import com.tinkerpop.pipes.util.iterators.ExpandableIterator
-    import com.tinkerpop.pipes.filter.DuplicateFilterPipe
-
-    include SideEffectPipe
-
-    def initialize
-      super()
-      prepare_state
-    end
-
-    def processNextStart
-      value = starts.next
-      check_uniqueness value if @unique
-      value
-    end
-
-    def reset
-      super()
-      prepare_state
-    end
-
-    def unique?
-      @unique
-    end
-
-    def getSideEffect
-      @unique
-    end
-
-    protected
-
-    def check_uniqueness(value)
-      @expando.add value
-      @unique_pipe.next
-    rescue EmptyPipe, java.util.NoSuchElementException
-      @unique = false
-    end
-
-    def prepare_state
-      @unique = true
-      @expando = ExpandableIterator.new ArrayList.new.iterator
-      @unique_pipe = DuplicateFilterPipe.new
-      @unique_pipe.setStarts @expando
-    end
-
-  end
-end

data/lib/pacer/pipe/label_collection_filter_pipe.rb

@@ -1,15 +0,0 @@
-module Pacer::Pipes
-  class LabelCollectionFilterPipe < RubyPipe
-    def initialize(labels)
-      super()
-      @labels = Set[*labels.map(&:to_s)]
-    end
-
-    def processNextStart
-      while true
-        edge = @starts.next
-        return edge if edge and @labels.include? edge.getLabel
-      end
-    end
-  end
-end

data/lib/pacer/pipe/label_prefix_pipe.rb

@@ -1,15 +0,0 @@
-module Pacer::Pipes
-  class LabelPrefixPipe < RubyPipe
-    def initialize(prefix)
-      super()
-      @prefix = /^#{prefix}/
-    end
-
-    def processNextStart
-      while true
-        edge = @starts.next
-        return edge if edge.label =~ @prefix
-      end
-    end
-  end
-end

data/lib/pacer/pipe/never_pipe.rb

@@ -1,9 +0,0 @@
-module Pacer::Pipes
-  class NeverPipe < RubyPipe
-    protected
-
-    def processNextStart
-      raise EmptyPipe.instance
-    end
-  end
-end

data/lib/pacer/pipe/vertices_pipe.rb

@@ -1,22 +0,0 @@
-module Pacer::Pipes
-  class VerticesPipe < AbstractPipe
-    attr_reader :starts
-
-    def setStarts(starts)
-      @starts = starts.first
-      self.iter = @starts.getVertices.iterator
-    end
-
-    def processNextStart
-      iter.next
-    end
-
-    def reset
-      self.iter = @starts.getVertices.iterator
-    end
-
-    private
-
-    attr_accessor :iter
-  end
-end