Re: [Caml-list] Generation of streams is slow

["Alexander V. Voinov" <avv@quasar.ipa.nw.ru>]

[-- Attachment #1: Type: text/plain, Size: 723 bytes --]

Hi Daniel,

Daniel de Rauglaudre wrote:
> 
> Hi,
> 
> On Fri, Jul 13, 2001 at 03:06:15PM -0700, Alexander V. Voinov wrote:
> 
> > I've run the following program and found it to be extremely slow. Why?
> 
> To be optimized, streams and parsers must be preprocessed by Camlp4.
> If they are not, their code is longer, not tail recursive and can be
> very very slow indeed.
> 
> Compile you file with the option -pp camlp4o.

Yes, the difference is substantial, but it gets longer and longer anyway
with more elements parsed (for a slightly more complex program, which
parses the stream as it is generated) and crashes at some point.

I've attached the program (change parse_stream to parse_stream' and vice
versa).

Alexander

[-- Attachment #2: test_streams.ml --]
[-- Type: text/plain, Size: 1065 bytes --]

open Printf

let gen_stream n =
  let rec gs i n =
    if i = n then begin
      printf "making last element of the stream\n"; 
      flush stdout;
      [< 'n >]
    end
    else begin
      if i mod 1000 = 0 then begin
	printf "making next element of the stream: %d\n" i; 
	flush stdout
      end;
      [< 'i; (gs (i+1) n) >] 
    end 
  in
  gs 1 n
	
let rec print_list = function
    []   -> printf "[]\n"
  | h::t -> printf "%d::" h; 
            print_list t

let rec parse_stream s =
  match s with parser
    [< 'i; s' >] -> begin 
      
      if i mod 1000 = 0 then begin
	printf "picked element %d\n" i; 
	flush stdout
      end; 
      
      i::(parse_stream s')
    end
  | [< >] -> (printf "end\n"; flush stdout; [])

let rec parse_stream' s =
  match s with parser
    [< 'i; tail = parse_stream' >] -> begin 
      
      if i mod 1000 = 0 then begin
	printf "picked element %d\n" i; 
	flush stdout
      end; 
      
      i::tail
    end
  | [< >] -> (printf "end\n"; flush stdout; [])

let _ = 
  print_list (parse_stream' (gen_stream 700000))