#pragma once #include "lib/utils/bts_no_copy.h" #include #include namespace bts { namespace md { /* * SpreadResolved accepts exchange spread definitions and resolves the legs */ template class SpreadResolver { struct ResolverEntry { ResolverEntry(ExchangeKey key) : exchange_key(key), legs() {} ResolverEntry() : exchange_key(), legs() {} ExchangeKey exchange_key; std::vector legs; }; public: SpreadResolver() : _queue() {} template void add(ExchangeKey key, LegContainer legs) { ResolverEntry entry(key); entry.legs.insert(end(entry.legs), begin(legs), end(legs)); _queue.push(entry); } // callback should accept const ExchangeKey& key, vector& legs) // When the callback is called the legs will be completely resolved template size_t resolve(MapKey keymap, CallBack on_resolved) { // Drain the queue and call keymap to resolve each leg size_t result = 0; std::vector unresolved; std::vector legs; while(!_queue.empty()) { legs.clear(); ResolverEntry entry; if(_queue.try_pop(entry)) { // Attempt to look up each spread leg for(ExchangeKey key : entry.legs) { security_key result = keymap(key); if (result == invalid_security_key) { unresolved.push_back(entry); break; } else { legs.push_back(result); } } if (legs.size() == entry.legs.size()) { ++result; on_resolved(entry.exchange_key, legs); } } } // If any legs remain unresolved push the entry back in the queue for later for(auto& entry : unresolved) { _queue.push(entry); } return result; } size_t count() const { return _queue.unsafe_size(); } private: BTS_NO_COPY(SpreadResolver); tbb::concurrent_queue _queue; }; }}//namespace