lasp 0.3.2 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: fe53c128ac7fb00e1dcf9e1e89db3596e9557690
-  data.tar.gz: c7a42762434a1192b531bc980fc65ba5b84d06f9
+  metadata.gz: 834e32aec6fd535ecec0d68c7297cb3184ced218
+  data.tar.gz: ccc67e45c0aeb24b368a51a6bcea67d09af86db9
 SHA512:
-  metadata.gz: 18a21269e6682b786c215d16b286ea6ff4533de458dea3099536e9f1b8f709c8cf568f0725a527c398469ccd941213f1c4a8c86f8b6c23f954a8f88c1e64cc44
-  data.tar.gz: 315b73b00df83f029848a3b36dd8b7e3a7fb03bf22109cd4298adff8b6b57eb6bee8afa9c81ba665735d6e5a6962a05f36943feb6481e42419cbdaf86f4f5f20
+  metadata.gz: ca7f8e586069ed34fa69c03c9c3b16a789b25b695e342d7e2124e5c1b6a9c7b5a23d12cfa4fa329b8668bcb24597ff1e4c8626a39888622369db3e20addab53e
+  data.tar.gz: 32229cfbb3e1c039249adcedacd75a8e50b3ad3ef0c71f3b0e522d8d5816a5d48429ddd9fa540157d7923b77a195bd46fe921d8b2d8f8086110896e2d1286675

data/CHANGELOG.md

@@ -1,5 +1,21 @@
 # Läsp changelog
 
+## v0.4.0
+
+Implicit do-blocks around files. You can now do this...:
+
+```lisp
+(def x 5)
+
+(def y 10)
+```
+
+...in a Läsp file without having to wrap the entire contents of the file in
+`(do ...)`. Previously it just stopped reading after the first form and
+anything after would seemingly inexplicably not be run.
+
+**This is only enabled in files, not every form of evaluation.**
+
 ## v0.3.2
 
 Fix bug in `do` - it accidentally returned part of the AST, now it correctly

data/README.md

@@ -57,6 +57,7 @@ Supports these datatypes (implemented as their Ruby counterparts)
 - nil
 - string
 - list
+- hash-map
 
 ### Comments
 

data/lib/lasp.rb

@@ -7,7 +7,7 @@ module Lasp
   module_function
 
   def execute_file(path)
-    execute(File.read(path))
+    execute("(do #{File.read(path)})")
   end
 
   def execute(program, env = global_env)

data/lib/lasp/stdlib.lasp

