Hi,
I'm new to this list, so please excuse me if I make some mistake...
I recently transitioned from FORTRAN77 under DOS to Fortran9X under
Windows and I like very much the new functionalities.
I would like to build a library of reusable list, tree, queue, stack
data structures that I noticed I will need in implementing some
computational geometry algorithms. I would like to implement something
like
TYPE List2link_node
TYPE (generic) :: node_payload
TYPE (List2link_node), POINTER :: back, front
END TYPE List2link_node
without having to rewrite/adapt all list (tree, queue, stack...)
processing routines to suit the payload type, as I have currently
envisioned. The top would be to be able to store different object in
the same data structure, but this is not a requirement.
Playing with memory address will probably do the magic, but I would like
to stay with the standard as much as possible.
I heard of Booch Components, but I was able to find only an Ada 95
implementation, that seem to me really hard to translate into Fortran.
Any suggestion, including links to software, book, Internet-available
report on this subject will be highly appreciated.
I apologize for the long message. Many thanks in advance.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|