Created
June 6, 2014 04:08
-
-
Save asmasa/54683263bf119f134535 to your computer and use it in GitHub Desktop.
独書会 Scala IN DEPTH @ファミレス その1 ref: http://qiita.com/asmasa/items/f8f09655543cf171aaf3
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
x.foo(); /*is the same as*/ x foo | |
x.foo(y); /*is the same as*/ x foo y | |
x.::(y); /*is the same as*/ y :: x |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def qsort[T <% Ordered[T]](list:List[T]):List[T] = { | |
list.match({ | |
case Nil => Nil; | |
case x::xs => | |
val (before,after) = xs.partition({ i => i.<(x) }); | |
qsort(before).++(qsort(after).::(x))); | |
}); | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def qsort[T <% Ordered[T]](list:List[T]):List[T] = list match { | |
case Nil => Nil | |
case x :: xs => | |
val (before, after) = xs partition ( _ < x ) | |
qsort(before) ++ (x :: qsort(after)); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment