pacer 2.0.12-java → 2.0.13-java

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c1d6ed458658599f541aebf48b0858211c9c5a12
-  data.tar.gz: e8da00bad64ae64ee08e59ed07640b4ba61a8851
+  metadata.gz: 13555fbf36509b247945a23559f60d2b5eddb0e4
+  data.tar.gz: 258b4dd295d67b91dfbb8aa29969b7bef809fb2b
 SHA512:
-  metadata.gz: a6ba6daeb5f72cbafbfe17664c1188089e9a939194c3b5810ebbf38851a473e21b7bf9a95df25215671ce38deca8dd543adfc4334ec70f6dc502a652e13ae606
-  data.tar.gz: b27450c26b112b401a905ef1b5a889b213c5166615440eb7c1b931bb909891e6972102470d803306c102d67c18cab19008a7fe4c0cbdad69635738f9458a72ef
+  metadata.gz: 7ed67f63063e560b02926a116fcace7dd285d7522d2f8165ccc659b34df9a66756c6bb31013e37a540844781a58fad4ebb6a2eb99dbec68ab772ed9d75e341a2
+  data.tar.gz: d1b69243930b7906702a5c67f5b2359b2dbf9f3b61bcf26c68a3b8bfe9b2cf51ab0a060277c9a13faee0efc5732279e9f70ba15a647e384f021ada7603bf2bdf

data/README.md

@@ -1,9 +1,9 @@
 # Pacer
