structures.hpp

// Types and structures for the LimitOrderBook: order, limit
// Copyright 2020 Christian Kauten
//
// Author: Christian Kauten (kautenja@auburn.edu)
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
//
 
#ifndef DATA_FEED_LIMIT_ORDER_BOOK_STRUCTURES_HPP
#define DATA_FEED_LIMIT_ORDER_BOOK_STRUCTURES_HPP
 
#include "doubly_linked_list.hpp"
#include "binary_search_tree.hpp"
#include <cstdint>
 
namespace DataFeed {
 
namespace LOB {
 
enum class Side : bool { Sell = false, Buy = true };
 
inline Side operator!(Side side) {
    return static_cast<Side>(!static_cast<bool>(side));
}
 
typedef uint64_t UID;
typedef uint32_t Quantity;
typedef uint64_t Price;
 
// forward declare the `Limit` structure so `Order` can reference it
struct Limit;
 
struct Order : DLL::Node {
    const UID uid = 0;
    const Side side = Side::Sell;
    Quantity quantity = 0;
    const Price price = 0;
    Limit* limit = nullptr;
 
    Order() : DLL::Node() { }
 
    Order(UID uid_, Side side_, Quantity quantity_, Price price_) :
        DLL::Node(),
        uid(uid_),
        side(side_),
        quantity(quantity_),
        price(price_) { }
};
 
typedef uint32_t Count;
typedef uint64_t Volume;
 
struct Limit : BST::Node<Price> {
    Count count = 0;
    const uint32_t _padding = 0;
    Volume volume = 0;
    Order* order_head = nullptr;
    Order* order_tail = nullptr;
 
    Limit() : BST::Node<Price>() { }
 
    explicit Limit(Order* order) :
        BST::Node<Price>(order->price),
        count(1),
        volume(order->quantity),
        order_head(order),
        order_tail(order) { }
};
 
}  // namespace LOB
 
}  // namespace DataFeed
 
#endif  // DATA_FEED_LIMIT_ORDER_BOOK_STRUCTURES_HPP