view release on metacpan or  search on metacpan

common.h  view on Meta::CPAN

#include <stdlib.h>
#include <math.h>

// BuDDy headers
#include <bdd.h>
#include <kernel.h>
// #include <cache.h>

//#include "jbdd.h"

// best to use C++ keywords (?)
enum e_bool { false = 0, true = 1 };
//#define bool int


// see if the __func__ macro is available??
static void dummy_function() {
#ifndef __func__
 #define __func__ "?"
#endif
}

lib/AI/PBDD.pm  view on Meta::CPAN

=item BDD_REORDER_WIN2

Reordering using a sliding window of size 2. This algorithm swaps two adjacent variable blocks and if this results in more nodes then the two blocks are swapped back again. Otherwise the result is kept in the variable order. This is then repeated for...

=item BDD_REORDER_WIN3

Same as above but with a window size of 3.

=item BDD_REORDER_SIFT

Each block is moved through all possible positions. The best of these is then used as the new position. Potentially a very slow but good method.

=item BDD_REORDER_RANDOM

Select a random position for each variable.

=back

These constants are automatically exported by the package.

=item B<reorder_now>