BFLibCPP 0.1
CPP Library
Loading...
Searching...
No Matches
BF::Queue< T, S > Class Template Reference

#include <queue.hpp>

Inheritance diagram for BF::Queue< T, S >:
Collaboration diagram for BF::Queue< T, S >:

Public Member Functions

 Queue ()
 
 ~Queue ()
 
int push (T object)
 
int pop ()
 
front () const
 
back () const
 
size ()
 
bool empty ()
 

Additional Inherited Members

- Protected Member Functions inherited from BF::List< T, int >
int deleteNode (Node *node)
 
 List ()
 
 List (const std::initializer_list< T > &list)
 
virtual ~List ()
 
int count () const
 
int add (T obj)
 
int pluckObject (T obj)
 
int deleteObjectAtIndex (int index)
 
int insertObjectAtIndex (T obj, int index)
 
void deleteAll ()
 
objectAtIndex (int index) const
 
void setDeallocateCallback (void(*callback)(T obj))
 
void setReleaseCallback (void(*callback)(T obj))
 
void setCompareCallback (int(*callback)(T a, T b))
 
Node * first () const
 
Node * last () const
 
bool contains (const T obj)
 
void print ()
 
int sort ()
 
int sort (const ListSortOptions option)
 
int shuffle ()
 
void operator= (const std::initializer_list< T > &list)
 
Iterator begin ()
 required interfaces: begin() & end()
 
Iterator end ()
 
- Protected Member Functions inherited from BF::Object
 Object ()
 
 Object (Object &obj)
 
virtual ~Object ()
 
- Static Protected Member Functions inherited from BF::Object
static void retain (Object *obj)
 
static void release (Object *obj)
 
static int retainCount (Object *obj)
 
static int retainCount (Object &obj)
 

Constructor & Destructor Documentation

◆ Queue()

template<typename T , typename S = int>
BF::Queue< T, S >::Queue ( )
inline

◆ ~Queue()

template<typename T , typename S = int>
BF::Queue< T, S >::~Queue ( )
inline

Member Function Documentation

◆ back()

template<typename T , typename S = int>
T BF::Queue< T, S >::back ( ) const
inline
Here is the call graph for this function:

◆ empty()

template<typename T , typename S = int>
bool BF::Queue< T, S >::empty ( )
inline
Here is the call graph for this function:

◆ front()

template<typename T , typename S = int>
T BF::Queue< T, S >::front ( ) const
inline
Here is the call graph for this function:

◆ pop()

template<typename T , typename S = int>
int BF::Queue< T, S >::pop ( )
inline
Here is the call graph for this function:

◆ push()

template<typename T , typename S = int>
int BF::Queue< T, S >::push ( T object)
inline
Here is the call graph for this function:

◆ size()

template<typename T , typename S = int>
S BF::Queue< T, S >::size ( )
inline
Here is the call graph for this function:

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