dunedaq::datahandlinglibs::BinarySearchQueueModel< T > Class Template Reference

#include <BinarySearchQueueModel.hpp>

Inheritance diagram for dunedaq::datahandlinglibs::BinarySearchQueueModel< T >:

Collaboration diagram for dunedaq::datahandlinglibs::BinarySearchQueueModel< T >:

Public Member Functions
	BinarySearchQueueModel ()
	BinarySearchQueueModel (uint32_t size)
IterableQueueModel< T >::Iterator	lower_bound (T &element, bool=false)
Public Member Functions inherited from dunedaq::datahandlinglibs::IterableQueueModel< T >
	IterableQueueModel (const IterableQueueModel &)=delete
IterableQueueModel &	operator= (const IterableQueueModel &)=delete
	IterableQueueModel ()
	IterableQueueModel (std::size_t size)
	IterableQueueModel (std::size_t size, bool numa_aware=false, uint8_t numa_node=0, bool intrinsic_allocator=false, std::size_t alignment_size=0)
	~IterableQueueModel ()
void	free_memory ()
void	allocate_memory (std::size_t size, bool numa_aware, uint8_t numa_node=0, bool intrinsic_allocator=false, std::size_t alignment_size=0)
void	allocate_memory (std::size_t size) override
void	prefill_task ()
void	force_pagefault ()
bool	write (T &&record) override
	Move referenced object into LB.
bool	read (T &record) override
	Move object from LB to referenced.
void	popFront ()
void	pop (std::size_t x)
	Pop specified amount of elements from LB.
bool	isEmpty () const
bool	isFull () const
std::size_t	occupancy () const override
	Occupancy of LB.
std::size_t	size () const
std::size_t	capacity () const
const T *	front () override
	Write referenced object into LB without moving it.
const T *	back () override
	Get pointer to the back of the LB.
T *	start_of_buffer ()
T *	end_of_buffer ()
void	conf (const appmodel::LatencyBuffer *cfg) override
	Configure the LB.
void	scrap (const nlohmann::json &) override
	Unconfigure the LB.
void	flush () override
	Flush all elements from the latency buffer.
std::size_t	get_alignment_size ()
Iterator	begin ()
Iterator	end ()
Public Member Functions inherited from dunedaq::datahandlinglibs::LatencyBufferConcept< T >
	LatencyBufferConcept ()
virtual	~LatencyBufferConcept ()
	LatencyBufferConcept (const LatencyBufferConcept &)=delete
	LatencyBufferConcept is not copy-constructible.
LatencyBufferConcept &	operator= (const LatencyBufferConcept &)=delete
	LatencyBufferConcept is not copy-assginable.
	LatencyBufferConcept (LatencyBufferConcept &&)=delete
	LatencyBufferConcept is not move-constructible.
LatencyBufferConcept &	operator= (LatencyBufferConcept &&)=delete
	LatencyBufferConcept is not move-assignable.
virtual void	allocate_memory (size_t)=0
	Whether or not the buffer is allocatable. false by default.
Public Member Functions inherited from dunedaq::opmonlib::MonitorableObject
	MonitorableObject (const MonitorableObject &)=delete
MonitorableObject &	operator= (const MonitorableObject &)=delete
	MonitorableObject (MonitorableObject &&)=delete
MonitorableObject &	operator= (MonitorableObject &&)=delete
virtual	~MonitorableObject ()=default
auto	get_opmon_id () const noexcept
auto	get_opmon_level () const noexcept

Additional Inherited Members
Public Types inherited from dunedaq::datahandlinglibs::IterableQueueModel< T >
typedef T	value_type
Public Types inherited from dunedaq::opmonlib::MonitorableObject
using	NodePtr = std::weak_ptr<MonitorableObject>
using	NewNodePtr = std::shared_ptr<MonitorableObject>
using	ElementId = std::string
Static Public Member Functions inherited from dunedaq::opmonlib::MonitorableObject
static bool	publishable_metric (OpMonLevel entry, OpMonLevel system) noexcept
Protected Member Functions inherited from dunedaq::datahandlinglibs::IterableQueueModel< T >
virtual void	generate_opmon_data () override
template<class... Args>
bool	write_ (Args &&... recordArgs)
Protected Member Functions inherited from dunedaq::opmonlib::MonitorableObject
	MonitorableObject ()=default
