Skip to content

Sync non-empty branch with upstream #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 94 commits into from
Sep 27, 2022

Conversation

alexfmpe
Copy link

@alexfmpe alexfmpe commented Sep 27, 2022

ggreif and others added 30 commits January 10, 2020 10:22
* Fix Haddocks for `mapAccumRWithKey`
Simply import `GHC.Exts` fully qualified to avoid fussy CPP.
deleteFindMin was missing the map argument (`empty`).
Make previously (grandfathered) ReadTheDocs configuration explicit. This is in
preparation for upgrading to Python 3 which is the default on ReadTheDocs now.

[ci skip]
- Update .readthedocs.yml
- Use Python 3 compatible haddock-autolink Sphinx extension.

[ci skip]
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.
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.
* Document the invariants of `raptyMiddle`.
* Simplify some of the arithmetic.
* Reorganize the arguments for clarity.
* 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.
Reimplement (<*) for sequences.
* 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
* Add Data.IntSet.alterF

Fixes haskell#719.

* Add Const rule and specialize for Identity

* Add tests

* Docs

* Work around missing Show instance for Const in GHC 7.8
- 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.
* Mention Data.IntSet.alterF in changelog

* Mention Li-Yao Xia in documentation bullet point.
Updates the definition of `Monoid (Seq a)` to use canonical definition of `mappend`, allowing https://gitlab.haskell.org/ghc/ghc/-/merge_requests/3174 to pass
Hackage now requires `cabal-version >= 1.10`.
Add `default-language` field all over the place.
treeowl and others added 28 commits January 20, 2022 16:40
Add `Lift` instances for `Seq`, `ViewL`, and `ViewR`. The `Seq` instance
tries to be a bit clever about the shape of the resulting tree and the
size of the splice; everything else is straightforward.
Add `Lift` instances for `Data.Map.Map`, `Data.Set.Set`,
`Data.IntSet.IntSet`, `Data.IntMap.IntMap`, `Data.Tree.Tree`,
and `Data.Graph.SCC`.
Co-authored-by: David Feuer <David.Feuer@gmail.com>
Test with 9.4 and head.
Use a private `Prelude` temporarily to deal with warnings arising
from the fact that `liftA2` hasn't always been exposed in the
`Prelude`. Other approaches seemed to involve too much CPP or
required disabling redundant import warnings, which we really don't
want.
I don't see a warning, but it seems a bit silly to export
`Applicative (..)` explicitly from the custom prelude when
`base >= 4.18.0`. Let's not.
@alexfmpe alexfmpe changed the title Sync with upstream Sync non-empty branch with upstream Sep 27, 2022
@Ericson2314 Ericson2314 merged commit 3239184 into obsidiansystems:non-empty Sep 27, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.