Looking for a robust doubly linked list library and cannot find fcl-stl docs

[EricS]

Hi!

Rather than reinventing the wheel - my project is complicated enough as is -, I'd prefer to use an existing doubly linked list library to create some parse trees (not Pascal-related parsetrees and no existing lexer&parser tools or units are used). Ideally, it would be robust, well-tested and allow me to store records or objects.

I was looking for info on fcl-stl Generic container library, but couldn't find any docs. Do they exist?

Do you have any other suggestions?

Thanks in advance for replies!

[howardpc]

A possibility if you have Delphi and work on Windows is Julian Bucknall's EZDSL, see
http://boyet.com/FixedArticles/EZDSL.html
The basic package is at
http://boyet.com/Code/EZDSL303.ZIP
It would probably take very little effort to get it to compile with Lazarus (though I have not tried).
The library has a whole slew of data structures including doubly linked lists.

[Leledumbo]

I was looking for info on fcl-stl Generic container library, but couldn't find any docs. Do they exist?

In its source folder. Take that main.pdf if you can't generate the documentation yourself, I don't know if it's up to date, though.

[EricS]

Thanks I've found the docs. Apparently there is no generic doubly linked list anyway (at least not according to the docs), so I'll roll my own. But the stack and queue implementations in fcl-stl will come pretty handy.