Popularity

1.2

Declining

Activity

0.0

Stable

Stars 1

Watchers 2

Forks 0

Last Commit almost 9 years ago

Monthly Downloads: 15

Programming language: Haskell

License: BSD 3-clause "New" or "Revised" License

Tags: Data

data-cell alternatives and similar packages

Based on the "Data" category.
Alternatively, view data-cell alternatives based on common mentions on social networks and blogs.

lens

10.0 6.8 data-cell VS lens

Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
semantic-source

10.0 9.1 data-cell VS semantic-source

Parsing, analyzing, and comparing source code across many languages

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com

hnix

9.9 6.8 data-cell VS hnix

A Haskell re-implementation of the Nix expression language
code-builder

9.8 0.0 data-cell VS code-builder

Packages for defining APIs, running them, generating client code and documentation.
text

9.8 8.4 data-cell VS text

Haskell library for space- and time-efficient operations over Unicode text.
Frames

9.7 6.1 data-cell VS Frames

Data frames for tabular data.
cassava

9.7 4.7 data-cell VS cassava

A CSV parsing and encoding library optimized for ease of use and high performance
compendium-client

9.7 0.0 data-cell VS compendium-client

Mu (μ) is a purely functional framework for building micro services.
unordered-containers

9.7 5.0 data-cell VS unordered-containers

Efficient hashing-based container types
massiv

9.7 5.9 data-cell VS massiv

Efficient Haskell Arrays featuring Parallel computation
holmes

9.6 0.0 data-cell VS holmes

A reference library for constraint-solving with propagators and CDCL.
alfred-margaret

9.5 3.5 data-cell VS alfred-margaret

Fast Aho-Corasick string searching
resource-pool

9.5 0.0 data-cell VS resource-pool

A high-performance striped resource pooling implementation for Haskell
hashable

9.5 5.7 data-cell VS hashable

A class for types that can be converted to a hash value
refined

9.5 1.5 data-cell VS refined

Refinement types with static checking
binary

9.5 4.3 data-cell VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
critbit

9.5 0.0 data-cell VS critbit

A Haskell implementation of crit-bit trees.
primitive

9.5 5.9 data-cell VS primitive

This package provides various primitive memory-related operations.
caledon

9.4 0.0 data-cell VS caledon

higher order dependently typed logic programing
data-msgpack

9.4 data-cell VS data-msgpack

A Haskell implementation of MessagePack
hashtables

9.4 1.0 data-cell VS hashtables

Mutable hash tables for Haskell, in the ST monad
discrimination

9.4 3.1 data-cell VS discrimination

Fast linear time sorting and discrimination for a large class of data types
higgledy

9.4 2.2 data-cell VS higgledy

Higher-kinded data via generics
aeson-qq

9.4 3.6 data-cell VS aeson-qq

JSON quasiquoter for Haskell
network-msgpack-rpc

9.4 data-cell VS network-msgpack-rpc

A MessagePack-RPC Implementation
jump

9.4 0.0 data-cell VS jump

Jump start your Haskell development
diskhash

9.4 0.0 data-cell VS diskhash

Diskbased (persistent) hashtable
json-autotype

9.4 0.0 data-cell VS json-autotype

Automatic Haskell type inference from JSON input
dependent-map

9.3 0.0 data-cell VS dependent-map

Dependently-typed finite maps (partial dependent products)
audiovisual

9.3 3.5 data-cell VS audiovisual

Extensible records, variants, structs, effects, tangles
reflection

9.3 4.8 data-cell VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
IORefCAS

9.3 3.5 data-cell VS IORefCAS

A collection of different packages for CAS based data structures.
dependent-sum

9.3 4.3 data-cell VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
cereal

9.3 0.0 data-cell VS cereal

A binary serialization library
certificate

9.3 0.0 data-cell VS certificate

Certificate and Key Reader/Writer in haskell
protobuf

9.2 2.6 data-cell VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
safecopy

9.2 3.1 data-cell VS safecopy

An extension to Data.Serialize with built-in version control
orgmode-parse

9.2 0.0 data-cell VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
streaming

9.2 0.0 data-cell VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
rei

9.2 0.0 data-cell VS rei

Process lists easily
bifunctors

9.2 5.6 data-cell VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
avro

9.2 4.2 data-cell VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
scientific

9.2 0.0 data-cell VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
MemoTrie

9.1 2.7 data-cell VS MemoTrie

Trie-based memo functions
uuid

9.1 2.9 data-cell VS uuid

A Haskell library for creating, printing and parsing UUIDs
b-tree

9.1 1.8 data-cell VS b-tree

Haskell on-disk B* tree implementation
uuid-types

9.1 2.9 data-cell VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
text-icu

9.1 6.1 data-cell VS text-icu

This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
witherable

9.1 6.4 data-cell VS witherable

Filter with effects
stdio

9.1 1.8 data-cell VS stdio

Haskell Standard Input and Output

Do you think we are missing an alternative of data-cell or a related project?

Add another 'Data' Package

Popular Comparisons

README

Generic cellular data representation library

Copyright © 2015 Patryk Zadarnowski «[email protected]».
All rights reserved.

This library defines a simple type used for efficient streaming of tabular data using coinductive control structures such as pipes, conduit or iteratees.

It was originally a part of pipes-cellular-csv, but was distilled into a separate module to facilitate interaction between different tabular data formats and control structures.

In this structure, each /cell/ of data is annotated with information about its relation to the following cell in the stream, namely /end of cell/, /end of row/ and /end of table/ conditions. In addition, in order to achieve truly-constant memory usage irrespective of individual cell size, we allow individual cells to be subdivided further into /parts/, as indicated by the /end of part/ condition. Logically, this subdivision into parts is supposed to be purely operational and have no semantic significance, similarly to subdivision of lazy bytestrings into chunks.