codesnippets:datastructuresfromsymboltrees
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| codesnippets:datastructuresfromsymboltrees [2021/04/13 02:44] – f2b216 | codesnippets:datastructuresfromsymboltrees [2025/10/08 00:48] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Creating data structures from symbol trees ====== | ====== Creating data structures from symbol trees ====== | ||
| - | ~~DISCUSSION~~ | ||
| * example | * example | ||
| Line 271: | Line 270: | ||
| cmbnFast :: (Builder g, Builder a) => (g -> a -> g) -> g -> [SymbolTree] -> Construction g | cmbnFast :: (Builder g, Builder a) => (g -> a -> g) -> g -> [SymbolTree] -> Construction g | ||
| cmbnFast fOp identity ltrSym = Fld.foldlM (fLOpFromSymTree fOp) identity ltrSym | cmbnFast fOp identity ltrSym = Fld.foldlM (fLOpFromSymTree fOp) identity ltrSym | ||
| + | </ | ||
| + | * compiles, error and warning free, with compiler: GHC 8.10.4, using -Wall | ||
| + | * executes, with output:< | ||
| + | Contains (Simply {rSimply = " | ||
| + | Contains (ConstDef {rsConstName = " | ||
| </ | </ | ||
| + | |||
| + | ===== ✎ ===== | ||
| + | ~~DISCUSSION~~ | ||
codesnippets/datastructuresfromsymboltrees.1618274667.txt.gz · Last modified: (external edit)