Hello,
> The problem is that modules are resolved at compile-time, in addition to
> run-time, so there just can’t be circular dependencies.
It's true that a module couldn't depend, at compile-time, on a module
that was only available at run-time. However, I think we could handle
circular dependen
Hello!
The problem is that modules are resolved at compile-time, in addition to
run-time, so there just can’t be circular dependencies.
Besides, I think it’s generally a problem from an engineering viewpoint
when cycles are introduced.
So my feeling is that Guile should be able to detect cycles
Hello all,
I recently ran up against an issue about modules with circular
dependencies while working on PEG stuff. I reduced it to the following
test case.
Here is file "test-a.scm":
(define-module (test-a)
#:use-module (test-b))
(define-syntax hello
(syntax-rules ()
((hello) "Hello, wo
Hi Mark,
On Wed 09 Mar 2011 07:48, Mark H Weaver writes:
> Attached are two minimal C programs. Both create threads that do
> nothing but sleep for 2 seconds and then exit. The parent tries to join
> with the child thread, with a timeout of 10 seconds.
>
> The only difference is that test1 use
Thien-Thi Nguyen writes:
> () Mark H Weaver
> () Thu, 17 Mar 2011 21:38:28 -0400
>
>If we may assume that the searched string is valid UTF-8, and when only
>ASCII characters are excluded (e.g. "."), then three additional states
>are required in the generated DFA. Let us call them S1
Andy Wingo writes:
> The thing is that we need to be giving the C library strings encoded in
> the current locale, not the locale of any particular port, because
> that's how library functions will decode the strings internally -- take
> the regexec case, for example, recently fixed.
Agreed.
Lu
Hello Andy!
Andy Wingo writes:
> On Sun 06 Mar 2011 23:12, l...@gnu.org (Ludovic Courtès) writes:
>
>> Neil Jerram writes:
>>
>>> In principle, how should Guile 2.0 be cross-compiled? I'm thinking
>>> mostly of the part of the build that compiles all the installed modules.
>>
>> Guile 2.0 can
() Mark H Weaver
() Thu, 17 Mar 2011 21:38:28 -0400
If we may assume that the searched string is valid UTF-8, and when only
ASCII characters are excluded (e.g. "."), then three additional states
are required in the generated DFA. Let us call them S1, S2, and S3.
[handling these stat
