{"id":21151896,"url":"https://github.com/belimfaux/extendible_hashing","last_synced_at":"2025-03-14T14:43:10.235Z","repository":{"id":247488626,"uuid":"825980819","full_name":"BelimFaux/extendible_hashing","owner":"BelimFaux","description":"C++ Implementation of an Extendible Hashing Set","archived":false,"fork":false,"pushed_at":"2025-01-10T17:40:00.000Z","size":47,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-21T08:23:44.697Z","etag":null,"topics":["cpp","data-structures","extendible-hashing","hashing"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BelimFaux.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2024-07-08T22:01:05.000Z","updated_at":"2025-01-10T17:40:03.000Z","dependencies_parsed_at":null,"dependency_job_id":"848fca2d-c57e-4866-99d2-a33e14b13e2d","html_url":"https://github.com/BelimFaux/extendible_hashing","commit_stats":null,"previous_names":["belimfaux/extendible_hashing"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BelimFaux%2Fextendible_hashing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BelimFaux%2Fextendible_hashing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BelimFaux%2Fextendible_hashing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BelimFaux%2Fextendible_hashing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BelimFaux","download_url":"https://codeload.github.com/BelimFaux/extendible_hashing/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243597780,"owners_count":20316842,"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":["cpp","data-structures","extendible-hashing","hashing"],"created_at":"2024-11-20T10:19:47.759Z","updated_at":"2025-03-14T14:43:10.216Z","avatar_url":"https://github.com/BelimFaux.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Extendible Hashing\n\nThis is a C++ Implementation of an Extendible Hashing Set.  \nIt was originally written for the ADS-Course of University of Vienna.\n\n## Setup\n\nTo try the Set out, you can use the provided playground program.\nTo run the Program, compile the file `eh_playground` using CMake and run it:\n\n```bash\nmkdir build \u0026\u0026 cd build\ncmake .. \u0026\u0026 make\n./eh_playground\n\n```\n\nYou can also set the program to nonverbose by setting the verbose flag\n\n```bash\n./eh_playground\n -v\n./eh_playground\n --verbose\n```\n\nFor more Information run\n\n```bash\n./eh_playground\n -h\n./eh_playground\n --help\n```\n\n## Commands\n\nThe Program launches into a prompt, from there you have multiple commands to modify or inspect the set:\n\n- i - insert elements in set\n- r - remove elements from set\n- f - find elements in set\n- l - list all elements in set (using foreach loop)\n- s - show size of set\n- c - clear set\n- p - print current set\n- h - show help page\n- q (or EOF) - quit\n\nCommands like insert, remove and find, that require more input will launch a second prompt where you can type in as much elements as you would like, seperated by spaces:\n\n```\ninput\u003e 1 2 3 4 5\nExtendible Hashing \u003cj,16\u003e, d = 0, nD = 1, sz = 5\n0 --\u003e [l = 0, offset = 1, arrsz = 5 | 1 2 3 4 5 ]\n```\n\nAfter executing commands that alter the set the set will be printed, if the Program isn't set to nonverbose (see Output)\n\n## Output\n\nIf the Program isn't run nonverbose, after every change to the Set, it will be printed out (equivalent to running `p`).  \nThe Format for printing is definde by the `dump()` method, and includes every directory, and the bucket that it points to (-\u003e if its the only (or first) Directory pointing to that Bucket, or ~\u003e followed by the first Directory, pointing to that Bucket else) as well as the Elements inside the Buckets and info like size, offset, local/global depth etc.\n\nFor example a Set like this:\n\n![https://media.geeksforgeeks.org/wp-content/uploads/20190803222615/hash73.png](https://media.geeksforgeeks.org/wp-content/uploads/20190803222615/hash73.png \"Example\")\n\nmight look like this:  \nExtendible Hashing \u003cj,4\u003e, d = 2, nD = 4, sz = 9  \n0 --\u003e [l = 2, offset = 4, arrsz = 3 | 16 4 24 ]  \n1 --\u003e [l = 1, offset = 2, arrsz = 3 | 31 7 9 ]  \n2 --\u003e [l = 2, offset = 4, arrsz = 3 | 6 22 10 ]  \n3 ~~\u003e 1 --\u003e [l = 1, offset = 2, arrsz = 3 | 31 7 9 ]\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbelimfaux%2Fextendible_hashing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbelimfaux%2Fextendible_hashing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbelimfaux%2Fextendible_hashing/lists"}