Skip to content

Issues: haskell/containers

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.

Sign up for GitHub

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

Clear current search query, filters, and sorts
22 Open 10 Closed
22 Open 10 Closed
Author
Filter by author
Loading
Label
Filter by label
Loading
Use alt + click/return to exclude labels
or ⇧ + click/return for logical OR
Projects
Filter by project
Loading
Milestones
Filter by milestone
Loading
Assignee
Filter by who’s assigned
Assigned to nobody Loading
Sort
Sort by
Newest Oldest Most commented Least commented Recently updated Least recently updated Best match
Most reactions
👍 👎 😄 🎉 😕 ❤️ 🚀 👀

Issues list

More efficient folds for Seq discussion/rfc performance Seq
#1036 opened Sep 10, 2024 by meooow25
6
Data.Sequence time bounds: emphasize (stronger) that they are amortized? docs Seq
#843 opened Jul 7, 2022 by jwaldmann
1
Implement mapM for sequences performance Seq
#838 opened May 18, 2022 by treeowl
Data.Sequence sort functions should be able to inline to eliminate unknown calls. performance Seq
#799 opened Sep 7, 2021 by AndreasPK
2
Look into ways of writing an efficient divvy. Seq
#770 opened Mar 7, 2021 by kindaro
2
Add a Data.Sequence.Strict feature-request Seq
#752 opened Oct 21, 2020 by infinity0
23
FingerTree has too many instances Seq
#511 opened Jan 23, 2018 by treeowl
1
Lower Seq by a level performance Seq
#406 opened Feb 18, 2017 by Zemyla
5
Add Data.Set.catMaybes and Data.Set.mapMaybe? feature-request IntSet low-hanging-fruit Seq Set
#346 opened Oct 6, 2016 by sjakobi
19
Improve deleteAt code code-quality low-priority Seq
#271 opened May 30, 2016 by treeowl
3
Add // for Data.Sequence feature-request Seq
#262 opened May 29, 2016 by treeowl
2
Can we improve bounds checks for splitAt? performance Seq
#244 opened May 22, 2016 by treeowl
Consider specializing replicateA to IO and/or ST performance Seq
#201 opened Apr 24, 2016 by treeowl
Consider adding Data.Sequence.{splitAtR, takeR, dropR} feature-request low-hanging-fruit Seq
#159 opened Jun 22, 2015 by JLimperg
6
Can we make Data.Sequence.sort incremental and/or faster? performance Seq
#143 opened Mar 14, 2015 by treeowl
5
Consider stealing Data.Vector.accum feature-request Seq
#136 opened Feb 10, 2015 by treeowl
6
Reorganize Data.Sequence code-quality docs Seq
#128 opened Jan 13, 2015 by treeowl
Add filterM feature-request Seq
#120 opened Dec 30, 2014 by treeowl Loading…
7
Add fromArrayMonolithic feature-request needs-libraries-proposal A proposal needs to be discussed on the libraries mailing list Seq
#115 opened Dec 25, 2014 by treeowl Loading…
21
Add performance notes to Data.Sequence Haddock documentation docs performance Seq
#111 opened Dec 22, 2014 by treeowl
Export something like splitTraverseSeq info-needed Seq
#87 opened Dec 4, 2014 by treeowl
3
Data.Sequence does not check for Int overflow Seq
#83 opened Nov 24, 2014 by treeowl
5
ProTip! Updated in the last three days: updated:>2025-05-22.