@@ -266,7 +266,7 @@ types :: HasTypes s a => Traversal' s a
266[42,1,88,37,2]
266[42,1,88,37,2]
269−Note that this traversal is `deep': the subtrees are recursively traversed.
269+Note that this traversal is "deep": the subtrees are recursively traversed.
271### By parameter
271### By parameter
272As the above example shows, the `types` traversal is limited in that it cannot
272As the above example shows, the `types` traversal is limited in that it cannot
@@ -398,9 +398,16 @@ Duck 6
400# Performance
400# Performance
401−TODO.
401+The runtime characteristics of the derived optics is in most cases identical at
402−## Inspection testing
402+`-O1`, in some cases only slightly slower than the hand-written version. This
403−## Benchmarks
403+is thanks to GHC's optimiser eliminating the generic overhead.
406+[inspection-testing](https://hackage.haskell.org/package/inspection-testing)
407+library is used to ensure (see [here](test/Spec.hs)) that everything gets
410+TODO push benchmarks too
404# Contributors
411# Contributors
406+ [Matthew Pickering](https://github.com/mpickering)
413+ [Matthew Pickering](https://github.com/mpickering)