Write dynamic array version of circular spike container

[thesamovar]

At the moment, the spike container needs to know the maximum number of spikes it will ever receive. This causes complications because you need to make assumptions about when spikes can or can't occur, and difficult to debug errors when those assumptions break down. However, a  dynamic array structure, as used in the DynamicConnectionMatrix? structure could be used here. When the number of spikes stored in the circular array grows beyond what can be contained in it, the array is doubled in size (or some other factor). This has very low computational cost in practice because resizes only occur O(log(N)) times for an array that grows to a maximum size of N.