Re: Using Grace.Lists.Unbounded in WindowsXP/GNAT3.15p

[mheaney@on2.com (Matthew Heaney)]

"Frank" <franjoe@frisurf.no> wrote in message news:<3e705a78$1@news.wineasy.se>...
> 
> The big picture(but not fully coded in this example):
> What I want to achieve is to be able to traverse a list, and based on
> information in the
> node, decide to remove it from the current position in the list and reinsert
> it at the end.
> This is done to postpone the calculation of the Node until all other Nodes
> have been calculated.

You said you're using GRACE, but here's how you'd do it in Charles:

procedure Op (List : in List_Subtype) is
   I : Iterator_Type := First (List);
   J : constant Iterator_Type := Back (List);
begin
   while I /= J loop
      declare
         E : Element_Subtype renames To_Access (I).all;   
      begin
         if Predicate (E) then
            Splice (List, Before => J, Iterator => I);
            return;
         end if;
      end;

      I := Succ (I);
   end loop;
end Op;

http://home.earthlink.net/~matthewjheaney/charles/