Here’s what I’d do:
(ql:quickload "alexandria")
(alexandria:flatten list)
That works mainly because I have Quicklisp installed already.
More Related Contents:
- Variable references in lisp
- values function in Common Lisp
- LET versus LET* in Common Lisp
- Dynamic and Lexical variables in Common Lisp
- Lisp – Print out () instead of nil for empty list
- What’s the best way to learn LISP? [closed]
- Lisp: Find the setf way of doing the equivalent of fset [closed]
- Why exactly is eval evil?
- When to use ‘ (or quote) in Lisp?
- Unexpected persistence of data [duplicate]
- Why does this function return a different value every time?
- Lisp, instructions not working in defun [duplicate]
- How to generate all the permutations of elements in a list one at a time in Lisp?
- Common lisp error: “should be lambda expression”
- tail-recursive function appending element to list
- Recursive range in Lisp adds a period?
- setq and defvar in Lisp
- Lisp Executable
- Why is Lisp used for AI? [closed]
- How can I read the contents of a file into a list in Lisp?
- Lisp format a character a number of times
- How many primitives does it take to build a LISP machine? Ten, seven or five?
- What exactly is a symbol in lisp/scheme?
- What is the formal difference in Scala between braces and parentheses, and when should they be used?
- Parenthesis/Brackets Matching using Stack algorithm
- When should Emacs #’function syntax be used?
- What’s the canonical way to join strings in a list?
- What is the meaning of curly braces? [closed]
- Cons element to list vs cons list to element in Scheme
- How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)?