|novaburst||do you guys know anything about this http://christian.jullien.free.fr/|
i'm wondering if it was available on a specific platform, if it would help me port some Common Lisp implementations over?
|jsnell||an islisp implementation is unlikely to help port a CL implementation|
if you need a CL to bootstrap the CL implementation you're intending to port, you should be able to cross-compile from some other platform
|novaburst||okay, thank you, good to know|
|a1k0n||ok, this is driving me crazy. why don't you die, auto-flush-thread?|
|jcowan||Does anyone know what the internal representation of strings looks like in SBCL if the :SB-UNICODE feature is on? The SBCL-internals doesn't say, merely that strings can contain any Unicode codepoint.|
|jsnell||for a (vector character), that is. for a base-string it's octets with the high bit 0|
|jcowan||But there is no guarantee that either CHAR or SCHAR is O(1), right?|
|jsnell||yes, there is. it's a fixed-width representation|
|rudi||not per the standard, but implementing it in other ways would be utter madness|
|action||rudi dimly recalls arguments about using utf-8 as internal representation which were shot down because of non-O(1)ness|
|rudi||dimly recalls arguments about using utf-8 as internal representation which were shot down because of non-O(1)ness|
|jcowan||"Per the standard" is what I meant.|
Kudos to the C++ STL, which tells you the time and space complexity of standard functions.
|rudi||the standard doesn't say anything about algorithmic complexity, no|
|redwyrm||I'm trying to invoke the debugger when a function is called (i.e., before it executes any code in the function). is there a way to accomplish this in SLIME?|
|rudi||hmm, insert a (break) as first form?|
|jsnell||it's not something that slime does. depending on your implementation, there might be better ways than changing the source|
|redwyrm||the source is read-only|
|jsnell||e.g. (trace foo :break t) in sbmucl|
|redwyrm||ok, I'll try that :)|
|eructate||i would advise advice =)|
|slyrus||yay. MORE RAM|
|rudi||how much is more?|
|slyrus||4 gb more. in theory. looks like I did something wrong though.|
|rudi||MORE SCREEN here - I grovelled for the unused 24" cinema display at the other desk :)|
|Modius||Stylistically, is a function that returns a (lookup) value based on a passed-in symbol,e.g. (funcall my-thing 'last-name), ever used in place of structs for const-only access?|
Was just wondering if this "pattern" (lookups behind functions) has much use, or if it's something that lisp programmers at large categorize in some way.
|Zhivago||modius: think of it instead as an accessor.|
modius: usually accessors are of the form kind-attribute
so, elephant-colour, etc
how these accessors is implemented is considered an implementation detail.
|Modius||That's off the struct|
a struct is an implementation detail
it will produce accessor functions which you can use as (or to implement other) accessors.
|Modius||Okay, that's the pattern that happens to be used by the struct macros to make accessor functions|