Predator
[unstable] git snapshot
|
public interface of list segment discovering algorithms More...
Go to the source code of this file.
Functions | |
void | digShapePropsCandidates (TShapePropsList *pDst, SymHeap &sh, TObjId obj) |
probe neighbouring objects and return a list of shape properties candidates | |
bool | canMergeObjWithNextObj (SymHeap &sh, TObjId obj, const ShapeProps &props, TObjId *pNextObj=0) |
true if we can merge a pair of subsequent objects according to shape props | |
bool | discoverBestAbstraction (Shape *pDst, SymHeap &sh) |
Take the given symbolic heap and look for the best possible abstraction in there. |
public interface of list segment discovering algorithms
Definition in file symdiscover.hh.
bool canMergeObjWithNextObj | ( | SymHeap & | sh, |
TObjId | obj, | ||
const ShapeProps & | props, | ||
TObjId * | pNextObj = 0 |
||
) |
true if we can merge a pair of subsequent objects according to shape props
void digShapePropsCandidates | ( | TShapePropsList * | pDst, |
SymHeap & | sh, | ||
TObjId | obj | ||
) |
probe neighbouring objects and return a list of shape properties candidates