MCPcopy Create free account
hub / github.com/cameron314/concurrentqueue / size_approx

Method size_approx

concurrentqueue.h:1759–1764  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1757 inline ProducerBase* next_prod() const { return static_cast<ProducerBase*>(next); }
1758
1759 inline size_t size_approx() const
1760 {
1761 auto tail = tailIndex.load(std::memory_order_relaxed);
1762 auto head = headIndex.load(std::memory_order_relaxed);
1763 return details::circular_less_than(head, tail) ? static_cast<size_t>(tail - head) : 0;
1764 }
1765
1766 inline index_t getTail() const { return tailIndex.load(std::memory_order_relaxed); }
1767 protected:

Callers 9

try_dequeueMethod · 0.45
size_approxMethod · 0.45
getForMethod · 0.45
producer_reuseMethod · 0.45
exceptionsMethod · 0.45
full_apiMethod · 0.45
blocking_wrappersMethod · 0.45

Calls 2

circular_less_thanFunction · 0.70
loadMethod · 0.45

Tested by 5

producer_reuseMethod · 0.36
exceptionsMethod · 0.36
full_apiMethod · 0.36
blocking_wrappersMethod · 0.36