Re: Git hunk header regex for CL

Option 3. seems the most reasonable to me. On Thu, 28 Mar 2024 at 07:49, Scott L. Burson wrote: > 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, e

Re: Password input in a console application

Thank you very much, works like a charm! On Sun, 12 Feb 2023 at 16:16, Raymond Wiker wrote: > > On 12 Feb 2023, at 11:47, Alessio Stalla wrote: > > Greetings everyone, > > is there a well-known way to do the thing in the subject, i.e. ask the > user for a password in

Password input in a console application

Greetings everyone, is there a well-known way to do the thing in the subject, i.e. ask the user for a password in a console application, reading from the keyboard without echoing anything to the terminal? Using a library is fine, SBCL only is fine, limited to some OS is not so fine but better than

Re: In CLOS, instance remorphing considered useless in practice?

On Wed, 9 Dec 2020 at 10:50, Jean-Claude Beaudoin < jean.claude.beaud...@gmail.com> wrote: > > > On Wed, Dec 9, 2020 at 3:59 AM Alessio Stalla > wrote: > >> About multithreading, *all *kinds of redefinition have an impact. If I >> redefine a widely-used, low-leve

Re: In CLOS, instance remorphing considered useless in practice?

About multithreading, *all *kinds of redefinition have an impact. If I redefine a widely-used, low-level function, with hundreds of call sites – will each thread immediately call the new one without the bug, or will some still call the old one? Again, imposing a proper order would require protectin

Re: Call for Interest: Clojure (or Lisp?) Code Camp with BLM focus

Perhaps this will change with a future JVM with Value Types and with a future ABCL making use of them, but at the moment, that's the sad story. On Thu, 3 Dec 2020 at 15:51, Pascal Costanza wrote: > We tested an implementation in Java, and the memory footprint of the JVM > is huge. Where C++, Com

Re: reading s-expressions from a file

Also I know about (but never used) Eclector https://github.com/robert-strandh/Eclector which I think can do what you're asking for. On Wed, Jun 26, 2019, 18:30 Luís Oliveira wrote: > On Wed, Jun 26, 2019 at 5:19 PM Alexandre Rademaker > wrote: > > The “read” function makes really easy to read a

Re: Common Lisp Blockchain - Scheme Coin

Well, that's a great idea! Il 19 dic 2017 11:36, "David McClain" ha scritto: It seems to me that, instead of performing totally useless computations for POW, a group like CERN might enlist the miners to search for W-Boson events from their detector trails, or astronomers might enlist the mining

Re: Prototype Based Programming in Lisp?

ABCL is older, yes. I can't look up the dates now, but it started as an embedded interpreter for the J editor surely more than a decade ago, and even when it became a standalone project I think Clojure was still in Rich's head at best. That said, ABCL never had even .1% of the community Clojure has

Re: Anyone interested in "package versioning"?

Indeed, the problem is present in popular languages used to write big systems comprising hundreds of dependencies and thousands of packages (namespaces). That is, Java, in my experience. The build system (Maven) does nothing to mitigate it; you have to resolve conflicts manually. Sometimes a very c

Re: Anyone interested in "package versioning"?

Can you elaborate on that? The stance on packages found in the mentioned Quora post is based on the old misconception about packages being modules, or "software packages" in the Linux distribution sense. They're not. They are really just namespaces, containers of symbols. So it does not make any s

Re: Naming suggestions

FSET uses 'lookup', also abbreviated to @. On 5 February 2016 at 08:35, Vsevolod Dyomkin wrote: > In rutilsx I have called generic access operator ? - see here: > https://github.com/vseloved/rutils/blob/master/contrib/generic.lisp > It allows the accessor code to stand up a bit, which I consider

Re: Package extensions usage

t gets accepted. Alessio On Thu, Dec 31, 2015 at 9:35 AM, Antoniotti Marco < antoniotti.ma...@disco.unimib.it> wrote: > > > On Dec 30, 2015, at 23:47 , Svante v. Erichsen > wrote: > > > > Hi! > > > > On 2015-12-30 00:52:27+0100, Alessio Stalla wrote: > &g

Package extensions usage

Hi everyone, I'd like to run a little poll among experienced Lisp developers. The topic is the usage in the wild of the extensions to the package system provided by various implementations. My apologies to people who are subscribed to the ABCL mailing list, where some time ago I submitted the same

Re: Do symbols need to be EQ?

