BinarySearch to speed up the windowstats
logic is still not implemented yet...
mostly this change is needed because
doing a full sort repeatedly is awful
and wastes so much time it can sometimes
take longer than 1 full minute:

UNACCEPTABLE!!!

The candles will break if anything takes
longer than one minute, so optimization
is required.

The binary search will allow an incremental
sort whereby the new value is inserted into
the correct place.
Merge branch 'master' of github.com:kuzetsa/gekko into portfolio.debug