Sorting and hierarchy-barrier state for nontrivial iteration paths. More...

#include <query_info.h>

Public Member Functions
void	clear ()
	Releases nontrivial execution payload storage and resets version stamps.

void	clear_transient ()
	Clears nontrivial payload contents while preserving allocated storage.

Public Attributes
cnt::darray< uint8_t >	archetypeBarrierPasses
	Cached depth-order hierarchy barrier result for each archetype.

cnt::darray< SortData >	archetypeSortData
	Sort data used by cache.

uint32_t	sortVersion {}
	World version at which the sorted cache slices were last rebuilt. Unlike worldVersion, this is only updated after a real sort refresh.

uint32_t	barrierRelVersion = UINT32_MAX
	Relation topology version at which the cached depth-order hierarchy barrier state was last rebuilt.

uint32_t	barrierEnabledVersion = UINT32_MAX
	Entity enable-state version at which the cached depth-order hierarchy barrier state was last rebuilt.

uint8_t	barrierMayPrune = 0
	True when at least one cached archetype fails the depth-order hierarchy barrier.

Detailed Description

Sorting and hierarchy-barrier state for nontrivial iteration paths.

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

Public Member Functions