libera/#commonlisp - IRC Chatlog
Search
21:51:52
engblom
pjb: I think hash table will be the best solution as then I only once need to specify the test function and the code will be easier to read.
21:53:49
pjb
engblom: but equal or equalp are very coarse. Good for strings, but for other keys (eg. vectors or arrays), you may want a more specific test.
22:05:22
engblom
pjb: As alexandria:plist-has-table does not recurse into the lists deeper in, it is not a problem. All the first level keys will be strings.
0:53:50
pdietz
IMO i's a good idea to look in alexandria or other such utility libraries (I like serapeum) for these sorts of things.
5:25:39
beach
phantomics: What would be the point of breaking backward compatibility for the very minor convenience to a very small number of users of Common Lisp?
8:05:28
hayley
I think I found the one good use for SIMPLE-BASE-STRING: one can scan at about 11 Gcharacters/second with BASE-CHAR, as opposed to "only" 4.7 Gcharacters/second with CHARACTER, because one can stuff more characters in a vector register.
8:47:53
hayley
Now that you mention it, I guess my Xorg.0.log nearly fits in L1 cache then (just 2KB short or so). Though I don't think I'm memory bound still.