Last active
November 26, 2017 03:45
-
-
Save prystupa/4521556 to your computer and use it in GitHub Desktop.
OrderBook with complete support for pegged orders
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class OrderBook(side: Side, orderTypes: (Order => OrderType)) | |
extends mutable.Publisher[OrderBookEvent] { | |
private case class OrdersAtLimit(limit: Double, orders: FastList[Order]) | |
private case class OrderLocation(list: FastList.Entry[OrdersAtLimit], entry: FastList.Entry[Order]) | |
private val marketBook: FastList[Order] = FastList() | |
private val limitBook = FastList[OrdersAtLimit]() | |
private val priceOrdering = if (side == Sell) Ordering[Double] else Ordering[Double].reverse | |
private var pegs: FastList[OrderLocation] = FastList() | |
def add(order: Order) { | |
orderTypes(order).price match { | |
case MarketPrice => marketBook.append(order) | |
case LimitPrice(limit) => addLimit(limit, order) | |
case PegPrice => addPeg(order, isNewOrder = true) | |
} | |
} | |
def top: Option[Order] = marketBook.headOption orElse limitBook.headOption.map(_.orders.head) | |
def bestLimit: Option[Double] = limitBook.headOption.filter(_.orders.exists(orderTypes(_).price match { | |
case LimitPrice(_) => true | |
case _ => false | |
})).map(_.limit) | |
def modify(worker: ModifyOperations => Unit) { | |
val book = this | |
val oldBestLimit = bestLimit | |
worker(new ModifyOperations { | |
def top = book.top | |
def decreaseTopBy(qty: Double) { | |
def decrease(list: FastList[Order], top: Order) { | |
if (qty == top.qty) list.removeTop() | |
else list.updateTop(orderTypes(top).decreasedBy(qty)) | |
} | |
marketBook.headOption match { | |
case Some(top) => decrease(marketBook, top) | |
case None => limitBook.headOption match { | |
case Some(OrdersAtLimit(_, orders)) => | |
decrease(orders, orders.head) | |
if (orders.isEmpty) limitBook.removeTop() | |
case None => throw new IllegalStateException("No top order in the book") | |
} | |
} | |
} | |
}) | |
if (oldBestLimit != bestLimit) updatePegs() | |
} | |
def orders(): List[Order] = marketBook.toList ++ limitBook.flatMap(_.orders) | |
private def addPeg(order: Order, isNewOrder: Boolean) { | |
bestLimit match { | |
case Some(limit) => | |
val pegOrder = insertLimit(limit, order) | |
pegs.append(pegOrder) | |
case None => publish(if (isNewOrder) RejectedOrder(order) else CancelledOrder(order)) | |
} | |
} | |
private def addLimit(level: Double, order: Order) { | |
val oldBestLimit = bestLimit | |
insertLimit(level, order) | |
if (oldBestLimit != bestLimit) updatePegs() | |
} | |
private def insertLimit(level: Double, order: Order): OrderLocation = { | |
val entry = limitBook.getOrInsertAt( | |
levelOrders => priceOrdering.compare(level, levelOrders.limit), | |
OrdersAtLimit(level, FastList())) | |
val OrdersAtLimit(_, orders) = entry.value | |
OrderLocation(entry, orders.append(order)) | |
} | |
private def removeLimit(orderLocation: OrderLocation) { | |
val entry = orderLocation.entry | |
val list = orderLocation.list | |
val orders = list.value.orders | |
entry.remove() | |
if (orders.isEmpty) list.remove() | |
} | |
private def updatePegs() { | |
val pegsToResubmit = pegs | |
pegs = FastList() | |
pegsToResubmit.foreach(peg => removeLimit(peg)) | |
pegsToResubmit.foreach(peg => addPeg(peg.entry.value, isNewOrder = false)) | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment