freenode/#lisp - IRC Chatlog
Search
16:10:28
heisig
pve: You could also attach a finalizer to check whether your class is actually being collected.
16:44:12
pve
While we're on the subject, there wouldn't happen to be a way to cleanly delete a structure-class? SBCL at least lets me do (closer-mop:remove-direct-subclass (find-class 'structure-object) (find-class 'mystruct)), but can it be relied on?
18:16:34
makomo
when running sbcl on the side (i.e. not as an emacs inferior process), running the same form from sbcl's repl returns true
18:18:54
makomo
yep, that's what i wanna know, is it a bug or not. i would have expected it to return T
18:29:19
White_Flame
one of the possible implementation-dependent criteria of interactive streams is the "normal input editing", which I don't think the stream perceives?
18:47:46
_death
the initial commit (and project description on cl.net) mentions bordeaux-mp by Dan Barlow
19:48:02
pfdietz
That tweak reduced the run time of that by about 10%. eql hash tables are much faster than equal hash tables, I think because they can cache based on the previous key.
19:51:00
slyrus_
shka_: thanks for the comments on the github issues. I'll check out the rr thing. We need to focus on the developer experience. I'd like to make sure that we have easily understandable examples a la those on the teddy README page.
20:19:19
_death
pfdietz: well, it looks good to me (there's some extra whitespace & commented code though).. I can merge it, but perhaps you should also send a PR to cffi maintainers
20:47:06
benjamindc
Every time I reload a file in the REPL in which I've used defconstant I get the redefinition warning. Is it possible to muffle this warning in my .sbclrc?
20:58:31
shka_
actually alexandria is based on utils described in "on lisp" and the author of the book is a notorious schemer
20:59:19
jackdaniel
define-constant is a very nice lispy name, I don't find it more schemish than lispish
21:00:13
jackdaniel
(define-condition, define-symbol-macro, define-method-combination, define-anything-what-is-not-defsmth-due-to-backward-compatibility)
21:12:11
slyrus_
shka_: refresh my memory about the filter thing. We're talking about the macro I wrote yesterday, right?
21:13:14
shka_
no question, just wanted to suggest that assuming that filter is supposed to be placed inside bind-row would make that macro significantly simpler
21:14:55
slyrus_
bind-row is nice and efficient and all but I think we should provide "wrapper" functions that hide its use for things like filter.
21:17:09
shka_
and perhaps write some macro that works accepts table, bind-row lambda-list and bind-row body as it's own &body
21:18:28
slyrus_
if we take for a moment that we want something dplyr-ish (which is reasonable for my needs), the things I use a lot are the various df/tibble creation routines, select, filter, mutate, rename, inner_join, arrange, pivot_..., etc...
21:18:51
slyrus_
I'd like to see an interface like that exposed to developer/users that would presumably use bind-row under the covers
21:19:19
shka_
since drop-row performs non-local-exit, you can just stick every operations in bind-row
21:19:45
shka_
slyrus_: if one would really want to make it compact, i think that reader macro is the solution
21:21:02
slyrus_
Don't get me wrong, bind-row is cool and there are certainly going to places to use it, but I'd like to see a higher level interface as well.
21:25:33
slyrus_
This is a good question. dplyr has it's approach to this that works reasonably well. The poorly-articulated question that's running around my mind is can we do better in the lisp world given the tools at our disposal?
21:27:00
shka_
but on the other hand, people are used to writing (lambda (something other-thing) ...) so why not imitate lambda?
0:45:28
moon-child
is there a good way to do forward declarations, to keep sbcl from getting uppity with me about co-recursive functions?
0:56:13
Alfr_
moon-child, by any chance you're loading the file directly? Can't it reproduce with (load (compile-file ..)).
0:57:28
Alfr_
moon-child, but you still can wrap these mutually recursive defuns in a (with-compilation-unit () ..) .
2:18:59
pfdietz
Or, you can declaim the later functions to have an ftype. Or, you can make the later functions be generic, and put defgenerics at the top of the file, above the defmethods.