internal::Stack< Allocator > Class Template Reference

A type-unsafe stack for storing different types of data. More...

#include <stack.h>

Public Member Functions
	Stack (Allocator *allocator, size_t stackCapacity)
	~Stack ()
void	Swap (Stack &rhs) RAPIDJSON_NOEXCEPT
void	Clear ()
void	ShrinkToFit ()
template<typename T >
RAPIDJSON_FORCEINLINE void	Reserve (size_t count=1)
template<typename T >
RAPIDJSON_FORCEINLINE T *	Push (size_t count=1)
template<typename T >
RAPIDJSON_FORCEINLINE T *	PushUnsafe (size_t count=1)
template<typename T >
T *	Pop (size_t count)
template<typename T >
T *	Top ()
template<typename T >
const T *	Top () const
template<typename T >
T *	End ()
template<typename T >
const T *	End () const
template<typename T >
T *	Bottom ()
template<typename T >
const T *	Bottom () const
bool	HasAllocator () const
Allocator &	GetAllocator ()
bool	Empty () const
size_t	GetSize () const
size_t	GetCapacity () const

Detailed Description

template<typename Allocator>
class internal::Stack< Allocator >

Template Parameters

Allocator

Allocator for allocating stack memory.

Definition at line 37 of file stack.h.

Constructor & Destructor Documentation

Stack()

template<typename Allocator >

internal::Stack< Allocator >::Stack ( Allocator * allocator, size_t stackCapacity )

inline

Definition at line 41 of file stack.h.

                                                      : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
    }

~Stack()

template<typename Allocator >

internal::Stack< Allocator >::~Stack ( )

inline

Definition at line 62 of file stack.h.

             {
        Destroy();
    }

Member Function Documentation

Bottom() [1/2]

template<typename Allocator >

template<typename T >

T * internal::Stack< Allocator >::Bottom ( )

inline

Definition at line 163 of file stack.h.

{ return reinterpret_cast<T*>(stack_); }

Bottom() [2/2]

template<typename Allocator >

template<typename T >

const T * internal::Stack< Allocator >::Bottom ( ) const

inline

Definition at line 166 of file stack.h.

{ return reinterpret_cast<T*>(stack_); }

Clear()

template<typename Allocator >

void internal::Stack< Allocator >::Clear ( )

inline

Definition at line 99 of file stack.h.

{ stackTop_ = stack_; }

Here is the caller graph for this function:

Empty()

template<typename Allocator >

bool internal::Stack< Allocator >::Empty ( ) const

inline

Definition at line 177 of file stack.h.

{ return stackTop_ == stack_; }

Here is the caller graph for this function:

End() [1/2]

template<typename Allocator >

template<typename T >

T * internal::Stack< Allocator >::End ( )

inline

Definition at line 157 of file stack.h.

{ return reinterpret_cast<T*>(stackTop_); }

End() [2/2]

template<typename Allocator >

template<typename T >

const T * internal::Stack< Allocator >::End ( ) const

inline

Definition at line 160 of file stack.h.

{ return reinterpret_cast<T*>(stackTop_); }

GetAllocator()

template<typename Allocator >

Allocator & internal::Stack< Allocator >::GetAllocator ( )

inline

Definition at line 172 of file stack.h.

                              {
        RAPIDJSON_ASSERT(allocator_);
        return *allocator_;
    }

Here is the caller graph for this function:

GetCapacity()

template<typename Allocator >

size_t internal::Stack< Allocator >::GetCapacity ( ) const

inline

Definition at line 179 of file stack.h.

{ return static_cast<size_t>(stackEnd_ - stack_); }

Here is the caller graph for this function:

GetSize()

template<typename Allocator >

size_t internal::Stack< Allocator >::GetSize ( ) const

inline

Definition at line 178 of file stack.h.

{ return static_cast<size_t>(stackTop_ - stack_); }

Here is the caller graph for this function:

HasAllocator()

template<typename Allocator >

bool internal::Stack< Allocator >::HasAllocator ( ) const

inline

