{"id":18881028,"url":"https://github.com/takumatt/concurrentskiplist","last_synced_at":"2025-04-14T19:33:10.989Z","repository":{"id":55043085,"uuid":"307412505","full_name":"takumatt/ConcurrentSkipList","owner":"takumatt","description":"A swift implementation of concurrent (thread-safe) skip list.  ","archived":false,"fork":false,"pushed_at":"2021-01-13T12:22:09.000Z","size":12,"stargazers_count":18,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-28T08:22:38.917Z","etag":null,"topics":["data-structures","skiplist","swift"],"latest_commit_sha":null,"homepage":"","language":"Swift","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/takumatt.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}},"created_at":"2020-10-26T15:10:19.000Z","updated_at":"2023-12-18T08:12:19.000Z","dependencies_parsed_at":"2022-08-14T10:00:26.781Z","dependency_job_id":null,"html_url":"https://github.com/takumatt/ConcurrentSkipList","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/takumatt%2FConcurrentSkipList","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/takumatt%2FConcurrentSkipList/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/takumatt%2FConcurrentSkipList/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/takumatt%2FConcurrentSkipList/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/takumatt","download_url":"https://codeload.github.com/takumatt/ConcurrentSkipList/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248946196,"owners_count":21187466,"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":["data-structures","skiplist","swift"],"created_at":"2024-11-08T06:47:01.773Z","updated_at":"2025-04-14T19:33:05.979Z","avatar_url":"https://github.com/takumatt.png","language":"Swift","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Introduction\n\nA swift implementation of concurrent (thread-safe) skip list.  \nThis package is mostly based on [sean-public/fast-skiplist](https://github.com/sean-public/fast-skiplist).\n\n## What is Skip List?\n\nTo simply put, skip list is a data structure to represent an ordered set.  \nThis package provides API similar to swift's `Set`.  \nIt is a probabilistic data structure and the average complexity of `search`, `insert` and `delete` are O(logn) respectively, while O(n) in worst cases.  \n\n| | Average | Worst case |\n| - | - | - |\n| Search | O(logn) | O(n) |\n| Insert | O(logn) | O(n) |\n| Delete | O(logn) | O(n) |\n\n# Installation\n\n## Swift Package Manager\n\nAdd the following to `Package.swift`.\n\n```\ndependencies: [\n  .package(url: \"https://github.com/takumatt/ConcurrentSkipList.git\", from: \"1.0.0\"),\n]\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftakumatt%2Fconcurrentskiplist","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftakumatt%2Fconcurrentskiplist","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftakumatt%2Fconcurrentskiplist/lists"}