{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":1924888,"defaultBranch":"master","name":"containers","ownerLogin":"haskell","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2011-06-20T17:48:10.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/450574?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1706872258.0","currentOid":""},"activityList":{"items":[{"before":"855d6f8e6688c96374087c34cdd77d3ef53ef9cd","after":"c651094ec026b90c4e9d4ed81bc15eb337d3fc2e","ref":"refs/heads/master","pushedAt":"2024-03-30T04:35:17.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Optimize IntMap.Bin (#995)\n\n* IntMap: Merge prefix and mask in Bin\r\n\r\n* Update lookupGE benchmarks\r\n\r\n* Add note on the relation to the Okasaki-Gill paper\r\n\r\n* Adopt BurningWitness's lower/upper helpers\r\n\r\n* Add property tests for is{Proper}SubmapOfBy\r\n\r\n* Generate large keys in Arbitrary IntMap for better coverage\r\n\r\n* Add GHC flag to prevent benchmarks from changing due to unpredictable alignment changes","shortMessageHtmlLink":"Optimize IntMap.Bin (#995)"}},{"before":"8f6ef9a1df028e812f9e0b52acd76e59fbafd53f","after":"855d6f8e6688c96374087c34cdd77d3ef53ef9cd","ref":"refs/heads/master","pushedAt":"2024-03-28T20:20:21.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Fix strictness bugs in `fromDistinctAscList` and `fromDistinctDescList` (#996)\n\n* Add a counterexample annotation to whnfHasNoThunks\r\n\r\n* Add NoThunks tests for `fromDistinctAscList` and `fromDistinctDescList`\r\n\r\n* Fix strictness bugs in `fromDistinctAscList` and `fromDistinctDescList`","shortMessageHtmlLink":"Fix strictness bugs in fromDistinctAscList and `fromDistinctDescLis…"}},{"before":"3c13e0b03bde9aab4ce1ea7b23be1c713b89d32b","after":"8f6ef9a1df028e812f9e0b52acd76e59fbafd53f","ref":"refs/heads/master","pushedAt":"2024-03-09T19:35:26.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Elaborate on asymptotics of IntMap (#957)","shortMessageHtmlLink":"Elaborate on asymptotics of IntMap (#957)"}},{"before":"fd3312c119129cf06a41303da9564d5957684e60","after":"0b3730c77af9551a2e0913b0847bfb68bf4c3dde","ref":"refs/heads/flattenSCC1","pushedAt":"2024-02-06T08:41:28.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"andreasabel","name":"Andreas Abel","path":"/andreasabel","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1155218?s=80&v=4"},"commit":{"message":"CHANGELOG: fix whitespace","shortMessageHtmlLink":"CHANGELOG: fix whitespace"}},{"before":"80179ab3a1f11eafd94ff005316da78f9593dd40","after":"fd3312c119129cf06a41303da9564d5957684e60","ref":"refs/heads/flattenSCC1","pushedAt":"2024-02-02T12:15:28.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"andreasabel","name":"Andreas Abel","path":"/andreasabel","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1155218?s=80&v=4"},"commit":{"message":"Add `flattenSCC1 :: SCC a -> NonEmpty a`\n\nThis gives a more precise type to the existing `flattenSCC :: SCC a -> [a]`.\nCloses #985.","shortMessageHtmlLink":"Add flattenSCC1 :: SCC a -> NonEmpty a"}},{"before":null,"after":"80179ab3a1f11eafd94ff005316da78f9593dd40","ref":"refs/heads/flattenSCC1","pushedAt":"2024-02-02T11:10:58.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"andreasabel","name":"Andreas Abel","path":"/andreasabel","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1155218?s=80&v=4"},"commit":{"message":"Add `flattenSCC1 :: SCC a -> NonEmpty a`\n\nThis gives a more precise type to the existing `flattenSCC :: SCC a -> [a]`.\nCloses #985.","shortMessageHtmlLink":"Add flattenSCC1 :: SCC a -> NonEmpty a"}},{"before":"014a20711911845602eeb9ee81e77cb502406652","after":null,"ref":"refs/heads/deepseq-1.5","pushedAt":"2024-02-02T07:09:22.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"andreasabel","name":"Andreas Abel","path":"/andreasabel","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1155218?s=80&v=4"}},{"before":"a4e8d167c0c0f0001e48f499d33735a61c68d9d4","after":"3c13e0b03bde9aab4ce1ea7b23be1c713b89d32b","ref":"refs/heads/master","pushedAt":"2024-02-01T21:24:35.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"containers-test: allow deepseq-1.5; bump CI to latest GHC minor versions (#986)","shortMessageHtmlLink":"containers-test: allow deepseq-1.5; bump CI to latest GHC minor versi…"}},{"before":null,"after":"014a20711911845602eeb9ee81e77cb502406652","ref":"refs/heads/deepseq-1.5","pushedAt":"2024-02-01T13:04:01.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"andreasabel","name":"Andreas Abel","path":"/andreasabel","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1155218?s=80&v=4"},"commit":{"message":"containers-test: allow deepseq-1.5; bump CI to latest GHC minor versions","shortMessageHtmlLink":"containers-test: allow deepseq-1.5; bump CI to latest GHC minor versions"}},{"before":"68e24da1b9a97f0095fe71eda03a6acb7779b32d","after":"a4e8d167c0c0f0001e48f499d33735a61c68d9d4","ref":"refs/heads/master","pushedAt":"2024-01-14T00:51:37.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Make IntSet splitMember strict in the key (#983)\n\nCurrently, the key is ignored for an empty set.","shortMessageHtmlLink":"Make IntSet splitMember strict in the key (#983)"}},{"before":"f5d0b13251291c3bd1ae396f3e6c8b0b9eaf58b0","after":"68e24da1b9a97f0095fe71eda03a6acb7779b32d","ref":"refs/heads/master","pushedAt":"2024-01-14T00:15:43.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Make IntMap split, splitLookup strict in the key (#982)\n\nCurrently, the key is ignored for an empty map.\r\n\r\nAll IntMap and IntSet functions taking a key are strict in the key.\r\nThis allows the Int to be unboxed.","shortMessageHtmlLink":"Make IntMap split, splitLookup strict in the key (#982)"}},{"before":"22f22471cd48195da16157783f98e67989771415","after":"f5d0b13251291c3bd1ae396f3e6c8b0b9eaf58b0","ref":"refs/heads/master","pushedAt":"2023-09-27T12:12:31.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Bump version to 0.7 (#973)","shortMessageHtmlLink":"Bump version to 0.7 (#973)"}},{"before":"269f53e6c466a1cb97c5c848ef90e8bd7eba2a3a","after":"22f22471cd48195da16157783f98e67989771415","ref":"refs/heads/master","pushedAt":"2023-09-27T10:47:58.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Map/IntMap: Document the most common O(n²) performance mistake (#961)","shortMessageHtmlLink":"Map/IntMap: Document the most common O(n²) performance mistake (#961)"}},{"before":"9d395e4a6ef63df58d9f1e087f66b2561ba28bc0","after":"269f53e6c466a1cb97c5c848ef90e8bd7eba2a3a","ref":"refs/heads/master","pushedAt":"2023-09-27T10:44:26.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Revert union, difference, etc. complexity changes (#958)\n\nAs discussed in #870, the complexities for union, difference, etc. on\r\nSet and Map were changed in #830 to fix some partiality in the\r\nexpressions, but along the way new partiality was introduced, and useful\r\nspecial cases like m = 1 get incorrect complexity values from the new\r\nformulas.\r\n\r\nThe original formula was as stated in the original paper:\r\n https://dl.acm.org/doi/10.1145/322123.322127\r\nand this holds for 0 < m <= n, which seems sufficient to me. (The m=0\r\ncase is excluded, but for m=0 nothing needs to be done anyway. This\r\ncontrary to the m=1 case, in which useful work with very specific\r\ncomplexity (namely, O(log(n))) needs to be done.)\r\n\r\nThis commit reverts all occurrences of the modified complexity formula\r\nback to the original one.","shortMessageHtmlLink":"Revert union, difference, etc. complexity changes (#958)"}},{"before":"b652f2fe9f2bbccaffbbb2ea3e6bc88b556a6ba1","after":"9d395e4a6ef63df58d9f1e087f66b2561ba28bc0","ref":"refs/heads/master","pushedAt":"2023-09-27T10:43:09.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Add Data.IntSet.fromRange (#965)\n\nfromRange (l,h) is faster than fromRange [l..h], primarily because we\r\ncan pack Tips with multiple elements at once.","shortMessageHtmlLink":"Add Data.IntSet.fromRange (#965)"}},{"before":"e400579ec0c084dd996b7ba10a5cea6e28b9c52d","after":"b652f2fe9f2bbccaffbbb2ea3e6bc88b556a6ba1","ref":"refs/heads/master","pushedAt":"2023-09-27T10:40:58.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Fix some IntMap time complexities (#967)\n\nIntMap.mapKeysMonotonic and IntMap.keysSet take linear time.","shortMessageHtmlLink":"Fix some IntMap time complexities (#967)"}},{"before":"e74ac0b5ad84b4ad5ba9b5b5ff5806ecbe797e1c","after":"e400579ec0c084dd996b7ba10a5cea6e28b9c52d","ref":"refs/heads/master","pushedAt":"2023-09-06T17:32:16.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Future-proof testsuite against potential Prelude.foldl' (#969)","shortMessageHtmlLink":"Future-proof testsuite against potential Prelude.foldl' (#969)"}},{"before":"f61b0c9104a3c436361f56a0974c5eeef40c1b89","after":"e74ac0b5ad84b4ad5ba9b5b5ff5806ecbe797e1c","ref":"refs/heads/master","pushedAt":"2023-07-26T13:00:19.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Clarify replicateM Haddock (#956)","shortMessageHtmlLink":"Clarify replicateM Haddock (#956)"}},{"before":"c8a24e8350feb081d8abcdcc1545811e02550aa0","after":"f61b0c9104a3c436361f56a0974c5eeef40c1b89","ref":"refs/heads/master","pushedAt":"2023-06-30T21:07:35.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Bump deepseq bound to allow 1.5 (#955)","shortMessageHtmlLink":"Bump deepseq bound to allow 1.5 (#955)"}},{"before":"823be589ece58cdded248ef351fb2d153bc29f35","after":"c8a24e8350feb081d8abcdcc1545811e02550aa0","ref":"refs/heads/master","pushedAt":"2023-06-28T23:16:38.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Data.Graph.SCC: store mutually reachable vertices in a non-empty list (#953)","shortMessageHtmlLink":"Data.Graph.SCC: store mutually reachable vertices in a non-empty list ("}},{"before":"48196fba49386a228939824066f2215f933ce302","after":"823be589ece58cdded248ef351fb2d153bc29f35","ref":"refs/heads/master","pushedAt":"2023-06-28T20:18:21.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Drop support of GHC 8.0 and base-4.9 (#954)","shortMessageHtmlLink":"Drop support of GHC 8.0 and base-4.9 (#954)"}},{"before":"f6e81f25c4ed8f49d16d9ba2066b5fb2d91c6a10","after":"48196fba49386a228939824066f2215f933ce302","ref":"refs/heads/master","pushedAt":"2023-06-24T16:43:59.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Improve {Set,Map}.fromDistinct{Asc,Desc}List (#950)\n\n* Benchmarks for {Set,Map}.fromDistinct{Asc,Desc}List\r\n\r\n* Improve {Set,Map}.fromDistinct{Asc,Desc}List\r\n\r\nA faster and fusion-friendly implemention of the current strategy.\r\n\r\nOn GHC 9.2.5:\r\nFor Set this takes 56% less time when there is fusion and 30% when not.\r\nFor Map this takes 55% less time when there is fusion and 16% when not.\r\n\r\n* Remove a now inaccurate claim in {Set,Map}.fromList\r\n\r\n* Add a note explaining the implementation\r\n\r\n* Pull out linkTop and linkAll helpers as INLINABLE\r\n\r\nAnd leave further optimization to GHC.","shortMessageHtmlLink":"Improve {Set,Map}.fromDistinct{Asc,Desc}List (#950)"}},{"before":"67752b2cbc22b05f3c0d4147fea64243fefefa8a","after":"f6e81f25c4ed8f49d16d9ba2066b5fb2d91c6a10","ref":"refs/heads/master","pushedAt":"2023-06-03T08:07:43.821Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"More foldMap related Tree tests (#934)\n\n* Test that last for Tree is lazy enough\r\n\r\nlast should only need to look at the path going down to the last leaf.\r\n\r\n* Test foldMap and foldMap1 for Tree more\r\n\r\nTest that they fold according to the structure of the tree.","shortMessageHtmlLink":"More foldMap related Tree tests (#934)"}},{"before":"538274589e7bdc1f7e3cd60c1ce6e8cfce0f0eb1","after":"67752b2cbc22b05f3c0d4147fea64243fefefa8a","ref":"refs/heads/master","pushedAt":"2023-05-24T23:48:19.247Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Future-proof against potential Prelude.foldl' (#948)","shortMessageHtmlLink":"Future-proof against potential Prelude.foldl' (#948)"}},{"before":"7b27da87c295bbeec1f9d3daf1e80c98b48e8ab8","after":"538274589e7bdc1f7e3cd60c1ce6e8cfce0f0eb1","ref":"refs/heads/master","pushedAt":"2023-04-19T08:37:07.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Add mkappend.hs (#945)\n\nThis is the code that was originally used to generate the code to append sequences. Adding it to the repo for history and education.\r\n\r\nCloses #908.\r\n\r\nCo-authored-by: Samuel Schlesinger ","shortMessageHtmlLink":"Add mkappend.hs (#945)"}},{"before":"7ffc276e35d8ad1a0b77b6e2341a51c3882cf2c9","after":"7b27da87c295bbeec1f9d3daf1e80c98b48e8ab8","ref":"refs/heads/master","pushedAt":"2023-03-18T19:53:28.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Add more detailed test and benchmark instructions (#943)","shortMessageHtmlLink":"Add more detailed test and benchmark instructions (#943)"}},{"before":"2eb150e6205bd36707c3607503de2d2923a7e0a9","after":"7ffc276e35d8ad1a0b77b6e2341a51c3882cf2c9","ref":"refs/heads/master","pushedAt":"2023-03-14T19:15:46.510Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Add instructions to compile containers-tests on Windows (#941)\n\nAdded instructions to compile containers-test using symbolic links for Windows users\r\n\r\nCo-authored-by: konsumlamm <44230978+konsumlamm@users.noreply.github.com>","shortMessageHtmlLink":"Add instructions to compile containers-tests on Windows (#941)"}},{"before":"5cdbecc9fa5edc930712788dc7ff40e00ec9043c","after":"2eb150e6205bd36707c3607503de2d2923a7e0a9","ref":"refs/heads/master","pushedAt":"2023-03-13T21:32:18.450Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"treeowl","name":"David Feuer","path":"/treeowl","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/1893117?s=80&v=4"},"commit":{"message":"Remove stack.yaml (#939)\n\n* The `stack.yaml` was quite stale. It also was not obviously very\r\n useful in the context of a GHC boot package. Remove it, as well as the\r\n instructions for building and testing with `stack`.\r\n\r\n* Expand the information on testing/benchmarking with `cabal`.\r\n\r\nCloses #938","shortMessageHtmlLink":"Remove stack.yaml (#939)"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEIyPAfAA","startCursor":null,"endCursor":null}},"title":"Activity · haskell/containers"}