freenode/#lisp - IRC Chatlog
Search
5:17:34
aeth
I think I'm going to update something in some of my code that solves the problem, but not with uiop:subpathname, so probably not as robustly
5:23:04
dbotton
I wouldn't have noticed it in mine if had not by chance tried merge-pathnames with a subdirectory following the file to merge on
12:19:31
VincentVega
Just got meself (gensym) to return two #:G0's nearly in a row. Thinking it has something to do with that reproducability rationale that I read about in one of the sbcl bugs. Currently working out a minimal example (which is proving to be a tad tricky), any insights would be appreciated...
12:26:40
VincentVega
Interesting. Can't say I really understand this bug to say for sure that this is the same one at this point, but yeah, it does look like it got the same roots. Thanks for the link.
12:28:20
phoe
well, you could try going to #sbcl and post your problem, maybe also link this issue if it's related
12:35:22
heisig
I recently promised I would start a collection of 'Common Lisp tweaks'. Well, here it is: https://github.com/marcoheisig/common-lisp-tweaks
12:36:55
heisig
I intend to grow this list whenever I hear about a new trick on IRC, so newcomers won't have to dig through decades of IRC logs to find them.
13:51:54
jmercouris
One thing I’ve been thinking about is that a defmethod is like a guard for a function call
14:16:00
jmercouris
I had been asking about the unique set of basic operators about a year ago i think
14:16:15
jmercouris
At the time I couldn’t articulate what I was trying to describe, but that is it!
14:17:45
beach
The paper by Baker is good. He explains various ways of implementing Common Lisp special operators using other Common Lisp special operators, and often the other way around too.
14:19:03
jmercouris
One thing that I think about a lot is maybe it would have been better if the default was doubly linked lists in lisp
14:20:04
beach
jmercouris: That would break almost every aspect of the semantics of large parts of Common Lisp.
14:21:14
heisig
If you are smart, every operation on lists is already O(1). And singly-linked lists help create beautiful recursive programs.
14:23:39
jmercouris
I think there are some algorithms that would be simpler to write with doubly linked lists
14:24:12
beach
jmercouris: If you have (defparameter *l0* (list 'a 'b 'c ...)) then (defparameter *l1* (cons 1 *l0*)) and (defparameter *l2* (cons 2 *l0*)), would then (rest *l1*) and (rest *l2*) be EQ with doubly linked lists?
14:25:28
heisig
jmercouris: Insertion at the front is O(1). Removal from the front is O(1). All you have to do is turn the list the right way round.
14:26:20
nij
Has anyone thought of making "notes" on discussion on #lisp, as the conversation here has been logged.
14:26:47
nij
Namely, now we are discussing why singly-linked list is the default. Maybe there could be a way to add a summary quickly that refers to this part of conversation?
14:28:41
beach
nij: While there are a few subjects with recurring questions, singly-linked vs doubly-linked lists as the default in Lisp is not one of them.
14:28:54
heisig
jmercouris: As for looking behind - if you only need to look a fixed number of list elements behind you, you an scan the list and keep track of the last K elements you just visited.
15:48:53
Josh_2
When using formatter, what do I pass as the stream arg to have it output as a string?
15:57:20
pfdietz
I had a situation that looked like (format nil (if <form> <string1> <string2>) ...), which I think runs faster if the IF parts were strength reduced with calls to formatter.