{"id":21270644,"url":"https://github.com/timstr/hashstash","last_synced_at":"2026-02-12T08:33:16.454Z","repository":{"id":256791240,"uuid":"855262079","full_name":"timstr/hashstash","owner":"timstr","description":"It's like git but for your Rust data structures.","archived":false,"fork":false,"pushed_at":"2026-02-08T04:41:48.000Z","size":183,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-02-08T12:25:54.543Z","etag":null,"topics":["hashing","rust","serialization"],"latest_commit_sha":null,"homepage":"","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/timstr.png","metadata":{"files":{"readme":"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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-09-10T15:32:02.000Z","updated_at":"2026-02-08T04:41:52.000Z","dependencies_parsed_at":"2024-10-28T06:31:35.439Z","dependency_job_id":"5632136d-4df4-4358-bf1b-73deef227a57","html_url":"https://github.com/timstr/hashstash","commit_stats":null,"previous_names":["timstr/hashstash"],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/timstr/hashstash","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/timstr%2Fhashstash","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/timstr%2Fhashstash/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/timstr%2Fhashstash/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/timstr%2Fhashstash/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/timstr","download_url":"https://codeload.github.com/timstr/hashstash/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/timstr%2Fhashstash/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29361819,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-12T01:03:07.613Z","status":"online","status_checked_at":"2026-02-12T02:00:06.911Z","response_time":55,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["hashing","rust","serialization"],"created_at":"2024-11-21T08:18:09.384Z","updated_at":"2026-02-12T08:33:16.440Z","avatar_url":"https://github.com/timstr.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# hashstash\n\nIt's like git but for your Rust data structures.\n\n`hashstash` provides means to concisely hash and serialize data structures\nand later de-serialize the same or new data structures, allowing you to\ncapture snapshots in time and rollback to or recreate those states later.\n\nTypes that you want to hash or serialize implement the `Stashable` trait,\nwhich uses its single `stash` method to transparently do both hashing and\nserializing. Stashed objects are stored in a `Stash` and referred to via a\n`StashHandle\u003cT\u003e`. From a `StashHandle\u003cT\u003e`, you can recreate new instances\nof `T` in the state it was stashed with that handle if `T` is `Unstashable`.\nYou can also modify the original object or other objects of type `T` in-place\nto recreate the state the handle represents if `T` is `UnstashableInplace`.\nDeserializing objects in place is risky, so `UnstashableInplace` uses a two-\nphase approach where stashed contents are read through in a practice run\nbefore being read through a second time when the object is actually modified.\n\nUnder the hood, `hashstash` implements a content-addressable storage system\nin the form of the `Stash` struct, such that objects with identical hashes\nare only serialized once. This automatically deduplicates serialized data\nand means that the marginal cost of stashing the same objects multiple times\nis free.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftimstr%2Fhashstash","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftimstr%2Fhashstash","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftimstr%2Fhashstash/lists"}