In general it is a n-to-1 relationship, n >= 0. A symbol has always a name but it can have either no home package or one home package, and additionally there can be any number of packages in which it is accessible. You have to think three-dimensionally ;) yes, two symbols with the same name in the

Re: Do symbols need to be EQ?

Package = map from symbol name to symbol object. INTERN ~= (or (gethash ...) (setf (gethash ...))) UNINTERN ~= remhash There's nothing special about symbols. You'd get the same effect with a map of constants and operations to add/remove them from the map. On Fri, Jul 3, 2015 at 10:56 AM, Kenneth

Re: macro returning more than one form

On Tue, Mar 18, 2014 at 8:54 PM, Paul Tarvydas wrote: > @All, thanks for the interesting discussion. Certainly gives me something > to chew on. > > Re-reading the responses, I see that, while I did sort-of say it, I didn't > emphasize the point of this: > > I have a PEG-syntax parser written in e

Re: macro returning more than one form

On 14 Mar 2014 19:47, "Paul Tarvydas" wrote: > > On 14-03-14 12:57 PM, Pascal J. Bourguignon wrote: > > I'm writing diagram-compilers that emit CL. It seems to me that each emitted lump of code should be in it's own package. Am I thinking about this "wrong"? It's not wrong to have each piece of

Re: macro returning more than one form

At the top level, PROGN is treated as if each contained expression appeared at the top level. So generally wrapping a PROGN around the result is precisely what you need to do. However, since I see an IN-PACKAGE form in your example... beware that that IN-PACKAGE form will NOT affect the following

Re: ASDF walkthrough

