Added an update-limit for the max number of recursions.  Mainly for goes,  but really should work for any algorithm, where the user doesn't care to crawl back days, weeks or years.

Changed argument from forceout to output-edge-forceout, to be consistant with other argument naming conventions

Added delta to the update recursion.  Added check to determine if an algorithm has the data ranges it need to function.  Encased run_as_update/run options parameter as an object.

Use starttime/endtime from the options parameter instead of being passed in as a seperate parameter.

Moved parameters out of init,  and into run/run_as_update.  Passed all arguments as options into run/run_as_update.  Got smarter on how we select the ouput parameters.

Abandoned realtime update method over all new data, replaced with recursive method for a single timespan at a time, oldest to newest.

Added update_realitime flag to init.  run_as_update is completed up to finding gaps, and backing up to find 'All' new data.  Still need to call the algorithm,  and write out the data that's 'new'

broke out update vs. normal timeseries, added functions to help analyze gaps.  Still need to complete update