homepage: https://github.com/pkamenarsky/memdb#readme
changelog-type: markdown
hash: 07fc063ee1784904630363602a6bf321254e2f3a2edc082dc0c4c0e9859b0f83
test-bench-deps:
  cereal: -any
  bytestring: -any
  base: ! '>=4.7 && <5'
  hspec: -any
  memdb: -any
  QuickCheck: -any
  vector: -any
maintainer: p.kamenarsky@gmail.com
synopsis: Efficient in memory indexed database
changelog: |
  # Changelog for memdb

  ## Unreleased changes
basic-deps:
  cereal: -any
  bytestring: -any
  base: ! '>=4.7 && <5'
  vector: -any
all-versions:
- 1.0.0.0
author: Philip Kamenarsky
latest: 1.0.0.0
description-type: markdown
description: |
  # memdb

  [![CircleCI](https://circleci.com/gh/pkamenarsky/memdb.svg?style=svg)](https://circleci.com/gh/pkamenarsky/memdb)

  This package contains a thin wrapper over a continous memory region combined
  with an efficient reverse index implementation for fast and type-safe indexed
  lookups.

  It is aimed at storing, loading and querying big immutable datasets. Once
  written, a database can not be modified further.

  The underlying storage is pinned and thus ensures efficient garbage
  collection without ever reading the structure contents, since no pointers
  live inside the dataset that point outside it.
license-name: MIT

Update from Hackage at 2019-06-03T10:26:03Z
Update from Hackage at 2019-06-03T10:26:03Z
