fixed circular priority queue to properly handle overflow in cases where
all is discarded, duration overflow is discarded, or both are handled.
Made the Overflow Handler an instance of more specific Capacity Overflow
Handler instead
edited ReteStormQueue to be both a DurationOverflowHandler AND a
CapacityOverflowHandler
Modified the iteration procedure so that "next()" is reduced from
O(log(n)) to O(1) whilst preparation remains at O(n.log(n)) (moving from
offering at O(log(n)) all n elements to a new priority queue to merge
sorting a list of the elements).

remove() remains an O(log(n)) operation, because it impacts the
underlying priorityqueue.
renamed data hashmap and priority queue to "data" and "queue"
respectively as this makes much more sense :-P