VC\OptionsBS\BlackScholesOptions\OptionModels
VC\OptionsBS\BlackScholesOptions\OptionModels\BlackScholesOptionModel Kono
VC\OptionsBS\BlackScholesOptions\OptionModels\GS.Options
Helpers, Interfaces,Enums, Data
VC\OptionsBS\BlackScholesOptions\OptionModels\OptionModelTest
Numericals
Variations
VC\OptionsBS\BlackScholesOptions\OptionModels\OptionPricingModels
GS.Trade.Dde.sln CA_Test_Dde_02
GS.Trade.Data OptionTicker, OptionDeskItem
GS.Moex MoexTicker ISS
DownLoads\CodeProject\CircularBuffer
---------------------------------------------------------------------------------------------------------
Circular character buffer C++ David Habbard
https://www.codeproject.com/Articles/139/A-circular-character-buffer
https://www.codeproject.com/Articles/283025/Simple-Carousel-Control-for-Windows-Forms
----------------------------------------------------------------------------------------------------------
Generic Circular Array C#
https://www.codeproject.com/Articles/31652/A-Generic-Circular-Array
A circular buffer allows for rapid pushing and popping from the front and back of the container. These operations are O(1) while other inserts and removes are O(n) assuming no reallocations.
This makes the buffer suitable as a generic stack or queue. The reason one might want to use this class this way despite Microsoft's stack or queue is that this class allows access by index, and fully implements IList<T>.
DList<T> is a “circular buffer”. A circular buffer is a region of memory organized so that you can efficiently add or remove items at both ends, and is commonly used to implement queues (it’s called a “circular queue”).
http://core.loyc.net/collections/internal-list.html
https://www.nuget.org/packages/LoycCore/
https://www.nuget.org/packages/LoycCore/
--------------------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------
A sort of spec sheet
for a circular buffer container class like boost::circular_buffer might look like this:
Sequence container
Insert or remove: from front or back O(1), from elsewhere O(n)
Index time: by position, O(1)
Sort: O(n log2 n).
Search: O(log2 n) if sorted, else O(n)
Iterators and references to an item are invalidated when the item is removed. Iterators and references to the item at one end of the circular buffer are invalidated when an item is inserted on the other end of the circular buffer, and the circular buffer is already full. All iterators and references are invalidated when the capacity is increased.
Iterators are random-access iterators.
Iterators produce items front-to-back or back-to-front.
Fixed-capacity data structure
https://www.codeproject.com/Articles/12462/A-single-threaded-HTTP-server
