tardis-dev 17.1.0 → 17.2.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +18 -0
- package/dist/computable/booksnapshot.d.ts.map +1 -1
- package/dist/computable/booksnapshot.js +86 -36
- package/dist/computable/booksnapshot.js.map +1 -1
- package/dist/computable/computable.d.ts.map +1 -1
- package/dist/computable/computable.js +3 -1
- package/dist/computable/computable.js.map +1 -1
- package/dist/computable/context.d.ts +4 -0
- package/dist/computable/context.d.ts.map +1 -0
- package/dist/computable/context.js +9 -0
- package/dist/computable/context.js.map +1 -0
- package/dist/consts.d.ts +1 -1
- package/dist/consts.d.ts.map +1 -1
- package/dist/consts.js +1 -0
- package/dist/consts.js.map +1 -1
- package/dist/handy.d.ts.map +1 -1
- package/dist/handy.js +4 -2
- package/dist/handy.js.map +1 -1
- package/dist/instrumentinfo.d.ts +4 -1
- package/dist/instrumentinfo.d.ts.map +1 -1
- package/dist/mappers/okex.d.ts.map +1 -1
- package/dist/mappers/okex.js +26 -14
- package/dist/mappers/okex.js.map +1 -1
- package/dist/orderbook.d.ts.map +1 -1
- package/dist/orderbook.js +6 -13
- package/dist/orderbook.js.map +1 -1
- package/dist/priceleveltree.d.ts +27 -0
- package/dist/priceleveltree.d.ts.map +1 -0
- package/dist/priceleveltree.js +165 -0
- package/dist/priceleveltree.js.map +1 -0
- package/example.js +50 -16
- package/package.json +1 -3
- package/src/computable/booksnapshot.ts +104 -41
- package/src/computable/computable.ts +5 -1
- package/src/computable/context.ts +12 -0
- package/src/consts.ts +1 -0
- package/src/handy.ts +4 -2
- package/src/instrumentinfo.ts +5 -0
- package/src/mappers/okex.ts +39 -18
- package/src/orderbook.ts +9 -15
- package/src/priceleveltree.ts +188 -0
|
@@ -0,0 +1,188 @@
|
|
|
1
|
+
import { BookPriceLevel, Writeable } from './types.ts'
|
|
2
|
+
|
|
3
|
+
const PAGE_CAPACITY = 64
|
|
4
|
+
const PAGE_MERGE_THRESHOLD = PAGE_CAPACITY >>> 2
|
|
5
|
+
|
|
6
|
+
class PriceLevelPage {
|
|
7
|
+
public readonly levels: Writeable<BookPriceLevel>[] = []
|
|
8
|
+
public count = 0
|
|
9
|
+
}
|
|
10
|
+
|
|
11
|
+
export class PriceLevelTree {
|
|
12
|
+
private _pages: PriceLevelPage[] = []
|
|
13
|
+
|
|
14
|
+
constructor(private readonly _direction: 1 | -1) {}
|
|
15
|
+
|
|
16
|
+
public clear() {
|
|
17
|
+
this._pages = []
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
public upsert(data: BookPriceLevel) {
|
|
21
|
+
if (this._pages.length === 0) {
|
|
22
|
+
const page = new PriceLevelPage()
|
|
23
|
+
page.levels[0] = { ...data }
|
|
24
|
+
page.count = 1
|
|
25
|
+
this._pages.push(page)
|
|
26
|
+
return
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
const pageIndex = this._findPageIndex(data.price)
|
|
30
|
+
const page = this._pages[pageIndex]
|
|
31
|
+
const levelIndex = this._findLevelIndex(page, data.price)
|
|
32
|
+
const existing = page.levels[levelIndex]
|
|
33
|
+
|
|
34
|
+
if (existing !== undefined && existing.price === data.price) {
|
|
35
|
+
existing.amount = data.amount
|
|
36
|
+
return
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
const storedData = { ...data }
|
|
40
|
+
if (page.count < PAGE_CAPACITY) {
|
|
41
|
+
insertIntoPage(page, levelIndex, storedData)
|
|
42
|
+
return
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
const splitIndex = PAGE_CAPACITY >>> 1
|
|
46
|
+
const rightPage = new PriceLevelPage()
|
|
47
|
+
for (let index = splitIndex; index < PAGE_CAPACITY; index++) {
|
|
48
|
+
rightPage.levels[rightPage.count++] = page.levels[index]
|
|
49
|
+
}
|
|
50
|
+
page.levels.length = splitIndex
|
|
51
|
+
page.count = splitIndex
|
|
52
|
+
this._pages.splice(pageIndex + 1, 0, rightPage)
|
|
53
|
+
|
|
54
|
+
if (levelIndex <= splitIndex) {
|
|
55
|
+
insertIntoPage(page, levelIndex, storedData)
|
|
56
|
+
} else {
|
|
57
|
+
insertIntoPage(rightPage, levelIndex - splitIndex, storedData)
|
|
58
|
+
}
|
|
59
|
+
}
|
|
60
|
+
|
|
61
|
+
public remove(data: BookPriceLevel) {
|
|
62
|
+
if (this._pages.length === 0) {
|
|
63
|
+
return false
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
const pageIndex = this._findPageIndex(data.price)
|
|
67
|
+
const page = this._pages[pageIndex]
|
|
68
|
+
const levelIndex = this._findLevelIndex(page, data.price)
|
|
69
|
+
const existing = page.levels[levelIndex]
|
|
70
|
+
|
|
71
|
+
if (existing === undefined || existing.price !== data.price) {
|
|
72
|
+
return false
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
removeFromPage(page, levelIndex)
|
|
76
|
+
if (page.count === 0) {
|
|
77
|
+
this._pages.splice(pageIndex, 1)
|
|
78
|
+
} else if (page.count <= PAGE_MERGE_THRESHOLD) {
|
|
79
|
+
this._mergePage(pageIndex)
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
return true
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
public iterator() {
|
|
86
|
+
return new PriceLevelTreeIterator(this._pages)
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
private _findPageIndex(price: number) {
|
|
90
|
+
let low = 0
|
|
91
|
+
let high = this._pages.length
|
|
92
|
+
|
|
93
|
+
while (low < high) {
|
|
94
|
+
const middle = (low + high) >>> 1
|
|
95
|
+
const page = this._pages[middle]
|
|
96
|
+
const lastLevel = page.levels[page.count - 1]!
|
|
97
|
+
if (this._comparePrices(lastLevel.price, price) < 0) {
|
|
98
|
+
low = middle + 1
|
|
99
|
+
} else {
|
|
100
|
+
high = middle
|
|
101
|
+
}
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
return low === this._pages.length ? low - 1 : low
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
private _findLevelIndex(page: PriceLevelPage, price: number) {
|
|
108
|
+
let low = 0
|
|
109
|
+
let high = page.count
|
|
110
|
+
|
|
111
|
+
while (low < high) {
|
|
112
|
+
const middle = (low + high) >>> 1
|
|
113
|
+
if (this._comparePrices(page.levels[middle]!.price, price) < 0) {
|
|
114
|
+
low = middle + 1
|
|
115
|
+
} else {
|
|
116
|
+
high = middle
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
return low
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private _comparePrices(priceA: number, priceB: number) {
|
|
124
|
+
return this._direction * (priceA - priceB)
|
|
125
|
+
}
|
|
126
|
+
|
|
127
|
+
private _mergePage(pageIndex: number) {
|
|
128
|
+
const page = this._pages[pageIndex]
|
|
129
|
+
const previousPage = pageIndex > 0 ? this._pages[pageIndex - 1] : undefined
|
|
130
|
+
const nextPage = pageIndex + 1 < this._pages.length ? this._pages[pageIndex + 1] : undefined
|
|
131
|
+
const canMergePrevious = previousPage !== undefined && previousPage.count + page.count <= PAGE_CAPACITY
|
|
132
|
+
const canMergeNext = nextPage !== undefined && page.count + nextPage.count <= PAGE_CAPACITY
|
|
133
|
+
|
|
134
|
+
if (canMergePrevious && (!canMergeNext || previousPage!.count <= nextPage!.count)) {
|
|
135
|
+
appendPage(previousPage!, page)
|
|
136
|
+
this._pages.splice(pageIndex, 1)
|
|
137
|
+
} else if (canMergeNext) {
|
|
138
|
+
appendPage(page, nextPage!)
|
|
139
|
+
this._pages.splice(pageIndex + 1, 1)
|
|
140
|
+
}
|
|
141
|
+
}
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
class PriceLevelTreeIterator {
|
|
145
|
+
private _pageIndex = 0
|
|
146
|
+
private _levelIndex = 0
|
|
147
|
+
|
|
148
|
+
constructor(private readonly _pages: readonly PriceLevelPage[]) {}
|
|
149
|
+
|
|
150
|
+
public next() {
|
|
151
|
+
while (this._pageIndex < this._pages.length) {
|
|
152
|
+
const page = this._pages[this._pageIndex]
|
|
153
|
+
if (this._levelIndex < page.count) {
|
|
154
|
+
return page.levels[this._levelIndex++]!
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
this._pageIndex++
|
|
158
|
+
this._levelIndex = 0
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
return null
|
|
162
|
+
}
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
function insertIntoPage(page: PriceLevelPage, index: number, data: Writeable<BookPriceLevel>) {
|
|
166
|
+
for (let current = page.count; current > index; current--) {
|
|
167
|
+
page.levels[current] = page.levels[current - 1]
|
|
168
|
+
}
|
|
169
|
+
page.levels[index] = data
|
|
170
|
+
page.count++
|
|
171
|
+
}
|
|
172
|
+
|
|
173
|
+
function removeFromPage(page: PriceLevelPage, index: number) {
|
|
174
|
+
page.count--
|
|
175
|
+
for (let current = index; current < page.count; current++) {
|
|
176
|
+
page.levels[current] = page.levels[current + 1]
|
|
177
|
+
}
|
|
178
|
+
page.levels.pop()
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
function appendPage(target: PriceLevelPage, source: PriceLevelPage) {
|
|
182
|
+
for (let index = 0; index < source.count; index++) {
|
|
183
|
+
target.levels[target.count + index] = source.levels[index]
|
|
184
|
+
}
|
|
185
|
+
target.count += source.count
|
|
186
|
+
source.levels.length = 0
|
|
187
|
+
source.count = 0
|
|
188
|
+
}
|