{"id":20161626,"url":"https://github.com/stablecoder/deck-o-cards","last_synced_at":"2025-03-03T02:43:27.784Z","repository":{"id":99244078,"uuid":"192226835","full_name":"StableCoder/deck-o-cards","owner":"StableCoder","description":"A simple proof-of-concept of a memory-minimized deck of cards with shuffle.","archived":false,"fork":false,"pushed_at":"2019-06-16T19:05:00.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-13T13:52:29.680Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/StableCoder.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":"2019-06-16T19:03:17.000Z","updated_at":"2019-06-16T19:05:02.000Z","dependencies_parsed_at":"2023-07-15T22:48:19.966Z","dependency_job_id":null,"html_url":"https://github.com/StableCoder/deck-o-cards","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StableCoder%2Fdeck-o-cards","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StableCoder%2Fdeck-o-cards/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StableCoder%2Fdeck-o-cards/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StableCoder%2Fdeck-o-cards/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/StableCoder","download_url":"https://codeload.github.com/StableCoder/deck-o-cards/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241600483,"owners_count":19988713,"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":[],"created_at":"2024-11-14T00:19:52.731Z","updated_at":"2025-03-03T02:43:27.752Z","avatar_url":"https://github.com/StableCoder.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Deck'o'Cards\n\nThis is a simple implementation of a deck of cards, with the minimum possible use of memory was a challenge set by a fellow co-worker.\n\nAny player's hand can be represented within 8 bytes, and a deck with 16 + 24 bytes with the ability to peek upto several future cards, and to reshuffle. (Without the ability to peek, it can be just 16 bytes).\n\nThis does, however, incur a higher computational cost, but such is the eternal struggle with computers of memory vs cycles.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstablecoder%2Fdeck-o-cards","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstablecoder%2Fdeck-o-cards","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstablecoder%2Fdeck-o-cards/lists"}