<commit_before>homepage: http://code.haskell.org/ranged-sets
changelog-type: text
hash: dbbd030e5fc2cfc24ed6fffcf9fb8c17f29d9c5e9dcd05cbdccc71b70bbc6877
test-bench-deps: {}
maintainer: <EMAIL>
synopsis: Ranged sets for Haskell
changelog: |
  Version 0.0.2
  -------------

  Fixed the infinite loop with infinite sets, at least as far as possible.
  Added lots more QuickCheck properties.
  Added subset predicates.
  Added infix operators.

  Version 0.0.3
  -------------

  Removed support for infinite sets.  They sometimes still work, but generally
  are more trouble than they are worth.  There is no simple set of rules for
  client applications to guarantee termination.

  Replaced the "deriving" clause for the Range type with instance declarations.
  Empty ranges created with different bounds will now test as equal.  All
  empty ranges now compare as less than all non-empty ranges.  "show" returns
  a string such as "3.5 < x <= 4.6", or "x < 23".

  Removed "maybeRange".

  Changed "rangeIntersection" to return a "Range" instead of a "Maybe Range".
  If the intersection is empty then it returns an empty range instead of
  Nothing.

  Renamed "rangeEmpty" to "rangeIsEmpty" for consistency with "rSetIsEmpty"

  Added "emptyRange" and "fullRange"



  Version 0.0.4
  -------------

  Added Monoid instances and singleton ranges, courtesy of Jean-Philippe
  Bernardy.

  Version 0.2.0
  -------------

  Reorganised and extended tests.
  Added "rangeIsFull" predicate.

  Version 0.2.1
  -------------
  Require QuickCheck < 2.

  Version 0.3.0
  -------------
  Require QuickCheck >= 2.4. This changes the API for the Arbitrary and CoArbitrary
  instances, so it gets a version number bump.
basic-deps:
  base: ! '>=4 && <4.11'
  HUnit: -any
  QuickCheck: ! '>=2'
all-versions:
- 0.1.0
- 0.1.1
- 0.2.0
- 0.2.1
- 0.3.0
author: <NAME>
latest: 0.3.0
description-type: text<commit_msg>Update from Hackage at 2019-03-11T09:29:46Z<commit_after>homepage: https://github.com/PaulJohnson/Ranged-sets
changelog-type: text
hash: 45b6674c9e8fba2c3a5bdc52cf3a41e41197c4215c19f912d8785900cb3219bb
test-bench-deps:
  base: ! '>=4 && <5'
  HUnit: -any
  QuickCheck: -any
maintainer: <EMAIL>
synopsis: Ranged sets for Haskell
changelog: |
  Version 0.0.2
  -------------

  Fixed the infinite loop with infinite sets, at least as far as possible.
  Added lots more QuickCheck properties.
  Added subset predicates.
  Added infix operators.

  Version 0.0.3
  -------------

  Removed support for infinite sets.  They sometimes still work, but generally
  are more trouble than they are worth.  There is no simple set of rules for
  client applications to guarantee termination.

  Replaced the "deriving" clause for the Range type with instance declarations.
  Empty ranges created with different bounds will now test as equal.  All
  empty ranges now compare as less than all non-empty ranges.  "show" returns
  a string such as "3.5 < x <= 4.6", or "x < 23".

  Removed "maybeRange".

  Changed "rangeIntersection" to return a "Range" instead of a "Maybe Range".
  If the intersection is empty then it returns an empty range instead of
  Nothing.

  Renamed "rangeEmpty" to "rangeIsEmpty" for consistency with "rSetIsEmpty"

  Added "emptyRange" and "fullRange"



  Version 0.0.4
  -------------

  Added Monoid instances and singleton ranges, courtesy of Jean-Philippe
  Bernardy.

  Version 0.2.0
  -------------

  Reorganised and extended tests.
  Added "rangeIsFull" predicate.

  Version 0.2.1
  -------------
  Require QuickCheck < 2.

  Version 0.3.0
  -------------
  Require QuickCheck >= 2.4. This changes the API for the Arbitrary and CoArbitrary
  instances, so it gets a version number bump.

  Version 0.4.0
  -------------

  Added Semigroup instance.
  Enabled "cabal test".
  Master repository now on GitHub.
basic-deps:
  base: ! '>=4 && <5'
  HUnit: -any
  QuickCheck: ! '>=2'
all-versions:
- 0.1.0
- 0.1.1
- 0.2.0
- 0.2.1
- 0.3.0
- 0.4.0
author: <NAME>
latest: 0.4.0
description-type: text
{'fraction_non_alphanumeric': 0.12129514321295143, 'fraction_numerical': 0.04682440846824409, 'mean_word_length': 2.8211227402473833, 'pattern_counts': {'":': 0, '<': 18, '<?xml version=': 0, '>': 14, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, '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': '4526198', 'n_tokens_mistral': 1438, 'n_tokens_neox': 1280, 'n_words': 476}