<commit_before>homepage: https://github.com/andrewthad/bytesmith
changelog-type: markdown
hash: bb18bb890dda56b9b2aa44e79028082ce07e7c707bd441aac289dccc31d3d01a
test-bench-deps:
  bytestring: -any
  base: ! '>=4.12.0.0 && <5'
  gauge: -any
  byteslice: -any
  tasty-quickcheck: -any
  tasty-hunit: -any
  tasty: -any
  primitive: -any
  bytesmith: -any
maintainer: <EMAIL>
synopsis: Nonresumable byte parser
changelog: |
  # Revision history for bytesmith

  ## 0.2.0.1 -- 2019-09-24

  * Correct an overflow-detection mistake in the implementation
    of machine-word parsers.

  ## 0.2.0.0 -- 2019-09-24

  * Add big-endian word parsers.
  * Redo module structure so that encoding-specific functions each
    live in their own module.
  * Add a lot more functions and attempt to make naming somewhat
    consistent.
  * Add `delimit`.
  * Add `replicate`.
  * Add `annotate` and its infix synonym `<?>`.

  ## 0.1.0.0 -- 2019-08-22

  * First version.
basic-deps:
  bytestring: ! '>=0.10.8 && <0.11'
  text-short: ! '>=0.1.3 && <0.2'
  base: ! '>=4.12 && <5'
  run-st: ! '>=0.1 && <0.2'
  contiguous: ! '>=0.4 && <0.6'
  byteslice: ! '>=0.1.3 && <0.2'
  primitive: ! '>=0.7 && <0.8'
all-versions:
- 0.1.0.0
- 0.2.0.0
- 0.2.0.1
author: Andrew Martin
latest: 0.2.0.1
description-type: haddock
description: |-
  Parse bytes as fast as possible. This is a nonresumable parser
  that aggresively uses `UnboxedSums` to avoid performing any
  allocations.
license-name: BSD-3-Clause<commit_msg>Update from Hackage at 2019-09-30T12:32:52Z<commit_after>homepage: https://github.com/andrewthad/bytesmith
changelog-type: markdown
hash: 9cdbd3ecca3afae792f722f1e0c3261877d9c0ef3b09ce8ea229933e41fe2182
test-bench-deps:
  bytestring: -any
  base: ! '>=4.12.0.0 && <5'
  gauge: -any
  byteslice: -any
  tasty-quickcheck: -any
  tasty-hunit: -any
  tasty: -any
  primitive: -any
  bytesmith: -any
maintainer: <EMAIL>
synopsis: Nonresumable byte parser
changelog: |
  # Revision history for bytesmith

  ## 0.3.0.0 -- 2019-??-??

  * Include the offset into the byte sequence in `Result`. Breaking change.
  * Rename `hexWord16` to `hexFixedWord16`. Breaking change.
  * Rename `parseBytesST` to `parseBytesEffectfully`. Breaking change.
  * Add `hexNibbleLower` and `tryHexNibbleLower`.
  * Add `hexNibble` and `tryHexNibble`.

  ## 0.2.0.1 -- 2019-09-24

  * Correct an overflow-detection mistake in the implementation
    of machine-word parsers.

  ## 0.2.0.0 -- 2019-09-24

  * Add big-endian word parsers.
  * Redo module structure so that encoding-specific functions each
    live in their own module.
  * Add a lot more functions and attempt to make naming somewhat
    consistent.
  * Add `delimit`.
  * Add `replicate`.
  * Add `annotate` and its infix synonym `<?>`.

  ## 0.1.0.0 -- 2019-08-22

  * First version.
basic-deps:
  bytestring: ! '>=0.10.8 && <0.11'
  text-short: ! '>=0.1.3 && <0.2'
  base: ! '>=4.12 && <5'
  run-st: ! '>=0.1 && <0.2'
  contiguous: ! '>=0.4 && <0.6'
  byteslice: ! '>=0.1.3 && <0.2'
  primitive: ! '>=0.7 && <0.8'
all-versions:
- 0.1.0.0
- 0.2.0.0
- 0.2.0.1
- 0.3.0.0
author: <NAME>
latest: 0.3.0.0
description-type: haddock
description: |-
  Parse bytes as fast as possible. This is a nonresumable parser
  that aggresively uses `UnboxedSums` to avoid performing any
  allocations.
license-name: BSD-3-Clause
{'fraction_non_alphanumeric': 0.15158777711204313, 'fraction_numerical': 0.08568004793289395, 'mean_word_length': 3.1478260869565218, 'pattern_counts': {'":': 0, '<': 24, '<?xml version=': 0, '>': 24, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 18, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1045121', 'n_tokens_mistral': 1482, 'n_tokens_neox': 1337, 'n_words': 336}