Вы не можете выбрать более 25 тем Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
 
 
 
 
 
 

80 строки
5.1 KiB

  1. (define (nil? x) "Checks if the argument is =nil=." (= x nil))
  2. (define (number? x) "Checks if the argument is a number." (= (type x) :number))
  3. (define (symbol? x) "Checks if the argument is a symbol." (= (type x) :symbol))
  4. (define (keyword? x) "Checks if the argument is a keyword." (= (type x) :keyword))
  5. (define (pair? x) "Checks if the argument is a pair." (= (type x) :pair))
  6. (define (string? x) "Checks if the argument is a string." (= (type x) :string))
  7. (define (lambda? x) "Checks if the argument is a function." (= (type x) :lambda))
  8. (define (macro? x) "Checks if the argument is a macro." (= (type x) :macro))
  9. (define (special-lambda? x) "Checks if the argument is a special-lambda." (= (type x) :dynamic-macro))
  10. (define (built-in-function? x) "Checks if the argument is a built-in function." (= (type x) :built-in-function))
  11. (define (callable? x) (or (lambda? x) (special-lambda? x) (macro? x) (built-in-function? x)))
  12. (define (end seq) "Returns the last pair in the sqeuence." (if (or (nil? seq) (not (pair? (rest seq)))) seq (end (rest seq))))
  13. (define (last seq) "Returns the (first) of the last (pair) of the given sequence." (first (end seq)))
  14. (define (extend seq elem) "Extends a list with the given element, by putting it in
  15. the (rest) of the last element of the sequence." (if (pair? seq) (begin (define e (end seq)) (mutate e (pair (first e) elem)) seq) elem))
  16. (define (extend2 seq elem) "Extends a list with the given element, by putting it in
  17. the (rest) of the last element of the sequence." (printf "addr of (end seq)" (addr-of (end seq))) (if (pair? seq) (let ((e (end seq))) (printf "addr if e inner" (addr-of e)) (mutate e (pair (first e) elem)) seq)) elem)
  18. (define (append seq elem) "Appends an element to a sequence, by extendeing the list
  19. with (pair elem nil)." (extend seq (pair elem ())))
  20. (define (length seq) "Returns the length of the given sequence." (if (nil? seq) 0 (+ 1 (length (rest seq)))))
  21. (define (increment val) "Adds one to the argument." (+ val 1))
  22. (define (decrement val) "Subtracts one from the argument." (- val 1))
  23. (define (range :keys from :defaults-to 0 to) "Returns a sequence of numbers starting with the number defined by the
  24. key =from= and ends with the number defined in =to=." (when (< from to) (pair from (range :from (+ 1 from) :to to))))
  25. (define (range-while :keys from :defaults-to 0 to) "Returns a sequence of numbers starting with the number defined
  26. by the key 'from' and ends with the number defined in 'to'." (define result (list (copy from))) (define head result) (mutate from (increment from)) (while (< from to) (begin (mutate head (pair (first head) (pair (copy from) nil))) (define head (rest head)) (mutate from (increment from)))) result)
  27. (define (map fun seq) "Takes a function and a sequence as arguments and returns a new
  28. sequence which contains the results of using the first sequences
  29. elemens as argument to that function." (if (nil? seq) seq (pair (fun (first seq)) (map fun (rest seq)))))
  30. (define (reduce fun seq) "Takes a function and a sequence as arguments and applies the
  31. function to the argument sequence. This only works correctly if the
  32. given function accepts a variable amount of parameters. If your
  33. funciton is limited to two arguments, use [[=reduce-binary=]]
  34. instead." (apply fun seq))
  35. (define (reduce-binary fun seq) "Takes a function and a sequence as arguments and applies the
  36. function to the argument sequence. reduce-binary applies the
  37. arguments `pair-wise' which means it works with binary functions
  38. as compared to `reduce'." (if (nil? (rest seq)) (first seq) (fun (first seq) (reduce-binary fun (rest seq)))))
  39. (define (filter fun seq) "Takes a function and a sequence as arguments and applies the
  40. function to every value in the sequence. If the result of that
  41. funciton application returns a truthy value, the original value is
  42. added to a list, which in the end is returned." (when seq (if (fun (first seq)) (pair (first seq) (filter fun (rest seq))) (filter fun (rest seq)))))
  43. (define (zip l1 l2) (unless (and (nil? l1) (nil? l2)) (pair (list (first l1) (first l2)) (zip (rest l1) (rest l2)))))
  44. (define (unzip lists) (when lists (define (iter lists l1 l2) (define elem (first lists)) (if elem (iter (rest lists) (pair (first elem) l1) (pair (first (rest elem)) l2)) (list l1 l2)))) (iter lists () ()))
  45. (define (enumerate seq) (define (enumerate-inner seq next-num) (when seq (pair (list (first seq) next-num) (enumerate-inner (rest seq) (+ 1 next-num))))) (enumerate-inner seq 0))
  46. (define (printf :keys sep :defaults-to " " end :defaults-to "
  47. " :rest args) "A wrapper for the built-in (print) that accepts a variable number
  48. of arguments and also provides keywords for specifying the printed
  49. separators between the arguments and what should be printed after the
  50. las argument." (define printf-quoted (special-lambda (:keys sep end :rest args) (if (nil? args) (begin (print (eval end)) nil) (begin (print (first args)) (unless (nil? (rest args)) (print (eval sep))) (eval (pair printf-quoted (extend (list :sep (eval sep) :end (eval end)) (rest args)))))))) (eval (pair printf-quoted (extend (list :sep (eval sep) :end (eval end)) args))))