avoid postfixOps

scalap/src/main/scala/org/json4s/scalap/SeqRule.scala

@@ -12,8 +12,6 @@
 
 package org.json4s.scalap
 
-import language.postfixOps
-
 /**
  * A workaround for the difficulties of dealing with
  * a contravariant 'In' parameter type...
@@ -51,7 +49,7 @@ class SeqRule[S, +A, +X](rule: Rule[S, S, A, X]) {
    * Creates a rule that always succeeds with a Boolean value.
    *  Value is 'true' if this rule succeeds, 'false' otherwise
    */
-  def -? = ? map { _ isDefined }
+  def -? = ? map (_.isDefined)
 
   def * = from[S] {
     // tail-recursive function with reverse list accumulator
@@ -67,12 +65,12 @@ class SeqRule[S, +A, +X](rule: Rule[S, S, A, X]) {
 
   def ~>?[B >: A, X2 >: X](f: => Rule[S, S, B => B, X2]) = for {
     a <- rule
-    fs <- f ?
+    fs <- f.?
   } yield fs.foldLeft[B](a) { (b, f) => f(b) }
 
   def ~>*[B >: A, X2 >: X](f: => Rule[S, S, B => B, X2]) = for {
     a <- rule
-    fs <- f *
+    fs <- f.*
   } yield fs.foldLeft[B](a) { (b, f) => f(b) }
 
   def ~*~[B >: A, X2 >: X](join: => Rule[S, S, (B, B) => B, X2]) = {
@@ -83,13 +81,13 @@ class SeqRule[S, +A, +X](rule: Rule[S, S, A, X]) {
   }
 
   /** Repeats this rule one or more times with a separator (which is discarded) */
-  def +/[X2 >: X](sep: => Rule[S, S, Any, X2]) = rule ~++ (sep -~ rule *)
+  def +/[X2 >: X](sep: => Rule[S, S, Any, X2]) = rule ~++ ((sep -~ rule).*)
 
   /** Repeats this rule zero or more times with a separator (which is discarded) */
   def */[X2 >: X](sep: => Rule[S, S, Any, X2]) = +/(sep) | state[S].nil
 
-  def *~-[Out, X2 >: X](end: => Rule[S, Out, Any, X2]) = (rule - end *) ~- end
-  def +~-[Out, X2 >: X](end: => Rule[S, Out, Any, X2]) = (rule - end +) ~- end
+  def *~-[Out, X2 >: X](end: => Rule[S, Out, Any, X2]) = ((rule - end).*) ~- end
+  def +~-[Out, X2 >: X](end: => Rule[S, Out, Any, X2]) = ((rule - end).+) ~- end
 
   /** Repeats this rule num times */
   def times(num: Int): Rule[S, S, Seq[A], X] = from[S] {