🚀 go-pugleaf

In article <1130@PT.CS.CMU.EDU> edw@IUS1.CS.CMU.EDU (Eddie Wyatt) writes:
>  In particular if you want generalized iteration say in C, its
>a simple matter of defining an iteration function for that particular
>data type.  Provide it a reset flag to start iteration,
>either a static var or extra field in the data type representing
>the current object and some termination object.
>
>    for (object = iter_func(data_struct,START); 
>	 object != TERMINATOR;
>	 object = iter_func(data_struct,NEXT)) {....}
>

I have also wrestled with implementing generalized iteration in C.
Eddie's solution is, I think, too restrictive, in that it prevents
one iterator to begin while another is in progress.  For example,
consider an iterator over a tree, used in a C for loop.  The loop
body may call some function that also needs to iterate over all
nodes in the tree.  

My solution (not original, I'm sure) is to provide the following
iterator functions for a data abstraction:

    x_ptr = first_x(abs, int_ptr)
    x_ptr =  next_x(abs, int_ptr)

Where 
    abs      is a data abstraction
    int_ptr  is a pointer to an integer, modified only by first_x() and next_x()
    x_ptr    is a pointer to an element of abs

A null object is returned by first_x() (or next_x()) when there is no
first (or next) object.  The variable 'int_ptr' is used by the iterator
to indicate a position in the data abstraction.

For example:

    for (node = first_node(tree, &i); node != NULL_NODE; node = next_node(tree, &i)) {
	    node_func(node);
    }

Sometimes it is easier to provide a function that traverses all
elements of a data abstraction, applying a given function to each
element.  So the previous example would become:

    tree_apply(tree, node_func);


-- 
Glenn Bruns 
MCC, Software Technology Program
arpa: bruns@mcc.com    
uucp: {seismo,harvard,gatech,pyramid}!ut-sally!im4u!milano!bruns