<commit_before>homepage: https://gitlab.utc.fr/gsabbagh/sets
changelog-type: markdown
hash: 2d56cbd0e57424daedef2e19af6e3f8471aec1f0d5d5b34084479684e7a6a987
test-bench-deps:
  base: ^>=4.15.0.0
  WeakSets: -any
maintainer: <EMAIL>
synopsis: Simple set types. Useful to create sets of arbitrary types and nested sets.
changelog: "# Revision history for Sets\r\n\r\n## 0.1.0.0 -- 2022-07-12\r\n\r\n* First
  version. Released on an unsuspecting world.\r\n\r\n## 1.0.0.0 -- 2022-07-17\r\n\r\n*
  Data.WeakSet and Data.WeakMap are now valid alternatives to Data.Set and Data.Map.\r\n\r\n#
  1.1.0.0 -- 2022-07-19\r\n\r\n* Correction of wrong function declaration of (|^|)\r\n\r\n#
  1.1.1.0 -- 2022-07-19\r\n\r\n* Implementation of drop, take and splitAt\r\n\r\n#
  1.1.2.0 -- 2022-07-19\r\n\r\n* Addition of weakMapFromSet and correction of WeakMap
  Show instance.\r\n\r\n# 1.1.3.0 -- 2022-07-20\r\n\r\n* Addition of inverse and pseudoInverse
  functions.\r\n\r\n# 1.1.4.0 -- 2022-07-20\r\n\r\n* Major bug correction : instance
  Eq for Data.WeakMap\r\n\r\n# 1.2.0.0 -- 2022-07-20\r\n\r\n* Major bug correction
  : instance Foldable removed for Data.WeakMap and Data.WeakSet\r\n\r\n# 1.2.1.0 --
  2022-07-23\r\n\r\n* Adding anElement function\r\n\r\n# 1.2.2.0 -- 2022-07-24\r\n\r\n*
  Adding enumerateMaps function"
basic-deps:
  base: ^>=4.15.0.0
all-versions:
- 0.1.0.0
- 0.2.0.0
- 0.3.0.0
- 0.4.0.0
- 1.0.0.0
- 1.1.0.0
- 1.1.1.0
- 1.1.2.0
- 1.1.3.0
- 1.1.4.0
- 1.2.0.0
- 1.2.2.0
author: <NAME>
latest: 1.2.2.0
description-type: markdown
description: "# WeakSets\n\nThis is a Haskell package which defines sets and maps
  in a more general way than Data.Set and Data.Map of the containers package.\n\nThis
  package answers three problems : \n\n* how to make sets of types which do not implement
  the Ord typeclass (which is required by Data.Set), this problem is solved by `Data.WeakSet`;\n*
  how to make maps of types which do not implement the Ord typeclass, this problem
  is solved by `Data.WeakMap`;\n* how to make arbitrarily nested sets as set theory
  allows. This problem is resolved thanks to `Math.PureSet`.\n\nData.WeakSet and Data.WeakMap<commit_msg>Update from Hackage at 2022-07-25T18:35:22Z<commit_after>homepage: https://gitlab.utc.fr/gsabbagh/sets
changelog-type: markdown
hash: 09a0947626b69b2b7161d17b4a0694fb3eb4312e8c1b8c02d6350efa6ac0d7aa
test-bench-deps:
  base: ^>=4.15.0.0
  WeakSets: -any
maintainer: <EMAIL>
synopsis: Simple set types. Useful to create sets of arbitrary types and nested sets.
changelog: "# Revision history for Sets\r\n\r\n## 0.1.0.0 -- 2022-07-12\r\n\r\n* First
  version. Released on an unsuspecting world.\r\n\r\n## 1.0.0.0 -- 2022-07-17\r\n\r\n*
  Data.WeakSet and Data.WeakMap are now valid alternatives to Data.Set and Data.Map.\r\n\r\n#
  1.1.0.0 -- 2022-07-19\r\n\r\n* Correction of wrong function declaration of (|^|)\r\n\r\n#
  1.1.1.0 -- 2022-07-19\r\n\r\n* Implementation of drop, take and splitAt\r\n\r\n#
  1.1.2.0 -- 2022-07-19\r\n\r\n* Addition of weakMapFromSet and correction of WeakMap
  Show instance.\r\n\r\n# 1.1.3.0 -- 2022-07-20\r\n\r\n* Addition of inverse and pseudoInverse
  functions.\r\n\r\n# 1.1.4.0 -- 2022-07-20\r\n\r\n* Major bug correction : instance
  Eq for Data.WeakMap\r\n\r\n# 1.2.0.0 -- 2022-07-20\r\n\r\n* Major bug correction
  : instance Foldable removed for Data.WeakMap and Data.WeakSet\r\n\r\n# 1.2.1.0 --
  2022-07-23\r\n\r\n* Adding anElement function\r\n\r\n# 1.2.2.0 -- 2022-07-24\r\n\r\n*
  Adding enumerateMaps function\r\n\r\n# 1.2.3.0 -- 2022-07-25\r\n\r\n* Adding all
  functions from Foldable"
basic-deps:
  base: ^>=4.15.0.0
all-versions:
- 0.1.0.0
- 0.2.0.0
- 0.3.0.0
- 0.4.0.0
- 1.0.0.0
- 1.1.0.0
- 1.1.1.0
- 1.1.2.0
- 1.1.3.0
- 1.1.4.0
- 1.2.0.0
- 1.2.2.0
- 1.2.3.0
author: <NAME>
latest: 1.2.3.0
description-type: markdown
description: "# WeakSets\n\nThis is a Haskell package which defines sets and maps
  in a more general way than Data.Set and Data.Map of the containers package.\n\nThis
  package answers three problems : \n\n* how to make sets of types which do not implement
  the Ord typeclass (which is required by Data.Set), this problem is solved by `Data.WeakSet`;\n*
  how to make maps of types which do not implement the Ord typeclass, this problem
  is solved by `Data.WeakMap`;\n* how to make arbitrarily nested sets as set theory
  allows. This problem is resolved thanks to `Math.PureSet`.\n\nData.WeakSet and Data.WeakMap
{'fraction_non_alphanumeric': 0.1566644189705552, 'fraction_numerical': 0.10609125646212632, 'mean_word_length': 2.8763066202090593, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 11, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 52, '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': '1174272', 'n_tokens_mistral': 2152, 'n_tokens_neox': 1909, 'n_words': 479}