unicode-transforms
lens
unicode-transforms | lens | |
---|---|---|
1 | 4 | |
47 | 1,990 | |
- | - | |
2.5 | 7.0 | |
7 months ago | 7 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 2-clause "Simplified" 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.
unicode-transforms
-
[ANN] unicode-collation 0.1
Thanks! Here's a puzzle. Profiling shows that about a third of the time in my code is spent in normalize from unicode-transforms. (Normalization is a required step in the algorithm but can be omitted if you know that the input is already in NFD form.) And when I add a benchmark that omits normalization, I see run time cut by a third. But text-icu's run time in my benchmark doesn't seem to be affected much by whether I set the normalization option. I am not sure how to square that with the benchmarks here that seem to show unicode-transforms outperforming text-icu in normalization. text-icu's documentation says that "an incremental check is performed to see whether the input data is in FCD form. If the data is not in FCD form, incremental NFD normalization is performed." I'm not sure exactly what this means, but it may mean that text-icu avoids normalizing the whole string, but just normalizes enough to do the comparison, and sometimes avoids normalization altogether if it can quickly determine that the string is already normalized. I don't see a way to do this currently with unicode-transforms.
lens
-
Haskell Lens Tutorial by Exercises
They are in fact well structured and not random at all. Take a look at this:
https://github.com/ekmett/lens/wiki/Operators
- -- /It puts the state in the monad or it gets the hose again./
-
How to learn OOP?
A composition of functional operations over Kmett style lenses. Here's the original Haskell implementation, here's usage in JS via Ramda
-
Dhall: A Gateway Drug to Haskell
The documentation of lenses is geared towards people know what lenses are. Of course this single fragment of documentation doesn't make sense if you don't know what lenses are. If you want to understand what lenses are the package links to a helpful wiki and tutorial: https://github.com/ekmett/lens/wiki/Overview
All within reach within seconds of discovering the function.
What are some alternatives?
with-utf8 - Get your IO right on the first try
proxy - This repository contains the WhatsApp proxy implementation for users to host their own proxy infrastructure to connect to WhatsApp for chat (VoIP is not currently supported)
refined - Refinement types with static checking
proxy - proxy 'helpers'
hashable - A class for types that can be converted to a hash value
algebraic-classes - Conversions between algebraic classes and F-algebras.
jump - Jump start your Haskell development
RFC1751 - RFC-1751 library for Haskell
code-builder - Packages for defining APIs, running them, generating client code and documentation.
hexml-lens - Lenses for working with XML data
critbit - A Haskell implementation of crit-bit trees.
double-metaphone