Helper functions for the layout algorithm.
More...
|
template<class S1 , class S2 > |
int | getAlpha (const S1 &shape1, int depth1, const S2 &shape2, int depth2) |
|
template<class S1 , class S2 > |
void | merge (Extent *result, const S1 &shape1, int depth1, const S2 &shape2, int depth2, int alpha) |
|
|
template<class S1 , class S2 > |
static int | getAlpha (const S1 &shape1, int depth1, const S2 &shape2, int depth2) |
| Compute distance needed between shape1 and shape2. More...
|
|
template<class S1 , class S2 > |
static void | merge (Extent *result, const S1 &shape1, int depth1, const S2 &shape2, int depth2, int alpha) |
| Merge shape1 and shape2 into result with distance alpha. More...
|
|
Helper functions for the layout algorithm.
Definition at line 299 of file visualnode.cpp.
template<class S1 , class S2 >
static int Gecode::Gist::Layouter::getAlpha |
( |
const S1 & |
shape1, |
|
|
int |
depth1, |
|
|
const S2 & |
shape2, |
|
|
int |
depth2 |
|
) |
| |
|
static |
Compute distance needed between shape1 and shape2.
template<class S1 , class S2 >
static void Gecode::Gist::Layouter::merge |
( |
Extent * |
result, |
|
|
const S1 & |
shape1, |
|
|
int |
depth1, |
|
|
const S2 & |
shape2, |
|
|
int |
depth2, |
|
|
int |
alpha |
|
) |
| |
|
static |
Merge shape1 and shape2 into result with distance alpha.
template<class S1 , class S2 >
int Gecode::Gist::Layouter::getAlpha |
( |
const S1 & |
shape1, |
|
|
int |
depth1, |
|
|
const S2 & |
shape2, |
|
|
int |
depth2 |
|
) |
| |
template<class S1 , class S2 >
void Gecode::Gist::Layouter::merge |
( |
Extent * |
result, |
|
|
const S1 & |
shape1, |
|
|
int |
depth1, |
|
|
const S2 & |
shape2, |
|
|
int |
depth2, |
|
|
int |
alpha |
|
) |
| |
The documentation for this class was generated from the following file: