Fix changelog for v0.6.6 and v0.6.8 (#1041)

Author: meooow25

containers/changelog.md

@@ -55,6 +55,8 @@
   * `NECyclicSCC (NonEmpty v)` is a new constructor, maintaining an invariant
     that a set of mutually reachable vertices is non-empty.
 
+## 0.6.8
+
 ### Additions
 
 * Add `Data.IntSet.fromRange`. (Soumik Sarkar)
@@ -129,16 +131,40 @@
 
 ## 0.6.6
 
-* Drop support for GHC versions before 8.0.2.
+### Additions
+
+* Add `Lift` instances for use with Template Haskell. Specifically:
+  `Seq`, `ViewL`, and `ViewR` (in `Data.Sequence`), `Map`, `Set`,
+  `IntMap`, `IntSet`, `Tree`, and `SCC` (in `Data.Graph`). (David Feuer)
+
+* Add `argSet` and `fromArgSet` for `Data.Map`. (jwaldmann)
+
+### Performance improvements
+
+* Remove short-circuiting from certain `IntMap` functions to improve
+  performance for successful lookups. (Callan McGill)
+
+### Other changes
+
+* Drop support for GHC versions before 8.0.2. (David Feuer)
+
+* Various documentation improvements. (Will Hawkins, Eric Lindblad, konsumlamm,
+  Joseph C. Sible)
+
+### Miscellaneous/internal
 
 * Bump Cabal version for tests, and use `common` clauses to reduce
-  duplication.
+  duplication. (David Feuer)
 
-### New instances
+* Migrate from test-framework to tasty. (Bodigrim)
 
-* Add `Lift` instances for use with Template Haskell. Specifically:
-  `Seq`, `ViewL`, and `ViewR` (in `Data.Sequence`), `Map`, `Set`,
-  `IntMap`, `IntSet`, `Tree`, and `SCC` (in `Data.Graph`).
+* Migrate from gauge to tasty-bench. (Bodigrim)
+
+* Enable `TypeOperators` to address a future GHC requirement.
+  (Vladislav Zavialov)
+
+* Work around an issue with unboxed arrays on big-endian systems.
+  (Peter Trommler)
 
 ## 0.6.5.1
 

containers/src/Data/Map/Internal.hs

@@ -3464,7 +3464,8 @@ keysSet (Bin sz kx _ l r) = Set.Bin sz kx (keysSet l) (keysSet r)
 --
 -- > argSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [Arg 3 "b",Arg 5 "a"]
 -- > argSet empty == Data.Set.empty
-
+--
+-- @since 0.6.6
 argSet :: Map k a -> Set.Set (Arg k a)
 argSet Tip = Set.Tip
 argSet (Bin sz kx x l r) = Set.Bin sz (Arg kx x) (argSet l) (argSet r)
@@ -3483,7 +3484,8 @@ fromSet f (Set.Bin sz x l r) = Bin sz x (f x) (fromSet f l) (fromSet f r)
 --
 -- > fromArgSet (Data.Set.fromList [Arg 3 "aaa", Arg 5 "aaaaa"]) == fromList [(5,"aaaaa"), (3,"aaa")]
 -- > fromArgSet Data.Set.empty == empty
-
+--
+-- @since 0.6.6
 fromArgSet :: Set.Set (Arg k a) -> Map k a
 fromArgSet Set.Tip = Tip
 fromArgSet (Set.Bin sz (Arg x v) l r) = Bin sz x v (fromArgSet l) (fromArgSet r)