Collections Support

[knickish]

Need to add different strategies for handling collections. Hashmaps/sets are straightforward, but need to decide on better ways than == for comparing Vecs/Arrays/LinkedLists/Maps (and allow recursion, probably).

• [x] unordered/hashable strategy - Turn any two array-like collections into a hashset and compare
• [x] hashmap/btreemap impl
• [x] ordered with minimal moves
  • [x] levenshtein
  • [ ] ~damerau–levenshtein~
  • [x] hirshberg
  • [x] rope for applying changes
  • [ ] myers