Gambit-list Octobre 2012

gambit-list@iro.umontreal.ca

11 participants
15 discussions

Blackhole and Windows
by Tomi Neste 09 Oct '12

09 Oct '12

When trying to compile a simple test file with Blackhole under Mingw/MSys I get ~ $ bh compile foo.scm gcc: error: foo-rt.c: No such file or directory gcc: fatal error: no input files compilation terminated. gcc: error: foo-ct.c: No such file or directory gcc: fatal error: no input files compilation terminated. gcc: error: foo-vt.c: No such file or directory gcc: fatal error: no input files compilation terminated. gcc: error: foo-mi.c: No such file or directory gcc: fatal error: no input files compilation terminated. gcc: error: foo.o1.c: No such file or directory gcc: fatal error: no input files compilation terminated. Any clues? Also when trying to compile the BH with --enable-single-host'ed Gambit I ran out of memory, is that to be expected? ISTR it has worked in the past... Without --enable-single-host it compiles just fine though. -- tomppa

2 4

Re: [gambit-list] question on symbol completion
by REPLeffect 08 Oct '12

08 Oct '12

On Sat, Oct 6, 2012 at 10:21 PM, REPLeffect <repleffect(a)gmail.com> wrote: > What would it take to expose a procedure in the interpreter for > completing symbols in the symbol table. What I mean is, I'd like a > scheme procedure I could call with a string representing either a full > or a partial symbol, and the procedure would give me back a list of > the possible completions for currently defined symbols. > > Essentially I want a procedure that does what the tab completion in > the interpreter's REPL does. > > I'm using the partially-implemented swank backend that James Long was > working on a while back, and I found these procedures that Marc posted > to the list back in March of '09: > > (define (symbol-table->list st) > > (define (symbol-chain s syms) > (let loop ((s s) (syms syms)) > (if (symbol? s) > (loop (##vector-ref s 2) (cons s syms)) > syms))) > > (let loop ((lst (vector->list st)) (syms '())) > (if (pair? lst) > (loop (cdr lst) (symbol-chain (car lst) syms)) > (reverse syms)))) > > (define (interned-symbols) > (symbol-table->list (##symbol-table))) > > (pp (length (interned-symbols))) > > (that was from this post: > https://mercure.iro.umontreal.ca/pipermail/gambit-list/2009-March/003308.ht… > ) > > >From that I cobbled together a very inefficient hash-table-based tab > completion (especially inefficient because of duplicating the entire > symbol table in a hash table, one key per symbol). I realize this is > a complete kludge and wastes tremendous amounts of memory. I'd like > to do it right and just query the symbol table itself, since the data > is obviously already there. > > I found the complete_word(), lineeditor_word_completion(), and > visit_symbol() functions in os_tty.c, and I'm sure that the solution > is to write a similar set of C functions to act as a scheme interface > to do what I want. However, I suspect I don't understand the code > well enough at this point to do that correctly. > > I'd be willing to give it a shot if I thought I had a sufficient > quantity of tips on how to get it done (I started to say 'pointers' on > how to get it done, but I suspected that would only lead to a long > string of programmer jokes that might derail this thread :-D ). > > It seems to me that this would be a good thing to have available for > any application that might embed Gambit and/or communicate with a > process running the Gambit interpreter. I don't think the > applicability would be in any way limited to slime/swank (though, > admittedly, that is my primary motivation for having it). > > REPLeffect > _______________________________________________ > Gambit-list mailing list > Gambit-list(a)iro.umontreal.ca > https://webmail.iro.umontreal.ca/mailman/listinfo/gambit-list Sorry about that, no subject on the previous email. I thought Gmail warned you before sending without a subject, but it didn't warn me this time. REPLeffect

2 2

(no subject)
by REPLeffect 06 Oct '12

06 Oct '12

What would it take to expose a procedure in the interpreter for completing symbols in the symbol table. What I mean is, I'd like a scheme procedure I could call with a string representing either a full or a partial symbol, and the procedure would give me back a list of the possible completions for currently defined symbols. Essentially I want a procedure that does what the tab completion in the interpreter's REPL does. I'm using the partially-implemented swank backend that James Long was working on a while back, and I found these procedures that Marc posted to the list back in March of '09: (define (symbol-table->list st) (define (symbol-chain s syms) (let loop ((s s) (syms syms)) (if (symbol? s) (loop (##vector-ref s 2) (cons s syms)) syms))) (let loop ((lst (vector->list st)) (syms '())) (if (pair? lst) (loop (cdr lst) (symbol-chain (car lst) syms)) (reverse syms)))) (define (interned-symbols) (symbol-table->list (##symbol-table))) (pp (length (interned-symbols))) (that was from this post: https://mercure.iro.umontreal.ca/pipermail/gambit-list/2009-March/003308.ht… ) >From that I cobbled together a very inefficient hash-table-based tab completion (especially inefficient because of duplicating the entire symbol table in a hash table, one key per symbol). I realize this is a complete kludge and wastes tremendous amounts of memory. I'd like to do it right and just query the symbol table itself, since the data is obviously already there. I found the complete_word(), lineeditor_word_completion(), and visit_symbol() functions in os_tty.c, and I'm sure that the solution is to write a similar set of C functions to act as a scheme interface to do what I want. However, I suspect I don't understand the code well enough at this point to do that correctly. I'd be willing to give it a shot if I thought I had a sufficient quantity of tips on how to get it done (I started to say 'pointers' on how to get it done, but I suspected that would only lead to a long string of programmer jokes that might derail this thread :-D ). It seems to me that this would be a good thing to have available for any application that might embed Gambit and/or communicate with a process running the Gambit interpreter. I don't think the applicability would be in any way limited to slime/swank (though, admittedly, that is my primary motivation for having it). REPLeffect

1 0

is this a problem in my code?
by Álvaro Castro-Castilla 04 Oct '12

04 Oct '12

Hi! I'm trying to figure out a parallel implementation of for-each (I'm going to use it for spawning system processes mostly). Anyway, the problem is like this: If I use any kind of recursion inside the thread created in the (new-thread) proc, I get this error: *** ERROR IN for-each -- Uncaught exception: #<type-exception #31> (thread-join! '#<thread #32>) As soon as I remove the call to (recur) (it would happen also with letrec for instance), it works as expected. I really don't understand how internal recursion in the thread could yield this error. Thanks for your help (define (parallel-for-each f l #!key (max-thread-number 2)) (let* ((pending-jobs l) (jobs-mutex (make-mutex)) (available-jobs? (lambda () (mutex-lock! jobs-mutex) (let ((more? (not (null? pending-jobs)))) (mutex-unlock! jobs-mutex) more?))) (next-element (lambda () (mutex-lock! jobs-mutex) (let ((next (car pending-jobs))) (set! pending-jobs (cdr pending-jobs)) (mutex-unlock! jobs-mutex) next))) (results '()) (results-mutex (make-mutex)) (add-to-results! (lambda (r) (mutex-lock! results-mutex) (set! results (cons r results)) (mutex-unlock! results-mutex)))) (let ((new-thread (lambda () (thread-start! (make-thread (lambda () (let recur () (add-to-results! (f (next-element))) (if (available-jobs?) (recur) (thread-yield!))))))))) (let do-times ((n 0) (thread-pool '())) (if (< n max-thread-number) (do-times (++ n) (cons (new-thread) thread-pool)) (for-each thread-join! thread-pool)))) (reverse results)))

1 0

Can't clone gambit
by Bradley Lucier 01 Oct '12

01 Oct '12

Am I doing something wrong here? banach-200% git clone https://github.com/feeley/gambit.git Initialized empty Git repository in /export/users/lucier/programs/gambit/.git/ fatal: https://github.com/feeley/gambit.git/info/refs download error - The requested URL returned error: 403 Brad

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Gambit-list Octobre 2012