aboutsummaryrefslogtreecommitdiff
path: root/examples/hamming.fusp
diff options
context:
space:
mode:
authorCamil Staps2016-10-16 21:46:51 +0200
committerCamil Staps2016-10-16 21:59:27 +0200
commit88bcec774b782319aa4ce32a39c101568d01925a (patch)
tree0213a083eba76dd9ef177a781ce585e273490934 /examples/hamming.fusp
parentUsage message when no modules are given (diff)
examples
Diffstat (limited to 'examples/hamming.fusp')
-rw-r--r--examples/hamming.fusp12
1 files changed, 12 insertions, 0 deletions
diff --git a/examples/hamming.fusp b/examples/hamming.fusp
new file mode 100644
index 0000000..9c6aa48
--- /dev/null
+++ b/examples/hamming.fusp
@@ -0,0 +1,12 @@
+import list;
+import int;
+import bool;
+
+// Taken from the Clean examples: the Hamming function.
+// The first 100 numbers with only 2, 3 and 5 as prime factors.
+
+ham = [1:merge (merge (map (mul 2) ham) (map (mul 3) ham)) (map (mul 5) ham)];
+
+merge [a:b] [c:d] = if (lt a c) [a:merge b [c:d]] (if (eq a c) (merge [a:b] d) [c:merge [a:b] d]);
+
+main = take 100 ham;