publicsuffix alternatives and similar packages
Based on the "Data" category.
Alternatively, view publicsuffix alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
lens
Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens -
-
text
Haskell library for space- and time-efficient operations over Unicode text. -
code-builder
Packages for defining APIs, running them, generating client code and documentation. -
unordered-containers
Efficient hashing-based container types -
cassava
A CSV parsing and encoding library optimized for ease of use and high performance -
compendium-client
Mu (μ) is a purely functional framework for building micro services. -
holmes
A reference library for constraint-solving with propagators and CDCL. -
-
binary
Efficient, pure binary serialisation using ByteStrings in Haskell. -
-
resource-pool
A high-performance striped resource pooling implementation for Haskell -
-
-
primitive
This package provides various primitive memory-related operations. -
discrimination
Fast linear time sorting and discrimination for a large class of data types -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
json-autotype
Automatic Haskell type inference from JSON input -
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
safecopy
An extension to Data.Serialize with built-in version control -
audiovisual
Extensible records, variants, structs, effects, tangles -
dependent-map
Dependently-typed finite maps (partial dependent products) -
IORefCAS
A collection of different packages for CAS based data structures. -
-
-
-
-
protobuf
An implementation of Google's Protocol Buffers in Haskell. -
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
-
scientific
Arbitrary-precision floating-point numbers represented using scientific notation -
uuid-types
A Haskell library for creating, printing and parsing UUIDs -
typerep-map
⚡️Efficient implementation of Map with types as keys
Less time debugging, more time building
Do you think we are missing an alternative of publicsuffix or a related project?
|
Static code analysis for 29 languages.
sponsored
www.sonarqube.org
|
Popular Comparisons
-
protobufvsCBOR
-
network-addressvsradius
-
attemptvstext
-
json-autotypevsbase58string
-
boringvsbinary
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
Haskell bindings to query the publicsuffix list
A "public suffix" is one under which Internet users can (or historically could) directly register names. Some examples of public suffixes are .com, .co.uk and pvt.k12.ma.us. The Public Suffix List is a list of all known public suffixes.
(from https://publicsuffix.org/)
This package exposes functions to query the publicsuffix list to see if
a particular domain is a public suffix or not. This is used for example in HTTP
user agents to determine whether a cookie can be accepted (example of a bad
cookie: Set-Cookie: session=X; domain=*.com) or when checking X.509
certificates (SSL/TLS) to see if a common name is valid (invalid CN: *.com).
The list is compiled into the package, the functions are pure and don't need IO (not even hidden internally). Since the publicsuffix list is updated periodically, you should watch for changes and update your lower bounds on this package.
Version number
The package version follows the template <api version>.<date> where date
is when the publicsuffix list was last updated from upstream, in the format
YYYYMMDD.