4namespace datahandlinglibs {
13 occupancy = acc.size();
25 auto ret = acc.insert(std::move(new_element));
38 auto ret = acc.insert(new_element);
51 auto lb_node = acc.begin();
52 found = (lb_node == acc.end()) ? false :
true;
109 for (
unsigned i = 0; i < num; ++i) {
119 info.set_num_buffer_elements(occupancy());
120 this->publish(std::move(info));
size_t occupancy() const override
Occupancy of LB.
Iterator lower_bound(T &element, bool with_errors=false)
typename folly::ConcurrentSkipList< T >::Accessor SkipListTAcc
bool read(T &element) override
Move object from LB to referenced.
typename SkipListT::iterator SkipListTIter
virtual void generate_opmon_data() override
bool write(T &&new_element) override
Move referenced object into LB.
const T * back() override
Get pointer to the back of the LB.
void pop(size_t num=1) override
const T * front() override
Write referenced object into LB without moving it.