-[![Coverage Status](https://img.shields.io/coveralls/pangloss/pacer.svg)](https://coveralls.io/r/pangloss/pacer) [![Build Status](https://travis-ci.org/pangloss/pacer.svg)](https://travis-ci.org/pangloss/pacer)  
+[![Coverage Status](https://img.shields.io/coveralls/pangloss/pacer.svg)](https://coveralls.io/r/pangloss/pacer) [![Build Status](https://travis-ci.org/pangloss/pacer.svg)](https://travis-ci.org/pangloss/pacer)  [![Code Climate](https://codeclimate.com/github/pangloss/pacer/badges/gpa.svg)](https://codeclimate.com/github/pangloss/pacer)
 
 Pacer is a JRuby library that enables very expressive graph traversals.
 
-It currently supports all of the major graph databases including [OrientDB][http://orientdb.com], [Neo4j](http://neo4j.org)
+It currently supports all of the major graph databases including [OrientDB](http://orientdb.com), [Neo4j](http://neo4j.org)
 and [Dex](http://www.sparsity-technologies.com/dex) thanks to the
 [Tinkerpop](http://tinkerpop.com) graphdb stack. Plus there's a very
 convenient in-memory graph called TinkerGraph which is part of
@@ -25,7 +25,7 @@ Pacer has a [google group](http://groups.google.com/group/pacer-users?lnk=gcimv)
 Check out the [wiki](https://github.com/pangloss/pacer/wiki) for detailed explanations of many of Pacer's features. Please contribute to it or open issues against it if there is anything missing that you want to see.
 
 Pacer is also documented with a comprehensive RSpec test suite and with a
-thorough YARD documentation. [Dig in!](http://rubydoc.info/github/pangloss/pacer/develop/frames)
+thorough YARD documentation. [Dig in!](http://www.rubydoc.info/github/pangloss/pacer/master)
 
 If you like, you can also use the documentation locally via
 

data/ext/pom.xml

@@ -72,5 +72,8 @@
       <version>4.11</version>
     </dependency>
   </dependencies>
+  <properties>
+  	<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
+  </properties>
 </project>
 

data/ext/src/main/java/com/xnlogic/pacer/pipes/ExpandablePipe.java

@@ -2,6 +2,9 @@ package com.xnlogic.pacer.pipes;
 
 import com.tinkerpop.pipes.AbstractPipe;
 import com.tinkerpop.pipes.Pipe;
+
+import java.util.Iterator;
+import java.util.NoSuchElementException;
 import java.util.Queue;
 import java.util.LinkedList;
 import java.util.List;
@@ -12,14 +15,21 @@ public class ExpandablePipe<T> extends AbstractPipe<T, T> {
     private Object metadata;
     private Object nextMetadata;
 
-    private List path;
-    private List nextPath;
+    private List<Object> path;
+    private List<Object> nextPath;
     
     public ExpandablePipe() {
         this.queue = new LinkedList<EPTriple>();
+        
+        // By default, initialize this pipe with an empty iterator
+        setStarts(new Iterator<T>() {
+			public boolean hasNext() {return false;}
+			public T next() {throw new NoSuchElementException();}
+			public void remove() {}
+		});
     }
 
-    public void add(T element, Object metadata, List path) {
+    public void add(T element, Object metadata, List<Object> path) {
         this.queue.add(new EPTriple(element, metadata, path));
     }
 
@@ -48,15 +58,16 @@ public class ExpandablePipe<T> extends AbstractPipe<T, T> {
         return toReturn;
     }
 
-    protected T processNextStart() {
+    @SuppressWarnings("unchecked")
+	protected T processNextStart() {
         if (this.queue.isEmpty()) {
             this.nextMetadata = null;
             T r = this.starts.next();
 
             if (this.pathEnabled && this.starts instanceof Pipe) {
-                this.nextPath = ((Pipe)this.starts).getCurrentPath();
+                this.nextPath = ((Pipe<T, T>)this.starts).getCurrentPath();
             } else {
-                this.nextPath = new ArrayList();
+                this.nextPath = new ArrayList<Object>();
             }
             return r;
         } else {
@@ -67,8 +78,8 @@ public class ExpandablePipe<T> extends AbstractPipe<T, T> {
         }
     }
 
-    public List getPathToHere() {
-        List path = new ArrayList();
+    public List<Object> getPathToHere() {
+        List<Object> path = new ArrayList<Object>();
 
         if (this.path != null) {
             for (Object p : this.path) {
@@ -82,9 +93,9 @@ public class ExpandablePipe<T> extends AbstractPipe<T, T> {
     private class EPTriple {
         public T element;
         public Object metadata;
-        public List path;
+        public List<Object> path;
 
-        public EPTriple(T element, Object metadata, List path) {
+        public EPTriple(T element, Object metadata, List<Object> path) {
             this.element = element;
             this.metadata = metadata;
             this.path = path;

data/ext/src/main/java/com/xnlogic/pacer/pipes/IdCollectionFilterPipe.java

@@ -9,19 +9,20 @@ import com.tinkerpop.blueprints.Element;
 import com.tinkerpop.pipes.AbstractPipe;
 
 public class IdCollectionFilterPipe<E extends Element> extends AbstractPipe<E, E> {
-    private Set ids;
+    private Set<Object> ids;
     private boolean containsIn;
     
     // TODO: Consider making this a derived exception.  Also, this constructor is the reverse of the Ruby one. Is this ok?
     // Also also, is an Object array the way to go?  Can we nail down the type further?
-    public IdCollectionFilterPipe(final Collection ids, final Contains comparison) throws RuntimeException {
+    @SuppressWarnings("unchecked")
+	public IdCollectionFilterPipe(final Collection<?> ids, final Contains comparison) throws RuntimeException {
         super();
         if (ids instanceof Set) {
-            this.ids = (Set)ids;
+            this.ids = (Set<Object>)ids;
         } else if (ids == null) {
-            this.ids = new HashSet();
+            this.ids = new HashSet<Object>();
         } else {
-            this.ids = new HashSet();
+            this.ids = new HashSet<Object>();
             this.ids.addAll(ids);
         }
         if (comparison == Contains.IN)

data/ext/src/main/java/com/xnlogic/pacer/pipes/IsUniquePipe.java

@@ -1,15 +1,13 @@
 package com.xnlogic.pacer.pipes;
 
-import java.util.NoSuchElementException;
+import java.util.LinkedHashSet;
+import java.util.Set;
 
 import com.tinkerpop.pipes.AbstractPipe;
-import com.tinkerpop.pipes.filter.DuplicateFilterPipe;
-import com.tinkerpop.pipes.util.iterators.ExpandableIterator;
 
 public class IsUniquePipe<T> extends AbstractPipe<T, T> {
     private boolean unique;
-    private ExpandableIterator<T> expando;
-    private DuplicateFilterPipe<T> uniquePipe;
+    private Set<T> historySet;
   
     public IsUniquePipe() {
         super();
@@ -18,10 +16,8 @@ public class IsUniquePipe<T> extends AbstractPipe<T, T> {
 
     protected T processNextStart() {
         T value = this.starts.next();
-
         if (this.unique)
             this.checkUniqueness(value);
-        
         return value;
     }
 
@@ -39,20 +35,14 @@ public class IsUniquePipe<T> extends AbstractPipe<T, T> {
     }
     
     protected void checkUniqueness(T value) {
-        try {
-            this.expando.add(value);
-            this.uniquePipe.next();
-        } catch (NoSuchElementException nsee) {
+        if (!this.historySet.add(value)) {
             this.unique = false;
-            this.uniquePipe = null;
-            this.expando = null;
+            this.historySet = null;
         }
     }
 
     protected void prepareState() {
+        this.historySet = new LinkedHashSet<T>();
         this.unique = true;
-        this.expando = new ExpandableIterator<T>();
-        this.uniquePipe = new DuplicateFilterPipe<T>();
-        this.uniquePipe.setStarts(this.expando);
     }
 }

data/ext/src/test/java/com/xnlogic/pacer/pipes/ExpandablePipeTest.java

@@ -1,29 +1,26 @@
 package com.xnlogic.pacer.pipes;
 
-import static org.junit.Assert.*;
-import org.junit.Test;
-import java.util.Arrays;
+import static org.junit.Assert.assertNull;
+import static org.junit.Assert.assertTrue;
+
 import java.util.ArrayList;
-import com.tinkerpop.pipes.Pipe;
-import com.tinkerpop.pipes.IdentityPipe;
-import com.tinkerpop.pipes.AbstractPipe;
-import java.util.Iterator;
-import com.xnlogic.pacer.pipes.ExpandablePipe;
+
+import org.junit.Test;
 
 public class ExpandablePipeTest {
 
     @Test
     public void queueWithElementsTest() {
-        ExpandablePipe expandablePipe = new ExpandablePipe();
+        ExpandablePipe<String> expandablePipe = new ExpandablePipe<String>();
 
-        ArrayList input = new ArrayList();
+        ArrayList<String> input = new ArrayList<String>();
         input.add("X");
 
         expandablePipe.setStarts(input.iterator());
 
-        expandablePipe.add("a", 1, new ArrayList());
-        expandablePipe.add("b", 2, new ArrayList());
-        expandablePipe.add("c", 3, new ArrayList());
+        expandablePipe.add("a", 1, new ArrayList<Object>());
+        expandablePipe.add("b", 2, new ArrayList<Object>());
+        expandablePipe.add("c", 3, new ArrayList<Object>());
       
         Object result = expandablePipe.next();
         assertTrue(result.equals("a"));

data/ext/src/test/java/com/xnlogic/pacer/pipes/LabelCollectionFilterPipeTest.java

@@ -20,6 +20,7 @@ public class LabelCollectionFilterPipeTest {
     @Before
     public void setup() throws Exception {
         this.graph = new TinkerGraph();
+        createEdges();
     }
 
     @After
@@ -42,53 +43,67 @@ public class LabelCollectionFilterPipeTest {
         this.edges = Arrays.asList(e1, e2, e3, e4);
     }
     
-    @Test(expected=NoSuchElementException.class)
-    public void hasSomeMatchingEdgesTest() {
-        this.createEdges();
-        Collection<String> edgeLabels = Arrays.asList("edge2", "edge3");
+    
+    
+    private LabelCollectionFilterPipe initPipeAndConsumeSomeItems(Collection<String> edgeLabels, int itemsToConsume) {
         LabelCollectionFilterPipe labelCollectionFilterPipe = new LabelCollectionFilterPipe(edgeLabels);
-        
         labelCollectionFilterPipe.setStarts(this.edges);
-        Edge e = labelCollectionFilterPipe.next();
-        assertEquals("E2", e.getId());
         
-        e = labelCollectionFilterPipe.next();
-        assertEquals("E3", e.getId());
-
-        labelCollectionFilterPipe.next();
+        for (int i = 0; i < itemsToConsume; i++) {
+        	labelCollectionFilterPipe.next();
+		}
+        
+        return labelCollectionFilterPipe;
     }
     
     
+    
+    @Test
+    public void hasSomeMatchingEdgesTest() {
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(Arrays.asList("edge2", "edge3"), 0);
+        assertEquals("E2", pipe.next().getId());
+    }
+    
+    @Test
+    public void hasSomeMatchingEdgesTest2() {
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(Arrays.asList("edge2", "edge3"), 1);
+        assertEquals("E3", pipe.next().getId());
+    }
+    
     @Test(expected=NoSuchElementException.class)
+    public void hasSomeMatchingEdgesTest3() {
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(Arrays.asList("edge2", "edge3"), 2);
+        pipe.next();
+    }
+    
+    
+    @Test
     public void hasSomeMatchingEdgesWithSetTest() {
-        this.createEdges();
-        HashSet<String> edgeLabels = new HashSet<String>(Arrays.asList("edge2", "edge3"));
-        LabelCollectionFilterPipe labelCollectionFilterPipe = new LabelCollectionFilterPipe(edgeLabels);
-        
-        labelCollectionFilterPipe.setStarts(this.edges);
-        Edge e = labelCollectionFilterPipe.next();
-        assertEquals("E2", e.getId());
-        
-        e = labelCollectionFilterPipe.next();
-        assertEquals("E3", e.getId());
-
-        labelCollectionFilterPipe.next();
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(new HashSet<String>(Arrays.asList("edge2", "edge3")), 0);
+        assertEquals("E2", pipe.next().getId());
+    }
+    
+    @Test
+    public void hasSomeMatchingEdgesWithSetTest2() {
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(new HashSet<String>(Arrays.asList("edge2", "edge3")), 1);
+        assertEquals("E3", pipe.next().getId());
+    }
+    
+    @Test(expected=NoSuchElementException.class)
+    public void hasSomeMatchingEdgesWithSetTest3() {
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(new HashSet<String>(Arrays.asList("edge2", "edge3")), 2);
+    	pipe.next();
     }
 
     @Test(expected=NoSuchElementException.class)
     public void hasNoMatchingEdgesTest() {
-        this.createEdges();
-        Collection<String> edgeLabels = Arrays.asList("edge5", "edge6");
-        LabelCollectionFilterPipe labelCollectionFilterPipe = new LabelCollectionFilterPipe(edgeLabels);
-        
-        labelCollectionFilterPipe.setStarts(this.edges);
-        labelCollectionFilterPipe.next();
+    	LabelCollectionFilterPipe pipe = initPipeAndConsumeSomeItems(new HashSet<String>(Arrays.asList("edge5", "edge6")), 0);
+    	pipe.next();
     }
     
     
     @Test(expected=NoSuchElementException.class)
     public void noEdgesToMatchTest() {
-        this.createEdges();
         LabelCollectionFilterPipe labelCollectionFilterPipe = new LabelCollectionFilterPipe(null);
         
         labelCollectionFilterPipe.setStarts(this.edges);

data/lib/pacer/core/route.rb

@@ -656,7 +656,6 @@ HELP
           end
           expando = Pacer::Pipes::ExpandablePipe.new
           expando.enablePath true
-          expando.setStarts(Pacer::Pipes::EmptyIterator::INSTANCE)
           pipe.setStarts expando
           if preconfig
             pipe = preconfig.instance pipe, graph

data/lib/pacer/filter/java_loop_filter.rb

@@ -8,7 +8,7 @@ module Pacer
       def all(opts = {}, &block)
         if opts[:include_self]
           branch do |this|
-            this
+            this.identity
           end.branch do |this|
             this.java_loop(opts, &block)
           end.merge_exhaustive
@@ -24,6 +24,7 @@ module Pacer
       import com.tinkerpop.pipes.branch.LoopPipe
 
       attr_reader :looping_route
+      attr_accessor :include_self
 
       def looping_route=(route)
         if route.is_a? Proc

data/lib/pacer/filter/loop_filter.rb

@@ -212,8 +212,6 @@ HELP
 
       def expandable(route = nil)
         expando = Pacer::Pipes::ExpandablePipe.new
-        empty = java.util.ArrayList.new
-        expando.setStarts empty.iterator
         if route
           control_pipe = Pacer::Route.pipeline route
           control_pipe.setStarts expando

data/lib/pacer/filter/where_filter/node_visitor.rb

@@ -156,21 +156,6 @@ module Pacer
           end
         end
 
-        def visitAndNode(node)
-          a = comparable_pipe node.first_node.accept(self)
-          b = comparable_pipe node.second_node.accept(self)
-
-          if a.pipe == AndFilterPipe and b.pipe == AndFilterPipe
-            Pipe.new AndFilterPipe, *a.args, *b.args
-          elsif a.pipe == AndFilterPipe
-            Pipe.new AndFilterPipe, *a.args, b
-          elsif b.pipe == AndFilterPipe
-            Pipe.new AndFilterPipe, a, *b.args
-          else
-            Pipe.new AndFilterPipe, a, b
-          end
-        end
-
         def visitArrayNode(node)
           Value.new Value.new(node.child_nodes.map { |n| n.accept self }).values!
         end
@@ -246,19 +231,12 @@ module Pacer
           Value.new nil
         end
 
-        def visitOrNode(node)
-          a = comparable_pipe node.first_node.accept(self)
-          b = comparable_pipe node.second_node.accept(self)
+        def visitAndNode(node)
+          visit_and_or(AndFilterPipe, node)
+        end
 
-          if a.pipe == OrFilterPipe and b.pipe == OrFilterPipe
-            Pipe.new OrFilterPipe, *a.args, *b.args
-          elsif a.pipe == OrFilterPipe
-            Pipe.new OrFilterPipe, *a.args, b
-          elsif b.pipe == OrFilterPipe
-            Pipe.new OrFilterPipe, a, *b.args
-          else
-            Pipe.new OrFilterPipe, a, b
-          end
+        def visitOrNode(node)
+          visit_and_or(OrFilterPipe, node)
         end
 
         def visitRootNode(node)
@@ -308,6 +286,22 @@ module Pacer
         def visitZArrayNode(node)
           Value.new []
         end
+
+        private
+
+        def visit_and_or(pipe_class, node)
+          a = comparable_pipe node.first_node.accept(self)
+          b = comparable_pipe node.second_node.accept(self)
+          if a.pipe == pipe_class and b.pipe == pipe_class
+            Pipe.new pipe_class, *a.args, *b.args
+          elsif a.pipe == pipe_class
+            Pipe.new pipe_class, *a.args, b
+          elsif b.pipe == pipe_class
+            Pipe.new pipe_class, a, *b.args
+          else
+            Pipe.new pipe_class, a, b
+          end
+        end
       end
     end
   end

data/lib/pacer/graph/graph_transactions_mixin.rb

@@ -39,7 +39,13 @@ module Pacer
     #   nesting: false -- (default) raise an exception instead of starting a nested transaction
     def transaction(opts = {})
       commit, rollback = start_transaction! opts
+      tx_depth = nil
       begin
+        if Pacer.verbose == :very
+          tx_depth = threadlocal_graph_info[:dx_depth]
+          puts "--#{self.class.name} transaction #{ tx_depth } --> "
+          puts caller[0,3]
+        end
         r = yield commit, rollback
         commit.call(false)
         r
@@ -47,6 +53,7 @@ module Pacer
         rollback.call e.message
         raise
       ensure
+        puts "--#{self.class.name} #{ tx_depth } <-- " if Pacer.verbose == :very
         finish_transaction!
       end
     end
@@ -156,6 +163,8 @@ module Pacer
     end
 
     # NOTE pacer-orient reimplements this
+    # A better name for this would be "create_real_transaction", vs. the other finalizers which are all mock transactions in the default
+    # implementation.
     def base_tx_finalizers
       tx_id = threadlocal_graph_info[:tx_id] = rand
       commit = ->(reopen = true) do

data/lib/pacer/pipe/loop_pipe.rb

@@ -10,8 +10,6 @@ module Pacer::Pipes
       @wrapper = Pacer::Wrappers::WrapperSelector.build graph
 
       @expando = ExpandablePipe.new
-      empty = ArrayList.new
-      @expando.setStarts empty.iterator
       looping_pipe.setStarts(@expando)
       if control_block.arity < 0 or control_block.arity > 2
         @yield_paths = true
@@ -43,8 +41,7 @@ module Pacer::Pipes
 
     def processNextStart
       while true
-        has_next = looping_pipe.hasNext
-        if has_next
+        if looping_pipe.hasNext
           element = looping_pipe.next
           depth = (expando.metadata || 0) + 1
           self.next_path = looping_pipe.getCurrentPath if pathEnabled

data/lib/pacer/transform/intersect_sections.rb

@@ -1,18 +1,53 @@
 module Pacer
   module Routes
     module RouteOperations
+      # Set operations on sections like intersect_sections, difference_sections, etc. allow a route to do things like produce a stream of the set of
+      # employees who worked in multiple groups within a compnay, in a single traversal. To take that example further, imagine that we define the
+      # following traversals:
+      #
+      # company.groups.employees
+      #
+      # Give me all of the employees who have worked in every group in the company:
+      #
+      # company.groups.as(:g).employees.intersect_sections(:g)
+      #
+      # To understand how this works, we can think about the underlying structure of the graph, with a company with 2 groups which share employee e2
+      # and also have their own employees:
+      #
+      # (c)--->(g1)=--->(e1)
+      #   |         '-->(e2)
+      #   |             /
+      #   |        .---`
+      #   '---(g2)=--->(e3)
+      #
+      # The simple route company.groups.employees.paths will produce:
+      #   [c, g1, e1]
+      #   [c, g1, e2]
+      #   [c, g2, e2]
+      #   [c, g2, e3]
+      #
+      # By adding a section to the groups with groups.as(:section_name), we set up the mechanism allowing us to respond to the event when the group in
+      # the path changes in subsequent stages of the route. That is what .intersect_sections(:section_name) does. It can conceptually keep a set of
+      # employees from each group and then when the source data has been exhausted, it can do a set intersection on those groups, then use the
+      # resulting set as its source of resulting data.
+      #
       def intersect_sections(section)
         chain_route transform: Pacer::Transform::IntersectSections, section: section, operation: :intersection
       end
 
+      # See details on intersect_section. Emits only elements that are not in other sections.
       def difference_sections(section)
         chain_route transform: Pacer::Transform::IntersectSections, section: section, operation: :difference
       end
 
+      # See details on intersect_section. Emits only elements that are in the first section and not in any subsequent ones.
       def left_difference_sections(section)
         chain_route transform: Pacer::Transform::IntersectSections, section: section, operation: :left_difference
       end
 
+      # See details on intersect_section. Emits only elements that are in the last section and not in the right difference of the previous section.
+      #
+      # This one can be confusing if you've got more than 2 sections...
       def right_difference_sections(section)
         chain_route transform: Pacer::Transform::IntersectSections, section: section, operation: :right_difference
       end

data/lib/pacer/version.rb

@@ -1,5 +1,5 @@
 module Pacer
-  VERSION = "2.0.12"
+  VERSION = "2.0.13"
   # Clients may optionally define the following constants in the Pacer namespace:
   # - LOAD_JARS : set to false to manage jar loading in the client. Be sure to load the jars defined in JARFILES.
   # - LOCKJAR_LOCK_OPTS : set some options to be passed to LockJar.lock (ie. :lockfile, :download_artifacts, :local_repo)

data/lib/pacer/wrappers/vertex_wrapper.rb

@@ -102,7 +102,7 @@ module Pacer::Wrappers
     end
 
     def as?(*exts)
-      has_exts = extensions_missing(exts).all? do |ext|
+      extensions_missing(exts).all? do |ext|
         rc = if ext.respond_to? :route_conditions
                ext.route_conditions(graph)
              elsif ext.respond_to? :lookup

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: pacer
 version: !ruby/object:Gem::Version
-  version: 2.0.12
+  version: 2.0.13
 platform: java
 authors:
 - Darrick Wiebe
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2015-01-09 00:00:00.000000000 Z
+date: 2015-03-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: lock_jar