{"id":26659820,"url":"https://github.com/rocq-community/fav-ssr","last_synced_at":"2025-06-29T01:38:10.798Z","repository":{"id":46123222,"uuid":"422654520","full_name":"rocq-community/fav-ssr","owner":"rocq-community","description":"Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]","archived":false,"fork":false,"pushed_at":"2024-12-30T12:06:05.000Z","size":359,"stargazers_count":48,"open_issues_count":15,"forks_count":7,"subscribers_count":7,"default_branch":"trunk","last_synced_at":"2025-05-18T17:27:49.251Z","etag":null,"topics":["2-3-tree","avl-tree","binomial-heap","coq","huffman-coding","leftist-heap","mathcomp","quadtree","redblack-tree","ssreflect"],"latest_commit_sha":null,"homepage":"","language":"Coq","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rocq-community.png","metadata":{"files":{"readme":"README.md","changelog":null,"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-10-29T17:07:42.000Z","updated_at":"2025-04-30T05:54:03.000Z","dependencies_parsed_at":"2024-03-04T12:28:57.544Z","dependency_job_id":"b4765e28-30a5-43b7-b515-1e18adcd0567","html_url":"https://github.com/rocq-community/fav-ssr","commit_stats":null,"previous_names":["coq-community/fav-ssr","rocq-community/fav-ssr","clayrat/fav-ssr"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rocq-community/fav-ssr","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rocq-community%2Ffav-ssr","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rocq-community%2Ffav-ssr/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rocq-community%2Ffav-ssr/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rocq-community%2Ffav-ssr/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rocq-community","download_url":"https://codeload.github.com/rocq-community/fav-ssr/tar.gz/refs/heads/trunk","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rocq-community%2Ffav-ssr/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262520897,"owners_count":23323782,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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","avl-tree","binomial-heap","coq","huffman-coding","leftist-heap","mathcomp","quadtree","redblack-tree","ssreflect"],"created_at":"2025-03-25T11:15:29.799Z","updated_at":"2025-06-29T01:38:10.777Z","avatar_url":"https://github.com/rocq-community.png","language":"Coq","funding_links":[],"categories":["Rocq Prover"],"sub_categories":[],"readme":"\u003c!---\nThis file was generated from `meta.yml`, please do not edit manually.\nFollow the instructions on https://github.com/coq-community/templates to regenerate.\n---\u003e\n# Functional Data Structures and Algorithms in SSReflect\n\n[![Docker CI][docker-action-shield]][docker-action-link]\n[![Contributing][contributing-shield]][contributing-link]\n[![Code of Conduct][conduct-shield]][conduct-link]\n[![Zulip][zulip-shield]][zulip-link]\n\n[docker-action-shield]: https://github.com/coq-community/fav-ssr/actions/workflows/docker-action.yml/badge.svg?branch=trunk\n[docker-action-link]: https://github.com/coq-community/fav-ssr/actions/workflows/docker-action.yml\n\n[contributing-shield]: https://img.shields.io/badge/contributions-welcome-%23f7931e.svg\n[contributing-link]: https://github.com/coq-community/manifesto/blob/master/CONTRIBUTING.md\n\n[conduct-shield]: https://img.shields.io/badge/%E2%9D%A4-code%20of%20conduct-%23f15a24.svg\n[conduct-link]: https://github.com/coq-community/manifesto/blob/master/CODE_OF_CONDUCT.md\n\n[zulip-shield]: https://img.shields.io/badge/chat-on%20zulip-%23c1272d.svg\n[zulip-link]: https://coq.zulipchat.com/#narrow/stream/237663-coq-community-devs.20.26.20users\n\n\n\nA port of the book https://functional-algorithms-verified.org/ to Coq/SSReflect.\n\nThe book was previously called \"Functional Algorithms Verified\", hence the FAV acronym.\n\n## Meta\n\n- Author(s):\n  - Alex Gryzlov (initial)\n- Coq-community maintainer(s):\n  - Alex Gryzlov ([**@clayrat**](https://github.com/clayrat))\n- License: [MIT license](LICENSE)\n- Compatible Coq versions: 8.15 to 8.19\n- Additional dependencies:\n  - [MathComp ssreflect](https://math-comp.github.io) 1.17.0 to 1.19.0\n  - [MathComp algebra](https://math-comp.github.io)\n  - [Equations](https://github.com/mattam82/Coq-Equations) 1.3 or later\n- Coq namespace: `favssr`\n- Related publication(s): none\n\n## Building instructions\n\nTo build manually, do:\n```shell\nmake   # or make -j \u003cnumber-of-cores-on-your-machine\u003e\n```\n\n## Contents\n\n1. [Basics](src/basics.v)\n### Part I: Sorting and Selection\n2. [Sorting](src/sorting.v)\n3. [Selection](src/selection.v)\n### Part II: Search Trees\n4. [Binary Trees](src/bintree.v)\n5. [Binary Search Trees](src/bst.v)\n6. [Abstract Data Types](src/adt.v)\n7. [2-3 Trees](src/twothree.v)\n8. [Red-Black Trees](src/redblack.v)\n9. [AVL Trees](src/avl.v)\n10. [Beyond Insert and Delete: \\cup, \\cap and -](src/beyond.v)\n11. [Arrays via Braun Trees](src/braun.v)\n12. [Tries](src/trie.v)\n13. [Region Quadtrees](src/quadtree.v)\n### Part III: Priority Queues\n14. [Priority Queues](src/priority.v)\n15. [Leftist Heaps](src/leftist.v)\n16. [Priority Queues via Braun Trees](src/braun_queue.v)\n17. [Binomial Heaps](src/binom_heap.v)\n### Part IV: Advanced Design and Analysis Techniques\n18. Dynamic Programming\n19. Amortized Analysis\n20. Queues\n21. Splay Trees\n22. Skew Heaps\n23. Pairing Heaps\n### Part V: Selected Topics\n24. Knuth–Morris–Pratt String Search\n25. [Huffman’s Algorithm](src/huffman.v)\n26. Alpha-Beta Pruning\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frocq-community%2Ffav-ssr","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frocq-community%2Ffav-ssr","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frocq-community%2Ffav-ssr/lists"}