void	register_node (ElementId name, NewNodePtr)
void	publish (google::protobuf::Message &&, CustomOrigin &&co={}, OpMonLevel l=to_level(EntryOpMonLevel::kDefault)) const noexcept
Protected Attributes inherited from dunedaq::datahandlinglibs::IterableQueueModel< T >
std::atomic< int >	overflow_ctr { 0 }
bool	numa_aware_
uint8_t	numa_node_
bool	intrinsic_allocator_
std::size_t	alignment_size_
bool	invalid_configuration_requested_
std::string	prefiller_name_ {"lbpfn"}
std::mutex	prefill_mutex_
std::condition_variable	prefill_cv_
bool	prefill_ready_
bool	prefill_done_
std::thread	ptrlogger
char	pad0_ [folly::hardware_destructive_interference_size]
uint32_t	size_
T *	records_
std::atomic< unsigned int >	readIndex_
std::atomic< unsigned int >	writeIndex_
char	pad1_ [folly::hardware_destructive_interference_size - sizeof(writeIndex_)]

Detailed Description

template<class T>
class dunedaq::datahandlinglibs::BinarySearchQueueModel< T >

Definition at line 22 of file BinarySearchQueueModel.hpp.

Constructor & Destructor Documentation

BinarySearchQueueModel() [1/2]

template<class T >

dunedaq::datahandlinglibs::BinarySearchQueueModel< T >::BinarySearchQueueModel ( )

inline

Definition at line 25 of file BinarySearchQueueModel.hpp.

    : IterableQueueModel<T>()
  {}

BinarySearchQueueModel() [2/2]

template<class T >

dunedaq::datahandlinglibs::BinarySearchQueueModel< T >::BinarySearchQueueModel ( uint32_t size )

inlineexplicit

Definition at line 29 of file BinarySearchQueueModel.hpp.

    : IterableQueueModel<T>(size)
  {}

Member Function Documentation

lower_bound()

template<typename T >

IterableQueueModel< T >::Iterator dunedaq::datahandlinglibs::BinarySearchQueueModel< T >::lower_bound	(	T &	element,
		bool	= false )

Definition at line 8 of file BinarySearchQueueModel.hxx.

{
  unsigned int start_index =
    IterableQueueModel<T>::readIndex_.load(std::memory_order_relaxed); // NOLINT(build/unsigned)
  unsigned int end_index =
    IterableQueueModel<T>::writeIndex_.load(std::memory_order_acquire); // NOLINT(build/unsigned)
 
  if (start_index == end_index) {
    TLOG() << "Queue is empty" << std::endl;
    return IterableQueueModel<T>::end();
  }
  end_index = end_index == 0 ? IterableQueueModel<T>::size_ - 1 : end_index - 1;
 
  T& left_element = IterableQueueModel<T>::records_[start_index];
 
  if (element < left_element) {
    TLOG() << "Could not find element" << std::endl;
    return IterableQueueModel<T>::end();
  }
 
  while (true) {
    unsigned int diff =
      start_index <= end_index ? end_index - start_index : IterableQueueModel<T>::size_ + end_index - start_index;
    unsigned int middle_index = start_index + ((diff + 1) / 2);
    if (middle_index >= IterableQueueModel<T>::size_)
      middle_index -= IterableQueueModel<T>::size_;
    T& element_between = IterableQueueModel<T>::records_[middle_index];
 
    //if we landed on our element, let's get out of here.
    if (element.get_timestamp()==element_between.get_timestamp())
      return typename IterableQueueModel<T>::Iterator(*this, middle_index);
 
    if ( diff == 0 ) {
 
      //if we satisfy the lower_bound condition, we have the right index
      if(element < element_between)
    return typename IterableQueueModel<T>::Iterator(*this, middle_index);
 
      //if we don't, we need to increment one up. for safety check size too
      if(++middle_index >= IterableQueueModel<T>::size_)
    middle_index -= IterableQueueModel<T>::size_;
      
      return typename IterableQueueModel<T>::Iterator(*this, middle_index);
    }
    
    if (element < element_between) {
      end_index = middle_index != 0 ? middle_index - 1 : IterableQueueModel<T>::size_ - 1;
    } else {
      start_index = middle_index;
    }
  }
}

---

The documentation for this class was generated from the following files:

• /github/workspace/dunedaq/sourcecode/datahandlinglibs/include/datahandlinglibs/models/BinarySearchQueueModel.hpp
• /github/workspace/dunedaq/sourcecode/datahandlinglibs/include/datahandlinglibs/models/detail/BinarySearchQueueModel.hxx