{"id":16339013,"url":"https://github.com/phadej/range-set-list","last_synced_at":"2025-03-22T23:32:54.293Z","repository":{"id":13876768,"uuid":"16574793","full_name":"phadej/range-set-list","owner":"phadej","description":"Memory efficient sets with continuous ranges of elements. List based implementation.","archived":false,"fork":false,"pushed_at":"2023-11-17T19:33:42.000Z","size":107,"stargazers_count":5,"open_issues_count":3,"forks_count":4,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-04-26T01:30:51.387Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Haskell","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/phadej.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","contributing":"CONTRIBUTING.md","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":"2014-02-06T09:47:14.000Z","updated_at":"2024-08-02T17:59:26.672Z","dependencies_parsed_at":"2023-11-17T20:44:33.412Z","dependency_job_id":null,"html_url":"https://github.com/phadej/range-set-list","commit_stats":{"total_commits":78,"total_committers":3,"mean_commits":26.0,"dds":"0.17948717948717952","last_synced_commit":"e423c3f495f9e96293a8bb1b6d9707db83558176"},"previous_names":[],"tags_count":13,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phadej%2Frange-set-list","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phadej%2Frange-set-list/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phadej%2Frange-set-list/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phadej%2Frange-set-list/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/phadej","download_url":"https://codeload.github.com/phadej/range-set-list/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245036127,"owners_count":20550662,"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-10-10T23:53:18.676Z","updated_at":"2025-03-22T23:32:53.870Z","avatar_url":"https://github.com/phadej.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# range-set-list\n\n[![Build Status](https://travis-ci.org/phadej/range-set-list.svg?branch=travis-expr)](https://travis-ci.org/phadej/range-set-list)\n[![Hackage](https://img.shields.io/hackage/v/range-set-list.svg)](http://hackage.haskell.org/package/range-set-list)\n[![Stackage LTS 2](http://stackage.org/package/range-set-list/badge/lts-2)](http://stackage.org/lts-2/package/range-set-list)\n[![Stackage LTS 3](http://stackage.org/package/range-set-list/badge/lts-3)](http://stackage.org/lts-3/package/range-set-list)\n[![Stackage Nightly](http://stackage.org/package/range-set-list/badge/nightly)](http://stackage.org/nightly/package/range-set-list)\n\nA few trivial implementations of range sets.\n\nYou can find the package (and its documentation) on [hackage](http://hackage.haskell.org/package/range-set-list).\n\nThis module is intended to be imported qualified, to avoid name\nclashes with Prelude functions, e.g.,\n\n```haskell\nimport Data.RangeSet.List (RSet)\nimport qualified Data.RangeSet.List as RSet\n```\n\nThis package contains two implementations of exactly the same interface, plus one specialization, all of which provide exactly the same behavior:\n\n* \"Data.RangeSet.List\" implements the simplest `RSet` based on _list_. Set construction and manipulation is most efficient for this version, but lookups may require a full list traversal.\n* \"Data.RangeSet.Map\" implements a slightly less simple `RSet` based on _map_. Construction and manipulation have more overhead in this version, but lookups are significantly faster, especially for large sets.\n* \"Data.RangeSet.IntMap\" is simply a specialization of \"Data.RangeSet.Map\" to Ints based on IntMap.\n\nCompared to [`Data.Set`](http://hackage.haskell.org/package/containers-0.5.4.0/docs/Data-Set.html),\nthis module also imposes an [`Enum`](http://hackage.haskell.org/package/base-4.6.0.1/docs/Prelude.html#t:Enum)\nconstraint for many functions.\nWe must be able to identify consecutive elements to be able to _glue_ and _split_ ranges properly.\n\nThe implementation assumes that\n\n```haskell\nx \u003c succ x\npred x \u003c x\n```\n\nand there aren't elements in between (not true for `Float` and `Double`).\nAlso `succ` and `pred` are never called for largest or smallest value respectively.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphadej%2Frange-set-list","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fphadej%2Frange-set-list","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphadej%2Frange-set-list/lists"}