{"id":28466460,"url":"https://github.com/clickermonkey/dsa","last_synced_at":"2025-07-23T10:34:22.334Z","repository":{"id":290372458,"uuid":"974224351","full_name":"ClickerMonkey/dsa","owner":"ClickerMonkey","description":"A Go module with my common data structures and algorithms.","archived":false,"fork":false,"pushed_at":"2025-05-29T23:48:02.000Z","size":85,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-29T21:37:17.349Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Go","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/ClickerMonkey.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,"zenodo":null}},"created_at":"2025-04-28T12:53:20.000Z","updated_at":"2025-05-29T23:47:42.000Z","dependencies_parsed_at":"2025-06-29T21:33:02.841Z","dependency_job_id":"682702f9-1149-4b76-9439-4342d521398f","html_url":"https://github.com/ClickerMonkey/dsa","commit_stats":null,"previous_names":["clickermonkey/dsa"],"tags_count":17,"template":false,"template_full_name":null,"purl":"pkg:github/ClickerMonkey/dsa","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ClickerMonkey%2Fdsa","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ClickerMonkey%2Fdsa/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ClickerMonkey%2Fdsa/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ClickerMonkey%2Fdsa/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ClickerMonkey","download_url":"https://codeload.github.com/ClickerMonkey/dsa/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ClickerMonkey%2Fdsa/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266663046,"owners_count":23964675,"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","status":"online","status_checked_at":"2025-07-23T02:00:09.312Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"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":[],"created_at":"2025-06-07T06:40:38.545Z","updated_at":"2025-07-23T10:34:22.315Z","avatar_url":"https://github.com/ClickerMonkey.png","language":"Go","readme":"# dsa\nA Go module with my common data structures and algorithms.\n\n\u003e go get github.com/clickermonkey/dsa\n\n### Interfaces\n- `dsa.Stack[T]` a stack interface (FILO/LIFO)\n- `dsa.Queue[T]` a queue interface (FIFO/LILO)\n\n### Concrete\n- `dsa.LinkedList[T]` a doubly linked list of T values. non-sequential memory layout but O(1) insertion \u0026 removal. Implements stack \u0026 queue.\n- `dsa.LinkedNode[T]` a doubly linked list node.\n- `dsa.Circle[T]` a size bounded stack \u0026 queue.\n- `dsa.PriorityQueue[T]` a queue where highest priority value is in the front.\n- `dsa.WaitQueue[T]` a concurrent queue implementation where `Dequeue()` waits for a value.\n- `dsa.ReadyQueue[T]` a concurrent priority queue implementation where dequeue waits for a value which meets an expected priority (ready state).\n- `dsa.SyncQueue[T]` a conccurrent queue wrapper.\n- `dsa.SliceStack[T]` a slice stack implementation.\n- `dsa.WaitStack[T]` a concurrent stack implementation where `Pop()` waits for a value.\n- `dsa.SyncStack[T]` a concurrent stack wrapper.\n\n### Helpers\n- `dsa.Stopper` a wait/stop object to simplify gates across goroutines.\n\n### Functions\n- `dsa.After(fn)` converts a function call into a channel that resolves when the function returns.\n- `dsa.ToChannel(fn)` converts a function which returns a value into a channel which resolves that value when the function returns it.\n- `dsa.WorkerPool(ctx,n,q,do)` creates an async pool of workers which do work off of a queue which can be stopped at any time.\n- `dsa.Executor(ctx,q,do)` creates an async work processor from a queue of work that can be stopped at any time.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fclickermonkey%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fclickermonkey%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fclickermonkey%2Fdsa/lists"}