-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMatchingEngine.h
57 lines (49 loc) · 1.62 KB
/
MatchingEngine.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
//
// Created by Victor Dusa on 8/29/20.
//
#ifndef UNTITLED3_MATCHINGENGINE_H
#define UNTITLED3_MATCHINGENGINE_H
#include <cstdint>
#include <unordered_map>
#include <map>
#include <list>
struct Order {
uint32_t oid;
uint32_t uid;
uint32_t sid;
int32_t price;
int32_t size;
int32_t filled;
bool isAsk;
};
struct OrderBook {
std::map<uint32_t,std::list<Order*>*>* askPriceBuckets;
std::map<uint32_t,std::list<Order*>*,std::greater<>>* bidPriceBuckets;
};
class MatchingEngine {
private:
std::unordered_map<uint32_t,OrderBook*>* orderBooks;
std::unordered_map<uint32_t,Order*>* orderMap;
int32_t tryMatchInstantly(Order *takerOrder,
std::map<uint32_t,std::list<Order*>*>* askPriceBuckets,
std::map<uint32_t,std::list<Order*>*,std::greater<>>* bidPriceBuckets);
template<class T, class U>
bool mapContains(T map, U key) { return map->find(key) != map->end(); }
template<class T>
void insertHelper(T buckets, Order* order);
template<class T>
void cancelHelper(T buckets, Order *order);
template<class T>
std::list<Order*>* matchHelper(T buckets);
template<class T>
std::list<Order*>* matchHelper(T buckets, int32_t price);
public:
MatchingEngine() :
orderBooks(new std::unordered_map<uint32_t,OrderBook*>),
orderMap(new std::unordered_map<uint32_t,Order*>) {}
void addSymbol(uint32_t sid);
void removeSymbol(uint32_t sid);
void placeOrder(uint32_t oid, uint32_t uid, uint32_t sid, int32_t price, int32_t size, bool isAsk);
void cancelOrder(uint32_t oid);
};
#endif //UNTITLED3_MATCHINGENGINE_H