libera/#commonlisp - IRC Chatlog
Search
20:18:42
gilberth
So it looks like SBCL abandoms *print-circle* processing when doing output to another stream altogether, but for the top-level object printed to that other stream. I can see why they have chosen to do so. Watch <https://termbin.com/y6fs>. This time using ~S. When asking for ~20S however, CCL fails to do *print-circle* processing because it first prints the argument to a string.
20:19:43
gilberth
However, completely abandoning *print-circle* may make you face some infinite recursion. I don't like that.
6:09:12
bitblit1
pjb: How would I modify that to make it permutations of a list. I thought of binary but that has repitition?
6:18:16
bitblit1
What is the easy way of grouping a list into sublists for e.g: '(9 2 7 8 4 1 0 4 6 3) in groups of 2 => '((9 2) (7 8) (4 1)...)
6:23:09
bitblit1
Thanks beach However, this is dependent on the cddr function, if we wanted to lets say take pairs of 12 that would be really difficult
6:27:27
bitblit1
beach: I wanted to make something dynamic which pairs depending on a number in this case (list x y z) is also not dependent
6:55:32
prokhor_
i have a question specific on "common prolog" from lispworks but it follows cl implementation rules: I have an assertion like: (assert ((color red))) which gives: (color red) -> YES now i would like to know how how i could do sth like: (setq pred1 human) (setq val1 socrates) and (assert ((pred1 val1))
6:57:07
prokhor_
if i do like above, it takes the var names literally and does not fill in the values associated (i.e. it uses the symbol slot (?))