PascalAdt is a library of data structures and algorithms for Free Pascal inspired by the C++ STL library.
- STL-like class hierarchies of containers, iterators and functors.
- Automatic memory management for iterators.
- Dynamic array containers.
- Linked lists: singly linked, doubly linked and xor linked lists.
- Double-ended queues: circular and segmented.
- Search trees: AVL trees, splay trees, 2-3-trees.
- Hash tables: open and closed.
- Priority queues: binomial heaps.
- Sorting algorithms: quick sort, merge sort, shell sort, insertion sort.
- Selection algorithms: Hoare, Blum-Floyd-Pratt-Rivest-Tarjan.
- String algorithms: Knuth-Morris-Pratt, Boyer-Moore, Karp-Miller-Rosenberg.
- Sequence algorithms: binary search, interpolation seach, partition, merge, random shuffle, etc.
- Free Pascal.
- Linux (should work on other systems, but the installation and compilation scripts might need adjusting).
- C compiler to compile the MCP macro processor.
- Compilation:
make - Tests:
make test - Installation:
make install - Demo compilation:
make demo
PascalAdt documentation is available at the PascalAdt webpage. It includes a tutorial and the API documentation auto-generated from sources with the SrcDoc program.
See also docsrc/tutorial.txt and demo/customer/customer.pas.
Copyright (C) 2004-2024 Lukasz Czajka
Distributed under LGPL 2.1. See LICENSE.