@@ -1,122 +1,120 @@
-(do
-  ; Aliases
-  (def first head)
-  (def rest tail)
-
-  ; Increment a number by one
-  (def inc (fn (x) (+ x 1)))
-
-  ; Decrement a number by one
-  (def dec (fn (x) (- x 1)))
-
-  ; If a list is empty
-  (def empty?
-    (fn (coll)
-      (= (head coll) nil)))
-
-  ; Modulus
-  (def mod
-    (fn (x y) (- x (* (/ x y) y))))
-
-  ; Returns a function that does the opposite of the given function
-  (def complement
-    (fn (f) (fn (x) (not (f x)))))
-
-  ; If a number is even
-  (def even?
-    (fn (x) (= (mod x 2) 0)))
-
-  ; If a number is odd
-  (def odd? (complement even?))
-
-  ; Length of a list
-  (def len
-    (fn (coll)
-      (if (empty? coll)
-        0
-        (inc (len (tail coll))))))
-
-  ; Gets an item in a list by index
-  (def nth
-    (fn (index coll)
-      (if (= 0 index)
-        (head coll)
-        (nth (dec index) (tail coll)))))
-
-  ; Last item in list
-  (def last
-    (fn (coll)
-      (nth (dec (len coll)) coll)))
-
-  ; Reverses a list
-  (def reverse
-    (fn (coll)
-      (reduce (fn (acc item) (cons item acc)) (list) coll)))
-
-  ; Apply f to all items in list
-  (def map
-    (fn (f coll)
-      (if (= nil (head coll))
-        coll
-        (cons
-          (f (head coll))
-          (map f (tail coll))))))
-
-  ; Go through a list passing an accumulator and each item of the list through f
-  ; f(acc item)
-  (def reduce
-    (fn (f acc coll)
-      (if (empty? coll)
-        acc
-        (reduce f (f acc (head coll)) (tail coll)))))
-
-  ; Filter a list of items based on a function
-  (def filter
-    (fn (f coll)
-      (reduce
-        (fn (acc item) (if (f item) (cons item acc) acc))
-        (list)
-        (reverse coll))))
-
-  ; Sum of all items in a list
-  (def sum
-    (fn (coll)
-      (reduce + 0 coll)))
-
-  ; Take x items from list
-  (def take
-    (fn (num coll)
-      (if (= num 0)
-        (list)
-        (cons (head coll) (take (dec num) (tail coll))))))
-
-  ; Drop x items from list
-  (def drop
-    (fn (num coll)
-      (if (= num 0)
-        coll
-        (drop (dec num) (tail coll)))))
-
-  ; Exclusive range
-  (def range
-    (fn (from to)
-      (if (= from to)
-        (list)
-        (cons from (range (inc from) to)))))
-
-  ; Highest value in list
-  (def max
-    (fn (coll)
-      (reduce
-        (fn (acc item) (if (< acc item) item acc))
-        (head coll)
-        (tail coll))))
-
-  ; Lowest value in list
-  (def min
-    (fn (coll)
-      (reduce
-        (fn (acc item) (if (> acc item) item acc))
-        (head coll)
-        (tail coll))))
-)
+; Aliases
+(def first head)
+(def rest tail)
+
+; Increment a number by one
+(def inc (fn (x) (+ x 1)))
+
+; Decrement a number by one
+(def dec (fn (x) (- x 1)))
+
+; If a list is empty
+(def empty?
+  (fn (coll)
+    (= (head coll) nil)))
+
+; Modulus
+(def mod
+  (fn (x y) (- x (* (/ x y) y))))
+
+; Returns a function that does the opposite of the given function
+(def complement
+  (fn (f) (fn (x) (not (f x)))))
+
+; If a number is even
+(def even?
+  (fn (x) (= (mod x 2) 0)))
+
+; If a number is odd
+(def odd? (complement even?))
+
+; Length of a list
+(def len
+  (fn (coll)
+    (if (empty? coll)
+      0
+      (inc (len (tail coll))))))
+
+; Gets an item in a list by index
+(def nth
+  (fn (index coll)
+    (if (= 0 index)
+      (head coll)
+      (nth (dec index) (tail coll)))))
+
+; Last item in list
+(def last
+  (fn (coll)
+    (nth (dec (len coll)) coll)))
+
+; Reverses a list
+(def reverse
+  (fn (coll)
+    (reduce (fn (acc item) (cons item acc)) (list) coll)))
+
+; Apply f to all items in list
+(def map
+  (fn (f coll)
+    (if (= nil (head coll))
+      coll
+      (cons
+        (f (head coll))
+        (map f (tail coll))))))
+
+; Go through a list passing an accumulator and each item of the list through f
+; f(acc item)
+(def reduce
+  (fn (f acc coll)
+    (if (empty? coll)
+      acc
+      (reduce f (f acc (head coll)) (tail coll)))))
+
+; Filter a list of items based on a function
+(def filter
+  (fn (f coll)
+    (reduce
+      (fn (acc item) (if (f item) (cons item acc) acc))
+      (list)
+      (reverse coll))))
+
+; Sum of all items in a list
+(def sum
+  (fn (coll)
+    (reduce + 0 coll)))
+
+; Take x items from list
+(def take
+  (fn (num coll)
+    (if (= num 0)
+      (list)
+      (cons (head coll) (take (dec num) (tail coll))))))
+
+; Drop x items from list
+(def drop
+  (fn (num coll)
+    (if (= num 0)
+      coll
+      (drop (dec num) (tail coll)))))
+
+; Exclusive range
+(def range
+  (fn (from to)
+    (if (= from to)
+      (list)
+      (cons from (range (inc from) to)))))
+
+; Highest value in list
+(def max
+  (fn (coll)
+    (reduce
+      (fn (acc item) (if (< acc item) item acc))
+      (head coll)
+      (tail coll))))
+
+; Lowest value in list
+(def min
+  (fn (coll)
+    (reduce
+      (fn (acc item) (if (> acc item) item acc))
+      (head coll)
+      (tail coll))))

data/lib/lasp/version.rb

@@ -1,3 +1,3 @@
 module Lasp
-  VERSION = "0.3.2"
+  VERSION = "0.4.0"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: lasp
 version: !ruby/object:Gem::Version
-  version: 0.3.2
+  version: 0.4.0
 platform: ruby
 authors:
 - Jimmy Börjesson