[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: What's the equivalent of `boundp' for lexical variables?
|
From: |
Alan Mackenzie |
|
Subject: |
Re: What's the equivalent of `boundp' for lexical variables? |
|
Date: |
Fri, 26 Jan 2024 20:58:05 +0000 |
Hello, Andreas.
On Fri, Jan 26, 2024 at 21:50:51 +0100, Andreas Schwab wrote:
> On Jan 26 2024, Alan Mackenzie wrote:
> > Is there such a facility for lexical variables, and if so what is it?
> A lexical variable can never be unbound.
A symbol might have a lexical binding, it might not. The problem is how
to test which one of these applies.
> --
> Andreas Schwab, schwab@linux-m68k.org
> GPG Key fingerprint = 7578 EB47 D4E5 4D69 2510 2552 DF73 E780 A9DA AEC1
> "And now for something completely different."
--
Alan Mackenzie (Nuremberg, Germany).
Re: What's the equivalent of `boundp' for lexical variables?, tomas, 2024/01/27