heap VS vinyl

Compare heap vs vinyl and see what are their differences.

heap

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps. (by pruvisto)
Data structures
Source Code
Suggest alternative
Edit details

vinyl

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. (by VinylRecords)
Data structures Records
Source Code
hackage.haskell.org
Suggest alternative
Edit details
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
heap vinyl
- 2
6 260
- 0.4%
0.0 0.0
about 3 years ago 6 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT 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.

heap

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

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

vinyl

Posts with mentions or reviews of vinyl. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-01-24.
  • Making sense of TypeScript using set theory
    2 projects | news.ycombinator.com | 24 Jan 2023
    > Having set types like this and refining them smaller is something I wish Haskell would learn from Typescript, especially the automatic inference side

    Haskell has far better type inference than Typescript in large part because it doesn't have subtyping.

    There are libraries for open records and sums (e.g. https://hackage.haskell.org/package/vinyl) but they're almost always the wrong choice.

  • Typed Markdown Revisited
    1 project | /r/haskell | 23 Apr 2021
    I would also like to see how this compares with data types à la carte or an extensible records solution like vinyl.

What are some alternatives?

When comparing heap and vinyl you can also consider the following projects:

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

graphite - Haskell graphs and networks library

bytestring-trie - An efficient finite map from (byte)strings to values.

slist - ♾️ Sized list

multiset - multiset haskell package

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

psqueues - Priority Search Queues in three different flavors for Haskell

permutation - git import of patrick perry permutations lib from darcs

naperian - Efficient representable functors

rawr - Anonymous extensible records and variant types

safer-file-handles - Type-safe file handling

haggle - An efficient graph library for Haskell

heap vs btree-concurrent vinyl vs graphite heap vs bytestring-trie vinyl vs slist heap vs multiset vinyl vs igraph heap vs psqueues vinyl vs permutation heap vs naperian vinyl vs rawr heap vs safer-file-handles vinyl vs haggle