public void insert(IteratorSTL<T> pos, T[] list) {
		VectorIterator<T> iter = (VectorIterator<T>) pos;
		data.addAll(iter.index, Arrays.asList(list));
	}
Returns an iterator postioned at the item in the vector that is the smallest key less than
the given key.  This method assumes the vector is sorted in ascending order.
@param key the key for which to find the upper bound
@return an iterator postioned at the item in the vector that is the smallest key less than
the given key. 
@throws UnsupportedOperationException if T is not comparable
Ghidra/Framework/Generic/src/main/java/generic/stl/VectorSTL.java