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).

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