FAUST compiler  0.9.9.6b8
Typedefs | Functions
boxes.hh File Reference
#include "tlib.hh"
#include "signals.hh"
Include dependency graph for boxes.hh:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs

typedef Tree(* prim0 )()
 
typedef Tree(* prim1 )(Tree x)
 
typedef Tree(* prim2 )(Tree x, Tree y)
 
typedef Tree(* prim3 )(Tree x, Tree y, Tree z)
 
typedef Tree(* prim4 )(Tree w, Tree x, Tree y, Tree z)
 
typedef Tree(* prim5 )(Tree v, Tree w, Tree x, Tree y, Tree z)
 

Functions

Tree boxIdent (const char *name)
 
bool isBoxIdent (Tree t)
 
bool isBoxIdent (Tree t, const char **name)
 
Tree boxInt (int n)
 
Tree boxReal (double n)
 
bool isBoxInt (Tree t)
 
bool isBoxReal (Tree t)
 
bool isBoxInt (Tree t, int *i)
 
bool isBoxReal (Tree t, double *r)
 
Tree boxWaveform (const tvec &br)
 
bool isBoxWaveform (Tree t)
 
Tree boxWire ()
 
Tree boxCut ()
 
bool isBoxWire (Tree t)
 
bool isBoxCut (Tree t)
 
Tree boxSlot (int id)
 
Tree boxSymbolic (Tree slot, Tree body)
 
bool isBoxSlot (Tree t)
 
bool isBoxSymbolic (Tree t)
 
bool isBoxSlot (Tree t, int *id)
 
bool isBoxSymbolic (Tree t, Tree &slot, Tree &body)
 
Tree boxSeq (Tree x, Tree y)
 
Tree boxPar (Tree x, Tree y)
 
Tree boxRec (Tree x, Tree y)
 
Tree boxSplit (Tree x, Tree y)
 
Tree boxMerge (Tree x, Tree y)
 
bool isBoxSeq (Tree t, Tree &x, Tree &y)
 
bool isBoxPar (Tree t, Tree &x, Tree &y)
 
bool isBoxRec (Tree t, Tree &x, Tree &y)
 
bool isBoxSplit (Tree t, Tree &x, Tree &y)
 
bool isBoxMerge (Tree t, Tree &x, Tree &y)
 
Tree boxIPar (Tree x, Tree y, Tree z)
 
Tree boxISeq (Tree x, Tree y, Tree z)
 
Tree boxISum (Tree x, Tree y, Tree z)
 
Tree boxIProd (Tree x, Tree y, Tree z)
 
bool isBoxIPar (Tree t, Tree &x, Tree &y, Tree &z)
 
bool isBoxISeq (Tree t, Tree &x, Tree &y, Tree &z)
 
bool isBoxISum (Tree t, Tree &x, Tree &y, Tree &z)
 
bool isBoxIProd (Tree t, Tree &x, Tree &y, Tree &z)
 
Tree boxInputs (Tree x)
 
Tree boxOutputs (Tree x)
 
bool isBoxInputs (Tree t, Tree &x)
 
bool isBoxOutputs (Tree t, Tree &x)
 
Tree buildBoxAbstr (Tree x, Tree y)
 
Tree buildBoxAppl (Tree x, Tree y)
 
Tree boxAbstr (Tree x, Tree y)
 
Tree boxAppl (Tree x, Tree y)
 
bool isBoxAbstr (Tree t)
 
bool isBoxAppl (Tree t)
 
bool isBoxAbstr (Tree t, Tree &x, Tree &y)
 
bool isBoxAppl (Tree t, Tree &x, Tree &y)
 
Tree closure (Tree abstr, Tree genv, Tree vis, Tree lenv)
 
bool isClosure (Tree t, Tree &abstr, Tree &genv, Tree &vis, Tree &lenv)
 
Tree boxAccess (Tree exp, Tree id)
 
bool isBoxAccess (Tree t, Tree &exp, Tree &id)
 
Tree boxWithLocalDef (Tree body, Tree ldef)
 
bool isBoxWithLocalDef (Tree t, Tree &body, Tree &ldef)
 
Tree boxModifLocalDef (Tree body, Tree ldef)
 
bool isBoxModifLocalDef (Tree t, Tree &body, Tree &ldef)
 
Tree boxError ()
 
bool isBoxError (Tree t)
 
Tree boxPrim0 (prim0 foo)
 
Tree boxPrim1 (prim1 foo)
 
Tree boxPrim2 (prim2 foo)
 
Tree boxPrim3 (prim3 foo)
 
Tree boxPrim4 (prim4 foo)
 
Tree boxPrim5 (prim5 foo)
 
bool isBoxPrim0 (Tree s)
 
bool isBoxPrim1 (Tree s)
 
bool isBoxPrim2 (Tree s)
 
bool isBoxPrim3 (Tree s)
 
bool isBoxPrim4 (Tree s)
 
bool isBoxPrim5 (Tree s)
 
bool isBoxPrim0 (Tree s, prim0 *p)
 
bool isBoxPrim1 (Tree s, prim1 *p)
 
bool isBoxPrim2 (Tree s, prim2 *p)
 
bool isBoxPrim3 (Tree s, prim3 *p)
 
bool isBoxPrim4 (Tree s, prim4 *p)
 
bool isBoxPrim5 (Tree s, prim5 *p)
 
Tree boxFFun (Tree ff)
 
bool isBoxFFun (Tree s)
 
bool isBoxFFun (Tree s, Tree &ff)
 
Tree boxFConst (Tree type, Tree name, Tree file)
 
bool isBoxFConst (Tree s)
 
bool isBoxFConst (Tree s, Tree &type, Tree &name, Tree &file)
 
Tree boxFVar (Tree type, Tree name, Tree file)
 
bool isBoxFVar (Tree s)
 
bool isBoxFVar (Tree s, Tree &type, Tree &name, Tree &file)
 
Tree boxEnvironment ()
 
bool isBoxEnvironment (Tree s)
 
Tree boxComponent (Tree filename)
 
bool isBoxComponent (Tree s, Tree &filename)
 
Tree boxLibrary (Tree filename)
 
bool isBoxLibrary (Tree s, Tree &filename)
 
Tree importFile (Tree filename)
 
bool isImportFile (Tree s, Tree &filename)
 
Tree boxButton (Tree label)
 
bool isBoxButton (Tree s)
 
bool isBoxButton (Tree s, Tree &label)
 
Tree boxCheckbox (Tree label)
 
bool isBoxCheckbox (Tree s)
 
bool isBoxCheckbox (Tree s, Tree &label)
 
Tree boxVSlider (Tree label, Tree cur, Tree min, Tree max, Tree step)
 
bool isBoxVSlider (Tree s)
 
bool isBoxVSlider (Tree s, Tree &label, Tree &cur, Tree &min, Tree &max, Tree &step)
 
Tree boxHSlider (Tree label, Tree cur, Tree min, Tree max, Tree step)
 
bool isBoxHSlider (Tree s)
 
bool isBoxHSlider (Tree s, Tree &label, Tree &cur, Tree &min, Tree &max, Tree &step)
 
Tree boxNumEntry (Tree label, Tree cur, Tree min, Tree max, Tree step)
 
bool isBoxNumEntry (Tree s)
 
bool isBoxNumEntry (Tree s, Tree &label, Tree &cur, Tree &min, Tree &max, Tree &step)
 
Tree boxVGroup (Tree label, Tree x)
 
bool isBoxVGroup (Tree s)
 
bool isBoxVGroup (Tree s, Tree &label, Tree &x)
 
Tree boxHGroup (Tree label, Tree x)
 
bool isBoxHGroup (Tree s)
 
bool isBoxHGroup (Tree s, Tree &label, Tree &x)
 
Tree boxTGroup (Tree label, Tree x)
 
bool isBoxTGroup (Tree s)
 
bool isBoxTGroup (Tree s, Tree &label, Tree &x)
 
Tree boxVBargraph (Tree label, Tree min, Tree max)
 
bool isBoxVBargraph (Tree s)
 
bool isBoxVBargraph (Tree s, Tree &label, Tree &min, Tree &max)
 
Tree boxHBargraph (Tree label, Tree min, Tree max)
 
bool isBoxHBargraph (Tree s)
 
bool isBoxHBargraph (Tree s, Tree &label, Tree &min, Tree &max)
 
Tree boxCase (Tree rules)
 
bool isBoxCase (Tree s)
 
bool isBoxCase (Tree s, Tree &rules)
 
Tree boxPatternMatcher (Automaton *a, int state, Tree env, Tree origRules, Tree revParamList)
 
bool isBoxPatternMatcher (Tree s)
 
bool isBoxPatternMatcher (Tree s, Automaton *&a, int &state, Tree &env, Tree &origRules, Tree &revParamList)
 
Tree boxPatternVar (Tree id)
 
bool isBoxPatternVar (Tree s, Tree &id)
 
bool getBoxType (Tree box, int *inum, int *onum)
 Return the type (number of inputs and outputs) of a box or false if undefined. More...
 

Typedef Documentation

typedef Tree(* prim0)()

Definition at line 208 of file boxes.hh.

typedef Tree(* prim1)(Tree x)

Definition at line 209 of file boxes.hh.

typedef Tree(* prim2)(Tree x, Tree y)

Definition at line 210 of file boxes.hh.

typedef Tree(* prim3)(Tree x, Tree y, Tree z)

Definition at line 211 of file boxes.hh.

typedef Tree(* prim4)(Tree w, Tree x, Tree y, Tree z)

Definition at line 212 of file boxes.hh.

typedef Tree(* prim5)(Tree v, Tree w, Tree x, Tree y, Tree z)

Definition at line 213 of file boxes.hh.

Function Documentation

Tree boxAbstr ( Tree  x,
Tree  y 
)

Definition at line 199 of file boxes.cpp.

References tree().

Referenced by buildBoxAbstr().

199 { return tree(BOXABSTR, x, y); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXABSTR
Definition: boxes.cpp:193

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxAccess ( Tree  exp,
Tree  id 
)

Definition at line 255 of file boxes.cpp.

References tree().

Referenced by yyparse().

255 { return tree(BOXACCESS, exp, id); }
Sym BOXACCESS
Definition: boxes.cpp:197
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxAppl ( Tree  x,
Tree  y 
)

Definition at line 200 of file boxes.cpp.

References tree().

Referenced by buildBoxAppl(), and preparePattern().

200 { return tree(BOXAPPL, x, y); }
Sym BOXAPPL
Definition: boxes.cpp:194
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxButton ( Tree  label)

Definition at line 365 of file boxes.cpp.

References tree().

Referenced by realeval(), and yyparse().

365 { return tree(BOXBUTTON, lbl); }
Sym BOXBUTTON
Definition: boxes.cpp:364
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxCase ( Tree  rules)

Definition at line 615 of file boxes.cpp.

References boxCaseInternal(), and prepareRules().

Referenced by applyList(), makeDefinition(), and yyparse().

615 { return boxCaseInternal(prepareRules(rules)); }
static Tree prepareRules(Tree rules)
Definition: boxes.cpp:610
Tree boxCaseInternal(Tree rules)
Definition: boxes.cpp:614

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxCheckbox ( Tree  label)

Definition at line 371 of file boxes.cpp.

References tree().

Referenced by realeval(), and yyparse().

371 { return tree(BOXCHECKBOX, lbl); }
Sym BOXCHECKBOX
Definition: boxes.cpp:370
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxComponent ( Tree  filename)

Definition at line 289 of file boxes.cpp.

References tree().

Referenced by yyparse().

289 { return tree(BOXCOMPONENT, filename); }
Sym BOXCOMPONENT
Definition: boxes.cpp:287
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxCut ( )

Definition at line 104 of file boxes.cpp.

References tree().

Referenced by yyparse().

104 { return tree(BOXCUT); }
Sym BOXCUT
Definition: boxes.cpp:103
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxEnvironment ( )

Definition at line 284 of file boxes.cpp.

References tree().

Referenced by realeval(), and yyparse().

284 { return tree(BOXENVIRONMENT); }
Sym BOXENVIRONMENT
Definition: boxes.cpp:282
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxError ( )

Definition at line 244 of file boxes.cpp.

References tree().

Referenced by apply_pattern_matcher(), and applyList().

245 {
246  return tree(BOXERROR);
247 }
Sym BOXERROR
Definition: boxes.cpp:196
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxFConst ( Tree  type,
Tree  name,
Tree  file 
)

Definition at line 349 of file boxes.cpp.

References tree().

Referenced by yyparse().

349 { return tree(BOXFCONST, type, name, file); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXFCONST
Definition: boxes.cpp:348

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxFFun ( Tree  ff)

Definition at line 343 of file boxes.cpp.

References tree().

Referenced by yyparse().

343 { return tree(BOXFFUN, ff); }
Sym BOXFFUN
Definition: boxes.cpp:342
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxFVar ( Tree  type,
Tree  name,
Tree  file 
)

Definition at line 355 of file boxes.cpp.

References tree().

Referenced by yyparse().

355 { return tree(BOXFVAR, type, name, file); }
Sym BOXFVAR
Definition: boxes.cpp:354
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxHBargraph ( Tree  label,
Tree  min,
Tree  max 
)

Definition at line 454 of file boxes.cpp.

References tree().

Referenced by realeval(), and yyparse().

454 { return tree(BOXHBARGRAPH, lbl, min, max); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXHBARGRAPH
Definition: boxes.cpp:453

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxHGroup ( Tree  label,
Tree  x 
)

Definition at line 436 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), preparePattern(), realeval(), and yyparse().

436 { return tree(BOXHGROUP, lbl, x); }
Sym BOXHGROUP
Definition: boxes.cpp:435
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxHSlider ( Tree  label,
Tree  cur,
Tree  min,
Tree  max,
Tree  step 
)

Definition at line 377 of file boxes.cpp.

References list4(), and tree().

Referenced by realeval(), and yyparse().

378  { return tree(BOXHSLIDER, lbl, list4(cur,min,max,step)); }
Tree list4(Tree a, Tree b, Tree c, Tree d)
Definition: list.hh:130
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXHSLIDER
Definition: boxes.cpp:376

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxIdent ( const char *  name)

Definition at line 57 of file boxes.cpp.

References symbol(), and tree().

Referenced by declareAutoDoc(), evalprocess(), realeval(), writeIdentValue(), and yyparse().

57 { return tree(BOXIDENT, tree(symbol(name)) ); }
Sym BOXIDENT
Definition: boxes.cpp:55
const char * name(Symbol *sym)
Returns the name of a symbol.
Definition: symbol.hh:98
Tree tree(const Node &n)
Definition: tree.hh:186
Symbol * symbol(const char *str)
Returns (and creates if new) the symbol of name str.
Definition: symbol.hh:95

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxInputs ( Tree  x)

Definition at line 182 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

182 { return tree(BOXINPUTS, x); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXINPUTS
Definition: boxes.cpp:179

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxInt ( int  n)

Definition at line 75 of file boxes.cpp.

References tree().

Referenced by isBoxNumeric(), isInverter(), numericBoxSimplification(), realeval(), and yyparse().

75 { return tree(n); }
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxIPar ( Tree  x,
Tree  y,
Tree  z 
)

Definition at line 164 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

164 { return tree(BOXIPAR, x, y, z); }
Sym BOXIPAR
Definition: boxes.cpp:159
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxIProd ( Tree  x,
Tree  y,
Tree  z 
)

Definition at line 167 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

167 { return tree(BOXIPROD, x, y, z); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXIPROD
Definition: boxes.cpp:162

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxISeq ( Tree  x,
Tree  y,
Tree  z 
)

Definition at line 165 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

165 { return tree(BOXISEQ, x, y, z); }
Sym BOXISEQ
Definition: boxes.cpp:160
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxISum ( Tree  x,
Tree  y,
Tree  z 
)

Definition at line 166 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

166 { return tree(BOXISUM, x, y, z); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXISUM
Definition: boxes.cpp:161

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxLibrary ( Tree  filename)

Definition at line 294 of file boxes.cpp.

References tree().

Referenced by yyparse().

294 { return tree(BOXLIBRARY, filename); }
Sym BOXLIBRARY
Definition: boxes.cpp:292
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxMerge ( Tree  x,
Tree  y 
)

Definition at line 151 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), preparePattern(), realeval(), and yyparse().

151 { return tree(BOXMERGE, x, y); }
Sym BOXMERGE
Definition: boxes.cpp:150
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxModifLocalDef ( Tree  body,
Tree  ldef 
)

Definition at line 274 of file boxes.cpp.

References tree().

Referenced by yyparse().

274 { return tree(BOXMODIFLOCALDEF, body, ldef); }
Sym BOXMODIFLOCALDEF
Definition: boxes.cpp:271
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxNumEntry ( Tree  label,
Tree  cur,
Tree  min,
Tree  max,
Tree  step 
)

Definition at line 416 of file boxes.cpp.

References list4(), and tree().

Referenced by realeval(), and yyparse().

417  { return tree(BOXNUMENTRY, lbl, list4(cur,min,max,step)); }
Tree list4(Tree a, Tree b, Tree c, Tree d)
Definition: list.hh:130
Sym BOXNUMENTRY
Definition: boxes.cpp:415
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxOutputs ( Tree  x)

Definition at line 183 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

183 { return tree(BOXOUTPUTS, x); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXOUTPUTS
Definition: boxes.cpp:180

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPar ( Tree  x,
Tree  y 
)

Definition at line 139 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), isInverter(), iteratePar(), iterateProd(), iterateSum(), larg2par(), preparePattern(), realeval(), and yyparse().

139 { return tree(BOXPAR, x, y); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXPAR
Definition: boxes.cpp:138

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPatternMatcher ( Automaton a,
int  state,
Tree  env,
Tree  origRules,
Tree  revParamList 
)

Definition at line 625 of file boxes.cpp.

References tree().

Referenced by applyList(), and evalCase().

626 {
627  return tree(BOXPATMATCHER, tree((void*)a), tree(state), env, origRules, revParamList);
628 }
Sym BOXPATMATCHER
Definition: boxes.cpp:470
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPatternVar ( Tree  id)

Definition at line 621 of file boxes.cpp.

References tree().

Referenced by preparePattern().

621 { return tree(BOXPATVAR, id); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXPATVAR
Definition: boxes.cpp:471

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPrim0 ( prim0  foo)

Definition at line 309 of file boxes.cpp.

References tree().

309 { return tree(BOXPRIM0, tree((void*)foo)); }
Sym BOXPRIM0
Definition: boxes.cpp:308
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Tree boxPrim1 ( prim1  foo)

Definition at line 314 of file boxes.cpp.

References tree().

Referenced by yyparse().

314 { return tree(BOXPRIM1, tree((void*)foo)); }
Sym BOXPRIM1
Definition: boxes.cpp:313
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPrim2 ( prim2  foo)

Definition at line 319 of file boxes.cpp.

References tree().

Referenced by isInverter(), iterateProd(), iterateSum(), and yyparse().

319 { return tree(BOXPRIM2, tree((void*)foo)); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXPRIM2
Definition: boxes.cpp:318

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPrim3 ( prim3  foo)

Definition at line 324 of file boxes.cpp.

References tree().

Referenced by yyparse().

324 { return tree(BOXPRIM3, tree((void*)foo)); }
Sym BOXPRIM3
Definition: boxes.cpp:323
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPrim4 ( prim4  foo)

Definition at line 329 of file boxes.cpp.

References tree().

Referenced by yyparse().

329 { return tree(BOXPRIM4, tree((void*)foo)); }
Sym BOXPRIM4
Definition: boxes.cpp:328
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxPrim5 ( prim5  foo)

Definition at line 334 of file boxes.cpp.

References tree().

Referenced by yyparse().

334 { return tree(BOXPRIM5, tree((void*)foo)); }
Sym BOXPRIM5
Definition: boxes.cpp:333
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxReal ( double  n)

Definition at line 76 of file boxes.cpp.

References tree().

Referenced by isBoxNumeric(), isInverter(), numericBoxSimplification(), and yyparse().

76 { return tree(n); }
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxRec ( Tree  x,
Tree  y 
)

Definition at line 143 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), preparePattern(), realeval(), and yyparse().

143 { return tree(BOXREC, x, y); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXREC
Definition: boxes.cpp:142

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxSeq ( Tree  x,
Tree  y 
)

Definition at line 135 of file boxes.cpp.

References tree().

Referenced by applyList(), insideBoxSimplification(), isInverter(), iterateProd(), iterateSeq(), iterateSum(), preparePattern(), realeval(), and yyparse().

135 { return tree(BOXSEQ, x, y); }
Sym BOXSEQ
Definition: boxes.cpp:134
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxSlot ( int  id)

Definition at line 118 of file boxes.cpp.

References tree().

Referenced by real_a2sb().

118 { return tree(BOXSLOT,tree(id)); }
Sym BOXSLOT
Definition: boxes.cpp:116
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxSplit ( Tree  x,
Tree  y 
)

Definition at line 147 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), preparePattern(), realeval(), and yyparse().

147 { return tree(BOXSPLIT, x, y); }
Sym BOXSPLIT
Definition: boxes.cpp:146
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxSymbolic ( Tree  slot,
Tree  body 
)

Definition at line 125 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), and real_a2sb().

125 { return tree(BOXSYMBOLIC,slot, body); }
Sym BOXSYMBOLIC
Definition: boxes.cpp:123
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxTGroup ( Tree  label,
Tree  x 
)

Definition at line 448 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), preparePattern(), realeval(), and yyparse().

448 { return tree(BOXTGROUP, lbl, x); }
Sym BOXTGROUP
Definition: boxes.cpp:447
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxVBargraph ( Tree  label,
Tree  min,
Tree  max 
)

Definition at line 460 of file boxes.cpp.

References tree().

Referenced by realeval(), and yyparse().

460 { return tree(BOXVBARGRAPH, lbl, min, max); }
Sym BOXVBARGRAPH
Definition: boxes.cpp:459
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxVGroup ( Tree  label,
Tree  x 
)

Definition at line 442 of file boxes.cpp.

References tree().

Referenced by insideBoxSimplification(), preparePattern(), realeval(), and yyparse().

442 { return tree(BOXVGROUP, lbl, x); }
Tree tree(const Node &n)
Definition: tree.hh:186
Sym BOXVGROUP
Definition: boxes.cpp:441

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxVSlider ( Tree  label,
Tree  cur,
Tree  min,
Tree  max,
Tree  step 
)

Definition at line 397 of file boxes.cpp.

References list4(), and tree().

Referenced by realeval(), and yyparse().

398  { return tree(BOXVSLIDER, lbl, list4(cur,min,max,step)); }
Tree list4(Tree a, Tree b, Tree c, Tree d)
Definition: list.hh:130
Sym BOXVSLIDER
Definition: boxes.cpp:396
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxWaveform ( const tvec br)

Definition at line 92 of file boxes.cpp.

References tree().

Referenced by yyparse().

93 {
94  return tree(BOXWAVEFORM, br);
95 }
Sym BOXWAVEFORM
Definition: boxes.cpp:90
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxWire ( )

Definition at line 108 of file boxes.cpp.

References tree().

Referenced by isInverter(), nwires(), and yyparse().

108 { return tree(BOXWIRE); }
Sym BOXWIRE
Definition: boxes.cpp:107
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxWithLocalDef ( Tree  body,
Tree  ldef 
)

Definition at line 264 of file boxes.cpp.

References tree().

Referenced by preparePattern(), and yyparse().

264 { return tree(BOXWITHLOCALDEF, body, ldef); }
Sym BOXWITHLOCALDEF
Definition: boxes.cpp:262
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

Tree buildBoxAbstr ( Tree  x,
Tree  y 
)

Definition at line 208 of file boxes.cpp.

References boxAbstr(), buildBoxAbstr(), hd(), isNil(), and tl().

Referenced by buildBoxAbstr(), makeDefinition(), and yyparse().

209 {
210  if (isNil(largs)) {
211  return body;
212  } else {
213  return buildBoxAbstr(tl(largs), boxAbstr(hd(largs), body));
214  }
215 }
Tree hd(Tree l)
Definition: list.hh:133
bool isNil(Tree l)
Definition: list.hh:137
Tree boxAbstr(Tree x, Tree y)
Definition: boxes.cpp:199
Tree buildBoxAbstr(Tree largs, Tree body)
Definition: boxes.cpp:208
Tree tl(Tree l)
Definition: list.hh:134

Here is the call graph for this function:

Here is the caller graph for this function:

Tree buildBoxAppl ( Tree  x,
Tree  y 
)

Definition at line 227 of file boxes.cpp.

References boxAppl(), and isNil().

Referenced by yyparse().

228 {
229  if (isNil (revarglist)) exit(1); // a revoir !!!!!!
230  return boxAppl(fun, revarglist);
231 }
bool isNil(Tree l)
Definition: list.hh:137
Tree boxAppl(Tree x, Tree y)
Definition: boxes.cpp:200

Here is the call graph for this function:

Here is the caller graph for this function:

Tree closure ( Tree  abstr,
Tree  genv,
Tree  vis,
Tree  lenv 
)

Definition at line 234 of file boxes.cpp.

References tree().

Referenced by apply_pattern_matcher(), copyEnvReplaceDefs(), pushMultiClosureDefs(), realeval(), and updateClosures().

235 {
236  return tree(CLOSURE, abstr, genv, vis, lenv);
237 }
Sym CLOSURE
Definition: boxes.cpp:195
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

bool getBoxType ( Tree  box,
int *  inum,
int *  onum 
)

Return the type (number of inputs and outputs) of a box or false if undefined.

Parameters
boxthe box we want to know the type
inumthe place to return the number of inputs
onumthe place to return the number of outputs
Returns
true if type is defined, false if undefined

Definition at line 63 of file boxtype.cpp.

References cons(), Node::getInt(), getProperty(), hd(), infereBoxType(), isNil(), nil, CTree::node(), setProperty(), tl(), and tree().

Referenced by applyList(), boxlistOutputs(), eval2double(), eval2int(), generateDiagramSchema(), getBoxInputsAndOutputs(), infereBoxType(), isBoxNumeric(), main(), mapGetEqName(), numericBoxSimplification(), realeval(), realPropagate(), and writeSchemaFile().

64 {
65  Tree t;
66  if (getProperty(box, BOXTYPEPROP, t)) {
67 
68  if (isNil(t)) {
69  return false;
70  } else {
71  *inum = hd(t)->node().getInt();
72  *onum = tl(t)->node().getInt();
73  return true;
74  }
75 
76  } else {
77 
78  if (infereBoxType(box, inum, onum)) {
79  setProperty(box, BOXTYPEPROP, cons(tree(*inum), tree(*onum)));
80  return true;
81  } else {
83  return false;
84  }
85  }
86 }
static bool infereBoxType(Tree box, int *inum, int *onum)
Infere the type (number of inputs and outputs) of a box.
Definition: boxtype.cpp:101
Tree cons(Tree a, Tree b)
Definition: list.hh:124
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Tree BOXTYPEPROP
Definition: boxtype.cpp:50
Tree hd(Tree l)
Definition: list.hh:133
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isNil(Tree l)
Definition: list.hh:137
Tree tree(const Node &n)
Definition: tree.hh:186
int getInt() const
Definition: node.hh:104
void setProperty(Tree t, Tree key, Tree val)
Definition: list.cpp:418
Tree nil
Definition: list.cpp:116
Tree tl(Tree l)
Definition: list.hh:134
bool getProperty(Tree t, Tree key, Tree &val)
Definition: list.cpp:423

Here is the call graph for this function:

Here is the caller graph for this function:

Tree importFile ( Tree  filename)

Definition at line 300 of file boxes.cpp.

References tree().

Referenced by main(), and yyparse().

300 { return tree(IMPORTFILE, filename); }
Sym IMPORTFILE
Definition: boxes.cpp:298
Tree tree(const Node &n)
Definition: tree.hh:186

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxAbstr ( Tree  t)

Definition at line 202 of file boxes.cpp.

References CTree::node().

Referenced by applyList(), preparePattern(), boxpp::print(), real_a2sb(), and realeval().

202 { return t->node() == Node(BOXABSTR); }
Class Node = (type x (int + double + Sym + void*))
Definition: node.hh:75
const Node & node() const
return the content of the tree
Definition: tree.hh:143
Sym BOXABSTR
Definition: boxes.cpp:193

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxAbstr ( Tree  t,
Tree x,
Tree y 
)

Definition at line 205 of file boxes.cpp.

References isTree().

205 { return isTree(t, BOXABSTR, x, y); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXABSTR
Definition: boxes.cpp:193

Here is the call graph for this function:

bool isBoxAccess ( Tree  t,
Tree exp,
Tree id 
)

Definition at line 256 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

256 { return isTree(t, BOXACCESS, exp, id); }
Sym BOXACCESS
Definition: boxes.cpp:197
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxAppl ( Tree  t)

Definition at line 203 of file boxes.cpp.

References CTree::node().

Referenced by preparePattern(), boxpp::print(), and realeval().

203 { return t->node() == Node(BOXAPPL); }
Class Node = (type x (int + double + Sym + void*))
Definition: node.hh:75
const Node & node() const
return the content of the tree
Definition: tree.hh:143
Sym BOXAPPL
Definition: boxes.cpp:194

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxAppl ( Tree  t,
Tree x,
Tree y 
)

Definition at line 206 of file boxes.cpp.

References isTree().

206 { return isTree(t, BOXAPPL, x, y); }
Sym BOXAPPL
Definition: boxes.cpp:194
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxButton ( Tree  s)

Definition at line 366 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

366 { Tree lbl; return isTree(s, BOXBUTTON, lbl); }
Sym BOXBUTTON
Definition: boxes.cpp:364
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxButton ( Tree  s,
Tree label 
)

Definition at line 367 of file boxes.cpp.

References isTree().

367 { return isTree(s, BOXBUTTON, lbl); }
Sym BOXBUTTON
Definition: boxes.cpp:364
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxCase ( Tree  s)

Definition at line 617 of file boxes.cpp.

References isTree().

Referenced by copyEnvReplaceDefs(), preparePattern(), boxpp::print(), pushMultiClosureDefs(), and realeval().

617 { Tree rules; return isTree(s, BOXCASE, rules); }
Sym BOXCASE
Definition: boxes.cpp:469
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxCase ( Tree  s,
Tree rules 
)

Definition at line 618 of file boxes.cpp.

References isTree().

618 { return isTree(s, BOXCASE, rules); }
Sym BOXCASE
Definition: boxes.cpp:469
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxCheckbox ( Tree  s)

Definition at line 372 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

372 { Tree lbl; return isTree(s, BOXCHECKBOX, lbl); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXCHECKBOX
Definition: boxes.cpp:370
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxCheckbox ( Tree  s,
Tree label 
)

Definition at line 373 of file boxes.cpp.

References isTree().

373 { return isTree(s, BOXCHECKBOX, lbl); }
Sym BOXCHECKBOX
Definition: boxes.cpp:370
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxComponent ( Tree  s,
Tree filename 
)

Definition at line 290 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

290 { return isTree(s, BOXCOMPONENT, filename); }
Sym BOXCOMPONENT
Definition: boxes.cpp:287
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxCut ( Tree  t)

Definition at line 105 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

105 { return isTree(t, BOXCUT); }
Sym BOXCUT
Definition: boxes.cpp:103
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxEnvironment ( Tree  s)

Definition at line 285 of file boxes.cpp.

References isTree().

Referenced by applyList(), infereBoxType(), preparePattern(), boxpp::print(), real_a2sb(), and realeval().

285 { return isTree(s, BOXENVIRONMENT); }
Sym BOXENVIRONMENT
Definition: boxes.cpp:282
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxError ( Tree  t)

Definition at line 249 of file boxes.cpp.

References isTree().

Referenced by apply_pattern_matcher(), applyList(), make_pattern_matcher(), and boxpp::print().

250 {
251  return isTree(t, BOXERROR);
252 }
Sym BOXERROR
Definition: boxes.cpp:196
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxFConst ( Tree  s)

Definition at line 350 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

350 { Tree t,n,f; return isTree(s, BOXFCONST, t, n, f); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXFCONST
Definition: boxes.cpp:348

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxFConst ( Tree  s,
Tree type,
Tree name,
Tree file 
)

Definition at line 351 of file boxes.cpp.

References isTree().

351 { return isTree(s, BOXFCONST,type, name, file); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXFCONST
Definition: boxes.cpp:348

Here is the call graph for this function:

bool isBoxFFun ( Tree  s)

Definition at line 344 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

344 { Tree ff; return isTree(s, BOXFFUN, ff); }
Sym BOXFFUN
Definition: boxes.cpp:342
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxFFun ( Tree  s,
Tree ff 
)

Definition at line 345 of file boxes.cpp.

References isTree().

345 { return isTree(s, BOXFFUN, ff); }
Sym BOXFFUN
Definition: boxes.cpp:342
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxFVar ( Tree  s)

Definition at line 356 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

356 { Tree t,n,f; return isTree(s, BOXFVAR, t, n, f); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXFVAR
Definition: boxes.cpp:354
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxFVar ( Tree  s,
Tree type,
Tree name,
Tree file 
)

Definition at line 357 of file boxes.cpp.

References isTree().

357 { return isTree(s, BOXFVAR,type, name, file); }
Sym BOXFVAR
Definition: boxes.cpp:354
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxHBargraph ( Tree  s)

Definition at line 455 of file boxes.cpp.

References isTree(), max(), and min().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

455 { Tree lbl, min, max; return isTree(s, BOXHBARGRAPH, lbl, min, max); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
double max(double x, double y)
Definition: interval.hh:60
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
double min(double x, double y)
Definition: interval.hh:59
Sym BOXHBARGRAPH
Definition: boxes.cpp:453

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxHBargraph ( Tree  s,
Tree label,
Tree min,
Tree max 
)

Definition at line 456 of file boxes.cpp.

References isTree().

456 { return isTree(s, BOXHBARGRAPH, lbl, min, max); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXHBARGRAPH
Definition: boxes.cpp:453

Here is the call graph for this function:

bool isBoxHGroup ( Tree  s)

Definition at line 437 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

437 { Tree lbl, x; return isTree(s, BOXHGROUP, lbl, x); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXHGROUP
Definition: boxes.cpp:435
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxHGroup ( Tree  s,
Tree label,
Tree x 
)

Definition at line 438 of file boxes.cpp.

References isTree().

438 { return isTree(s, BOXHGROUP, lbl, x); }
Sym BOXHGROUP
Definition: boxes.cpp:435
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxHSlider ( Tree  s)

Definition at line 379 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

379 { Tree lbl, params; return isTree(s, BOXHSLIDER, lbl, params); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXHSLIDER
Definition: boxes.cpp:376

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxHSlider ( Tree  s,
Tree label,
Tree cur,
Tree min,
Tree max,
Tree step 
)

Definition at line 381 of file boxes.cpp.

References isTree(), and nth().

382 {
383  Tree params;
384  if (isTree(s, BOXHSLIDER, lbl, params)) {
385  cur = nth(params, 0);
386  min = nth(params, 1);
387  max = nth(params, 2);
388  step= nth(params, 3);
389  return true;
390  } else {
391  return false;
392  }
393 }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Tree nth(Tree l, int i)
Definition: list.cpp:182
Sym BOXHSLIDER
Definition: boxes.cpp:376

Here is the call graph for this function:

bool isBoxIdent ( Tree  t)

Definition at line 58 of file boxes.cpp.

References CTree::node().

Referenced by preparePattern(), boxpp::print(), real_a2sb(), realeval(), and standardArgList().

58 { return t->node() == Node(BOXIDENT); }
Class Node = (type x (int + double + Sym + void*))
Definition: node.hh:75
Sym BOXIDENT
Definition: boxes.cpp:55
const Node & node() const
return the content of the tree
Definition: tree.hh:143

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxIdent ( Tree  t,
const char **  name 
)

Definition at line 59 of file boxes.cpp.

References isSym(), isTree(), name(), and CTree::node().

60 {
61  Tree t1; Sym s;
62  if ( isTree(t0, BOXIDENT, t1) && isSym(t1->node(), &s) ) {
63  *str = name(s);
64  return true;
65  } else {
66  return false;
67  }
68 }
Sym BOXIDENT
Definition: boxes.cpp:55
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isSym(const Node &n)
Definition: node.hh:199
const char * name(Symbol *sym)
Returns the name of a symbol.
Definition: symbol.hh:98
Symbols are unique objects with a name stored in a hash table.
Definition: symbol.hh:53
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxInputs ( Tree  t,
Tree x 
)

Definition at line 185 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

185 { return isTree(t, BOXINPUTS, x); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXINPUTS
Definition: boxes.cpp:179

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxInt ( Tree  t)

Definition at line 78 of file boxes.cpp.

References isInt(), and CTree::node().

Referenced by Automaton::build(), computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxNumeric(), numericBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

78 { return isInt(t->node()); }
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isInt(const Node &n)
Definition: node.hh:126

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxInt ( Tree  t,
int *  i 
)

Definition at line 81 of file boxes.cpp.

References isInt(), and CTree::node().

81 { return isInt(t->node(), i); }
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isInt(const Node &n)
Definition: node.hh:126

Here is the call graph for this function:

bool isBoxIPar ( Tree  t,
Tree x,
Tree y,
Tree z 
)

Definition at line 169 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

169 { return isTree(t, BOXIPAR, x, y, z); }
Sym BOXIPAR
Definition: boxes.cpp:159
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxIProd ( Tree  t,
Tree x,
Tree y,
Tree z 
)

Definition at line 172 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

172 { return isTree(t, BOXIPROD, x, y, z); }
Sym BOXIPROD
Definition: boxes.cpp:162
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxISeq ( Tree  t,
Tree x,
Tree y,
Tree z 
)

Definition at line 170 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

170 { return isTree(t, BOXISEQ, x, y, z); }
Sym BOXISEQ
Definition: boxes.cpp:160
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxISum ( Tree  t,
Tree x,
Tree y,
Tree z 
)

Definition at line 171 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

171 { return isTree(t, BOXISUM, x, y, z); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXISUM
Definition: boxes.cpp:161

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxLibrary ( Tree  s,
Tree filename 
)

Definition at line 295 of file boxes.cpp.

References isTree().

Referenced by realeval().

295 { return isTree(s, BOXLIBRARY, filename); }
Sym BOXLIBRARY
Definition: boxes.cpp:292
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxMerge ( Tree  t,
Tree x,
Tree y 
)

Definition at line 152 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

152 { return isTree(t, BOXMERGE, x, y); }
Sym BOXMERGE
Definition: boxes.cpp:150
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxModifLocalDef ( Tree  t,
Tree body,
Tree ldef 
)

Definition at line 275 of file boxes.cpp.

References isTree().

Referenced by realeval().

275 { return isTree(t, BOXMODIFLOCALDEF, body, ldef); }
Sym BOXMODIFLOCALDEF
Definition: boxes.cpp:271
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxNumEntry ( Tree  s)

Definition at line 418 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

418 { Tree lbl, params; return isTree(s, BOXNUMENTRY, lbl, params); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXNUMENTRY
Definition: boxes.cpp:415
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxNumEntry ( Tree  s,
Tree label,
Tree cur,
Tree min,
Tree max,
Tree step 
)

Definition at line 420 of file boxes.cpp.

References isTree(), and nth().

421 {
422  Tree params;
423  if (isTree(s, BOXNUMENTRY, lbl, params)) {
424  cur = nth(params, 0);
425  min = nth(params, 1);
426  max = nth(params, 2);
427  step= nth(params, 3);
428  return true;
429  } else {
430  return false;
431  }
432 }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXNUMENTRY
Definition: boxes.cpp:415
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Tree nth(Tree l, int i)
Definition: list.cpp:182

Here is the call graph for this function:

bool isBoxOutputs ( Tree  t,
Tree x 
)

Definition at line 186 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

186 { return isTree(t, BOXOUTPUTS, x); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXOUTPUTS
Definition: boxes.cpp:180

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPar ( Tree  t,
Tree x,
Tree y 
)

Definition at line 140 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

140 { return isTree(t, BOXPAR, x, y); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXPAR
Definition: boxes.cpp:138

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPatternMatcher ( Tree  s)

Definition at line 630 of file boxes.cpp.

References isTree().

Referenced by applyList(), boxpp::print(), real_a2sb(), and realeval().

631 {
632  Tree ta, ts, env, orig, rpl;
633  return isTree(s, BOXPATMATCHER, ta, ts, env, orig, rpl);
634 }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXPATMATCHER
Definition: boxes.cpp:470
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPatternMatcher ( Tree  s,
Automaton *&  a,
int &  state,
Tree env,
Tree origRules,
Tree revParamList 
)

Definition at line 636 of file boxes.cpp.

References isTree(), tree2int(), and tree2ptr().

637 {
638  Tree ta, ts;
639  if (isTree(s, BOXPATMATCHER, ta, ts, env, origRules, revParamList)) {
640  a = (Automaton*)tree2ptr(ta);
641  state = tree2int(ts);
642  return true;
643  } else {
644  return false;
645  }
646 }
int tree2int(Tree t)
if t has a node of type int, return it otherwise error
Definition: tree.cpp:230
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXPATMATCHER
Definition: boxes.cpp:470
void * tree2ptr(Tree t)
if t has a node of type ptr, return it otherwise error
Definition: tree.cpp:288
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxPatternVar ( Tree  s,
Tree id 
)

Definition at line 622 of file boxes.cpp.

References isTree().

Referenced by infereBoxType(), make_state(), preparePattern(), boxpp::print(), and realeval().

622 { return isTree(s, BOXPATVAR, id); }
Sym BOXPATVAR
Definition: boxes.cpp:471
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim0 ( Tree  s)

Definition at line 310 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

310 { Tree t; return isTree(s, BOXPRIM0, t); }
Sym BOXPRIM0
Definition: boxes.cpp:308
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim0 ( Tree  s,
prim0 p 
)

Definition at line 311 of file boxes.cpp.

References isPointer(), isTree(), and CTree::node().

311 { Tree t; return isTree(s, BOXPRIM0, t) && isPointer(t->node(),(void**)p); }
Sym BOXPRIM0
Definition: boxes.cpp:308
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
bool isPointer(const Node &n)
Definition: node.hh:216

Here is the call graph for this function:

bool isBoxPrim1 ( Tree  s)

Definition at line 315 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

315 { Tree t; return isTree(s, BOXPRIM1, t); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXPRIM1
Definition: boxes.cpp:313
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim1 ( Tree  s,
prim1 p 
)

Definition at line 316 of file boxes.cpp.

References isPointer(), isTree(), and CTree::node().

316 { Tree t; return isTree(s, BOXPRIM1, t) && isPointer(t->node(),(void**)p); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
Sym BOXPRIM1
Definition: boxes.cpp:313
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
bool isPointer(const Node &n)
Definition: node.hh:216

Here is the call graph for this function:

bool isBoxPrim2 ( Tree  s)

Definition at line 320 of file boxes.cpp.

References isTree().

Referenced by applyList(), computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

320 { Tree t; return isTree(s, BOXPRIM2, t); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXPRIM2
Definition: boxes.cpp:318

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim2 ( Tree  s,
prim2 p 
)

Definition at line 321 of file boxes.cpp.

References isPointer(), isTree(), and CTree::node().

321 { Tree t; return isTree(s, BOXPRIM2, t) && isPointer(t->node(),(void**)p); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXPRIM2
Definition: boxes.cpp:318
bool isPointer(const Node &n)
Definition: node.hh:216

Here is the call graph for this function:

bool isBoxPrim3 ( Tree  s)

Definition at line 325 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

325 { Tree t; return isTree(s, BOXPRIM3, t); }
Sym BOXPRIM3
Definition: boxes.cpp:323
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim3 ( Tree  s,
prim3 p 
)

Definition at line 326 of file boxes.cpp.

References isPointer(), isTree(), and CTree::node().

326 { Tree t; return isTree(s, BOXPRIM3, t) && isPointer(t->node(),(void**)p); }
Sym BOXPRIM3
Definition: boxes.cpp:323
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
bool isPointer(const Node &n)
Definition: node.hh:216

Here is the call graph for this function:

bool isBoxPrim4 ( Tree  s)

Definition at line 330 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

330 { Tree t; return isTree(s, BOXPRIM4, t); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXPRIM4
Definition: boxes.cpp:328
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim4 ( Tree  s,
prim4 p 
)

Definition at line 331 of file boxes.cpp.

References isPointer(), isTree(), and CTree::node().

331 { Tree t; return isTree(s, BOXPRIM4, t) && isPointer(t->node(),(void**)p); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
Sym BOXPRIM4
Definition: boxes.cpp:328
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
bool isPointer(const Node &n)
Definition: node.hh:216

Here is the call graph for this function:

bool isBoxPrim5 ( Tree  s)

Definition at line 335 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

335 { Tree t; return isTree(s, BOXPRIM5, t); }
Sym BOXPRIM5
Definition: boxes.cpp:333
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxPrim5 ( Tree  s,
prim5 p 
)

Definition at line 336 of file boxes.cpp.

References isPointer(), isTree(), and CTree::node().

336 { Tree t; return isTree(s, BOXPRIM5, t) && isPointer(t->node(),(void**)p); }
Sym BOXPRIM5
Definition: boxes.cpp:333
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
bool isPointer(const Node &n)
Definition: node.hh:216

Here is the call graph for this function:

bool isBoxReal ( Tree  t)

Definition at line 79 of file boxes.cpp.

References isDouble(), and CTree::node().

Referenced by Automaton::build(), computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxNumeric(), numericBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

79 { return isDouble(t->node()); }
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isDouble(const Node &n)
Definition: node.hh:143

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxReal ( Tree  t,
double *  r 
)

Definition at line 82 of file boxes.cpp.

References isDouble(), and CTree::node().

82 { return isDouble(t->node(), r); }
const Node & node() const
return the content of the tree
Definition: tree.hh:143
bool isDouble(const Node &n)
Definition: node.hh:143

Here is the call graph for this function:

bool isBoxRec ( Tree  t,
Tree x,
Tree y 
)

Definition at line 144 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

144 { return isTree(t, BOXREC, x, y); }
Sym BOXREC
Definition: boxes.cpp:142
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxSeq ( Tree  t,
Tree x,
Tree y 
)

Definition at line 136 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

136 { return isTree(t, BOXSEQ, x, y); }
Sym BOXSEQ
Definition: boxes.cpp:134
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxSlot ( Tree  t)

Definition at line 119 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

119 { Tree w; return isTree(t, BOXSLOT,w); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXSLOT
Definition: boxes.cpp:116
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxSlot ( Tree  t,
int *  id 
)

Definition at line 120 of file boxes.cpp.

References isInt(), isTree(), and CTree::node().

120 { Tree w; return isTree(t, BOXSLOT,w) && isInt(w->node(),id); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
const Node & node() const
return the content of the tree
Definition: tree.hh:143
Sym BOXSLOT
Definition: boxes.cpp:116
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
bool isInt(const Node &n)
Definition: node.hh:126

Here is the call graph for this function:

bool isBoxSplit ( Tree  t,
Tree x,
Tree y 
)

Definition at line 148 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

148 { return isTree(t, BOXSPLIT, x, y); }
Sym BOXSPLIT
Definition: boxes.cpp:146
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxSymbolic ( Tree  t)

Definition at line 126 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateAbstractionSchema(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

126 { Tree slot, body; return isTree(t, BOXSYMBOLIC, slot, body); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXSYMBOLIC
Definition: boxes.cpp:123
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxSymbolic ( Tree  t,
Tree slot,
Tree body 
)

Definition at line 127 of file boxes.cpp.

References isTree().

127 { return isTree(t, BOXSYMBOLIC, slot, body); }
Sym BOXSYMBOLIC
Definition: boxes.cpp:123
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxTGroup ( Tree  s)

Definition at line 449 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

449 { Tree lbl, x; return isTree(s, BOXTGROUP, lbl, x); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXTGROUP
Definition: boxes.cpp:447
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxTGroup ( Tree  s,
Tree label,
Tree x 
)

Definition at line 450 of file boxes.cpp.

References isTree().

450 { return isTree(s, BOXTGROUP, lbl, x); }
Sym BOXTGROUP
Definition: boxes.cpp:447
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxVBargraph ( Tree  s)

Definition at line 461 of file boxes.cpp.

References isTree(), max(), and min().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

461 { Tree lbl, min, max; return isTree(s, BOXVBARGRAPH, lbl, min, max); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
double max(double x, double y)
Definition: interval.hh:60
Sym BOXVBARGRAPH
Definition: boxes.cpp:459
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
double min(double x, double y)
Definition: interval.hh:59

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxVBargraph ( Tree  s,
Tree label,
Tree min,
Tree max 
)

Definition at line 462 of file boxes.cpp.

References isTree().

462 { return isTree(s, BOXVBARGRAPH, lbl, min, max); }
Sym BOXVBARGRAPH
Definition: boxes.cpp:459
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

bool isBoxVGroup ( Tree  s)

Definition at line 443 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isBoxPatternOp(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

443 { Tree lbl, x; return isTree(s, BOXVGROUP, lbl, x); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXVGROUP
Definition: boxes.cpp:441

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxVGroup ( Tree  s,
Tree label,
Tree x 
)

Definition at line 444 of file boxes.cpp.

References isTree().

444 { return isTree(s, BOXVGROUP, lbl, x); }
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Sym BOXVGROUP
Definition: boxes.cpp:441

Here is the call graph for this function:

bool isBoxVSlider ( Tree  s)

Definition at line 399 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), preparePattern(), boxpp::print(), realeval(), realPropagate(), and UserInterfaceDescription().

399 { Tree lbl, params; return isTree(s, BOXVSLIDER, lbl, params); }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXVSLIDER
Definition: boxes.cpp:396
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxVSlider ( Tree  s,
Tree label,
Tree cur,
Tree min,
Tree max,
Tree step 
)

Definition at line 401 of file boxes.cpp.

References isTree(), and nth().

402 {
403  Tree params;
404  if (isTree(s, BOXVSLIDER, lbl, params)) {
405  cur = nth(params, 0);
406  min = nth(params, 1);
407  max = nth(params, 2);
408  step= nth(params, 3);
409  return true;
410  } else {
411  return false;
412  }
413 }
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109
Sym BOXVSLIDER
Definition: boxes.cpp:396
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305
Tree nth(Tree l, int i)
Definition: list.cpp:182

Here is the call graph for this function:

bool isBoxWaveform ( Tree  t)

Definition at line 97 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), preparePattern(), boxpp::print(), real_a2sb(), realeval(), and realPropagate().

97 { return isTree(s, BOXWAVEFORM); }
Sym BOXWAVEFORM
Definition: boxes.cpp:90
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxWire ( Tree  t)

Definition at line 109 of file boxes.cpp.

References isTree().

Referenced by computeBoxComplexity(), generateInsideSchema(), infereBoxType(), insideBoxSimplification(), isPureRouting(), preparePattern(), boxpp::print(), realeval(), and realPropagate().

109 { return isTree(t, BOXWIRE); }
Sym BOXWIRE
Definition: boxes.cpp:107
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isBoxWithLocalDef ( Tree  t,
Tree body,
Tree ldef 
)

Definition at line 265 of file boxes.cpp.

References isTree().

Referenced by preparePattern(), boxpp::print(), and realeval().

265 { return isTree(t, BOXWITHLOCALDEF, body, ldef); }
Sym BOXWITHLOCALDEF
Definition: boxes.cpp:262
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isClosure ( Tree  t,
Tree abstr,
Tree genv,
Tree vis,
Tree lenv 
)

Definition at line 239 of file boxes.cpp.

References isTree().

Referenced by applyList(), boxpp::print(), real_a2sb(), realeval(), and updateClosures().

240 {
241  return isTree(t, CLOSURE, abstr, genv, vis, lenv);
242 }
Sym CLOSURE
Definition: boxes.cpp:195
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function:

bool isImportFile ( Tree  s,
Tree filename 
)

Definition at line 301 of file boxes.cpp.

References isTree().

Referenced by SourceReader::expandrec(), formatDefinitions(), and boxpp::print().

301 { return isTree(s, IMPORTFILE, filename); }
Sym IMPORTFILE
Definition: boxes.cpp:298
bool isTree(const Tree &t, const Node &n)
Definition: tree.cpp:305

Here is the call graph for this function:

Here is the caller graph for this function: