20:38:42drmeisterWith Common Lisp CFFI - what is the idiomatic way to allocate an array of characters that I can pass a pointer to a function that will fill it with a zero terminated string. I know the maximum length of the zero-terminated string.
20:43:00drmeisterThere is also foreign-string-alloc/foreign-string-free
20:43:10lacedaemonwith-foreign-pointer-as-string will do that, see the example in https://common-lisp.net/project/cffi/manual/html_node/with_002dforeign_002dpointer_002das_002dstring.html
23:15:25dimdrmeister: I had a weird dream/idea the other day with CL and the .Net platform wherein someone would do the same as you did with LLVM and clasp, only targeting the .Net IR thingy this time, so that you could have basically CL#
23:15:47dimI'm not sure if I should thank you for that too, adding to CANDO and clasp, but well ;-)
23:16:30dim(I also more interestingly showed CANDO to a bio drugs researcher in Germany)
23:17:07jackdanielI think that some ABCL fork targetted .net CLR
23:17:41dimIBCL or something yeah, I think, based on IKVM which is a Java layer for the CLR, and ABCL, I believe
2:16:49pjbDICTIONARY-FIND-WORD could be a high level linguistic operator. (word-case (make-word "Häuser")) -> :nominative can be a high level linguistic operation.
2:17:02pjbpaule32: data storage is no problem. Forget it.
2:17:04paule32search for the words in list (is in range - or so
2:18:21ThomasLewis[m]I would use a word class and a dictionary class with a hash table keyed to the word with the values being instances of word.
2:18:48pjbfor example. It doesn't matter what you use. What matters is what abstraction you're designing and using.
2:18:56ThomasLewis[m]You could even make the slots containing the hash tables indexed by letter, type, or whatever.
2:19:15pjbOnce you've defined an abstraction, you can change its implementation at will, therefore it doesn't matter if you use a a-list, a hash-table or noodles.