#include <set>
#include <algorithm>
#include <iterator>
#include "tlib.hh"
Go to the source code of this file.
|
| void | splitDependance (const set< Tree > &exps, set< Tree > &post, set< Tree > &pre) |
| | Analyze a set of expressions to discover its dependencies that is subexpressions common to at least two of these expressions. More...
|
| |
| void splitDependance |
( |
const set< Tree > & |
exps, |
|
|
set< Tree > & |
post, |
|
|
set< Tree > & |
pre |
|
) |
| |
Analyze a set of expressions to discover its dependencies that is subexpressions common to at least two of these expressions.
- Parameters
-
| exps | set of expressions to analyze |
| post | resulting set of post expressions |
| pre | resulting set of pre expressions |
Definition at line 28 of file colorize.cpp.
References allocateColor(), colorize(), listMultiColoredExp(), and uncolorize().
30 set<Tree>::const_iterator e;
31 for (e= exps.begin(); e != exps.end(); e++) {
36 for (e = exps.begin(); e != exps.end(); e++) {
41 set_difference(exps.begin(), exps.end(), pre.begin(), pre.end(), inserter(post, post.begin()));
43 for (e = exps.begin(); e != exps.end(); e++) {
static void uncolorize(Tree exp)
remove color information
static int allocateColor(Tree exp)
allocate a new unique color for exp
static void listMultiColoredExp(Tree exp, set< Tree > &lst)
list multicolored subexpressions of exp
static void colorize(Tree exp, int color)
add color information to exp and all its subtrees