Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Hashtable, possible?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Lukasz Lew <ll189417@z...>
Subject: Re: [Caml-list] Hashtable, possible?



On Sun, 25 May 2003, Remi Vanicat wrote:

> Remi Vanicat <vanicat@labri.u-bordeaux.fr> writes:
> 
> > Lukasz Lew <ll189417@zodiac.mimuw.edu.pl> writes:
> >
> >> Hi.
> >> Is it possible to implement with camlp4, syntax for using hashtables like 
> >> arrays?
> >> I think about something like this:
> >>
> >> # let a = [{ }];;
> >> val a : ('_a, '_b) Hashtbl.t = <abstr>
> >>
> >> # a.{"foo"} <- 'f';;
> >> - : unit = ()
> >>
> >> I need only "yes" or "no" :)
> >
> > yes it is
> 
> well, you should use something else than [{ }] and a.{ ... } because
> they already have a meaning, but if you find something then yes you
> can.
thank you all.

So. If it is possibe, and there is such syntax for arrays, strings and 
bigarrays, so why there isn't any for hashtables?
I belive hashtables are more often used than bigarrays...

Lukasz Lew

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners