1 for n of queue holder orders mean 2 total orders
This commit is contained in:
1 parent
03b4b2ec29
commit
dc5d4cf50a
1 file changed
+6
-5
@@ -32,7 +32,7 @@ private:
|
||||
double _tick_size;
|
||||
Price _target_price;
|
||||
Quantity _target_qty;
|
||||
uint16_t _n_orders;
|
||||
uint16_t _n_eff_orders;
|
||||
std::vector<SubOrder> _orders;
|
||||
public:
|
||||
QHOOrderManager()
|
||||
@@ -41,7 +41,7 @@ public:
|
||||
_tick_size(os::nan()),
|
||||
_target_price(os::nan()),
|
||||
_target_qty(0),
|
||||
_n_orders(0),
|
||||
_n_eff_orders(1),
|
||||
_orders(){
|
||||
}
|
||||
void init(OrderBuilder& order_builder,
|
||||
@@ -53,9 +53,10 @@ public:
|
||||
Quantity qty){
|
||||
_side=side;
|
||||
_tick_size=tick_size;
|
||||
_n_orders=n_orders;
|
||||
// 1 trailing order means 2 total orders and so forth
|
||||
_n_eff_orders=n_orders+1;
|
||||
_orders.reserve(n_orders);
|
||||
for(uint16_t i=0;i<_n_orders;i++){
|
||||
for(uint16_t i=0;i<_n_eff_orders;i++){
|
||||
ChildOrder child_order=order_builder.build();
|
||||
_orders.emplace_back(key,child_order);
|
||||
}
|
||||
@@ -94,7 +95,7 @@ public:
|
||||
_tick_size);
|
||||
bool moving_up=tick_diff>0;
|
||||
double price_i=_target_price.value();
|
||||
for(uint16_t i=0;i<_n_orders;i++){
|
||||
for(uint16_t i=0;i<_n_eff_orders;i++){
|
||||
SubOrder* order_i=_find_order(price_i);
|
||||
if(order_i==nullptr){
|
||||
SubOrder& to_move=moving_up?_lowest_price_order():_highest_price_order();
|
||||
|
||||
Reference in new issue
Block a user