Mike Gran writes:
> I've been looking over one of the solutions to a Guile 100 problem
> (a basic version of the `ls' command) at the link below. It is
> interesting stylistically because it works very hard at minimizing the
> scope of procedures. It uses a lot of procedures within procedures,
>
Hello,
I haven't thought about this whole email, but I disagree with this part of
your response:
On Thu, Apr 4, 2013 at 8:17 PM, Daniel Hartwig wrote:
> Hash tables are not just a set of (key, value) pairs, they also
> include the particular hash and equality procedures that are used with
> the
On 4 April 2013 20:06, Panicz Maciej Godek wrote:
> There are, however, situations, when one wants to have an ordered set,
> and it's good to have choice. Clojure, for instance, offers such choice, and
> from the perspective of a programmer it's better to have a choice.
>
Note that Scheme provide
On 5 April 2013 06:21, Taylan Ulrich B. wrote:
> Panicz Maciej Godek writes:
>
>> Plainly, the size is kept in the internal representation of the hash
>> table:
>>
>> typedef struct scm_t_hashtable {
>> unsigned long n_items; /* number of items in table */
>> ...
>>
>> cf.
>> http://git.savannah.
Thank you both for the comments.
I must admit that I got kind of lost and I ended up not knowing if you
had any specific suggestions for guile-json. It is my very first guile
(scheme) package and I am pretty new to scheme.
>From what I understood, the main concerns were:
1. Hash tables might not
Panicz Maciej Godek writes:
> Well, I see why the representation based on hash tables is adequate
> for JSON. There are, however, situations, when one wants to have an
> ordered set, and it's good to have choice. Clojure, for instance,
> offers such choice, and from the perspective of a programme
Hello Jan,
> - (if (not (null? args))
> + (when (not (null? args))
I did not 'check' your patch, but reading it very quickly I have a 2c
suggestion :)
(unless (null? args) ...
Cheers,
David
If not so, I've sent a patch to get hash-size and hash-items directly.
Maybe it's still useful.
> One could look at using lots of procedures within procedures as good
> defensive programming style: hiding unnecessary functions.
Here is a related part of SICP [1] which describes this approach.
[1] https://mitpress.mit.edu/sicp/full-text/book/book-Z-H-10.html#%_sec_1.1.8
(Internal definition
2013/4/4 Taylan Ulrich B.
> Panicz Maciej Godek writes:
>
> > - firstly, guile's hash tables are maps, not dictionaries, so they are
> > insensitive to order. This behaviour is desired if we want to use them
> > to represent sets or maps; however, PHP arrays, and -- as I presume --
> > JavaScrip
Panicz Maciej Godek writes:
> - firstly, guile's hash tables are maps, not dictionaries, so they are
> insensitive to order. This behaviour is desired if we want to use them
> to represent sets or maps; however, PHP arrays, and -- as I presume --
> JavaScript objects -- store the information abou
Hi!
I'm glad that you've made a great piece of work to integrate guile with the
rest of the world. I see you implemed it using guile's hash tables and
lists, which seems sound.
The problem lies within the way guile deals with hash tables. Actually,
there are several problems that need to be address
Hi,
I suggest these patches. Until then, I'm using inheritance and define
one signal per class.
Greetings, Jan
>From e06d6364c5776183a98a4e69d34d237736388327 Mon Sep 17 00:00:00 2001
From: Jan Nieuwenhuizen
Date: Thu, 4 Apr 2013 10:56:57 +0200
Subject: [PATCH 1/2] gobject: also loop args after
Ian Price skribis:
> Sometimes_ I do it because I know Guile can inline it if it is an inner
> define (naughty, naughty).
Same, and also for clarity.
Ludo’.
14 matches
Mail list logo
