packages feed

rocksdb-query-0.7.0: CHANGELOG.md

# Changelog
All notable changes to this project will be documented in this file.

The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/)
and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html).

## 0.7.0 - 2026-11-15
### Changed
- Prefix queries read the database in chunks, through `iterChunk` of
  rocksdb-haskell-jprupp 2.8.0, which is now required. They made a call into
  RocksDB for every entry, and each such call costs a Haskell thread its
  capability, which it has to wait for under load. Lists now read up to 256
  entries or a megabyte per call. Conduits read 16 entries, then 64, then
  256 at a time, so that a consumer who stops early has made the database
  read little more than it took.
- The list functions no longer use stack for every entry. Their loop left a
  frame there for each one, and the run-time system walks the stack at every
  call that may block, so each entry cost more the longer the list was.
- Together, `matchingAsList` on four cores: 2,000 entries in 1 ms where they
  took 5, and from sixteen threads at once in 6 ms where they took 48;
  200,000 entries in 0.12 s where they took 0.54, and from sixteen threads
  in 0.92 s where they took 4.8.
- `firstMatching` and its variants read the one entry and nothing after it,
  without a conduit.
- A failure of RocksDB to read, such as a corrupt block, is thrown as an
  `IOError`. It used to look like the end of the data, and the result was
  only shorter.
- After a consumer of `matching` or `matchingSkip` stops, the iterator is
  past the entries read ahead, and no longer on the last one yielded.
- The module has an export list. It exports everything that it did before;
  the helpers that are new stay internal.

## 0.6.1
### Changed
- Documentation: the README explains the purpose and design of the library,
  with installation steps and a tutorial on modelling a schema, and the
  Haddock of every function says why it works the way it does.
- Build against rocksdb-haskell-jprupp 2.6.1 and Stackage nightly-2026-11-07.

## 0.6.0
### Changed
- Get rid of MonadIO and operate directly on IO monad.

## 0.5.0
### Changed
- Improvements to rocksdb-haskell-jprupp package.

## 0.4.2
### Adedd
- Forgot to add retrieval using column families.

## 0.4.1
### Added
- Support column families.

## 0.4.0
### Changed
- Depend on my new Haskell bindings.

## 0.3.2
### Changed
- Use MIT license.
- Udate dependencies.

## 0.3.1
### Changed
- List functions do not use conduits.
- Reuse serialized version of key prefix.
- Avoid building extra bytestring for key prefix comparison.

## 0.3.0
### Changed
- Make conduits polymorphic on input parameter.

## 0.2.0
### Changed
- Accept read options instead of snapshot for read operations.

## 0.1.4
### Changed
- Documentation improvements.

## 0.1.3
### Changed
- Reduce documentation verbosity and correct wording.

## 0.1.2
### Added
- Documentation for all functions.

## 0.1.1
### Changed
- Separate package dependencies.

## 0.1.0
### Added
- Typeclasses for key/value pairs, base keys and key seekers.
- Functions for creating, updating, deleting records.
- Functions for retrieving multiple records.
- Fuunctions for streaming records.