| 254 | } |
| 255 | |
| 256 | void enqueue(K cl, unsigned priority, unsigned cost, T&& item) final { |
| 257 | if (cost < min_cost) |
| 258 | cost = min_cost; |
| 259 | if (cost > max_tokens_per_subqueue) |
| 260 | cost = max_tokens_per_subqueue; |
| 261 | create_queue(priority)->enqueue(cl, cost, std::move(item)); |
| 262 | } |
| 263 | |
| 264 | void enqueue_front(K cl, unsigned priority, unsigned cost, T&& item) final { |
| 265 | if (cost < min_cost) |