summaryrefslogtreecommitdiff
path: root/test/scanners/ruby/example.expected.raydebug
diff options
context:
space:
mode:
Diffstat (limited to 'test/scanners/ruby/example.expected.raydebug')
-rw-r--r--test/scanners/ruby/example.expected.raydebug18
1 files changed, 9 insertions, 9 deletions
diff --git a/test/scanners/ruby/example.expected.raydebug b/test/scanners/ruby/example.expected.raydebug
index 492a67a..5a684e6 100644
--- a/test/scanners/ruby/example.expected.raydebug
+++ b/test/scanners/ruby/example.expected.raydebug
@@ -217,7 +217,7 @@ reserved(class) class(Set)
reserved(def) method(size)
instance_variable(@hash)operator(.)ident(size)
reserved(end)
- reserved(alias) ident(length) ident(size)
+ reserved(alias) method(length) method(size)
comment(# Returns true if the set contains no elements.)
reserved(def) method(empty?)
@@ -288,7 +288,7 @@ reserved(class) class(Set)
reserved(def) method(include?)operator(()ident(o)operator(\))
instance_variable(@hash)operator(.)ident(include?)operator(()ident(o)operator(\))
reserved(end)
- reserved(alias) ident(member?) ident(include?)
+ reserved(alias) method(member?) method(include?)
comment(# Returns true if the set is a superset of the given set.)
reserved(def) method(superset?)operator(()ident(set)operator(\))
@@ -331,7 +331,7 @@ reserved(class) class(Set)
instance_variable(@hash)operator([)ident(o)operator(]) operator(=) pre_constant(true)
pre_constant(self)
reserved(end)
- reserved(alias) operator(<<) ident(add)
+ reserved(alias) method(<<) method(add)
comment(# Adds the given object to the set and returns self. If the)
comment(# object is already in the set, returns nil.)
@@ -373,7 +373,7 @@ reserved(class) class(Set)
ident(each) operator({) operator(|)ident(o)operator(|) ident(set) operator(<<) reserved(yield)operator(()ident(o)operator(\)) operator(})
ident(replace)operator(()ident(set)operator(\))
reserved(end)
- reserved(alias) ident(map!) ident(collect!)
+ reserved(alias) method(map!) method(collect!)
comment(# Equivalent to Set#delete_if, but returns nil if no changes were)
comment(# made.)
@@ -410,8 +410,8 @@ reserved(class) class(Set)
ident(enum)operator(.)ident(is_a?)operator(()constant(Enumerable)operator(\)) reserved(or) ident(raise) constant(ArgumentError)operator(,) string<delimiter(")content(value must be enumerable)delimiter(")>
ident(dup)operator(.)ident(merge)operator(()ident(enum)operator(\))
reserved(end)
- reserved(alias) operator(+) operator(|) comment(##)
- reserved(alias) ident(union) operator(|) comment(##)
+ reserved(alias) method(+) method(|) comment(##)
+ reserved(alias) method(union) method(|) comment(##)
comment(# Returns a new set built by duplicating the set, removing every)
comment(# element that appears in the given enumerable object.)
@@ -419,7 +419,7 @@ reserved(class) class(Set)
ident(enum)operator(.)ident(is_a?)operator(()constant(Enumerable)operator(\)) reserved(or) ident(raise) constant(ArgumentError)operator(,) string<delimiter(")content(value must be enumerable)delimiter(")>
ident(dup)operator(.)ident(subtract)operator(()ident(enum)operator(\))
reserved(end)
- reserved(alias) ident(difference) operator(-) comment(##)
+ reserved(alias) method(difference) method(-) comment(##)
comment(# Returns a new array containing elements common to the set and the)
comment(# given enumerable object.)
@@ -429,7 +429,7 @@ reserved(class) class(Set)
ident(enum)operator(.)ident(each) operator({) operator(|)ident(o)operator(|) ident(n)operator(.)ident(add)operator(()ident(o)operator(\)) reserved(if) ident(include?)operator(()ident(o)operator(\)) operator(})
ident(n)
reserved(end)
- reserved(alias) ident(intersection) operator(&) comment(##)
+ reserved(alias) method(intersection) method(&) comment(##)
comment(# Returns a new array containing elements exclusive between the set)
comment(# and the given enumerable object. (set ^ enum\) is equivalent to)
@@ -508,7 +508,7 @@ reserved(class) class(Set)
reserved(class) operator(<<) class(dig) operator(=) operator({)operator(}) comment(# :nodoc:)
ident(include) constant(TSort)
- reserved(alias) ident(tsort_each_node) ident(each_key)
+ reserved(alias) method(tsort_each_node) method(each_key)
reserved(def) method(tsort_each_child)operator(()ident(node)operator(,) operator(&)ident(block)operator(\))
ident(fetch)operator(()ident(node)operator(\))operator(.)ident(each)operator(()operator(&)ident(block)operator(\))
reserved(end)