Resource Utilization Point. More...

#include <resourceutilizationpoint.h>

Public Member Functions
void	reset ()
int	operator== (const ResourceUtilizationPoint &rup) const
int	operator!= (const ResourceUtilizationPoint &rup) const
Static Public Member Functions
static cardinal	mergeResourceUtilizationLists (ResourceUtilizationPoint destination, ResourceUtilizationPoint listArray, const cardinal listSizeArray, const cardinal listCount)
static void	ResourceUtilizationPoint::sortResourceUtilizationList (ResourceUtilizationPoint *rup, const integer start, const integer end)
static cardinal	ResourceUtilizationPoint::optimizeResourceUtilizationList (ResourceUtilizationPoint *rup, const cardinal count)
static cardinal	grahamScanResourceUtilizationList (ResourceUtilizationPoint *rup, const cardinal count)
Public Attributes
card64	Bandwidth
double	BandwidthCost
double	Utilization
double	FrameRate
cardinal	Layers
BandwidthInfo	LayerBandwidthInfo [RTPConstants::RTPMaxQualityLayers]
LayerClassMapping	Mapping [RTPConstants::RTPMaxQualityLayers]
Static Private Member Functions
static void	swapResourceUtilizationPoints (ResourceUtilizationPoint &a, ResourceUtilizationPoint &b)
static integer	ccw (const ResourceUtilizationPoint &p0, const ResourceUtilizationPoint &p1, const ResourceUtilizationPoint &p2)

Detailed Description

Resource Utilization Point.

This class is a resource/utilization point used for the bandwidth mapping algorithm.

Author:: Thomas Dreibholz

Version:: 1.0

Member Function Documentation

static integer Coral::ResourceUtilizationPoint::ccw	(	const ResourceUtilizationPoint &	p0,
		const ResourceUtilizationPoint &	p1,
		const ResourceUtilizationPoint &	p2
	)		`[inline, static, private]`

cardinal Coral::ResourceUtilizationPoint::grahamScanResourceUtilizationList	(	ResourceUtilizationPoint *	rup,
		const cardinal	count
	)		`[static]`

Compute convex hull on resource/utilization list using Graham Scan algorithm.

Parameters:

rup	List.
count	Number of entries in list.

Returns:: Number of entries remaining in list.

cardinal Coral::ResourceUtilizationPoint::mergeResourceUtilizationLists	(	ResourceUtilizationPoint *	destination,
		ResourceUtilizationPoint **	listArray,
		const cardinal *	listSizeArray,
		const cardinal	listCount
	)		`[static]`

Merge resource/utilization lists.

Parameters:

destination	Destination list.
listArray	Array of lists to merge.
listSizeArray	Array of list sizes.
listCount	Number of lists.

Returns:: Number of points in destination list.

int Coral::ResourceUtilizationPoint::operator!= ( const ResourceUtilizationPoint & rup ) const [inline]

Operator "!=".

int Coral::ResourceUtilizationPoint::operator== ( const ResourceUtilizationPoint & rup ) const [inline]

Operator "==".

void Coral::ResourceUtilizationPoint::reset ( )

Reset.

static cardinal Coral::ResourceUtilizationPoint::ResourceUtilizationPoint::optimizeResourceUtilizationList	(	ResourceUtilizationPoint *	rup,
		const cardinal	count
	)		`[static]`

Optimize resource/utilization list by utilization: Eliminate points which have higher resource requirements or cost than higher-utilized points following.

Parameters:

rup	List.
count	Number of entries in list.

Returns:: Number of entries remaining in list.

static void Coral::ResourceUtilizationPoint::ResourceUtilizationPoint::sortResourceUtilizationList	(	ResourceUtilizationPoint *	rup,
		const integer	start,
		const integer	end
	)		`[static]`

Sort resource/utilization list by utilization.

Parameters:

rup	List.
start	First point number.
end	Last point number.

static void Coral::ResourceUtilizationPoint::swapResourceUtilizationPoints	(	ResourceUtilizationPoint &	a,
		ResourceUtilizationPoint &	b
	)		`[inline, static, private]`