Data update

Task/Hilbert-curve/EasyLang/hilbert-curve.easy

@@ -0,0 +1,15 @@
+order = 64
+linewidth 32 / order
+scale = 100 / order - 100 / (order * order)
+proc hilbert x y lg i1 i2 . .
+   if lg = 1
+      line (order - x) * scale (order - y) * scale
+      return
+   .
+   lg = lg div 2
+   hilbert x + i1 * lg y + i1 * lg lg i1 1 - i2
+   hilbert x + i2 * lg y + (1 - i2) * lg lg i1 i2
+   hilbert x + (1 - i1) * lg y + (1 - i1) * lg lg i1 i2
+   hilbert x + (1 - i2) * lg y + i2 * lg lg 1 - i1 i2
+.
+hilbert 0 0 order 0 0

Task/Hilbert-curve/F-Sharp/hilbert-curve.fs

@@ -0,0 +1,11 @@
+// Hilbert curve. Nigel Galloway: September 18th., 2023
+type C= |At|Cl|Ab|Cr
+type D= |Z|U|D|L|R
+let fD=function Z->0,0 |U->0,1 |D->0,-1 |L-> -1,0 |R->1,0
+let fC=function At->[fD D;fD R;fD U] |Cl->[fD R;fD D;fD L] |Ab->[fD U;fD L;fD D] |Cr->[fD L;fD U;fD R]
+let order(n,g)=match g with At->[n,Cl;D,At;R,At;U,Cr]
+                           |Cl->[n,At;R,Cl;D,Cl;L,Ab]
+                           |Ab->[n,Cr;U,Ab;L,Ab;D,Cl]
+                           |Cr->[n,Ab;L,Cr;U,Cr;R,At]
+let hilbert=Seq.unfold(fun n->Some(n,n|>List.collect order))[Z,At]
+hilbert|>Seq.take 7|>Seq.iteri(fun n g->Chart.Line(g|>Seq.collect(fun(n,g)->(fD n)::(fC g))|>Seq.scan(fun(x,y)(n,g)->(x+n,y+g))(0,0))|>Chart.withTitle(sprintf "Hilbert order %d" n)|>Chart.show)