containers
ihp
containers | ihp | |
---|---|---|
11 | 124 | |
312 | 4,226 | |
-0.6% | 0.3% | |
6.0 | 9.5 | |
22 days ago | 6 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | MIT License |
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.
containers
-
Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes
"Make invalid laziness unrepresentable" means you should use strict versions of container types instead of lazy ones. However, for better or for worse, sometimes the "strict version" of a data type is not actually a strict data type, it's just a strict API to the lazy type. Examples include Data.Map.Strict (not Data.Map or Data.Map.Lazy) or Data.HashMap.Strict (not Data.HashMap.Lazy) (sadly there is no Data.Sequence.Strict but perhaps there will be one day).
-
How are Lists & Sequences (from containers package) control structures?
Indeed it's rather subtle. See https://github.com/haskell/containers/issues/752 for more discussion on the matter. Nonetheless, I believe it is "spine strict" in the sense that thunks for all values always exist, even if the spine that holds them can be rearranged due to laziness.
-
An elegant approach to solve this problem?
Note that the list index operator has O(n) complexity. Ideally you'd want to use something like Seq from the containers package
- Monthly Hask Anything (June 2022)
-
Why is seemingly infinite (lazy) recursion faster?
Edison and containers both have sequence types that support efficient, cons, snoc, viewL, viewR, append, map, and length.
-
Haskell - Important Libraries
containers
-
Assessing Haskell (blogpost, slightly negative!)
Calling linked lists Haskell's "primary data structure" seems off-base to me. Yes, there's String, yes, there's built-in syntax for List... but there's also everything in containers, and vector is pretty easy to use in practice, though it would probably be good for more learning material to mention it more prominently.
-
Is a a MONAD in Haskell just the functional equivalent of a generic type (such as in C#) and how do MONADs enable things like saving data?
Haskell has much more sophisticated immutable data structures, you can find them in the "containers" package: https://hackage.haskell.org/package/containers
-
Looking for projects that make heavy use of IntMap which have benchmarks
I asked this on the libraries mailing list but thought posting here would bring in potentially more responses. I made a recent change to the behaviour of lookup and find (see here for more details: https://github.com/haskell/containers/pull/800).
-
Semver doesn't mean MAJOR.MINOR.PATCH, it means FAILS.FEATURES.BUGS
Rust has nothing on Haskell. containers, which might as well be considered part of the standard library, has been out for almost 14 years and is still 0.x
ihp
- IHP – The Haskell Framework for Non-Haskellers
-
Ask HN: Why are all of the best back end web frameworks dynamically typed?
I found IHP straightforward:
https://ihp.digitallyinduced.com/
despite not remembering much haskell!
This assumes you can get past nix for the install.
I find IHP well-designed. I just wish the licensing scheme were more transparent.
- IHP v1.1.0 has been released 🎉
- IHP Haskell Framework v1.1.0 has been released
-
Servant or framework
You can find the docs at https://ihp.digitallyinduced.com/ and some getting started videos at https://www.youtube.com/watch?v=PLl9Sjq6Nzc&list=PLenFm8BWuKlS0IaE31DmKB_PbkMLmwWmG
-
Haskell Optimization Handbook
In case this got you interested in Haskell, and you want a good way to start your Haskell journey (and have something to apply the optimization handbook to), check out IHP. It's the Rails/Laravel of the Haskell world. You can start here https://ihp.digitallyinduced.com/Guide/index.html or check it out on GitHub here https://github.com/digitallyinduced/ihp
-
Show HN: Algora.io – Open-source development bounties
At IHP we've been using Algora for a while now and it works really great. Here's e.g. one PR that was merged last week with a bounty attached https://github.com/digitallyinduced/ihp/issues/1621 Everything was set up in less than 15 minutes and ioannis and zafer have been super helpful with any questions we had.
In general I think this is a good direction and an interesting take on the open question around sustainable open source. Congrats on the launch and keep up the great work! :)
- Por que Elm é uma linguagem tão deliciosa?
-
Any open source projects to contribute to for beginners
You could contribute to IHP! We have some great docs to get started here https://github.com/digitallyinduced/ihp/blob/master/CONTRIBUTING.md And we have some low hanging fruits in GitHub issues for you to get started with, e.g. https://github.com/digitallyinduced/ihp/issues/1601 (also there's always lots of activity in the IHP Slack, in case you have any questions/need help)
- IHP Haskell Framework v1.0.1 has been released
What are some alternatives?
singletons - Fake dependent types in Haskell using singletons
miso - :ramen: A tasty Haskell front-end framework
EdisonAPI - Edison: A Library of Efficient Data Structures
Ruby on Rails - Ruby on Rails
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
haskell-ux - Let's make Haskells error messages helpful :)
hevm - Dapp, Seth, Hevm, and more
Phoenix - Peace of mind from prototype to production
ghc-proposals - Proposed compiler and language changes for GHC and GHC/Haskell
indexed-containers
purescript-flame - Fast & simple framework for building web applications