blob: 4fc6ffe911d3540e679ec00f7936ef8b37ff440b (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
;;; vector.el --- Working with Elisp's Vector data type -*- lexical-binding: t -*-
;; Author: William Carroll <wpcarro@gmail.com>
;;; Commentary:
;; It might be best to think of Elisp vectors as tuples in languages like
;; Haskell or Erlang.
;;
;; Not surprisingly, this API is modelled after Elixir's Tuple API.
;;
;; Some Elisp trivia:
;; - "Array": Usually means vector or string.
;; - "Sequence": Usually means list or "array" (see above).
;;
;; It might be a good idea to think of Array and Sequence as typeclasses in
;; Elisp. This is perhaps more similar to Elixir's notion of the Enum protocol.
;;
;; Intentionally not supporting a to-list function, because tuples can contain
;; heterogenous types whereas lists should contain homogenous types.
;;; Code:
;; TODO: Consider supporting an alias named tuple for vector.
;; TODO: Consider labelling variadic functions like `vector/concat*'
;; vs. `vector/concat'.
(defun vector/concat (&rest args)
"Return a new vector composed of all vectors in `ARGS'."
(apply #'vconcat args))
;; TODO: Here's a sketch of a protocol macro being consumed.
;; (definstance monoid vector
;; :empty (lambda () []))
(defun vector/prepend (x xs)
"Add `X' to the beginning of `XS'."
(vector/concat `[,x] xs))
(defun vector/append (x xs)
"Add `X' to the end of `XS'."
(vector/concat xs `[,x]))
(defun vector/get (i xs)
"Return the value in `XS' at index, `I'."
(aref xs i))
(defun vector/set (i v xs)
"Set index `I' to value `V' in `XS'.
Returns a copy of `XS' with the updates."
(let ((copy (vconcat [] xs)))
(aset copy i v)
copy))
;; TODO: Decide between "remove" and "delete" as the appropriate verbs.
;; TODO: Implement this.
;; (defun vector/delete (i xs)
;; "Remove the element at `I' in `XS'.")
(provide 'vector)
;;; vector.el ends here
|
