pomaps VS ixset-typed

Compare pomaps vs ixset-typed and see what are their differences.

pomaps

Haskell data structure for maps and sets with partially ordered keys (by sgraf812)

ixset-typed

More strongly typed variant of the ixset Haskell package (by well-typed)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
pomaps ixset-typed
- 1
3 23
- -
0.0 0.0
about 3 years ago 3 months ago
Haskell Haskell
MIT License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

pomaps

Posts with mentions or reviews of pomaps. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning pomaps yet.
Tracking mentions began in Dec 2020.

ixset-typed

Posts with mentions or reviews of ixset-typed. We have used some of these posts to build our list of alternatives and similar projects.

What are some alternatives?

When comparing pomaps and ixset-typed you can also consider the following projects:

data-clist - A purely functional ring data structure for Haskell.

ixset - A Set type which supports multiple indexes

cubical - Implementation of Univalence in Cubical Sets

multiset - multiset haskell package

representable-functors - representable functors

psqueues - Priority Search Queues in three different flavors for Haskell

void - Provides Data.Void, which is in base since ghc 7.8 or so

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell

ethereum-client-haskell

nibblestring - Packed, strict nibble arrays with a list interface (ByteString for nibbles)

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

permutation - git import of patrick perry permutations lib from darcs