Queue< E > Class Template Reference

#include <sample3-inl.h>

Public Member Functions
	Queue ()
	~Queue ()
void	Clear ()
size_t	Size () const
QueueNode< E > *	Head ()
const QueueNode< E > *	Head () const
QueueNode< E > *	Last ()
const QueueNode< E > *	Last () const
void	Enqueue (const E &element)
E *	Dequeue ()
template<typename F >
Queue *	Map (F function) const

Detailed Description

template<typename E>
class Queue< E >

Definition at line 74 of file sample3-inl.h.

Constructor & Destructor Documentation

Queue()

template<typename E >

Queue< E >::Queue ( )

inline

Definition at line 77 of file sample3-inl.h.

: head_(NULL), last_(NULL), size_(0) {}

Here is the caller graph for this function:

~Queue()

template<typename E >

Queue< E >::~Queue ( )

inline

Definition at line 80 of file sample3-inl.h.

{ Clear(); }

Here is the call graph for this function:

Member Function Documentation

Clear()

template<typename E >

void Queue< E >::Clear ( )

inline

Definition at line 83 of file sample3-inl.h.

               {
    if (size_ > 0) {
      // 1. Deletes every node.
      QueueNode<E>* node = head_;
      QueueNode<E>* next = node->next();
      for (; ;) {
        delete node;
        node = next;
        if (node == NULL) break;
        next = node->next();
      }
 
      // 2. Resets the member variables.
      head_ = last_ = NULL;
      size_ = 0;
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

Dequeue()

template<typename E >

E * Queue< E >::Dequeue ( )

inline

Definition at line 131 of file sample3-inl.h.

               {
    if (size_ == 0) {
      return NULL;
    }
 
    const QueueNode<E>* const old_head = head_;
    head_ = head_->next_;
    size_--;
    if (size_ == 0) {
      last_ = NULL;
    }
 
    E* element = new E(old_head->element());
    delete old_head;
 
    return element;
  }

Here is the call graph for this function:

Enqueue()

template<typename E >

void Queue< E >::Enqueue ( const E & element )

inline

Definition at line 116 of file sample3-inl.h.

                                 {
    QueueNode<E>* new_node = new QueueNode<E>(element);
 
    if (size_ == 0) {
      head_ = last_ = new_node;
      size_ = 1;
    } else {
      last_->next_ = new_node;
      last_ = new_node;
      size_++;
    }
  }

Here is the caller graph for this function:

Head() [1/2]

template<typename E >

QueueNode< E > * Queue< E >::Head ( )

inline

Definition at line 105 of file sample3-inl.h.

{ return head_; }

Head() [2/2]

template<typename E >

const QueueNode< E > * Queue< E >::Head ( ) const

inline

Definition at line 106 of file sample3-inl.h.

{ return head_; }

Last() [1/2]

template<typename E >

QueueNode< E > * Queue< E >::Last ( )

inline

Definition at line 109 of file sample3-inl.h.

{ return last_; }

Last() [2/2]

template<typename E >

const QueueNode< E > * Queue< E >::Last ( ) const

inline

Definition at line 110 of file sample3-inl.h.

{ return last_; }

Map()

template<typename E >

template<typename F >

Queue * Queue< E >::Map ( F function ) const

inline

Definition at line 153 of file sample3-inl.h.

                               {
    Queue* new_queue = new Queue();
    for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) {
      new_queue->Enqueue(function(node->element()));
    }
 
    return new_queue;
  }

Here is the call graph for this function:

Size()

template<typename E >

size_t Queue< E >::Size ( ) const

inline

Definition at line 102 of file sample3-inl.h.

{ return size_; }

---

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

• libraries/fc/include/fc/crypto/webauthn_json/thirdparty/gtest/googletest/samples/sample3-inl.h