On Fri, Jan 3, 2014 at 8:13 AM, Faré wrote: > Dear Lisp hackers, > > I'm considering recording a walk through the ASDF sources. > > I'd like to have an interactive session over Google Hangout > with one or a few people, explaining the current code in asdf/defsystem > (i.e. not going into uiop, ex

Re: :DBG

; Dis donc, francois, how did you handle source that might be a good-sized > little sexpr? > > -- His Professionalness > > > > On Mon, Nov 18, 2013 at 3:44 AM, Alessio Stalla > wrote: > >> Well, Faré is obviously well aware of that, and has given an explanation >> for w

Re: :DBG

ings "should" be done on the Lisp community. > > I have already considered removing asdf completely from my workflow in the > past. If asdf starts to mess with such fundamental rules for allowing > indepently developed code to coexist, then it will be the final blow for me. >

Re: :DBG

Well, Faré is obviously well aware of that, and has given an explanation for why he is willing to "break the rules" this particular time. So "don't dare touch the keywords package!" does not seem the right answer to me... Faré, I understand your points, what fails me is: if this is a debug macro no

Re: setf not working

On Thu, Oct 3, 2013 at 10:13 AM, Didier Verna wrote: > Willem Broekema wrote: > > > The value that is assigned, that is the problem. That is probably a > > modified literal list. > > You're absolutely right. I hadn't realized it but I was doing exactly > that: > > > http://stackoverflow.com/qu

Re: setf not working

This sounds really weird. Are you providing the full (setq) form to those macros, or the var and value separately? The fact that '(0 0) does not work but (list 0 0) does smells like there's some compiler macro triggering on (constantp value). On Thu, Oct 3, 2013 at 8:48 AM, Didier Verna wrote:

Re: [pro] #; comments...

On Tue, May 8, 2012 at 7:41 PM, Faré wrote: > Is the point to evolve the Common Lisp standard into some kind of CLtL4, Huh? Did I miss a CLtL3...? On topic: the proposed syntactic addition is nice, but imho too trivial and too easily provided as a library to bother with a CDR (that would need to

Re: [pro] Lisp and DSLs

On Wed, Jul 20, 2011 at 9:21 PM, Martin Cracauer wrote: > I find that people have a wrong impression of what it means to have a > domain specific language. > > For me, one of the greatest advantages of Lisp is literal data in > code.  I don't have to write a complicated parser for some external >

Re: [pro] Lisp and DSLs

On Wed, Jul 20, 2011 at 3:32 PM, Didier Verna wrote: > >  Dear friends, > > I'm starting to write a chapter for an upcoming book on domain specific > languages. The chapter is called (tentatively): > > Extensible languages -- blurring the distinction between DSLs and GPLs > > GPL meaning General P

Re: [pro] why :key arguments?

On Mon, Jul 4, 2011 at 3:09 PM, Pascal J. Bourguignon wrote: > Nikodemus Siivola > writes: > >> On 4 July 2011 14:46, Stas Boukarev wrote: >> >>> * They can't be used with APPLY or FUNCALL. >> >> Actually, they can be used with FUNCALL. >> >> (Otherwise, I echo pretty much everything that Stas s

Re: [pro] "fhash"

On Wed, Jun 29, 2011 at 12:06 AM, Daniel Weinreb wrote: > Hi.   I read Christophe's paper on extensible sequences.  I don't think > this bears on my new package, though, for two reasons: > (1) it's only about sequences; maps don't fit into its framework. Yes, I was aware of that; I suggested the

Re: [pro] "fhash"

On Tue, Jun 14, 2011 at 3:38 PM, Daniel Weinreb wrote: > Could you tell me where to find that?  Thanks. -- Dan The paper - titled "User-extensible sequences in Common Lisp" by C. Rhodes - can be found for example here:

Re: [pro] "fhash"

On Tue, Jun 14, 2011 at 9:37 AM, Marco Antoniotti wrote: > > On Jun 13, 2011, at 21:18 , Daniel Weinreb wrote: > >> Friends, >> >> I wrote a little package for "fash hash tables", which provide an >> abstraction that is analogous to that of Common Lisp hash tables, but >> is faster for tables with

Re: [pro] Lisp 2's and function values.

On Wed, May 25, 2011 at 9:40 PM, Marco Antoniotti wrote: > Hi > I don't think there is a reasonable objection to forbid a form like > ((returns-something-funcallable arg1 arg2 ... argN) 1 2 3 ... N) > from "working as expected". Me neither ;) > As Martin pointed out, if the return value of > the

Re: [pro] Lisp 2's and function values.

On Wed, May 25, 2011 at 4:45 PM, Matthew Swank wrote: > Pascal Costanza writes: > >> >> >> On 25 May 2011, at 04:51, Matthew D. Swank wrote: > >> > However, consider the following: >> > >> > ((returns-a-function) arg arg ...) >> > >> > Would it be reasonable to allow this as a legal form as well?

Re: [pro] definitional home

On Mon, Mar 28, 2011 at 10:24 PM, Mark H. David wrote: > Yeah, that would be great.  We had a bit of a discussion of this sort of > functionality on the slime-devel mailing list. > Nobody had any easy answers, even for just SBCL and CCL, which I would > have settled for. > It was also pointed out

Re: [pro] Common Lisp Library for MS Word files (.doc or .docx)?

On Tue, Mar 1, 2011 at 12:46 AM, Mark H. David wrote: > Does anyone know of any CL libraries for dealing with Microsoft Word files? > Tools for creating them, reading from them, parsing them, converting > them to plain text or other formats, things like that? > Thanks, > -Mark I know some time ag

Re: [pro] Learning Lisp the Bump Free Way

On Fri, Jan 21, 2011 at 8:34 PM, Nick Levine wrote: >> I can't find any libraries. > > I think this is one of the most serious issues which is blocking the > growth of lisp use. Speaking as someone who recently gave up trying to > write a book on how to use CL's libraries: locating them and knowin

Re: [pro] Learning Lisp the Bump Free Way

On Thu, Jan 20, 2011 at 5:43 PM, Martin Cracauer wrote: > Alessio Stalla wrote on Thu, Jan 20, 2011 at 05:38:03PM +0100: >> On Thu, Jan 20, 2011 at 5:04 PM, Alexander Repenning >> wrote: >> > One point made: >> > >> >> It?s probably faster than most

Re: [pro] Learning Lisp the Bump Free Way

On Thu, Jan 20, 2011 at 5:04 PM, Alexander Repenning wrote: > One point made: > >> It’s probably faster than most dynamic languages. > > is still mostly true but as I am tracking the speed of JavaScript versus > Common Lisp I can see a scary performance cross over point > in the near > future (m

Re: [pro] macros expanding to defclass + some mop code

On Mon, Dec 27, 2010 at 3:28 PM, Sam Steingold wrote: > On Mon, Dec 27, 2010 at 2:02 AM, Pascal Costanza wrote: >> On 27 Dec 2010, at 04:37, Sam Steingold wrote: >>> I want to write a macro which would expand to a defclass + some code >>> which uses the resulting class object using mop. >>> e.g.