freenode/#lisp - IRC Chatlog
Search
5:37:00
jeosol
@pierpa, thanks for your help man. The parallel functional is running ok. I am trying to get cloud instances to do the runs. I am cleaning out the code to make sure it does not fail on the lisp/sbcl slide
6:07:28
jack_rabbit
Is there a reason quicklisp doesn't like symlinks in the local-projects directory?
6:11:10
jack_rabbit
I just symlinked a project into the local-projects directory. Just says "couldn't find package whatever"
10:44:28
earl-ducaine
I'm running into a peculiar error with cffi:with-foreign-slots. The message: Attempt to bind a special variable with SYMBOL-MACROLET: WIDTH
10:45:04
earl-ducaine
looking at the expansion the following is a minimal example of that type of error:
10:45:06
earl-ducaine
(defparameter WIDTH 1) (SYMBOL-MACROLET ((WIDTH 2)) (FORMAT T "width: ~d~%" width))
10:45:24
earl-ducaine
This is the full code: https://gist.github.com/earl-ducaine/786b3c616ee014a7359e554619322924
10:46:30
|3b|
"If an attempt is made to bind a symbol that is defined as a global variable, an error of type program-error is signaled. "
10:46:39
earl-ducaine
Yes, so the problem seems to be that if you have a special variable that has the same name as you've assigned to one of your structure slots, you get the error.
10:49:59
|3b|
possibly with-foreign-slots should allow explicitly naming the variable so you could work around that, but not really a 'bug'
10:51:50
earl-ducaine
Holy crap. I'd never noticed that before. I'd always assumed that with-slots created a lexical binding for the slot name.
10:53:06
|3b|
no portable way to make a lexical binding that overrides a global special declamation, so it can't do that (without being a special form at least), and it would still have to figure out how to get the writes back to the slot
10:53:48
didi
Constants are a weird thing to have in a highly interactive environment. I always try to redefine them at some point.
10:54:33
|3b|
maybe if i can prove that some specific thing actually affects performance i might change it to a constant
11:25:49
stacksmith
|3b|: SBCL definitely compiles shorter code if you use constants. Of course it's not worth it unless it's in a tight loop...
11:32:52
Shinmera
Any idea why Drakma might be interpreting a stream with a wrong encoding even if I explicitly specify :external-format-in as :utf-8 AND the server returns a conte-type with charset utf-8?
12:42:52
Colleen
There is no applicable method for the generic function
#<STANDARD-GENERIC-FUNCTION OXENFURT:PHONETIC-SPELLING (1)>
when called with arguments
(#<OXENFURT:LEXICAL-ENTRY "lisp" EN>).
12:44:49
Colleen
lisp /lɪsp/
(noun): a speech defect in which s is pronounced like th in thick and z is pronounced like th in this
(verb): speak with a lisp
(noun): a high-level computer programming language devised for list processing.
12:47:11
Shinmera
I'm not sure what you're telling me to do. I can't exactly shorten the definitions.
12:58:57
_death
for example, a bot could have a "personality" (changing every week? :) and pick a definition according to it..
13:01:46
Shinmera
That first example sounds awful, and the second one sounds very hard and prone to errors.
13:01:56
myrkraverk
Shinmera: iirc, you can set your own conversion routine, which is what I did in one project.
13:03:20
myrkraverk
In other news, apparently lldb can't print a variable if it's called "new" in C.
13:50:13
fourier
anyone about limitatons of SLY in contrast to SLIME? Just installed and it looks real good. Any reasons not to switch to it from SLIME?
13:51:10
makomo
Xach: i found this answer of yours https://stackoverflow.com/a/22796292 that references a dead link. web.archive also doesn't give me back anything
13:51:32
makomo
Xach: would this be the original paper? https://web.archive.org/web/20070204110210/https://common-lisp.net/project/movitz/files/movitz.pdf
13:51:48
makomo
(by the above web archive comment i was referring specifically to the link you gave in the answer)
14:40:21
beach
Hah! There was a bug in the incremental parser for Second Climacs. Once the bug fixed, the parser is 10 times as fast as we claimed in our ELS submission. For a buffer with 120 top-level forms, each 10 lines long, inserting and deleting an opening parenthesis at the beginning (this the worst-case scenario) takes less than 2ms for the parser to handle. And there are no doubt even more optimizations possible.
14:40:57
beach
So we will supply more and better benchmark results for the final version of the paper.