Changes in / [1dfe6a6:91571e5]
- Location:
- doc/theses/andrew_beach_MMath
- Files:
-
- 1 deleted
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/andrew_beach_MMath/existing.tex
r1dfe6a6 r91571e5 83 83 the the call site. 84 84 85 As an example, even if no function named \codeCFA{do _once} is not defined86 near the definition of \codeCFA{do _twice} the following code will work.85 As an example, even if no function named \codeCFA{do\_once} is not defined 86 near the definition of \codeCFA{do\_twice} the following code will work. 87 87 \begin{lstlisting} 88 88 int quadruple(int x) { … … 95 95 \end{lstlisting} 96 96 This is not the recommended way to implement a quadruple function but it 97 does work. The complier will deduce that \codeCFA{do _twice}'s T is an97 does work. The complier will deduce that \codeCFA{do\_twice}'s T is an 98 98 integer from the argument. It will then look for a definition matching the 99 assertion which is the \codeCFA{do _once} defined within the function. That100 function will be passed in as a function pointer to \codeCFA{do _twice} and99 assertion which is the \codeCFA{do\_once} defined within the function. That 100 function will be passed in as a function pointer to \codeCFA{do\_twice} and 101 101 called within it. 102 102 … … 156 156 In \CFA coroutines are created using the \codeCFA{coroutine} keyword which 157 157 works just like \codeCFA{struct} except that the created structure will be 158 modified by the compiler to satify the \codeCFA{is _coroutine} trait.158 modified by the compiler to satify the \codeCFA{is\_coroutine} trait. 159 159 160 160 These structures act as the interface between callers and the coroutine,
Note: See TracChangeset
for help on using the changeset viewer.