Eager vectors, sets, and maps

[gdejohn]

Implement persistent vector abstract data type using weight-balanced binary trees (bit mapped vector tries? relaxed radix balanced trees?).

Implement persistent set and map abstract data types using hash array mapped tries (compressed hash array mapped prefix trees?), and ordered set and map abstract data types using AVL trees (red-black?).