113 lines
2.8 KiB
C
113 lines
2.8 KiB
C
// SPDX-FileCopyrightText: 2025 Erin Catto
|
|
// SPDX-License-Identifier: MIT
|
|
#pragma once
|
|
|
|
#include "box3d/id.h"
|
|
|
|
#include "human.h"
|
|
#include <stdbool.h>
|
|
|
|
#ifdef __cplusplus
|
|
extern "C"
|
|
{
|
|
#endif
|
|
|
|
#define RAGDOLL_GROUP_SIZE 2
|
|
#define RAGDOLL_GRID_COUNT 2
|
|
|
|
typedef struct RagdollGroup
|
|
{
|
|
Human humans[RAGDOLL_GROUP_SIZE];
|
|
} RagdollGroup;
|
|
|
|
typedef struct FallingRagdollData
|
|
{
|
|
RagdollGroup groups[RAGDOLL_GRID_COUNT * RAGDOLL_GRID_COUNT];
|
|
b3MeshData* gridMesh;
|
|
b3MeshData* torusMesh;
|
|
int columnCount;
|
|
int columnIndex;
|
|
int stepCount;
|
|
int sleepStep;
|
|
uint32_t hash;
|
|
} FallingRagdollData;
|
|
|
|
FallingRagdollData CreateFallingRagdolls( b3WorldId worldId );
|
|
bool UpdateFallingRagdolls( b3WorldId worldId, FallingRagdollData* data );
|
|
void DestroyFallingRagdolls( FallingRagdollData* data );
|
|
|
|
// Convex pile dropped on a wave height field. Spheres, capsules, boxes, and rocks with
|
|
// rolling resistance so the pile sleeps quickly.
|
|
#define WAVE_PILE_BODY_COUNT 100
|
|
|
|
typedef struct WavePileData
|
|
{
|
|
b3BodyId bodies[WAVE_PILE_BODY_COUNT];
|
|
b3HeightFieldData* heightField;
|
|
int stepCount;
|
|
int sleepStep;
|
|
uint32_t hash;
|
|
} WavePileData;
|
|
|
|
WavePileData CreateWavePile( b3WorldId worldId );
|
|
bool UpdateWavePile( b3WorldId worldId, WavePileData* data );
|
|
void DestroyWavePile( WavePileData* data );
|
|
|
|
// Query driven spawning in an empty zero gravity world. Each step casts a ray, overlaps an
|
|
// AABB, and casts a sphere, then spawns a shape whose position, type, and size depend on the
|
|
// query results. Any query divergence cascades into the final state.
|
|
#define QUERY_SPAWN_COUNT 50
|
|
#define QUERY_SPAWN_CAST_RADIUS 0.5f
|
|
|
|
typedef struct QuerySpawnData
|
|
{
|
|
b3BodyId bodies[QUERY_SPAWN_COUNT];
|
|
int spawnCount;
|
|
int queryHitCount;
|
|
uint32_t queryHash;
|
|
int stepCount;
|
|
int sleepStep;
|
|
uint32_t hash;
|
|
|
|
// Last query cycle, recorded for visualization
|
|
b3Pos rayOrigin;
|
|
b3Vec3 rayTranslation;
|
|
b3Pos rayPoint;
|
|
b3Vec3 rayNormal;
|
|
bool rayDidHit;
|
|
b3AABB overlapBounds;
|
|
int overlapCount;
|
|
float castFraction;
|
|
b3Pos lastSpawnPosition;
|
|
} QuerySpawnData;
|
|
|
|
QuerySpawnData CreateQuerySpawn( b3WorldId worldId );
|
|
bool UpdateQuerySpawn( b3WorldId worldId, QuerySpawnData* data );
|
|
void DestroyQuerySpawn( QuerySpawnData* data );
|
|
|
|
// A grid of short hinged columns that fall and settle. Light enough to step in a unit test
|
|
// and it exercises joints, sleeping islands, and island splitting.
|
|
#if defined( BOX3D_DOUBLE_PRECISION )
|
|
#define FALLING_HINGE_SLEEP_STEP 277
|
|
#define FALLING_HINGE_HASH 0x97A63BFF
|
|
#else
|
|
#define FALLING_HINGE_SLEEP_STEP 248
|
|
#define FALLING_HINGE_HASH 0xF4CAB37C
|
|
#endif
|
|
|
|
typedef struct FallingHingeData
|
|
{
|
|
b3BodyId* bodyIds;
|
|
int bodyCount;
|
|
int stepCount;
|
|
int sleepStep;
|
|
uint32_t hash;
|
|
} FallingHingeData;
|
|
|
|
FallingHingeData CreateFallingHinges( b3WorldId worldId );
|
|
bool UpdateFallingHinges( b3WorldId worldId, FallingHingeData* data );
|
|
void DestroyFallingHinges( FallingHingeData* data );
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|