Definition at line 168 of file stack.h.

                              {
        return allocator_ != 0;
    }

Here is the caller graph for this function:

Pop()

template<typename Allocator >

template<typename T >

T * internal::Stack< Allocator >::Pop ( size_t count )

inline

Definition at line 138 of file stack.h.

                         {
        RAPIDJSON_ASSERT(GetSize() >= count * sizeof(T));
        stackTop_ -= count * sizeof(T);
        return reinterpret_cast<T*>(stackTop_);
    }

Here is the call graph for this function:

Push()

template<typename Allocator >

template<typename T >

RAPIDJSON_FORCEINLINE T * internal::Stack< Allocator >::Push ( size_t count = 1 )

inline

Definition at line 123 of file stack.h.

                                                    {
        Reserve<T>(count);
        return PushUnsafe<T>(count);
    }

Here is the call graph for this function:

PushUnsafe()

template<typename Allocator >

template<typename T >

RAPIDJSON_FORCEINLINE T * internal::Stack< Allocator >::PushUnsafe ( size_t count = 1 )

inline

Definition at line 129 of file stack.h.

                                                          {
        RAPIDJSON_ASSERT(stackTop_);
        RAPIDJSON_ASSERT(static_cast<std::ptrdiff_t>(sizeof(T) * count) <= (stackEnd_ - stackTop_));
        T* ret = reinterpret_cast<T*>(stackTop_);
        stackTop_ += sizeof(T) * count;
        return ret;
    }

Here is the caller graph for this function:

Reserve()

template<typename Allocator >

template<typename T >

RAPIDJSON_FORCEINLINE void internal::Stack< Allocator >::Reserve ( size_t count = 1 )

inline

Definition at line 116 of file stack.h.

                                                         {
         // Expand the stack if needed
        if (RAPIDJSON_UNLIKELY(static_cast<std::ptrdiff_t>(sizeof(T) * count) > (stackEnd_ - stackTop_)))
            Expand<T>(count);
    }

Here is the caller graph for this function:

ShrinkToFit()

template<typename Allocator >

void internal::Stack< Allocator >::ShrinkToFit ( )

inline

Definition at line 101 of file stack.h.

                       { 
        if (Empty()) {
            // If the stack is empty, completely deallocate the memory.
            Allocator::Free(stack_); // NOLINT (+clang-analyzer-unix.Malloc)
            stack_ = 0;
            stackTop_ = 0;
            stackEnd_ = 0;
        }
        else
            Resize(GetSize());
    }

Here is the call graph for this function:

Swap()

template<typename Allocator >

void internal::Stack< Allocator >::Swap ( Stack< Allocator > & rhs )

inline

Definition at line 90 of file stack.h.

                                             {
        internal::Swap(allocator_, rhs.allocator_);
        internal::Swap(ownAllocator_, rhs.ownAllocator_);
        internal::Swap(stack_, rhs.stack_);
        internal::Swap(stackTop_, rhs.stackTop_);
        internal::Swap(stackEnd_, rhs.stackEnd_);
        internal::Swap(initialCapacity_, rhs.initialCapacity_);
    }

Here is the call graph for this function:

Here is the caller graph for this function:

Top() [1/2]

template<typename Allocator >

template<typename T >

T * internal::Stack< Allocator >::Top ( )

inline

Definition at line 145 of file stack.h.

             { 
        RAPIDJSON_ASSERT(GetSize() >= sizeof(T));
        return reinterpret_cast<T*>(stackTop_ - sizeof(T));
    }

Here is the call graph for this function:

Top() [2/2]

template<typename Allocator >

template<typename T >

const T * internal::Stack< Allocator >::Top ( ) const

inline

Definition at line 151 of file stack.h.

                         {
        RAPIDJSON_ASSERT(GetSize() >= sizeof(T));
        return reinterpret_cast<T*>(stackTop_ - sizeof(T));
    }

Here is the call graph for this function:

---

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

• libraries/fc/include/fc/crypto/webauthn_json/include/rapidjson/internal/stack.h