Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/allocators_8h_source.html below:

NCBI C++ ToolKit: include/misc/jsonwrapp/rapidjson11/allocators.h Source File

kNeedFree =

;

*

(

* originalPtr,

originalSize,

newSize) {

std::realloc(originalPtr, newSize);

<

BaseAllocator = CrtAllocator>

kNeedFree =

;

chunkHead_(0), chunk_capacity_(chunkSize), userBuffer_(0), baseAllocator_(baseAllocator), ownBaseAllocator_(0)

chunkHead_(0), chunk_capacity_(chunkSize), userBuffer_(

), baseAllocator_(baseAllocator), ownBaseAllocator_(0)

chunkHead_->size = 0;

chunkHead_->next = 0;

(chunkHead_ && chunkHead_ != userBuffer_) {

baseAllocator_->Free(chunkHead_);

(chunkHead_ && chunkHead_ == userBuffer_)

chunkHead_->size = 0;

capacity += c->capacity;

(chunkHead_ == 0 || chunkHead_->size +

> chunkHead_->capacity)

(!AddChunk(chunk_capacity_ >

? chunk_capacity_ :

))

chunkHead_->size +=

;

*

(

* originalPtr,

originalSize,

newSize) {

(originalPtr == 0)

(originalSize >= newSize)

(originalPtr ==

*

(chunkHead_) +

(

(

)) + chunkHead_->size - originalSize) {

increment =

(newSize - originalSize);

(chunkHead_->size + increment <= chunkHead_->capacity) {

chunkHead_->size += increment;

(

* newBuffer =

(newSize)) {

std::memcpy(newBuffer, originalPtr, originalSize);

(

*ptr) { (void)ptr; }

ownBaseAllocator_ = baseAllocator_ =

(BaseAllocator)();

chunk->capacity = capacity;

chunk->next = chunkHead_;

kDefaultChunkCapacity = 64 * 1024;

C-runtime library allocator.

void * Realloc(void *originalPtr, size_t originalSize, size_t newSize)

void * Malloc(size_t size)

static void Free(void *ptr)

Default memory allocator used by the parser and DOM.

void * Malloc(size_t size)

Allocates a memory block. (concept Allocator)

void * userBuffer_

User supplied buffer.

MemoryPoolAllocator(size_t chunkSize=kDefaultChunkCapacity, BaseAllocator *baseAllocator=0)

Constructor with chunkSize.

size_t chunk_capacity_

The minimum capacity of chunk when they are allocated.

ChunkHeader * chunkHead_

Head of the chunk linked-list. Only the head chunk serves allocation.

MemoryPoolAllocator(const MemoryPoolAllocator &rhs)

Copy constructor is not permitted.

void * Realloc(void *originalPtr, size_t originalSize, size_t newSize)

Resizes a memory block (concept Allocator)

static void Free(void *ptr)

Frees a memory block (concept Allocator)

void Clear()

Deallocates all memory chunks, excluding the user-supplied buffer.

MemoryPoolAllocator & operator=(const MemoryPoolAllocator &rhs)

Copy assignment operator is not permitted.

size_t Size() const

Computes the memory blocks allocated.

~MemoryPoolAllocator()

Destructor.

bool AddChunk(size_t capacity)

Creates a new chunk.

MemoryPoolAllocator(void *buffer, size_t size, size_t chunkSize=kDefaultChunkCapacity, BaseAllocator *baseAllocator=0)

Constructor with user-supplied buffer.

size_t Capacity() const

Computes the total capacity of allocated memory chunks.

BaseAllocator * baseAllocator_

base allocator for allocating memory chunks.

BaseAllocator * ownBaseAllocator_

base allocator created by this object.

static DLIST_TYPE *DLIST_NAME() next(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

#define RAPIDJSON_ALIGN(x)

Data alignment of the machine.

#define RAPIDJSON_ASSERT(x)

Assertion.

#define RAPIDJSON_NAMESPACE_BEGIN

provide custom rapidjson namespace (opening expression)

#define RAPIDJSON_NAMESPACE_END

provide custom rapidjson namespace (closing expression)

const struct ncbi::grid::netcache::search::fields::SIZE size

common definitions and configuration

#define RAPIDJSON_DELETE(x)

! customization point for global delete

#define RAPIDJSON_NEW(TypeName)

! customization point for global new

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4