-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathorderbook.go
166 lines (133 loc) · 2.78 KB
/
orderbook.go
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
package main
import (
"fmt"
"sort"
"time"
)
type Order struct {
Size float64
Bid bool
Limit *Limit
Timestamp int64
}
type Limit struct {
Price float64
Orders Orders
TotalVolume float64
}
type Orderbook struct {
Asks []*Limit
Bids []*Limit
AskLimits map[float64]*Limit
BidLimits map[float64]*Limit
}
type Match struct {
Ask *Order
Bid *Order
SizeFilled float64
Price float64
}
type Limits []*Limit
type ByBestAsk struct{ Limits }
type ByBestBid struct{ Limits }
type Orders []*Order
/**** FUNCTIONS ****/
func (a ByBestAsk) Len() int {
return len(a.Limits)
}
func (a ByBestAsk) Swap(i, j int) {
a.Limits[i], a.Limits[j] = a.Limits[j], a.Limits[i]
}
func (a ByBestAsk) Less(i, j int) bool {
return a.Limits[i].Price < a.Limits[j].Price
}
func (b ByBestBid) Len() int {
return len(b.Limits)
}
func (b ByBestBid) Swap(i, j int) {
b.Limits[i], b.Limits[j] = b.Limits[j], b.Limits[i]
}
func (b ByBestBid) Less(i, j int) bool {
return b.Limits[i].Price > b.Limits[j].Price
}
func (o Orders) Len() int {
return len(o)
}
func (o Orders) Swap(i, j int) {
o[i], o[j] = o[j], o[i]
}
func (o Orders) Less(i, j int) bool {
return o[i].Timestamp > o[j].Timestamp
}
func NewLimit(price float64) *Limit {
return &Limit{
Price: price,
Orders: []*Order{},
}
}
func NewOrder(bid bool, size float64) *Order {
return &Order{
Size: size,
Bid: bid,
Timestamp: time.Now().UnixNano(),
}
}
func (l *Limit) AddOrder(o *Order) {
o.Limit = l
l.Orders = append(l.Orders, o)
l.TotalVolume += o.Size
}
func (o *Order) String() string {
return fmt.Sprintf("size: %2.f", o.Size)
}
func (l *Limit) DeleteOrder(o *Order) {
for i := 0; i < len(l.Orders); i++ {
if l.Orders[i] == o {
l.Orders[i] = l.Orders[len(l.Orders)-1]
l.Orders = l.Orders[:len(l.Orders)-1]
}
}
o.Limit = nil
l.TotalVolume -= o.Size
sort.Sort(l.Orders)
}
/*
func (l *Limit) String() string {
return fmt.Sprintf("[price: %.2f | volume: %.2f]", l.Price, l.TotalVolume)
}
*/
func NewOrderbook() *Orderbook {
return &Orderbook{
Asks: []*Limit{},
Bids: []*Limit{},
AskLimits: make(map[float64]*Limit),
BidLimits: make(map[float64]*Limit),
}
}
func (ob *Orderbook) PlaceOrder(price float64, o *Order) []Match {
// Try to Match the order buy/sell
// Add the rest of the order to the book
if o.Size > 0.0 {
ob.add(price, o)
}
return []Match{}
}
func (ob *Orderbook) add(price float64, o *Order) {
var limit *Limit
if o.Bid {
limit = ob.BidLimits[price]
} else {
limit = ob.AskLimits[price]
}
if limit == nil {
limit = NewLimit(price)
limit.AddOrder(o)
if o.Bid {
ob.Bids = append(ob.Bids, limit)
ob.BidLimits[price] = limit
} else {
ob.Asks = append(ob.Asks, limit)
ob.AskLimits[price] = limit
}
}
}