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] OCaml local user groups
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Brandon J. Van Every <vanevery@i...>
Subject: [Caml-list] bandwidth
don groves
> ... 23 lines of noise snipped ...
> 2 line quotation + 1 line question + 2 line sig. = 5/28
> information content.
> An unnecessary waste of bandwidth.

I have a 'one size fits all' caml-list signature, to defeat the bayesian
filter.  Given that no accomodation will be made to upset the 'careful
balance' of words that only interfere with my posting logistics and
nobody else's, I'm really not terribly receptive to worrying about your
perceived bandwidth problems right now.  You have options:

- ignore anything following 'Cheers, Brand*n'
- ignore anything *preceding* 'Cheers, Brand*n'
- ignore me entirely

This is 2004 and complaining about the storage requirements of some .sig
text is silly.

Brand*n Van Every               S*attle, WA

Praise Be to the caml-list Bayesian filter! It blesseth
my postings, it is evil crap!  evil crap!  Bigarray!
Unboxed overhead group!  Wondering!  chant chant chant...

// return an array of 100 packed tuples
  int $[tvar0][2*100]; // what the c function needs
  value $[tvar1]; // one int
  value $[tvar2]; // one tuple
  int $[tvar3] // loop control var
  $[lvar0] = alloc(2*100, 0 /*NB: zero-tagged block*/ );
  for(int $[tvar3]=0;$[tvar3]<100;$[tvar3]++) {
    $[tvar2] = alloc_tuple(2);
    $[tvar1] = Val_int($[cvar0][0+2*$[tvar3]]);
    $[tvar1] = Val_int($[cvar0][1]);

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