Add `default-language` field all over the place.

Hackage now requires `cabal-version >= 1.10`.

Fixes #724.

Context: #717

Updates the definition of `Monoid (Seq a)` to use canonical definition of `mappend`, allowing ghc/ghc!3174 to pass

* Mention Data.IntSet.alterF in changelog

* Mention Li-Yao Xia in documentation bullet point.

- Renamed aptyMiddle to liftA2Middle and some of its parameters
- Document invariants and meaning of parameters.
- A short note about sharing related to ffirstx, flastx, and f.

* Add Data.IntSet.alterF

Fixes #719.

* Add Const rule and specialize for Identity

* Add tests

* Docs

* Work around missing Show instance for Const in GHC 7.8

Add 'compose' for maps

* Make Map an instance of Bifoldable



* Replace the Arbitrary instance for Map with an adaptation of the one from Set

* Use a Map and toList instead of a list and fromList

Reimplement (<*) for sequences.

* Rename and clarify some functions based on discussions with
  @int-e and @Lysxia.
* Make `mapMulFT` unconditionally strict in its multiplier to avoid
  one silly box.
* Update changelog with credits.
* Build the 2-3 trees more eagerly to reduce heap allocation.

Xia Li-yao authored 5 years ago and David Feuer committed 5 years ago

* Document the invariants of `raptyMiddle`.
* Simplify some of the arithmetic.
* Reorganize the arguments for clarity.

Remove the explicit intermediate spine structure from `(<*)`.
I don't really know if this is a good or a bad thing from a
clarity standpoint.

Make `(<*)` for `Data.Sequence` incrementally asymptotically optimal.
This finally completes the task, begun in December 2014, of making all
the `Applicative` methods for sequences asymptotically optimal
even when their results are consumed incrementally.

- Update .readthedocs.yml
- Use Python 3 compatible haddock-autolink Sphinx extension.

[ci skip]

Make previously (grandfathered) ReadTheDocs configuration explicit. This is in
preparation for upgrading to Python 3 which is the default on ReadTheDocs now.

[ci skip]

deleteFindMin was missing the map argument (`empty`).

This submodule appears to have been errenously removed in [30ccbaa2].

[30ccbaa2]: https://github.com/haskell/containers/commit/30ccbaa201043109bf1ee905c66ccd0dbe24422f#diff-fc048ebf98a95fc8a8ff9c949d9b49a9.

Closes #696.

Simon Jakobi authored 5 years ago and David Feuer committed 5 years ago

Simply import `GHC.Exts` fully qualified to avoid fussy CPP.

Gabor Greif authored 5 years ago and David Feuer committed 5 years ago

* Fix Haddocks for `mapAccumRWithKey`

Simon Jakobi authored 5 years ago and David Feuer committed 5 years ago

Also:
* Fix a bunch of warnings.
* Disable "cabal check" in Travis CI, since it dislikes -Werror

Simon Jakobi authored 5 years ago and David Feuer committed 5 years ago

Closes #692.

This includes a test for the effects sequencing in Data.Map.mergeA.

jwaldmann authored 5 years ago and David Feuer committed 5 years ago

* Test that instances for Eq and Ord agree with going via toAscList

* Add benchmark for "instance Ord IntSet", using "Set IntSet"

* Improve implementation of "instance Ord IntSet"
that avoids toAscList and walks the tree directly. See #470

Matthew Pickering authored 5 years ago and David Feuer committed 5 years ago

The function is self-recursive and not overloaded, therefore I see no reason for the pragma. 

Core lint warns - 

```
*** Core Lint warnings : in result of Simplifier ***
libraries/containers/containers/src/Data/Sequence/Internal/Sorting.hs:389:1: warning:
    [RHS of foldToMaybeTree :: forall b a.
                               (b -> b -> b) -> (a -> b) -> FingerTree a -> Maybe b]
    INLINE binder is (non-rule) loop breaker: foldToMaybeTree
```

Simon Jakobi authored 5 years ago and David Feuer committed 5 years ago

Fixes #629.

Felix Paulusma authored 5 years ago and David Feuer committed 5 years ago

* corrected traverseWithKey changing the structure of the map

* also updated the other traverse* functions to use the correct order of traversing

* added property tests for traversals





* fixed /mapAccumR?WithKey/ as well

* adjusted tests for map* functions to also incluse negative numbers

* fixed minimum and maximum methods of IntMap to keep order so that "minimum intMap == minimum (elems intMap)"


* added negative numbers to all unit tests

* fixed filterWithKeyA to also consider negative keys

* IntMap/tests: added degrade prop tests to traverseMaybeWithKey and misc

* IntMap/tests: also added degradation test from traverseWithKey to mapWithKey

Use countTrailingZeros for indexOfTheOnlyBit

Javran Cheng authored 5 years ago and David Feuer committed 5 years ago

* Add Data.IntSet.mapMonotonic.

This patch fills in the missing piece for Data.IntSet,
since Data.{Map,IntMap} and Data.Set all have this function.
(for Map variant it's `mapKeysMonotonic`)

* test mapMonotonic property on id and linear.