Remove unused parameter names.

rakudo · Apr 7, 2014 · 45863ee · 45863ee
1 parent 3e72f70
commit 45863ee
Show file tree

Hide file tree

Showing 3 changed files with 28 additions and 28 deletions.
diff --git a/src/core/Any.pm b/src/core/Any.pm
@@ -268,13 +268,13 @@ Metamodel::ClassHOW.exclude_parent(Any);
 
 # builtin ops
 proto infix:<===>($?, $?) is pure { * }
-multi infix:<===>($a?)    { Bool::True }
+multi infix:<===>($?)    { Bool::True }
 multi infix:<===>($a, $b) {
     nqp::p6bool(nqp::iseq_s(nqp::unbox_s($a.WHICH), nqp::unbox_s($b.WHICH)))
 }
 
 proto infix:<before>($, $?)  is pure { * }
-multi infix:<before>($x?)      { Bool::True }
+multi infix:<before>($?)      { Bool::True }
 multi infix:<before>(\a, \b)   { (a cmp b) < 0 }
 
 proto infix:<after>($, $?) is pure { * }

diff --git a/src/core/Mu.pm b/src/core/Mu.pm
@@ -703,14 +703,14 @@ multi sub infix:<~~>(Mu \topic, Mu \matcher) {
     matcher.ACCEPTS(topic).Bool;
 }
 
-proto sub infix:<=:=>(Mu $a?, Mu $b?) { * }
-multi sub infix:<=:=>($a?)      { Bool::True }
+proto sub infix:<=:=>(Mu $?, Mu $?) { * }
+multi sub infix:<=:=>($?)      { Bool::True }
 multi sub infix:<=:=>(Mu \a, Mu \b) { 
     nqp::p6bool(nqp::eqaddr(a, b));
 }
 
 proto sub infix:<eqv>(Any $?, Any $?) { * }
-multi sub infix:<eqv>($a?)            { Bool::True }
+multi sub infix:<eqv>($?)            { Bool::True }
 multi sub infix:<eqv>(Any $a, Any $b) {
     $a.WHICH eq $b.WHICH
 }

diff --git a/src/core/Numeric.pm b/src/core/Numeric.pm
@@ -181,49 +181,49 @@ multi sub round($a)                 { $a.Numeric.round }
 multi sub round(Numeric $a)         { $a.round }
 multi sub round(Numeric $a, $scale) { $a.round($scale) }
 
-proto infix:<+>($a?, $b?) is pure   { * }
+proto infix:<+>($?, $?) is pure   { * }
 multi infix:<+>($x = 0)      { $x.Numeric }
 multi infix:<+>(\a, \b)    { a.Numeric + b.Numeric }
 
-proto infix:<->($a?, $b?) is pure   { * }
+proto infix:<->($?, $?) is pure   { * }
 multi infix:<->($x = 0)      { $x.Numeric }
 multi infix:<->(\a, \b)    { a.Numeric - b.Numeric }
 
-proto infix:<*>($a?, $b?) is pure   { * }
+proto infix:<*>($?, $?) is pure   { * }
 multi infix:<*>($x = 1)      { $x.Numeric }
 multi infix:<*>(\a, \b)    { a.Numeric * b.Numeric }
 
-proto infix:</>($a?, $b?) { * }
+proto infix:</>($?, $?) { * }
 multi infix:</>()            { fail "No zero-arg meaning for infix:</>" }
 multi infix:</>($x)          { $x.Numeric }
 multi infix:</>(\a, \b)    { a.Numeric / b.Numeric }
 
-proto infix:<div>($a?, $b?) is pure  { * }
+proto infix:<div>($?, $?) is pure  { * }
 # rest of infix:<div> is in Int.pm
 
-proto infix:<%>($a?, $b?) is pure   { * }
+proto infix:<%>($?, $?) is pure   { * }
 multi infix:<%>()            { fail "No zero-arg meaning for infix:<%>" }
 multi infix:<%>($x)          { $x }
 multi infix:<%>(\a, \b)    { a.Real % b.Real }
 
-proto infix:<%%>($a?, $b?) is pure  { * }
+proto infix:<%%>($?, $?) is pure  { * }
 multi infix:<%%>()           { fail "No zero-arg meaning for infix:<%%>" }
-multi infix:<%%>($x)         { Bool::True }
+multi infix:<%%>($)         { Bool::True }
 multi infix:<%%>(\a, \b)   {
     fail X::Numeric::DivideByZero.new(using => 'infix:<%%>') unless b;
     a.Real % b.Real == 0;
 }
 
-proto infix:<lcm>($a?, $b?) is pure  { * }
+proto infix:<lcm>($?, $?) is pure  { * }
 multi infix:<lcm>(Int $x = 1) { $x }
 multi infix:<lcm>(\a, \b)   { a.Int lcm b.Int }
 
-proto infix:<gcd>($a?, $b?) is pure { * }
+proto infix:<gcd>($?, $?) is pure { * }
 multi infix:<gcd>()          { fail 'No zero-arg meaning for infix:<gcd>' }
 multi infix:<gcd>(Int $x)    { $x }
 multi infix:<gcd>(\a, \b)  { a.Int gcd b.Int }
 
-proto infix:<**>($a?, $b?) is pure  { * }
+proto infix:<**>($?, $?) is pure  { * }
 multi infix:<**>($x = 1)     { $x.Numeric }
 multi infix:<**>(\a, \b)   { a.Numeric ** b.Numeric }
 
@@ -232,28 +232,28 @@ multi infix:<**>(\a, \b)   { a.Numeric ** b.Numeric }
 proto infix:«<=>»($, $?) is pure       { * }
 multi infix:«<=>»(\a, \b)  { a.Real <=> b.Real }
 
-proto infix:<==>($a?, $b?) is pure  { * }
-multi infix:<==>($x?)        { Bool::True }
+proto infix:<==>($?, $?) is pure  { * }
+multi infix:<==>($?)        { Bool::True }
 multi infix:<==>(\a, \b)   { a.Numeric == b.Numeric }
 
-proto infix:<!=>(Mu $a?, Mu $b?) is pure  { * }
-multi infix:<!=>($x?)        { Bool::True }
+proto infix:<!=>(Mu $?, Mu $?) is pure  { * }
+multi infix:<!=>($?)        { Bool::True }
 multi infix:<!=>(Mu \a, Mu \b)   { not a == b }
 
-proto infix:«<»($a?, $b?) is pure   { * }
-multi infix:«<»($x?)         { Bool::True }
+proto infix:«<»($?, $?) is pure   { * }
+multi infix:«<»($?)         { Bool::True }
 multi infix:«<»(\a, \b)    { a.Real < b.Real }
 
-proto infix:«<=»($a?, $b?) is pure  { * }
-multi infix:«<=»($x?)        { Bool::True }
+proto infix:«<=»($?, $?) is pure  { * }
+multi infix:«<=»($?)        { Bool::True }
 multi infix:«<=»(\a, \b)   { a.Real <= b.Real }
 
-proto infix:«>»($a?, $b?) is pure   { * }
-multi infix:«>»($x?)         { Bool::True }
+proto infix:«>»($?, $?) is pure   { * }
+multi infix:«>»($?)         { Bool::True }
 multi infix:«>»(\a, \b)    { a.Real > b.Real }
 
-proto infix:«>=»($a?, $b?) is pure  { * }
-multi infix:«>=»($x?)        { Bool::True }
+proto infix:«>=»($?, $?) is pure  { * }
+multi infix:«>=»($?)        { Bool::True }
 multi infix:«>=»(\a, \b)   { a.Real >= b.Real }
 
 ## bitwise operators