Changeset 1dc6df0 for doc/generic_types

Timestamp:

Apr 16, 2017, 9:45:31 AM (9 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

0aad606

Parents:

4635c79

Message:

additional cleanup

File:

• doc/generic_types/generic_types.tex (modified) (4 diffs)

doc/generic_types/generic_types.tex

@@ -257 +257 @@
 For example, it is possible to write a type-safe \CFA wrapper @malloc@ based on the C @malloc@:
 \begin{lstlisting}
-forall( dtype T | sized(T) ) T * malloc( void ) { return (T *)(void *)malloc( (size_t)sizeof(T) ); }
+forall( dtype T | sized(T) ) T * malloc( void ) { return (T *)malloc( sizeof(T) ); }
 int * ip = malloc();                                            $\C{// select type and size from left-hand side}$
 double * dp = malloc();
@@ -505 +505 @@
 Consider C's @div@ and @remquo@ functions, which return the quotient and remainder for a division of integer and floating-point values, respectively.
 \begin{lstlisting}
-typedef struct { int quo, rem; } div_t;
+typedef struct { int quo, rem; } div_t;         $\C{// from include stdlib.h}$
 div_t div( int num, int den );
 double remquo( double num, double den, int * quo );
@@ -759 +759 @@
 \begin{lstlisting}
 int f( [int, double], double );
-forall(otype T, otype U | { T f( T, U, U ); })
-void g( T, U );
+forall(otype T, otype U | { T f( T, U, U ); }) void g( T, U );
 g( 5, 10.21 );
 \end{lstlisting}
@@ -767 +766 @@
 Whenever a candidate's parameter structure does not exactly match the formal parameter's structure, a thunk is generated to specialize calls to the actual function:
 \begin{lstlisting}
-int _thunk( int _p0, double _p1, double _p2 ) {
-        return f( [_p0, _p1], _p2 );
-}
+int _thunk( int _p0, double _p1, double _p2 ) { return f( [_p0, _p1], _p2 ); }
 \end{lstlisting}
 so the thunk provides flattening and structuring conversions to inferred functions, improving the compatibility of tuples and polymorphism.