problem.cpp File Reference

#include "pal.h"
#include "palstat.h"
#include "layer.h"
#include "rtree.hpp"
#include "feature.h"
#include "geomfunction.h"
#include "labelposition.h"
#include "problem.h"
#include "util.h"
#include "priorityqueue.h"
#include "internalexception.h"
#include <cfloat>
#include <limits>
#include "qgslabelingengine.h"

Include dependency graph for problem.cpp:

Go to the source code of this file.

Classes
struct	_nokContext
struct	_Triple
struct	ChainContext
struct	FalpContext
struct	Ft
struct	SubPartContext
struct	UpdateContext

Typedefs
typedef struct _nokContext	NokContext
typedef struct _Triple	Triple

Functions
void	actualizeCandidateList (int nbOverlap, int *candidateListSize, double, double *candidateFactor, int minCandidateListSize, double growingFactor, int n)
void	actualizeTabuCandidateList (int m, int iteration, int nbOverlap, int *candidateListSize, double candidateBaseFactor, double *candidateFactor, int minCandidateListSize, double reductionFactor, int minTabuTSize, double tabuFactor, int *tenure, int n)
bool	borderSizeInc (void *l, void *r)
bool	chainCallback (LabelPosition *lp, void *context)
bool	checkCallback (LabelPosition *lp, void *ctx)
bool	decreaseCost (void *tl, void *tr)
void	delete_chain (Chain *chain)
bool	falpCallback1 (LabelPosition *lp, void *ctx)
bool	falpCallback2 (LabelPosition *lp, void *ctx)
void	ignoreLabel (LabelPosition *lp, PriorityQueue *list, RTree< LabelPosition *, double, 2, double > *candidates)
bool	nokCallback (LabelPosition *lp, void *context)
bool	subPartCallback (LabelPosition *lp, void *ctx)
bool	updateCandidatesCost (LabelPosition *lp, void *context)

Typedef Documentation

typedef struct _nokContext NokContext

typedef struct _Triple Triple

Function Documentation

void actualizeCandidateList ( int  nbOverlap, int *  candidateListSize, double  , double *  candidateFactor, int  minCandidateListSize, double  growingFactor, int  n  )

inline

Definition at line 718 of file problem.cpp.

void actualizeTabuCandidateList ( int  m, int  iteration, int  nbOverlap, int *  candidateListSize, double  candidateBaseFactor, double *  candidateFactor, int  minCandidateListSize, double  reductionFactor, int  minTabuTSize, double  tabuFactor, int *  tenure, int  n  )

inline

Definition at line 697 of file problem.cpp.

bool borderSizeInc ( void *  l, void *  r  )

inline

Definition at line 100 of file problem.cpp.

bool chainCallback	(	LabelPosition *	lp,
		void *	context
	)

Definition at line 1099 of file problem.cpp.

bool checkCallback	(	LabelPosition *	lp,
		void *	ctx
	)

Definition at line 2039 of file problem.cpp.

bool decreaseCost	(	void *	tl,
		void *	tr
	)

Definition at line 692 of file problem.cpp.

void delete_chain ( Chain *  chain )

inline

Definition at line 48 of file problem.cpp.

bool falpCallback1	(	LabelPosition *	lp,
		void *	ctx
	)

Definition at line 238 of file problem.cpp.

bool falpCallback2	(	LabelPosition *	lp,
		void *	ctx
	)

Definition at line 200 of file problem.cpp.

void ignoreLabel	(	LabelPosition *	lp,
		PriorityQueue *	list,
		RTree< LabelPosition *, double, 2, double > *	candidates
	)

Definition at line 214 of file problem.cpp.

bool nokCallback	(	LabelPosition *	lp,
		void *	context
	)

Definition at line 2096 of file problem.cpp.

bool subPartCallback	(	LabelPosition *	lp,
		void *	ctx
	)

Definition at line 528 of file problem.cpp.

bool updateCandidatesCost	(	LabelPosition *	lp,
		void *	context
	)

Definition at line 744 of file problem.cpp.