<commit_before>homepage: https://github.com/Bodigrim/integer-roots
changelog-type: markdown
hash: cbd8a6d3cc52193192c1f7553df38123f7f966b28c087a34a722dbc6133791ea
test-bench-deps:
  tasty-smallcheck: '>=0.8 && <0.9'
  base: '>=4.9 && <5'
  integer-roots: -any
  doctest: '>=0.8'
  smallcheck: '>=1.2 && <1.3'
  tasty-quickcheck: '>=0.9 && <0.11'
  tasty-hunit: '>=0.9 && <0.11'
  tasty: '>=0.10'
maintainer: <NAME> <EMAIL>
synopsis: Integer roots and perfect powers
changelog: |
  # 1.0.1.0

  * Fixes for big-endian architectures.

  # 1.0.0.1

  * Compatibility fixes for GHC 9.2.

  # 1.0

  * Initial release.
basic-deps:
  base: '>=4.9 && <5'
  integer-gmp: <1.2
all-versions:
- '1.0'
- 1.0.0.1
- 1.0.1.0
author: <NAME>, <NAME>
latest: 1.0.1.0
description-type: markdown
description: |
  # integer-roots [![Hackage](http://img.shields.io/hackage/v/integer-roots.svg)](https://hackage.haskell.org/package/integer-roots) [![Stackage LTS](http://stackage.org/package/integer-roots/badge/lts)](http://stackage.org/lts/package/integer-roots) [![Stackage Nightly](http://stackage.org/package/integer-roots/badge/nightly)](http://stackage.org/nightly/package/integer-roots)

  Calculating integer roots and testing perfect powers of arbitrary precision.

  ## Integer square root

  The [integer square root](https://en.wikipedia.org/wiki/Integer_square_root)
  (`integerSquareRoot`)
  of a non-negative integer
  _n_
  is the greatest integer
  _m_
  such that
  <img src="https://render.githubusercontent.com/render/math?math=m\le\sqrt{n}">.
  Alternatively, in terms of the
  [floor function](https://en.wikipedia.org/wiki/Floor_and_ceiling_functions),<commit_msg>Update from Hackage at 2021-11-22T20:15:20Z<commit_after>homepage: https://github.com/Bodigrim/integer-roots
changelog-type: markdown
hash: b56ae45f447d744aad863a655039f0ba7eda551eed402c5b0d263f73140100fa
test-bench-deps:
  tasty-smallcheck: '>=0.8 && <0.9'
  base: '>=4.9 && <5'
  integer-roots: -any
  doctest: '>=0.8'
  smallcheck: '>=1.2 && <1.3'
  tasty-quickcheck: '>=0.9 && <0.11'
  tasty-hunit: '>=0.9 && <0.11'
  tasty: '>=0.10'
maintainer: <NAME> andrew dot lelechenko at g<EMAIL> dot com
synopsis: Integer roots and perfect powers
changelog: |
  # 1.0.2.0

  * More fixes for big-endian architectures.

  # 1.0.1.0

  * Fixes for big-endian architectures.

  # 1.0.0.1

  * Compatibility fixes for GHC 9.2.

  # 1.0

  * Initial release.
basic-deps:
  base: '>=4.9 && <5'
  integer-gmp: <1.2
all-versions:
- '1.0'
- 1.0.0.1
- 1.0.1.0
- 1.0.2.0
author: <NAME>, <NAME>
latest: 1.0.2.0
description-type: markdown
description: |
  # integer-roots [![Hackage](http://img.shields.io/hackage/v/integer-roots.svg)](https://hackage.haskell.org/package/integer-roots) [![Stackage LTS](http://stackage.org/package/integer-roots/badge/lts)](http://stackage.org/lts/package/integer-roots) [![Stackage Nightly](http://stackage.org/package/integer-roots/badge/nightly)](http://stackage.org/nightly/package/integer-roots)

  Calculating integer roots and testing perfect powers of arbitrary precision.

  ## Integer square root

  The [integer square root](https://en.wikipedia.org/wiki/Integer_square_root)
  (`integerSquareRoot`)
  of a non-negative integer
  _n_
  is the greatest integer
  _m_
  such that
  <img src="https://render.githubusercontent.com/render/math?math=m\le\sqrt{n}">.
  Alternatively, in terms of the
  [floor function](https://en.wikipedia.org/wiki/Floor_and_ceiling_functions),
{'fraction_non_alphanumeric': 0.16892867455963037, 'fraction_numerical': 0.062951198382905, 'mean_word_length': 4.034883720930233, 'pattern_counts': {'":': 0, '<': 27, '<?xml version=': 0, '>': 29, 'https://': 10, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 12, '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': '4867607', 'n_tokens_mistral': 1497, 'n_tokens_neox': 1355, 'n_words': 246}