
On Dec 13, 2016 1:26 PM, "Oleg Grenrus"
Current implementations are naive, but more obviously correct.
More than what?
It seems that implementation for Data.Map is indeed "check size, compare lists", but e.g for vector it uses streaming framework to make things fuse, I still use "check size, compare lists" approach. I believe the only containers structures with non-boring instances of any of those classes are Data.IntMap, Data.IntSet, and Data.Tree. Side question: why doesn't Read1 have the ReadPrec-based methods that Read does?