{"id":19351563,"url":"https://github.com/lukaszcz/pascaladt","last_synced_at":"2026-02-28T22:02:16.697Z","repository":{"id":92465538,"uuid":"410385597","full_name":"lukaszcz/pascaladt","owner":"lukaszcz","description":"A library of algorithms and data structures for the Free Pascal Compiler.","archived":false,"fork":false,"pushed_at":"2024-08-10T17:12:14.000Z","size":396,"stargazers_count":6,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-02-27T03:58:49.977Z","etag":null,"topics":["2-3-tree","abstract-data-structures","algorithms","avl-tree","boyer-moore","delphi","hash-table","karp-miller-rosenberg","knuth-morris-pratt","pascal","priority-queue","splay-tree"],"latest_commit_sha":null,"homepage":"","language":"Pascal","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"lgpl-2.1","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lukaszcz.png","metadata":{"files":{"readme":"README.md","changelog":"NEWS","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-09-25T21:28:05.000Z","updated_at":"2025-03-15T20:26:12.000Z","dependencies_parsed_at":"2025-01-06T15:48:18.491Z","dependency_job_id":"697502ba-7219-4b36-bc50-890a2fe863da","html_url":"https://github.com/lukaszcz/pascaladt","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/lukaszcz/pascaladt","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lukaszcz%2Fpascaladt","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lukaszcz%2Fpascaladt/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lukaszcz%2Fpascaladt/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lukaszcz%2Fpascaladt/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lukaszcz","download_url":"https://codeload.github.com/lukaszcz/pascaladt/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lukaszcz%2Fpascaladt/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29953212,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-28T18:42:55.706Z","status":"ssl_error","status_checked_at":"2026-02-28T18:42:48.811Z","response_time":90,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["2-3-tree","abstract-data-structures","algorithms","avl-tree","boyer-moore","delphi","hash-table","karp-miller-rosenberg","knuth-morris-pratt","pascal","priority-queue","splay-tree"],"created_at":"2024-11-10T04:36:37.443Z","updated_at":"2026-02-28T22:02:11.686Z","avatar_url":"https://github.com/lukaszcz.png","language":"Pascal","funding_links":[],"categories":[],"sub_categories":[],"readme":"[PascalAdt](https://pascaladt.github.io) is a library of data\nstructures and algorithms for Free Pascal inspired by the C++ STL\nlibrary.\n\nFeatures\n--------\n* STL-like class hierarchies of containers, iterators and functors.\n* Automatic memory management for iterators.\n* Dynamic array containers.\n* Linked lists: singly linked, doubly linked and xor linked lists.\n* Double-ended queues: circular and segmented.\n* Search trees: AVL trees, splay trees, 2-3-trees.\n* Hash tables: open and closed.\n* Priority queues: binomial heaps.\n* Sorting algorithms: quick sort, merge sort, shell sort, insertion sort.\n* Selection algorithms: Hoare, Blum-Floyd-Pratt-Rivest-Tarjan.\n* String algorithms: Knuth-Morris-Pratt, Boyer-Moore, Karp-Miller-Rosenberg.\n* Sequence algorithms: binary search, interpolation seach, partition,\n  merge, random shuffle, etc.\n\nRequirements\n------------\n* [Free Pascal](https://www.freepascal.org).\n* Linux (should work on other systems, but the installation and\n  compilation scripts might need adjusting).\n* C compiler to compile the [MCP](https://github.com/lukaszcz/mcp) macro processor.\n\nInstallation and usage\n----------------------\n* Compilation: `make`\n* Tests: `make test`\n* Installation: `make install`\n* [Demo](demo/customer/customer.pas) compilation: `make demo`\n\nDocumentation\n-------------\n\n[PascalAdt documentation](https://pascaladt.github.io/pascaladt-docs/index.html) is available at the [PascalAdt webpage](https://pascaladt.github.io/). It includes a tutorial and the API documentation auto-generated from sources with the [SrcDoc](https://github.com/lukaszcz/srcdoc/) program.\n\nSee also [docsrc/tutorial.txt](docsrc/tutorial.txt) and [demo/customer/customer.pas](demo/customer/customer.pas).\n\nCopyright and license\n---------------------\n\nCopyright (C) 2004-2024 Lukasz Czajka\n\nDistributed under LGPL 2.1. See [LICENSE](LICENSE).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flukaszcz%2Fpascaladt","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flukaszcz%2Fpascaladt","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flukaszcz%2Fpascaladt/lists"}