{"id":16679885,"url":"https://github.com/eval-exec/skiplist","last_synced_at":"2026-04-20T16:32:02.814Z","repository":{"id":140182756,"uuid":"325221368","full_name":"eval-exec/skiplist","owner":"eval-exec","description":"Implementation of a skiplist data structure that is thread-safe for searching and insertion.","archived":false,"fork":false,"pushed_at":"2021-02-08T09:02:52.000Z","size":4,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-31T03:28:08.229Z","etag":null,"topics":["skiplist"],"latest_commit_sha":null,"homepage":"","language":"Go","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/eval-exec.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":"2020-12-29T07:47:35.000Z","updated_at":"2025-08-27T14:50:36.000Z","dependencies_parsed_at":null,"dependency_job_id":"ca23845e-47f3-4373-95fa-b89b1696adce","html_url":"https://github.com/eval-exec/skiplist","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/eval-exec/skiplist","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eval-exec%2Fskiplist","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eval-exec%2Fskiplist/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eval-exec%2Fskiplist/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eval-exec%2Fskiplist/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/eval-exec","download_url":"https://codeload.github.com/eval-exec/skiplist/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eval-exec%2Fskiplist/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32055295,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-20T11:35:06.609Z","status":"ssl_error","status_checked_at":"2026-04-20T11:34:48.899Z","response_time":94,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["skiplist"],"created_at":"2024-10-12T13:38:00.577Z","updated_at":"2026-04-20T16:32:02.788Z","avatar_url":"https://github.com/eval-exec.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# skiplist\n![](https://upload.wikimedia.org/wikipedia/commons/8/86/Skip_list.svg)\n\nSkip lists were first described in 1989 by William Pugh.\n\nIt is a probabilistic data structure that allows `O(log n)` search complexity as well as `O(log n)` insertion complexity within an ordered sequence of `n` elements.\n\n\u003e Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space.\n\u003e\n\u003e — William Pugh, Concurrent Maintenance of Skip Lists (1989)\n\u003e \n## References\n- https://en.wikipedia.org/wiki/Skip_list\n- Papadakis, Thomas (1993). Skip Lists and Probabilistic Analysis of Algorithms.  University of Waterloo.\n- William Pugh. \"A skip list cookbook\". 1990. Section 3.4 Linear List Operations .\n- Pugh, William (April 1989). Concurrent Maintenance of Skip Lists (PS, PDF) (Technical report). Dept. of Computer Science, U. Maryland. CS-TR-2222.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feval-exec%2Fskiplist","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Feval-exec%2Fskiplist","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feval-exec%2Fskiplist/lists"}