filesystem-trees VS base64-bytestring

Compare filesystem-trees vs base64-bytestring and see what are their differences.

filesystem-trees

Traverse and manipulate directories as lazy rose trees (by erratic-pattern)

base64-bytestring

Fast base64 encoding and decoding for Haskell. (by haskell)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
filesystem-trees base64-bytestring
- 1
6 45
- -
0.0 4.7
about 6 years ago 7 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v3.0 or later
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.

filesystem-trees

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

We haven't tracked posts mentioning filesystem-trees yet.
Tracking mentions began in Dec 2020.

base64-bytestring

Posts with mentions or reviews of base64-bytestring. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-06-07.
  • Yatima: A programming language for the decentralized web
    16 projects | news.ycombinator.com | 7 Jun 2021
    Sure, if you consider Haskell's runtime (I know that technically GHC /= Haskell, but in practice it's the only Haskell that matters, except maybe something like Asterius) all the primitives are backed by C libraries: https://hackage.haskell.org/package/ghc-prim-0.4.0.0/docs/GH...

    Likewise with conventions around pointers, arrays, etc. to the point where if you want to do anything really low-level or performance sensitive in Haskell, you're essentially punching a hole into C. As a random example, within the fast base64bytestring library, you find lots of use of `malloc`, `ForeignPtr` etc.: https://github.com/haskell/base64-bytestring/blob/master/Dat... And of course because this is C there aren't really many safety guarantees here.

    The plan with Yatima with its primitives, and eventually when we write an FFI is to integrate with Rust in the same way that Haskell uses C. My hope is that with Yatima's affine types we might even be able to FFI to and from safe Rust (since the borrow checker uses affine types), but this is a little bit of a research project to see how much that works. Even to unsafe Rust though, we have better safety guarantees than C, since unsafe Rust's UB is still more restricted than C's is.

What are some alternatives?

When comparing filesystem-trees and base64-bytestring you can also consider the following projects:

data-lens - Haskell 98 Lenses

msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]

data-lens-fd - Lenses with Functional Dependencies

asn1-encoding - ASN1 Raw/BER/DER/CER reader/writer in haskell

histogram-fill - Filling and manupulation with histograms

type-iso - Expresses isomorphic and injective relations between types.

cassava-conduit - Conduit interface for cassava [Haskell]

schedule-planner - Calculate an ideal schedule layout from a set of timeslots

bimap - Bidirectional mapping between two key types

unamb-custom - Functional concurrency with unambiguous choice, using a custom scheduler.

buffer-builder - Haskell library for efficiently building up buffers