BIH::BuildStats Class Reference

#include "BoundingIntervalHierarchy.h"

Public Member Functions
	BuildStats ()
void	updateInner ()
void	updateBVH2 ()
void	updateLeaf (int depth, int n)
void	printStats ()

Private Attributes
int	numNodes {0}
int	numLeaves {0}
int	sumObjects {0}
int	minObjects {0x0FFFFFFF}
int	maxObjects {-1}
int	sumDepth {0}
int	minDepth {0x0FFFFFFF}
int	maxDepth {-1}
int	numLeavesN [6]
int	numBVH2 {0}

Detailed Description

Constructor & Destructor Documentation

BuildStats()

BIH::BuildStats::BuildStats ( )

inline

        {
            for (int& i : numLeavesN) { i = 0; }
        }

References numLeavesN.

Member Function Documentation

printStats()

void BIH::BuildStats::printStats

(

)

{
    printf("Tree stats:\n");
    printf("  * Nodes:          %d\n", numNodes);
    printf("  * Leaves:         %d\n", numLeaves);
    printf("  * Objects: min    %d\n", minObjects);
    printf("             avg    %.2f\n", (float) sumObjects / numLeaves);
    printf("           avg(n>0) %.2f\n", (float) sumObjects / (numLeaves - numLeavesN[0]));
    printf("             max    %d\n", maxObjects);
    printf("  * Depth:   min    %d\n", minDepth);
    printf("             avg    %.2f\n", (float) sumDepth / numLeaves);
    printf("             max    %d\n", maxDepth);
    printf("  * Leaves w/: N=0  %3d%%\n", 100 * numLeavesN[0] / numLeaves);
    printf("               N=1  %3d%%\n", 100 * numLeavesN[1] / numLeaves);
    printf("               N=2  %3d%%\n", 100 * numLeavesN[2] / numLeaves);
    printf("               N=3  %3d%%\n", 100 * numLeavesN[3] / numLeaves);
    printf("               N=4  %3d%%\n", 100 * numLeavesN[4] / numLeaves);
    printf("               N>4  %3d%%\n", 100 * numLeavesN[5] / numLeaves);
    printf("  * BVH2 nodes:     %d (%3d%%)\n", numBVH2, 100 * numBVH2 / (numNodes + numLeaves - 2 * numBVH2));
}

Referenced by BIH::build().

updateBVH2()

void BIH::BuildStats::updateBVH2 ( )

inline

{ numBVH2++; }

References numBVH2.

Referenced by BIH::subdivide().

updateInner()

void BIH::BuildStats::updateInner ( )

inline

{ numNodes++; }

References numNodes.

Referenced by BIH::subdivide().

updateLeaf()

void BIH::BuildStats::updateLeaf	(	int	depth,
		int	n
	)

{
    numLeaves++;
    minDepth = std::min(depth, minDepth);
    maxDepth = std::max(depth, maxDepth);
    sumDepth += depth;
    minObjects = std::min(n, minObjects);
    maxObjects = std::max(n, maxObjects);
    sumObjects += n;
    int nl = std::min(n, 5);
    ++numLeavesN[nl];
}

References maxDepth, maxObjects, minDepth, minObjects, numLeaves, numLeavesN, sumDepth, and sumObjects.

Referenced by BIH::subdivide().

Member Data Documentation

maxDepth

int BIH::BuildStats::maxDepth {-1}

private

{-1}; // 0xFFFFFFFF

Referenced by updateLeaf().

maxObjects

int BIH::BuildStats::maxObjects {-1}

private

{-1}; // 0xFFFFFFFF

Referenced by updateLeaf().

minDepth

int BIH::BuildStats::minDepth {0x0FFFFFFF}

private

{0x0FFFFFFF};

Referenced by updateLeaf().

minObjects

int BIH::BuildStats::minObjects {0x0FFFFFFF}

private

{0x0FFFFFFF};

Referenced by updateLeaf().

numBVH2

int BIH::BuildStats::numBVH2 {0}

private

{0};

Referenced by updateBVH2().

numLeaves

int BIH::BuildStats::numLeaves {0}

private

{0};

Referenced by updateLeaf().

numLeavesN

int BIH::BuildStats::numLeavesN[6]

private

Referenced by BuildStats(), and updateLeaf().

numNodes

int BIH::BuildStats::numNodes {0}

private

{0};

Referenced by updateInner().

sumDepth

int BIH::BuildStats::sumDepth {0}

private

{0};

Referenced by updateLeaf().

sumObjects

int BIH::BuildStats::sumObjects {0}

private

{0};

Referenced by updateLeaf().

---

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

• azerothcore-wotlk/src/common/Collision/BoundingIntervalHierarchy.h
• azerothcore-wotlk/src/common/Collision/BoundingIntervalHierarchy.cpp