Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] newbie type problem
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-10-24 (08:21)
From: Dustin Sallings <dustin@s...>
Subject: Re: [Caml-list] newbie type problem

On Thursday, Oct 23, 2003, at 17:52 US/Pacific, David Brown wrote:

> You may want to consider putting the data for a given transaction type
> into its own type, and having that be the target of the hashtbl.
>    type transaction_info = {
>      mutable counts : int;
>      mutable times : int;
>    }

	That's exactly what I did, 'cept my time is a float.  :)

> Then your results could just be a
>    (int * (string, transaction_info) Hashtbl.t) list

	Well, part of the problem is that my log files aren't necessarily 
sequential, so I have to be able to go back to any point in time and 
update the thing.  Other than that, that's about right (from what I can 
read of that syntax so far).

> BTW, this actually seems like a good problem for learning the language.
> I seem to always choose things too difficult, and end up getting
> frustrated.

	It's still plenty foreign to me, but this is complex enough to help me 
out with a bunch of concepts in the language.  What amazes me is the 
lack of resources I've been able to find in ocaml so far (just 
googling).  It seems like caml's been around for a while, and it works 
quite well.

	I wrote these log processor things in python originally because I know 
it pretty well, but it doesn't run very fast.  In my early tests, ocaml 
and bigloo ran at roughly the same speed, and caml seems very foreign 
to me.  However, recently, I've had a few instability problems with 
bigloo under certain circumstances.  I rewrote that app in ocaml and it 
was many, many times faster and it worked more reliably.

> BTW, I have found the .mli files for the libraries to be the best
> documentation.

	Yeah, but I still couldn't figure out how to make a Map, assuming 
that's what I really wanted in the first place.  A hash table that 
iterates in key sorted order would make my app faster and reduce 
complexity.  I want to see it actually work first, though.  :)

SPY                      My girlfriend asked me which one I like better.
pub  1024/3CAE01D5 1994/11/03 Dustin Sallings <>
|    Key fingerprint =  87 02 57 08 02 D0 DA D6  C8 0F 3E 65 51 98 D8 BE
L_______________________ I hope the answer won't upset her. ____________

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: