My opinions on the issues:
2.1: I very weakly prefer 2.1.7, NICKNAMED-PACKAGE-IF-SUCCESSFUL. If we're
going to return anything other than T, we might as well return the value
that carries the most information. But I doubt anyone will ever care,
though I agree that it should be standardized.
2.2
>
> It doesn’t surprise me that it’s not a “cleaned up CL” — isn’t it older
> than CL? Though I suppose it’s less ossified so could have evolved to be
> “newer.”
Hard to say, really. While the original Scheme development was in the late
1970s and the CL standardization effort didn't get going un
Hi all,
I am using Git to manage a CL project I am working on, and have noticed
that there is no predefined regular expression to pull out "hunk headers".
If you look at 'git diff' output, each hunk (sequence of consecutive lines
with differences noted) has a header line, which is intended to show
I don't understand when you say this is "not an issue that one runs into
writing in another language and associated ecosystem". AFAIK, in Java, you
can have only one version of a given package loaded into the JVM at any one
time. Am I missing something here?
-- Scott
On Wed, May 18, 2016 at 11:
Package-local nicknames always seem to me like a good idea, and I expect
that if I ever built something really large in CL they would sooner or
later become invaluable, but I have to confess that the number of times I
can recall actually using them is on the order of once or twice.
I don't think I
That reminds me of the time I did
(trace format)
That _did_ crash the LispM, very, very hard.
-- Scott
On Sat, Aug 2, 2014 at 8:52 PM, Steve Haflich wrote:
> OK, now I'm sitting in front of the front end of a computer rather than
> the back end of a smelly wet large long-haired dog.
>
> Th
On Sun, Apr 27, 2014 at 1:27 AM, Steve Haflich wrote:
> At some point on any modern OS, reading or writing
> to a socket stream will involve passing to the OS (generally via a thin
> user-mode C API layer like *nix read() and write(), or some socket
> analogue). Neither Lisp nor C will provide an
On Thu, Apr 24, 2014 at 11:44 PM, Steve Haflich wrote:
>
> On Thu, Apr 24, 2014 at 10:35 PM, Jean-Claude Beaudoin
> wrote:
>>
>> On Fri, Apr 25, 2014 at 12:31 AM, Scott L. Burson
>> wrote:
>>>
>>> I've long thought that was an oversight, thou
On Thu, Apr 24, 2014 at 7:29 PM, Steve Haflich wrote:
> Take for example aref, which might be used to
> extract octets of characters or whatever from a buffer. aref makes no
> guarantees even in safe code that it will signal bad array bounds.
I've long thought that was an oversight, though now t
On Wed, Apr 23, 2014 at 1:06 AM, Max Rottenkolber wrote:
>> From what I understand about the bug (I have not seen the code) it sounds
> like data length information
>> arrived both directly and indirectly in the client message and that a
> conflict between them was not
>> scrutinized.
>
> No. The
There is CL-STM. I haven't tried it, though, and know little about it.
If you do find a good STM library, you'll want a functional collections
library to go with it. This is for the same reason that Clojure uses
functional collections: you don't want to have to go outside the STM
framework to up
On Mon, Jan 23, 2012 at 5:18 AM, Burton Samograd
wrote:
> Hello,
>
> I am wondering if anyone can explain the reason for the defined
> but not used variable in setf that this code is experiencing:
I don't know for sure, but there are a couple of things that are odd
about your macro-writing macro.
On Fri, Dec 2, 2011 at 12:28 AM, Nikodemus Siivola
wrote:
> On 1 December 2011 23:12, Juan Jose Garcia-Ripoll
>
>> I _now_ think that the compiler macro processor should simply recognize the
>> failure to parse the form and return the original form, unprocessed
>
> I'm not convinced.
>
> Firstly,
On Thu, Dec 1, 2011 at 1:12 PM, Juan Jose Garcia-Ripoll
wrote:
> I _now_ think that the compiler macro processor should simply recognize the
> failure to parse the form and return the original form, unprocessed
I agree. Otherwise the compiler macro writer has to use &rest and
parse the argument
On Mon, Jun 13, 2011 at 12:18 PM, Daniel Weinreb wrote:
> Here are pros and cons of changing it that I can see.
> Pro: I's not a hash table in the small-cardinality case; it's a linear
> lookup. So the name is not actually accurate.
Yes it is! It's a hash table with one bucket.
But I prefer th
On Sun, Jun 12, 2011 at 1:17 PM, Gary King wrote:
> In the spirit of tooting my own horn, you might also want to see
> metabang-bind (http://common-lisp.net/project/metabang-bind).
I'm aware of it, thanks. I'm afraid I'm quite attached to my own LET
macro, of which I wrote the first version in
On Sun, Jun 12, 2011 at 7:00 AM, Daniel Weinreb wrote:
> I, myself, really dislike &aux.
>
> I don't even like
>
> (let (a b c) ...)
Agreed on both counts. &aux is just gross. Like LOOP :-)
As for read-only variables -- yes, it would have been nice if Lisp had
used ML-style references(*) from
One caveat, if you're going to do this kind of thing: be sure to bind
all the variables that control the printer (on the sending end) and
reader (on the receiving end) -- *package*, *print-base*, *read-base*,
etc.
Years ago I was working on a project on the Lisp Machines that
involved creating a p
On Wed, Apr 13, 2011 at 11:35 AM, Ryan Davis wrote:
> When working on a larger lisp code base, one with 10+ files in one package,
> I begin to get nervous about accidental name conflicts, and was wondering
> how other people deal with this.
I used to work on some large Lisp systems in a place whe
On Mon, Feb 14, 2011 at 2:43 AM, Samium Gromoff
<_deepf...@feelingofgreen.ru> wrote:
> I'm surprised that nobody has mentioned OMeta/ometa2 as of yet.
>
> It has this boolean functionality you speak of:
I wasn't familiar with it. Based on a quick glance I don't think it
can handle boolean grammar
On Fri, Feb 4, 2011 at 8:06 AM, Pascal J. Bourguignon
wrote:
>
> I would also note that given that context free languages include regular
> languages, there's also little theorical point in distinguishing a lexer
> from a parser: you can describe the tokens using normal grammar rules.
>
> space-or
On Thu, Feb 3, 2011 at 10:33 PM, Matthew D. Swank wrote:
> It seems (from my admittedly limited search) that this is not a common
> modification of yacc. Before I start bugging the maintainer about my
> changes, I want to know: am I abusing yacc?
I've had to do that kind of thing for parsing lan
On Thu, Feb 3, 2011 at 9:46 AM, Andrew Shalit wrote:
> If we're looking for an animal that's mastered the lambda calculus, clearly
> we should go with ouroboros.
A capital suggestion! I will use it on the Lisp-powered Web site I am
currently developing.
-- Scott
__
On Thu, Jan 27, 2011 at 6:19 AM, Didier Verna wrote:
>
> I just fell upon a case where implementations seem to differ on what to
> do. The question is how to interpret a format directive in which the
> last parameter is followed by a comma.
>
> I'm willing to report those divergences to the respe
I'd say I'm 70% imager, 30% filer. I usually save an image with
libraries I'm using, but then load more stuff on top of that when I
start.
-- Scott
___
pro mailing list
pro@common-lisp.net
http://common-lisp.net/cgi-bin/mailman/listinfo/pro
On Fri, Jan 14, 2011 at 8:42 AM, Daniel Weinreb wrote:
> If you have a function that is a predicate, in the sense that
> the function's contract says that its value should be interpreted
> as being either false or true, do you think it's better to code
> it so that it always returns "t" for the tr
On Wed, Jan 5, 2011 at 7:17 AM, Didier Verna wrote:
> Until now, I've been uncounsiously relying on something that the
> standard does not seem to specify: the fact that shared slots equipped
> with an initform are initialized before the first instance is created:
>
> (defclass test () ((slot :all
On Fri, Dec 17, 2010 at 11:16 AM, Ryan Davis wrote:
> We do something like this. For lisp websites my company makes, we have
> a password-protected admin section with some light UI to help us manage
> the site (turn logging levels up/down, clear caches, etc), and one of
> those tools is a "evalua
On Thu, Dec 2, 2010 at 3:20 PM, Peter Seibel wrote:
> My taste tells me that's an over-clever idiom and should not be used.
> If it's not clear that a function is for-effect without (values)
> you've already lost.
>
I can certainly see the argument that this information primarily belongs in
the
On Thu, Dec 2, 2010 at 3:00 PM, Daniel Weinreb wrote:
>
> From a purely emotional/historical point of
> view, I am not used to seeing these (values)
> forms, and they seem somewhat ugly and
> verbose. But that's just based on my own
> experience and should not carry much weight.
>
> I'd like to
[Sorry for the dup, Pascal. Meant to send this to the whole list.]
On Fri, Nov 26, 2010 at 5:36 AM, Pascal Costanza wrote:
> Did anybody see anything similar before? Any suggestions for improvement?
>
My `bcond' macro, which works closely with my `nlet' macro, attempts to
solve the same proble
On Tue, Nov 16, 2010 at 1:15 PM, Nikodemus Siivola <
nikode...@random-state.net> wrote:
> I *think* permutation vectors can be extended to accessors
> as well, but I don't know how commonly that is implemented (eg. SBCL
> at least currently doesn't)
Presumably the automatically generated methods
On Tue, Nov 16, 2010 at 2:22 AM, Pascal Costanza wrote:
>
> Note that it is always possible to have several accessors with different
> names. So you could define something like this:
>
> (defclass foo ()
> ((some-slot :reader official-slot-reader :accessor
> %internal-slot-accessor) ...))
>
>
I
33 matches
Mail list logo
