3 files changed, 54 insertions, 0 deletions
diff --git a/demos/chain.apl b/demos/chain.apl
new file mode 100644
index 0000000..e7e1979
--- /dev/null
+++ b/demos/chain.apl
@@ -0,0 +1,18 @@
+⍝ First we define a function which recieves a message,
+⍝ and sends one to the task with id ⍵
+f←{
+        (from msg)←{1 ⍵}⍇⍬
+        (1+msg)⍈⍵
+      }
+
+⍝ Now start 10000 of those
+last←f&'chain'⍣10000⊢⎕self
+
+≢⎕THREADS 0
+
+⍝ Start the chain by sending something to the last one
+0 ⍈ last
+
+⎕threads 0 1 2
+
+{1 (2⊃⍵)}⍇0 ⍝ We only pick out the message part, not the sender
diff --git a/demos/demos b/demos/demos
new file mode 100644
index 0000000..b687a93
--- /dev/null
+++ b/demos/demos
@@ -0,0 +1,3 @@
+APLDemo intro.apl
+APLDemo doubleup.apl
+APLDemo chain.apl
diff --git a/demos/intro.apl b/demos/intro.apl
new file mode 100644
index 0000000..a98bb1e
--- /dev/null
+++ b/demos/intro.apl
@@ -0,0 +1,33 @@
+⍝ The send primitive is a dyadic function
+⍝ message ⍈ to
+
+message←'Hello there'
+
+⍝ We can send it to ourselves
+us←⎕self
+us
+message ⍈ us
+
+⍝ Let's examine the state of the system
+us ⎕threads 0 ⍝ Thread ID
+us ⎕threads 1 ⍝ Thread name
+us ⎕threads 2 ⍝ Number of messages in mailbox
+us ⎕threads 3 ⍝ Approximate C stack usage (in bytes)
+
+⍝ All at once, for all currently running threads
+⎕threads 0 1 2 3
+
+⍝ We have one message in our mailbox, let's receive it
+⍝ The recieve primitive is a monadic operator
+⍝ filter ⍇ timeout
+{1 ⍵} ⍇ 0
+
+⍝ Again?
+{1 ⍵} ⍇ 0
+⍝ The time we asked it to wait was 0, so it failed immediately.
+{1 ⍵} ⍇ 5
+
+⍝ What if we don't want it to timeout?
+{1 ⍵} ⍇ ⍬  ⍝ Noone will send it anything, so it hangs
+
+