mt_cutpool.c File Reference

---

Detailed Description

Definition in file mt_cutpool.c.

#include "mt_cutpool.h"

Include dependency graph for mt_cutpool.c:

Go to the source code of this file.

Defines
#define	__MT_DOM
	helper to set dominance
Functions
int	MTcut_check_dominance (const MTcut_t *const cut1, const MTcut_t *const cut2)
	check for dominance between cuts.
void	MTcut_clear (MTcut_t *const MTcut)
	free any internal memory asociated with an MTcut_t structure
void	MTcut_copy (MTcut_t *const dest, const MTcut_t *const src)
	copy a cut from one structure to the next
void	MTcut_rsz (MTcut_t *const MTcut, const int MTnsz)
	resize a cut structure
int	MTcutHeap_add_cut (const MTlp_t *const lp, MTcutHeap_t *const cuth)
	add the cut (obtained by MTcutHeap_get_free_cut) to the structure, and possibly discard a worst cut from the heap
MTcut_t *	MTcutHeap_pop_cut (MTcutHeap_t *const cuth)
	pop the worst remaining cut within an MTcutHeap_t structure. Note that the memory asociated with the returned MTcut_t structure is handled by the MTcutHeap_t structure, and should not be freed by the user.
void	MTcutHeapClear (MTcutHeap_t *const cuth)
	Clear any internal memory asociated with an MTcutHeap_t structure. Note that after a call to this function a new call to MTcutHeapInit should be made before using any other function over the strucutre.
static int	MTcutHeapCn_compute_val (MTcutHeap_t *const cuth, MTcutHeapCn_t *const chcn)
	given a MTcutHeapCn_t compute the value asociated with the stored cut and store it in MTcutHeapCn_t::hcn, inside dbl_EGeHeapCn_t::val, the function used to evaluate depend on the configuration for the cut heap. The smallest the value, the worst the cut is.
void	MTcutHeapInit (MTcutHeap_t *const cuth, size_t sz)
	initialize an MTcutHeap_t structure
void	MTcutNzAlloc (void)
void	MTcutNzFree (void)
void	MTintPermSort (const int sz, int *const perm, const int *const elem)
	permutation sort for integers
Variables
static int *	MTcut1_nz = 0
	internal memory for dominance check
static int *	MTcut2_nz = 0

---