@@ -399,7 +399,7 @@ class NodeMethods(node: GNode) extends AnyVal {
399399 out ++ in
400400
401401 /** follow the given IN and OUT edge(s) to their adjacent nodes */
402- @ Doc (" follow the given OUT and IN edge(s) to their adjacent nodes" )
402+ @ Doc (info = " follow the given OUT and IN edge(s) to their adjacent nodes" )
403403 def both (edgeLabel : String ): Iterator [GNode ] =
404404 out(edgeLabel) ++ in(edgeLabel)
405405
@@ -420,12 +420,12 @@ class NodeMethods(node: GNode) extends AnyVal {
420420 Accessors .getEdgesIn(node, edgeKind = edgeKind(edgeLabel))
421421
422422 /** follow _all_ OUT and IN edge(s) */
423- @ Doc (" follow all OUT and IN edge(s)" )
423+ @ Doc (info = " follow all OUT and IN edge(s)" )
424424 def bothE : Iterator [Edge ] =
425425 outE ++ inE
426426
427427 /** follow the given OUT and IN edge(s) */
428- @ Doc (" follow the given OUT and IN edge(s)" )
428+ @ Doc (info = " follow the given OUT and IN edge(s)" )
429429 def bothE (edgeLabel : String ): Iterator [Edge ] =
430430 outE(edgeLabel) ++ inE(edgeLabel)
431431
@@ -569,17 +569,17 @@ class NodeSteps[A <: GNode](traversal: Iterator[A]) extends AnyVal {
569569 traversal.flatMap(node => node.out ++ node.in)
570570
571571 /** follow the given OUT edge(s) to their adjacent nodes */
572- @ Doc (" follow the given OUT edge(s) to their adjacent nodes" )
572+ @ Doc (info = " follow the given OUT edge(s) to their adjacent nodes" )
573573 def out (edgeLabel : String ): Iterator [GNode ] =
574574 traversal.flatMap(_.out(edgeLabel))
575575
576576 /** follow the given IN edge(s) to their adjacent nodes */
577- @ Doc (" follow the given IN edge(s) to their adjacent nodes" )
577+ @ Doc (info = " follow the given IN edge(s) to their adjacent nodes" )
578578 def in (edgeLabel : String ): Iterator [GNode ] =
579579 traversal.flatMap(_.in(edgeLabel))
580580
581581 /** follow the given IN and OUT edge(s) to their adjacent nodes */
582- @ Doc (" follow the given OUT and IN edge(s) to their adjacent nodes" )
582+ @ Doc (info = " follow the given OUT and IN edge(s) to their adjacent nodes" )
583583 def both (edgeLabel : String ): Iterator [GNode ] =
584584 traversal.flatMap(node => node.out(edgeLabel) ++ node.in(edgeLabel))
585585
@@ -600,16 +600,16 @@ class NodeSteps[A <: GNode](traversal: Iterator[A]) extends AnyVal {
600600 traversal.flatMap(_.inE(edgeLabel))
601601
602602 /** follow _all_ IN and OUT edge(s) */
603- @ Doc (" follow all given OUT and IN edge(s)" )
603+ @ Doc (info = " follow all given OUT and IN edge(s)" )
604604 def bothE : Iterator [Edge ] =
605605 traversal.flatMap(node => node.outE ++ node.inE)
606606
607607 /** follow the given IN and OUT edge(s) */
608- @ Doc (" follow the given OUT and IN edge(s)" )
608+ @ Doc (info = " follow the given OUT and IN edge(s)" )
609609 def bothE (edgeLabel : String ): Iterator [Edge ] =
610610 traversal.flatMap(node => node.outE(edgeLabel) ++ node.inE(edgeLabel))
611611
612- @ Doc (" lookup a property value" )
612+ @ Doc (info = " lookup a property value" )
613613 def property [@ specialized T ](name : String ): Iterator [T ] =
614614 traversal.flatMap(_.propertyOption[T ](name))
615615
0 commit comments