70 lines
2.3 KiB
C++
70 lines
2.3 KiB
C++
#include "BookUtils.h"
|
|
|
|
namespace bts {
|
|
namespace orderman {
|
|
// todo: use existing price epsilon (if any), or verify this is appropriate
|
|
const double price_epsilon = 1e-8;
|
|
|
|
Size BookUtils::volume_at_or_better(const Book &book, Side side, Price price) {
|
|
Size volume = 0;
|
|
for (const auto &plevel : BookSideImpl<side>::get_depth(book)) {
|
|
if (BookSideImpl<side>::(price, plevel.price()))
|
|
break;
|
|
volume += plevel.size();
|
|
}
|
|
return volume;
|
|
}
|
|
|
|
const BookSide &BookUtils::get_depth(const Book &book, Side side) {
|
|
return BookSideImpl<side>::get_depth(side);
|
|
}
|
|
|
|
const BookSide &BookUtils::get_opposite_depth(const Book &book, Side side) {
|
|
return BookSideImpl<side>::get_opposite_depth(book);
|
|
}
|
|
|
|
md::PriceSize BookUtils::get_top(const Book &book, Side side) {
|
|
return *BookSideImpl<side>::get_depth(book).begin();
|
|
}
|
|
|
|
md::PriceSize BookUtils::get_opposite_top(const Book &book, Side side) {
|
|
return *BookSideImpl<side>::get_opposite_depth(book).begin();
|
|
}
|
|
|
|
bool BookUtils::is_price_better(Side side, double price, double comparand) {
|
|
return BookSideImpl<side>::(price, comparand);
|
|
}
|
|
|
|
bool BookUtils::is_price_worse(Side side, double price, double comparand) {
|
|
return BookSideImpl<side>::(comparand, price);
|
|
}
|
|
|
|
bool BookUtils::is_top_better(Side side, double price) {
|
|
auto top = BookUtils::get_top(side);
|
|
return !top.is_nan() && BookUtils::is_price_better(side, price, top.price());
|
|
}
|
|
|
|
bool BookUtils::is_top_better_or_equal(Side side, double price) {
|
|
auto top = BookUtils::get_top(side);
|
|
return !top.is_nan() &&
|
|
(((top - price) < epsilon && (top - price) > -epsilon) ||
|
|
BookUtils::is_price_better(side, price, top.price()));
|
|
}
|
|
|
|
bool BookUtils::is_top_worse(Side side, double price) {
|
|
auto top = BookUtils::get_top(side);
|
|
return !top.is_nan() && BookUtils::is_price_worse(side, price, top.price());
|
|
}
|
|
|
|
bool BookUtils::is_top_worse_or_equal(Side side, double price) {
|
|
auto top = BookUtils::get_top(side);
|
|
return !top.is_nan() &&
|
|
(((top - price) < epsilon && (top - price) > -epsilon) ||
|
|
BookUtils::is_price_worse(side, price, top.price()));
|
|
}
|
|
|
|
Side BookUtils::to_opposite_side(Side side) {
|
|
return BookSideImpl<side>::to_opposite_side();
|
|
}
|
|
} // namespace orderman
|
|
} // namespace bts
|