{"id":15672387,"url":"https://github.com/afnanenayet/hashed-permutation","last_synced_at":"2025-10-18T07:00:18.510Z","repository":{"id":50794444,"uuid":"207219838","full_name":"afnanenayet/hashed-permutation","owner":"afnanenayet","description":"An implementation of Kensler's hashed permutation algorithm","archived":false,"fork":false,"pushed_at":"2025-01-31T17:57:16.000Z","size":73,"stargazers_count":16,"open_issues_count":7,"forks_count":3,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-04-26T07:52:59.907Z","etag":null,"topics":["hash","hashed","permutation","permute","shuffle"],"latest_commit_sha":null,"homepage":null,"language":"Rust","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/afnanenayet.png","metadata":{"files":{"readme":"docs/README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","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":"2019-09-09T03:53:39.000Z","updated_at":"2025-01-31T17:44:29.000Z","dependencies_parsed_at":"2024-10-03T15:25:25.254Z","dependency_job_id":"350581ce-5315-42e6-a76d-d08206210d3f","html_url":"https://github.com/afnanenayet/hashed-permutation","commit_stats":{"total_commits":54,"total_committers":4,"mean_commits":13.5,"dds":0.2962962962962963,"last_synced_commit":"078289b075f0c5aef1b366fa91427d79ceafeda7"},"previous_names":[],"tags_count":9,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/afnanenayet%2Fhashed-permutation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/afnanenayet%2Fhashed-permutation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/afnanenayet%2Fhashed-permutation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/afnanenayet%2Fhashed-permutation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/afnanenayet","download_url":"https://codeload.github.com/afnanenayet/hashed-permutation/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252577115,"owners_count":21770733,"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":["hash","hashed","permutation","permute","shuffle"],"created_at":"2024-10-03T15:25:17.610Z","updated_at":"2025-10-18T07:00:13.419Z","avatar_url":"https://github.com/afnanenayet.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# hashed-permutation\n\n[![CI](https://github.com/afnanenayet/hashed-permutation/actions/workflows/CI.yml/badge.svg)](https://github.com/afnanenayet/hashed-permutation/actions/workflows/CI.yml)\n[![crates badge](https://meritbadge.herokuapp.com/hashed-permutation)](https://crates.io/crates/hashed-permutation)\n[![Documentation](https://docs.rs/hashed-permutation/badge.svg)](https://docs.rs/hashed-permutation)\n![License](https://img.shields.io/crates/l/hashed-permutation/1.0.0.svg)\n\n## Synopsis\n\nThis is an implementation of Andrew Kensler's hashed permutation, which allows\nyou to take an array of the elements [0 ... n) and shuffle it with no memory\noverhead and very little computational overhead. This works by using a clever\nhash function to effectively permute all of the elements in the array.\n\nBasically, you get a nearly free method to shuffle a bunch of numbers that\ndoesn't require you to allocate a vector of size `n`, letting you sample the\nset without replacement.\n\nYou can find the paper here: https://graphics.pixar.com/library/MultiJitteredSampling/paper.pdf.\nI have a little writeup of how the algorithm works [here](https://afnan.io/posts/2019-04-05-explaining-the-hashed-permutation),\nand [Timothy Hobbs](https://github.com/timthelion) made a nice writeup explaining how to use the library itself\n[here](https://timothy.hobbs.cz/rust-play/hashed-permutation.html).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fafnanenayet%2Fhashed-permutation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fafnanenayet%2Fhashed-permutation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fafnanenayet%2Fhashed-permutation/lists"}