Data Structures: Vectors!

Last week we started looking at less common Haskell data structures, starting with Arrays. Today we're taking one step further and looking at Vectors. These combine some of the performance mechanics of arrays with the API of lists. Many operations are quite a bit faster than you can find with lists.

For a full review, here's a list of the structures we've covered so far:

1. Lists
2. Sets
3. Maps
4. Hash Sets
5. Hash Maps
6. Arrays
7. Vectors

We've got two more structures coming up, so stay tuned!