Save memory when there are many duplicate hulls. Can improve performance in some cases. For consistency with b3MeshData, b3Hull is renamed to b3HullData.
34 lines
702 B
C
34 lines
702 B
C
// SPDX-FileCopyrightText: 2025 Erin Catto
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
#pragma once
|
|
|
|
#include "container.h"
|
|
|
|
typedef struct b3IdPool
|
|
{
|
|
b3Array( int ) freeArray;
|
|
int nextIndex;
|
|
} b3IdPool;
|
|
|
|
b3IdPool b3CreateIdPool( void );
|
|
void b3DestroyIdPool( b3IdPool* pool );
|
|
|
|
int b3AllocId( b3IdPool* pool );
|
|
void b3FreeId( b3IdPool* pool, int id );
|
|
void b3ValidateFreeId( const b3IdPool* pool, int id );
|
|
|
|
static inline int b3GetIdCount( const b3IdPool* pool )
|
|
{
|
|
return pool->nextIndex - pool->freeArray.count;
|
|
}
|
|
|
|
static inline int b3GetIdCapacity( const b3IdPool* pool )
|
|
{
|
|
return pool->nextIndex;
|
|
}
|
|
|
|
static inline int b3GetIdBytes( const b3IdPool* pool )
|
|
{
|
|
return b3Array_ByteCount( pool->freeArray );
|
|
}
|