Last active
August 29, 2015 13:57
-
-
Save kamiyaowl/9410135 to your computer and use it in GitHub Desktop.
ScalaでL-System
This file contains 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
===== L-System ===== | |
(algae,(A,Map(A -> AB, B -> A))) | |
(fib,(A,Map(A -> B, B -> AB))) | |
(koch,(F,Map(F -> F+F-F-F+F))) | |
(sierpinski,(F,Map(F -> F-F-F-GG, G -> GG))) | |
rule> algae | |
count > 4 | |
result>ABAABABA | |
===== L-System ===== | |
(algae,(A,Map(A -> AB, B -> A))) | |
(fib,(A,Map(A -> B, B -> AB))) | |
(koch,(F,Map(F -> F+F-F-F+F))) | |
(sierpinski,(F,Map(F -> F-F-F-GG, G -> GG))) | |
rule> fib | |
count > 4 | |
result>ABBAB | |
===== L-System ===== | |
(algae,(A,Map(A -> AB, B -> A))) | |
(fib,(A,Map(A -> B, B -> AB))) | |
(koch,(F,Map(F -> F+F-F-F+F))) | |
(sierpinski,(F,Map(F -> F-F-F-GG, G -> GG))) | |
rule> count > result>F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F+F+F-F-F+F+F+F-F-F+F-F+F-F-F+F-F+F-F-F+F+F+F-F-F+F | |
===== L-System ===== | |
(algae,(A,Map(A -> AB, B -> A))) | |
(fib,(A,Map(A -> B, B -> AB))) | |
(koch,(F,Map(F -> F+F-F-F+F))) | |
(sierpinski,(F,Map(F -> F-F-F-GG, G -> GG))) | |
rule> koch | |
count > 4 | |
result>F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-GGGGGGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-GGGGGGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-F-F-F-GG-F-F-F-GG-F-F-F-GG-GGGG-GGGGGGGG-GGGGGGGGGGGGGGGG |
This file contains 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
import scala.language.postfixOps | |
object LSystem { | |
implicit class ReplaceSystem(self:String) { | |
def /(implicit rule:Map[Char,String]) = self map(r) mkString | |
def >>(n:Int)(implicit rule:Map[Char,String]):String = { | |
if(n == 0) self | |
else self./.>>(n-1)(rule) | |
} | |
} | |
def r(c:Char)(implicit rule:Map[Char,String]) = rule.get(c) match { | |
case Some(n) => n | |
case None => c | |
} | |
def main(args:Array[String]) = { | |
val rules = Map( "algae" -> ("A", Map('A' -> "AB", 'B' -> "A")), | |
"fib" -> ("A", Map('A' -> "B" , 'B' -> "AB")), | |
"koch" -> ("F", Map('F' -> "F+F-F-F+F")), | |
"sierpinski" -> ("F", Map('F' -> "F-F-F-GG", 'G' -> "GG"))); | |
while(true) | |
{ | |
println("\n===== L-System =====") | |
rules foreach(println) | |
print("\nrule> ") | |
val key = readLine | |
rules.get(key) match { | |
case Some(r) => show(r) | |
case None => println("retry") | |
} | |
} | |
def show(s:(String,Map[Char,String])) = { | |
implicit val rule = s._2 | |
print("count > ") | |
val count = readLine.toInt | |
print("result>") | |
println(s._1 >> count) | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment