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	Clear ()
void	ShrinkToFit ()
template<typename T >
RAPIDJSON_FORCEINLINE T *	Push (size_t count=1)
template<typename T >
T *	Pop (size_t count)
template<typename T >
T *	Top ()
template<typename T >
T *	Bottom ()
Allocator &	GetAllocator ()
bool	Empty () const
size_t	GetSize () const
size_t	GetCapacity () const

Private Member Functions
template<typename T >
void	Expand (size_t count)
void	Resize (size_t newCapacity)
void	Destroy ()
	Stack (const Stack &)
Stack &	operator= (const Stack &)

Private Attributes
Allocator *	allocator_
Allocator *	ownAllocator_
char *	stack_
char *	stackTop_
char *	stackEnd_
size_t	initialCapacity_

Detailed Description

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

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

Template Parameters

Allocator

Allocator for allocating stack memory.

Constructor & Destructor Documentation

template<typename Allocator>

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

inline

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

template<typename Allocator>

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

inline

 {
 Destroy();
 }

template<typename Allocator>

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

private

Member Function Documentation

template<typename Allocator>

template<typename T >

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

inline

{ return (T*)stack_; }

template<typename Allocator>

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

inline

{ stackTop_ = stack_; }

Here is the caller graph for this function:

template<typename Allocator>

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

inlineprivate

 {
 Allocator::Free(stack_);
 RAPIDJSON_DELETE(ownAllocator_); // Only delete if it is owned by the stack
 }

Here is the caller graph for this function:

template<typename Allocator>

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

inline

{ return stackTop_ == stack_; }

Here is the caller graph for this function:

template<typename Allocator>

template<typename T >

void internal::Stack< Allocator >::Expand ( size_t  count )

inlineprivate

 {
 // Only expand the capacity if the current stack exists. Otherwise just create a stack with initial capacity.
 size_t newCapacity;
 if (stack_ == 0) {
 if (!allocator_)
 ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator());
 newCapacity = initialCapacity_;
 } else {
 newCapacity = GetCapacity();
 newCapacity += (newCapacity + 1) / 2;
 }
 size_t newSize = GetSize() + sizeof(T) * count;
 if (newCapacity < newSize)
 newCapacity = newSize;

 Resize(newCapacity);
 }

template<typename Allocator>

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

inline

{ return *allocator_; }

Here is the caller graph for this function:

template<typename Allocator>

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

inline

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

Here is the caller graph for this function:

template<typename Allocator>

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

inline

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

Here is the caller graph for this function:

template<typename Allocator>

Stack& internal::Stack< Allocator >::operator= ( const Stack< Allocator > &  )

private

template<typename Allocator>

template<typename T >

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

inline

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

template<typename Allocator>

template<typename T >

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

inline

 {
 // Expand the stack if needed
 if (stackTop_ + sizeof(T) * count >= stackEnd_)
 Expand<T>(count);

 T* ret = reinterpret_cast<T*>(stackTop_);
 stackTop_ += sizeof(T) * count;
 return ret;
 }

template<typename Allocator>

void internal::Stack< Allocator >::Resize ( size_t  newCapacity )

inlineprivate

 {
 const size_t size = GetSize(); // Backup the current size
 stack_ = (char*)allocator_->Realloc(stack_, GetCapacity(), newCapacity);
 stackTop_ = stack_ + size;
 stackEnd_ = stack_ + newCapacity;
 }

Here is the caller graph for this function:

template<typename Allocator>

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

inline

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

Here is the caller graph for this function:

template<typename Allocator>

template<typename T >

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

inline

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

Member Data Documentation

template<typename Allocator>

Allocator* internal::Stack< Allocator >::allocator_

private

template<typename Allocator>

size_t internal::Stack< Allocator >::initialCapacity_

private

template<typename Allocator>

Allocator* internal::Stack< Allocator >::ownAllocator_

private

template<typename Allocator>

char* internal::Stack< Allocator >::stack_

private

template<typename Allocator>

char* internal::Stack< Allocator >::stackEnd_

private

template<typename Allocator>

char* internal::Stack< Allocator >::stackTop_

private

---

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

• dep/rapidjson/rapidjson/internal/stack.h