Changeset dbff8ec

TabularUnified INSTALL ¶

rbb336a6	rdbff8ec
40	40
41	41	$ cd ./test
42		$ make -j 8 all-~~tests~~
	42	$ make -j 8 all-local
43	43
44	44	The tests take about 2-5 minutes and can be stopped at any time.

TabularUnified doc/theses/mike_brooks_MMath/array.tex ¶

-                      rbb336a6
+                      rdbff8ec
 \label{c:Array}
 \section{Introduction}
+This chapter describes my contribution of language and library features that provide a length-checked array type, as in:
+\begin{lstlisting}
+array(float, 99) x;    // x contains 99 floats
+void f( array(float, 42) & a ) {}
+f(x);                  // statically rejected: types are different
+Arrays in C are possible the single most misunderstood and incorrectly used features in the language, resulting in the largest proportion of runtime errors and security violations.
+This chapter describes the new \CFA language and library features that introduce a length-checked array-type to the \CFA standard library~\cite{Cforall}, \eg:
+\begin{cfa}
+@array( float, 99 )@ x;                                 $\C{// x contains 99 floats}$
+void f( @array( float, 42 )@ & p ) {}   $\C{// p accepts 42 floats}$
+f( x );                                                                 $\C{// statically rejected: types are different, 99 != 42}$
 forall( T, [N] )
+void g( array(T, N) & a, int i ) {
+        T elem = a[i];     // dynamically checked: requires 0 <= i < N
+}
+g(x, 0);               // T is float, N is 99, succeeds
+g(x, 1000);            // T is float, N is 99, dynamic check fails
+\end{lstlisting}
+This example first declares @x@ a variable, whose type is an instantiation of the generic type named @array@, with arguments @float@ and @99@.
+Next, it declares @f@ as a function that expects a length-42 array; the type system rejects the call's attempt to pass @x@ to @f@, because the lengths do not match.
+Next, the @forall@ annotation on function @g@ introduces @T@ as a familiar type parameter and @N@ as a \emph{dimension} parameter, a new feature that represents a count of elements, as managed by the type system.
+Because @g@ accepts any length of array; the type system accepts the calls' passing @x@ to @g@, inferring that this length is 99.
+Just as the caller's code does not need to explain that @T@ is @float@, the safe capture and communication of the value @99@ occurs without programmer involvement.
+In the case of the second call (which passes the value 1000 for @i@), within the body of @g@, the attempt to subscript @a@ by @i@ fails with a runtime error, since $@i@ \nless @N@$.
+The type @array@, as seen above, comes from my additions to the \CFA standard library.
+It is very similar to the built-in array type, which \CFA inherits from C.
+void g( @array( T, N )@ & p, int i ) {
+        T elem = p[i];                                          $\C{// dynamically checked: requires 0 <= i < N}$
+}
+g( x, 0 );                                                              $\C{// T is float, N is 99, dynamic subscript check succeeds}$
+g( x, 1000 );                                                   $\C{// T is float, N is 99, dynamic subscript check fails}$
+\end{cfa}
+This example declares variable @x@, with generic type @array@ using arguments @float@ and @99@.
+Function @f@ is declared with an @array@ parameter of length @42@.
+The call @f( x )@ is invalid because the @array@ lengths @99@ and @42@ do not match.
+Next, function @g@ introduces a @forall@ prefix on type parameter @T@ and arbitrary \emph{dimension parameter} @N@, the new feature that represents a count of elements managed by the type system.
+The call @g( x, 0 )@ is valid because @g@ accepts any length of array, where the type system infers @float@ for @T@ and length @99@ for @N@.
+Inferring values for @T@ and @N@ is implicit without programmer involvement.
+Furthermore, the runtime subscript @x[0]@ (parameter @i@ is @0@) in @g@ is valid because @0@ is in the dimension range $[0,99)$ of argument @x@.
+The call @g( x, 1000 )@ is also valid;
+however, the runtime subscript @x[1000]@ is invalid (generates a subscript error) because @1000@ is outside the dimension range $[0,99)$ of argument @x@.
+The generic @array@ type is similar to the C array type, which \CFA inherits from C.
 Its runtime characteristics are often identical, and some features are available in both.
 \begin{lstlisting}
+For example, assume a caller can instantiates @N@ with 42 in the following (details to follow).
+\begin{cfa}
 forall( [N] )
 void declDemo() {
+        float a1[N];         // built-in type ("C array")
+        array(float, N) a2;  // type from library
+}
+\end{lstlisting}
+If a caller instantiates @N@ with 42, then both locally-declared array variables, @a1@ and @a2@, become arrays of 42 elements, each element being a @float@.
+The two variables have identical size and layout; they both encapsulate 42-float stack allocations, no heap allocations, and no further "bookkeeping" allocations/header.
+Having the @array@ library type (that of @a2@) is a tactical measure, an early implementation that offers full feature support.
+A future goal (TODO xref) is to port all of its features into the built-in array type (that of @a1@); then, the library type could be removed, and \CFA would have only one array type.
+In present state, the built-in array has partial support for the new features.
+The fully-featured library type is used exclusively in introductory examples; feature support and C compatibility are revisited in sec TODO.
+Offering the @array@ type, as a distinct alternative from the the C array, is consistent with \CFA's extension philosophy (TODO xref background) to date.
+A few compatibility-breaking changes to the behaviour of the C array were also made, both as an implementation convenience, and as justified fixes to C's lax treatment.
+The @array@ type is an opportunity to start from a clean slate and show a cohesive selection of features.
+A clean slate was an important starting point because it meant not having to deal with every inherited complexity introduced in TODO xref background-array.
+My contributions are
+\begin{itemize}
+\item a type system enhancement that lets polymorphic functions and generic types be parameterized by a numeric value: @forall( [N] )@
+        float x1[N];                            $\C{// built-in type ("C array")}$
+        array(float, N) x2;                     $\C{// type from library}$
+}
+\end{cfa}
+Both of the locally-declared array variables, @x1@ and @x2@, have 42 elements, each element being a @float@.
+The two variables have identical size and layout; they both encapsulate 42-float, stack \vs heap allocations with no additional ``bookkeeping'' allocations or headers.
+Providing this explicit generic approach required a significant extension to the \CFA type system to support a full-feature, safe, efficient (space and time) array-type, which forms the foundation for more complex array forms in \CFA.
+Admittedly, the @array@ library type (type for @x2@) is syntactically different from its C counterpart.
+A future goal (TODO xref) is to provide a built-in array type with syntax approaching C's (type for @x1@);
+then, the library @array@ type can be removed giving \CFA a largely uniform array type.
+At present, the built-in array is only partially supported, so the generic @array@ is used exclusively in the discussion;
+feature support and C compatibility are revisited in Section ? TODO.
+Offering an @array@ type, as a distinct alternative to the C array, is consistent with \CFA's goal of backwards compatibility, \ie virtually all existing C (gcc) programs can be compiled by \CFA with only a small number of changes, similar to \CC (g++).
+However, a few compatibility-breaking changes to the behaviour of the C array are necessary, both as an implementation convenience and to fix C's lax treatment of arrays.
+Hence, the @array@ type is an opportunity to start from a clean slate and show a cohesive selection of features, making it unnecessary to deal with every inherited complexity introduced by the C array TODO xref.
+My contributions are:
+\begin{enumerate}
+\item A type system enhancement that lets polymorphic functions and generic types be parameterized by a numeric value: @forall( [N] )@.
+\item Provide a length-checked array-type in the \CFA standard library, where the array's length is statically managed and dynamically valued.
+\item Provide argument/parameter passing safety for arrays and subscript safety.
 \item TODO: general parking...
 \item identify specific abilities brought by @array@
 \item Where there is a gap concerning this feature's readiness for prime-time, identification of specific workable improvements that are likely to close the gap
 \end{itemize}
+\item Identify the interesting specific abilities available by the new @array@ type.
+\item Where there is a gap concerning this feature's readiness for prime-time, identification of specific workable improvements that are likely to close the gap.
+\end{enumerate}
 …
+\section{Features Added}
+The present work adds a type @array@ to the \CFA standard library~\cite{Cforall}.
+This array's length is statically managed and dynamically valued.
+This static management achieves argument safety and suggests a path to subscript safety as future work (TODO: cross reference).
+This section presents motivating examples of the new array type's usage and follows up with definitions of the notations that appear.
+The core of the new array management is tracking all array lengths in the type system.
+Dynamically valued lengths are represented using type variables.
+The stratification of type variables preceding object declarations makes a length referenceable everywhere that it is needed.
+\section{Features added}
+This section presents motivating examples for the new array type, demonstrating the syntax and semantics of the generic @array@.
+As stated, the core capability of the new array is tracking all dimensions in the type system, where dynamic dimensions are represented using type variables.
+The definition of type variables preceding object declarations makes the array dimension lexically referenceable where it is needed.
 For example, a declaration can share one length, @N@, among a pair of parameters and the return.
 \lstinput{10-17}{hello-array.cfa}
 Here, the function @f@ does a pointwise comparison, checking if each pair of numbers is within half a percent of each other, returning the answers in a newly allocated @bool@ array.
+The array type uses the parameterized length information in its @sizeof@ determination, illustrated in the example's call to @alloc@.
+That call requests an allocation of type @array(bool, N)@, which the type system deduces from the left-hand side of the initialization, into the return type of the @alloc@ call.
+Preexisting \CFA behaviour is leveraged here, both in the return-type-only polymorphism, and the @sized(T)@-aware standard-library @alloc@ routine.
+The new @array@ type plugs into this behaviour by implementing the @sized@/@sizeof@ assertion to have the intuitive meaning.
+As a result, this design avoids an opportunity for programmer error by making the size/length communication to a called routine implicit, compared with C's @calloc@ (or the low-level \CFA analog @aalloc@), which take an explicit length parameter not managed by the type system.
+\VRef[Figure]{f:fHarness} shows the harness to use the @f@ function illustrating how dynamic values are fed into the system.
+Here, the @a@ array is loaded with decreasing values, and the @b@ array with amounts off by a constant, giving relative differences within tolerance at first and out of tolerance later.
+The program main is run with two different inputs of sequence length.
+The dynamic allocation of the @ret@ array by @alloc@ uses the parameterized dimension information in its implicit @_Alignof@ and @sizeof@ determinations, and casting the return type.
+\begin{cfa}
+static inline forall( T & | sized(T) )
+T * alloc( size_t dim ) {
+        if ( _Alignof(T) <= libAlign() ) return (T *)aalloc( dim, sizeof(T) ); // calloc without zero fill
+        else return (T *)amemalign( _Alignof(T), dim, sizeof(T) ); // array memalign
+}
+\end{cfa}
+Here, the type system deduces from the left-hand side of the assignment the type @array(bool, N)@, and forwards it as the type variable @T@ for the generic @alloc@ function, making it available in its body.
+Hence, preexisting \CFA behaviour is leveraged here, both in the return-type polymorphism, and the @sized(T)@-aware standard-library @alloc@ routine.
+This example illustrates how the new @array@ type plugs into existing \CFA behaviour by implementing necessary @sized@ assertions needed by other types.
+(@sized@ implies a concrete \vs abstract type with a compile-time size.)
+As a result, there is significant programming safety by making the size accessible and implicit, compared with C's @calloc@ and non-array supporting @memalign@, which take an explicit length parameter not managed by the type system.
 \begin{figure}
+\lstinput{30-49}{hello-array.cfa}
+\lstinput{30-43}{hello-array.cfa}
+\lstinput{45-48}{hello-array.cfa}
 \caption{\lstinline{f} Harness}
 \label{f:fHarness}
 \end{figure}
+The loops in the program main follow the more familiar pattern of using the ordinary variable @n@ to convey the length.
+The type system implicitly captures this value at the call site (@main@ calling @f@) and makes it available within the callee (@f@'s loop bound).
+The two parts of the example show @n@ adapting a variable into a type-system managed length (at @main@'s declarations of @a@, @b@, and @result@), @N@ adapting in the opposite direction (at @f@'s loop bound), and a pass-thru use of a managed length (at @f@'s declaration of @ret@).
+The @forall( ...[N] )@ participates in the user-relevant declaration of the name @N@, which becomes usable in parameter/return declarations and in the function @b@.
+The present form is chosen to parallel the existing @forall@ forms:
+\begin{cfa}
+forall( @[N]@ ) ... // array kind
+forall( & T  ) ...  // reference kind (dtype)
+forall( T  ) ...    // value kind (otype)
+\end{cfa}
+The notation @array(thing, N)@ is a single-dimensional case, giving a generic type instance.
+\VRef[Figure]{f:fHarness} shows a harness that uses the @f@ function illustrating how dynamic values are fed into the @array@ type.
+Here, the dimension of the @x@, @y@, and @result@ arrays is specified from a command-line value and these arrays are allocated on the stack.
+Then the @x@ array is initialized with decreasing values, and the @y@ array with amounts offset by constant @0.005@, giving relative differences within tolerance initially and diverging for later values.
+The program main is run (see figure bottom) with inputs @5@ and @7@ for sequence lengths.
+The loops follow the familiar pattern of using the variable @n@ to iterate through the arrays.
+Most importantly, the type system implicitly captures @n@ at the call of @f@ and makes it available throughout @f@ as @N@.
+The example shows @n@ adapting into a type-system managed length at the declarations of @x@, @y@, and @result@, @N@ adapting in the same way at @f@'s loop bound, and a pass-thru use of @n@ at @f@'s declaration of @ret@.
+Except for the lifetime-management issue of @result@, \ie explicit @free@, this program has eliminated both the syntactic and semantic problems associated with C arrays and their usage.
+These benefits cannot be underestimated.
+In general, the @forall( ..., [N] )@ participates in the user-relevant declaration of the name @N@, which becomes usable in parameter/return declarations and within a function.
+The syntactic form is chosen to parallel other @forall@ forms:
+\begin{cfa}
+forall( @[N]@ ) ...     $\C[1.5in]{// array kind}$
+forall( T & ) ...       $\C{// reference kind (dtype)}$
+forall( T ) ...         $\C{// value kind (otype)}\CRT$
+\end{cfa}
+% The notation @array(thing, N)@ is a single-dimensional case, giving a generic type instance.
 In summary:
 \begin{itemize}
 \item
 @[N]@ -- within a forall, declares the type variable @N@ to be a managed length
 \item
+$e$ -- a type representing the value of $e$ as a managed length, where $e$ is a @size_t@-typed expression
 \item
+N -- an expression of type @size_t@, whose value is the managed length @N@
 \item
 @array( thing, N0, N1, ... )@ -- a type wrapping $\prod_i N_i$ adjacent occurrences of @thing@ objects
+@[N]@ within a forall declares the type variable @N@ to be a managed length.
+\item
+The type of @N@ within code is @size_t@.
+\item
+The value of @N@ within code is the acquired length derived from the usage site, \ie generic declaration or function call.
+\item
+@array( thing, N0, N1, ... )@ is a multi-dimensional type wrapping $\prod_i N_i$ adjacent occurrences of @thing@ objects.
 \end{itemize}
+Unsigned integers have a special status in this type system.
+Unlike how C++ allows
+\VRef[Figure]{f:TemplateVsGenericType} shows @N@ is not the same as a @size_t@ declaration in a \CC \lstinline[language=C++]{template}.
+\begin{enumerate}[leftmargin=*]
+\item
+The \CC template @N@ is a compile-time value, while the \CFA @N@ is a runtime value.
+\item
+The \CC template @N@ must be passed explicitly at the call, unless @N@ has a default value, even when \CC can deduct the type of @T@.
+The \CFA @N@ is part of the array type and passed implicitly at the call.
+\item
+\CC cannot have an array of references, but can have an array of pointers.
+\CC has a (mistaken) belief that references are not objects, but pointers are objects.
+In the \CC example, the arrays fall back on C arrays, which have a duality with references with respect to automatic dereferencing.
+The \CFA array is a contiguous object with an address, which can stored as a reference or pointer.
+\item
+C/\CC arrays cannot be copied, while \CFA arrays can be copied, making them a first-class object (although array copy is often avoided for efficiency).
+\end{enumerate}
+\begin{figure}
+\begin{tabular}{@{}l@{\hspace{20pt}}l@{}}
 \begin{c++}
+template< size_t N, char * msg, typename T >... // declarations
+@template< typename T, size_t N >@
+void copy( T ret[N], T x[N] ) {
+        for ( int i = 0; i < N; i += 1 ) ret[i] = x[i];
+}
+int main() {
+        int ret[10], x[10];
+        for ( int i = 0; i < 10; i += 1 ) x[i] = i;
+        @copy<int, 10 >( ret, x );@
+        for ( int i = 0; i < 10; i += 1 )
+                cout << ret[i] << ' ';
+        cout << endl;
+}
 \end{c++}
+\CFA does not accommodate values of any user-provided type.
+TODO: discuss connection with dependent types.
+An example of a type error demonstrates argument safety.
+The running example has @f@ expecting two arrays of the same length.
+A compile-time error occurs when attempting to call @f@ with arrays whose lengths may differ.
+\begin{cfa}
+forall( [M], [N] )
+void bad( array(float, M) &a, array(float, N) &b ) {
+        f( a, a ); // ok
+        f( b, b ); // ok
+        f( a, b ); // error
+}
+\end{cfa}
+%\lstinput{60-65}{hello-array.cfa}
+As is common practice in C, the programmer is free to cast, to assert knowledge not shared with the type system.
+\begin{cfa}
+forall( [M], [N] )
+void bad_fixed( array(float, M) & a, array(float, N) & b ) {
+        if ( M == N ) {
+            f( a, (array(float, M) &)b ); // cast b to matching type
+&
+\begin{cfa}
+int main() {
+        @forall( T, [N] )@   // nested function
+        void copy( array( T, N ) & ret, array( T, N ) & x ) {
+                for ( i; 10 ) ret[i] = x[i];
+        }
+}
+\end{cfa}
+%\lstinput{70-75}{hello-array.cfa}
+Argument safety and the associated implicit communication of array length work with \CFA's generic types too.
+\CFA allows aggregate types to be generalized with multiple type parameters, including parameterized element type, so can it be defined over a parameterized length.
+Doing so gives a refinement of C's ``flexible array member'' pattern, that allows nesting structures with array members anywhere within other structures.
+\lstinput{10-16}{hello-accordion.cfa}
+This structure's layout has the starting offset of @cost_contribs@ varying in @Nclients@, and the offset of @total_cost@ varying in both generic parameters.
+For a function that operates on a @request@ structure, the type system handles this variation transparently.
+\lstinput{40-47}{hello-accordion.cfa}
+In the example, different runs of the program result in different offset values being used.
+\lstinput{60-76}{hello-accordion.cfa}
+        array( int, 10 ) ret, x;
+        for ( i; 10 ) x[i] = i;
+        @copy( ret,  x );@
+        for ( i; 10 )
+                sout | ret[i] | nonl;
+        sout | nl;
+}
+\end{cfa}
+\end{tabular}
+\caption{\CC \lstinline[language=C++]{template} \vs \CFA generic type }
+\label{f:TemplateVsGenericType}
+\end{figure}
+Continuing the discussion of \VRef[Figure]{f:fHarness}, the example has @f@ expecting two arrays of the same length.
+A compile-time error occurs when attempting to call @f@ with arrays of differing lengths.
+% removing leading whitespace
+\lstinput[tabsize=1]{52-53}{hello-array.cfa}
+\lstinput[tabsize=1,aboveskip=0pt]{62-64}{hello-array.cfa}
+As is common practice in C, the programmer is free to cast, \ie to assert knowledge not shared with the type system.
+\lstinput{70-74}{hello-array.cfa}
+Orthogonally, the new @array@ type works with \CFA's generic types, providing argument safety and the associated implicit communication of array length.
+Specifically, \CFA allows aggregate types to be generalized with multiple type parameters, including parameterized element types and lengths.
+Doing so gives a refinement of C's ``flexible array member'' pattern, allowing nesting structures with array members anywhere within other structures.
+\lstinput{10-15}{hello-accordion.cfa}
+This structure's layout has the starting offset of @municipalities@ varying in @NprovTerty@, and the offset of @total_pt@ and @total_mun@ varying in both generic parameters.
+For a function that operates on a @CanadaPop@ structure, the type system handles this variation transparently.
+\lstinput{40-45}{hello-accordion.cfa}
+\VRef[Figure]{f:checkHarness} shows program results where different offset values being used.
 The output values show that @summarize@ and its caller agree on both the offsets (where the callee starts reading @cost_contribs@ and where the callee writes @total_cost@).
+Yet the call site still says just, ``pass the request.''
+\section{Multidimensional implementation}
+Yet the call site just says, ``pass the request.''
+\begin{figure}
+\lstinput{60-68}{hello-accordion.cfa}
+\lstinput{70-72}{hello-accordion.cfa}
+\caption{\lstinline{check} Harness}
+\label{f:checkHarness}
+\end{figure}
+\section{Multidimensional Arrays}
 \label{toc:mdimpl}
+TODO: introduce multidimensional array feature and approaches
+The new \CFA standard library @array@ datatype supports multidimensional uses more richly than the C array.
+The new array's multidimensional interface and implementation, follows an array-of-arrays setup, meaning, like C's @float[n][m]@ type, one contiguous object, with coarsely-strided dimensions directly wrapping finely-strided dimensions.
+This setup is in contrast with the pattern of array of pointers to other allocations representing a sub-array.
+Beyond what C's type offers, the new array brings direct support for working with a noncontiguous array slice, allowing a program to work with dimension subscripts given in a non-physical order.
+C and C++ require a programmer with such a need to manage pointer/offset arithmetic manually.
+Examples are shown using a $5 \times 7$ float array, @a@, loaded with increments of $0.1$ when stepping across the length-7 finely-strided dimension shown on columns, and with increments of $1.0$ when stepping across the length-5 coarsely-strided dimension shown on rows.
+%\lstinput{120-126}{hello-md.cfa}
+The memory layout of @a@ has strictly increasing numbers along its 35 contiguous positions.
+% TODO: introduce multidimensional array feature and approaches
+When working with arrays, \eg linear algebra, array dimensions are referred to as ``rows'' and ``columns'' for a matrix, adding ``planes'' for a cube.
+(There is little terminology for higher dimensional arrays.)
+For example, an acrostic poem\footnote{A type of poetry where the first, last or other letters in a line spell out a particular word or phrase in a vertical column.}
+can be treated as a grid of characters, where the rows are the text and the columns are the embedded keyword(s).
+Within a poem, there is the concept of a \newterm{slice}, \eg a row is a slice for the poem text, a column is a slice for a keyword.
+In general, the dimensioning and subscripting for multidimensional arrays has two syntactic forms: @m[r,c]@ or @m[r][c]@.
+Commonly, an array, matrix, or cube, is visualized (especially in mathematics) as a contiguous row, rectangle, or block.
+This conceptualization is reenforced by subscript ordering, \eg $m_{r,c}$ for a matrix and $c_{p,r,c}$ for a cube.
+Few programming languages differ from the mathematical subscript ordering.
+However, computer memory is flat, and hence, array forms are structured in memory as appropriate for the runtime system.
+The closest representation to the conceptual visualization is for an array object to be contiguous, and the language structures this memory using pointer arithmetic to access the values using various subscripts.
+This approach still has degrees of layout freedom, such as row or column major order, \ie juxtaposed rows or columns in memory, even when the subscript order remains fixed.
+For example, programming languages like MATLAB, Fortran, Julia and R store matrices in column-major order since they are commonly used for processing column-vectors in tabular data sets but retain row-major subscripting.
+In general, storage layout is hidden by subscripting, and only appears when passing arrays among different programming languages or accessing specific hardware.
+\VRef[Figure]{f:FixedVariable} shows two C90 approaches for manipulating contiguous arrays.
+Note, C90 does not support VLAs.
+The fixed-dimension approach uses the type system;
+however, it requires all dimensions except the first to be specified at compile time, \eg @m[][6]@, allowing all subscripting stride calculations to be generated with constants.
+Hence, every matrix passed to @fp1@ must have exactly 6 columns but the row size can vary.
+The variable-dimension approach ignores (violates) the type system, \ie argument and parameters types do not match, and manually performs pointer arithmetic for subscripting in the macro @sub@.
+\begin{figure}
+\begin{tabular}{@{}l@{\hspace{40pt}}l@{}}
+\multicolumn{1}{c}{\textbf{Fixed Dimension}} & \multicolumn{1}{c}{\textbf{Variable Dimension}} \\
+\begin{cfa}
+void fp1( int rows, int m[][@6@] ) {
+        ...  printf( "%d ", @m[r][c]@ );  ...
+}
+int fm1[4][@6@], fm2[6][@6@]; // no VLA
+// initialize matrixes
+fp1( 4, fm1 ); // implicit 6 columns
+fp1( 6, fm2 );
+\end{cfa}
+&
+\begin{cfa}
+#define sub( m, r, c ) *(m + r * sizeof( m[0] ) + c)
+void fp2( int rows, int cols, int *m ) {
+        ...  printf( "%d ", @sub( m, r, c )@ );  ...
+}
+int vm1[4][4], vm2[6][8]; // no VLA
+// initialize matrixes
+fp2( 4, 4, vm1 );
+fp2( 6, 8, vm2 );
+\end{cfa}
+\end{tabular}
+\caption{C90 Fixed \vs Variable Contiguous Matrix Styles}
+\label{f:FixedVariable}
+\end{figure}
+Many languages allow multidimensional arrays-of-arrays, \eg in Pascal or \CC.
+\begin{cquote}
+\begin{tabular}{@{}ll@{}}
+\begin{pascal}
+var m : array[0..4, 0..4] of Integer;  (* matrix *)
+type AT = array[0..4] of Integer;  (* array type *)
+type MT = array[0..4] of AT;  (* array of array type *)
+var aa : MT;  (* array of array variable *)
+m@[1][2]@ := 1;   aa@[1][2]@ := 1 (* same subscripting *)
+\end{pascal}
+&
+\begin{c++}
+int m[5][5];
+typedef vector< vector<int> > MT;
+MT vm( 5, vector<int>( 5 ) );
+m@[1][2]@ = 1;  aa@[1][2]@ = 1;
+\end{c++}
+\end{tabular}
+\end{cquote}
+The language decides if the matrix and array-of-array are laid out the same or differently.
+For example, an array-of-array may be an array of row pointers to arrays of columns, so the rows may not be contiguous in memory nor even the same length (triangular matrix).
+Regardless, there is usually a uniform subscripting syntax masking the memory layout, even though the two array forms could be differentiated at the subscript level, \eg @m[1,2]@ \vs @aa[1][2]@.
+Nevertheless, controlling memory layout can make a difference in what operations are allowed and in performance (caching/NUMA effects).
+C also provides non-contiguous arrays-of-arrays.
+\begin{cfa}
+int m[5][5];                                                    $\C{// contiguous}$
+int * aa[5];                                                    $\C{// non-contiguous}$
+\end{cfa}
+both with different memory layout using the same subscripting, and both with different degrees of issues.
+The focus of this work is on the contiguous multidimensional arrays in C.
+The reason is that programmers are often forced to use the more complex array-of-array form when a contiguous array would be simpler, faster, and safer.
+Nevertheless, the C array-of-array form continues to be useful for special circumstances.
+\VRef[Figure]{f:ContiguousNon-contiguous} shows the extensions made in C99 for manipulating contiguous \vs non-contiguous arrays.\footnote{C90 also supported non-contiguous arrays.}
+First, VLAs are supported.
+Second, for contiguous arrays, C99 conjoins one or more of the parameters as a downstream dimension(s), \eg @cols@, implicitly using this parameter to compute the row stride of @m@.
+If the declaration of @fc@ is changed to:
+\begin{cfa}
+void fc( int rows, int cols, int m[@rows@][@cols@] ) ...
+\end{cfa}
+it is possible for C to perform bound checking across all subscripting, but it does not.
+While this contiguous-array capability is a step forward, it is still the programmer's responsibility to manually manage the number of dimensions and their sizes, both at the function definition and call sites.
+That is, the array does not automatically carry its structure and sizes for use in computing subscripts.
+While the non-contiguous style in @faa@ looks very similar to @fc@, the compiler only understands the unknown-sized array of row pointers, and it relies on the programmer to traverse the columns in a row correctly.
+Specifically, there is no requirement that the rows are the same length, like a poem with different length lines.
+\begin{figure}
+\begin{tabular}{@{}ll@{}}
+\multicolumn{1}{c}{\textbf{Contiguous}} & \multicolumn{1}{c}{\textbf{ Non-contiguous}} \\
+\begin{cfa}
+void fc( int rows, @int cols@, int m[ /* rows */ ][@cols@] ) {
+        ...  printf( "%d ", @m[r][c]@ );  ...
+}
+int m@[5][5]@;
+for ( int r = 0; r < 5; r += 1 ) {
+        for ( int c = 0; c < 5; c += 1 )
+                m[r][c] = r + c;
+}
+fc( 5, 5, m );
+\end{cfa}
+&
+\begin{cfa}
+void faa( int rows, int cols, int * m[ @/* cols */@ ] ) {
+        ...  printf( "%d ", @m[r][c]@ );  ...
+}
+int @* aa[5]@;  // row pointers
+for ( int r = 0; r < 5; r += 1 ) {
+        @aa[r] = malloc( 5 * sizeof(int) );@ // create rows
+        for ( int c = 0; c < 5; c += 1 )
+                aa[r][c] = r + c;
+}
+faa( 5, 5, aa );
+\end{cfa}
+\end{tabular}
+\caption{C99 Contiguous \vs Non-contiguous Matrix Styles}
+\label{f:ContiguousNon-contiguous}
+\end{figure}
+\subsection{Multidimensional array implementation}
+A multidimensional array implementation has three relevant levels of abstraction, from highest to lowest, where the array occupies \emph{contiguous memory}.
+\begin{enumerate}
+\item
+Flexible-stride memory:
+this model has complete independence between subscripting ordering and memory layout, offering the ability to slice by (provide an index for) any dimension, \eg slice a plane, row, or column, \eg @c[3][*][*]@, @c[3][4][*]@, @c[3][*][5]@.
+\item
+Fixed-stride memory:
+this model binds the first subscript and the first memory layout dimension, offering the ability to slice by (provide an index for) only the coarsest dimension, @m[row][*]@ or @c[plane][*][*]@, \eg slice only by row (2D) or plane (3D).
+After which, subscripting and memory layout are independent.
+\item
+Explicit-displacement memory:
+this model has no awareness of dimensions just the ability to access memory at a distance from a reference point (base-displacement addressing), \eg @x + 23@ or @x[23}@ $\Rightarrow$ 23rd element from the start of @x@.
+A programmer must manually build any notion of dimensions using other tools;
+hence, this style is not offering multidimensional arrays \see{\VRef[Figure]{f:FixedVariable}}.
+\end{enumerate}
+There is some debate as to whether the abstraction ordering goes $\{1, 2\} < 3$, rather than my numerically-ordering.
+That is, styles 1 and 2 are at the same abstraction level, with 3 offering a limited set of functionality.
+I chose to build the \CFA style-1 array upon a style-2 abstraction.
+(Justification of the decision follows, after the description of the design.)
+Style 3 is the inevitable target of any array implementation.
+The hardware offers this model to the C compiler, with bytes as the unit of displacement.
+C offers this model to its programmer as pointer arithmetic, with arbitrary sizes as the unit.
+Casting a multidimensional array as a single-dimensional array/pointer, then using @x[i]@ syntax to access its elements, is still a form of pointer arithmetic.
+Now stepping into the implementation of \CFA's new type-1 multidimensional arrays in terms of C's existing type-2 multidimensional arrays, it helps to clarify that even the interface is quite low-level.
+A C/\CFA array interface includes the resulting memory layout.
+The defining requirement of a type-2 system is the ability to slice a column from a column-finest matrix.
+The required memory shape of such a slice is set, before any discussion of implementation.
+The implementation presented here is how the \CFA array library wrangles the C type system, to make it do memory steps that are consistent with this layout.
+TODO: do I have/need a presentation of just this layout, just the semantics of -[all]?
+The new \CFA standard library @array@ datatype supports richer multidimensional features than C.
+The new array implementation follows C's contiguous approach, \ie @float [r][c]@, with one contiguous object subscripted by coarsely-strided dimensions directly wrapping finely-strided dimensions.
+Beyond what C's array type offers, the new array brings direct support for working with a noncontiguous array slice, allowing a program to work with dimension subscripts given in a non-physical order.
+The following examples use an @array( float, 5, 7) m@, loaded with values incremented by $0.1$, when stepping across the length-7 finely-strided column dimension, and stepping across the length-5 coarsely-strided row dimension.
+\par\noindent
+\mbox{\lstinput{121-126}{hello-md.cfa}}
+\par\noindent
+The memory layout is 35 contiguous elements with strictly increasing addresses.
 A trivial form of slicing extracts a contiguous inner array, within an array-of-arrays.
+Like with the C array, a lesser-dimensional array reference can be bound to the result of subscripting a greater-dimensional array, by a prefix of its dimensions.
+This action first subscripts away the most coarsely strided dimensions, leaving a result that expects to be be subscripted by the more finely strided dimensions.
+\lstinput{60-66}{hello-md.cfa}
+As for the C array, a lesser-dimensional array reference can be bound to the result of subscripting a greater-dimensional array by a prefix of its dimensions, \eg @m[2]@, giving the third row.
+This action first subscripts away the most coarsely strided dimensions, leaving a result that expects to be subscripted by the more finely strided dimensions, \eg @m[2][3]@, giving the value @2.3@.
+The following is an example slicing a row.
+\lstinput{60-64}{hello-md.cfa}
 \lstinput[aboveskip=0pt]{140-140}{hello-md.cfa}
+This function declaration is asserting too much knowledge about its parameter @c@, for it to be usable for printing either a row slice or a column slice.
+Specifically, declaring the parameter @c@ with type @array@ means that @c@ is contiguous.
+However, the function does not use this fact.
+For the function to do its job, @c@ need only be of a container type that offers a subscript operator (of type @ptrdiff_t@ $\rightarrow$ @float@), with managed length @N@.
+However, function @print1d@ is asserting too much knowledge about its parameter @r@ for printing either a row slice or a column slice.
+Specifically, declaring the parameter @r@ with type @array@ means that @r@ is contiguous, which is unnecessarily restrictive.
+That is, @r@ need only be of a container type that offers a subscript operator (of type @ptrdiff_t@ $\rightarrow$ @float@) with managed length @N@.
 The new-array library provides the trait @ix@, so-defined.
 With it, the original declaration can be generalized, while still implemented with the same body, to the latter declaration:
 \lstinput{40-44}{hello-md.cfa}
+With it, the original declaration can be generalized with the same body.
+\lstinput{43-44}{hello-md.cfa}
 \lstinput[aboveskip=0pt]{145-145}{hello-md.cfa}
+Nontrivial slicing, in this example, means passing a noncontiguous slice to @print1d@.
+The new-array library provides a ``subscript by all'' operation for this purpose.
+In a multi-dimensional subscript operation, any dimension given as @all@ is left ``not yet subscripted by a value,'' implementing the @ix@ trait, waiting for such a value.
+The nontrivial slicing in this example now allows passing a \emph{noncontiguous} slice to @print1d@, where the new-array library provides a ``subscript by all'' operation for this purpose.
+In a multi-dimensional subscript operation, any dimension given as @all@ is a placeholder, \ie ``not yet subscripted by a value'', waiting for such a value, implementing the @ix@ trait.
 \lstinput{150-151}{hello-md.cfa}
 The example has shown that @a[2]@ and @a[[2, all]]@ both refer to the same, ``2.*'' slice.
 Indeed, the various @print1d@ calls under discussion access the entry with value 2.3 as @a[2][3]@, @a[[2,all]][3]@, and @a[[all,3]][2]@.
 This design preserves (and extends) C array semantics by defining @a[[i,j]]@ to be @a[i][j]@ for numeric subscripts, but also for ``subscripting by all''.
+The example shows @x[2]@ and @x[[2, all]]@ both refer to the same, ``2.*'' slice.
+Indeed, the various @print1d@ calls under discussion access the entry with value @2.3@ as @x[2][3]@, @x[[2,all]][3]@, and @x[[all,3]][2]@.
+This design preserves (and extends) C array semantics by defining @x[[i,j]]@ to be @x[i][j]@ for numeric subscripts, but also for ``subscripting by all''.
 That is:
 \begin{tabular}{cccccl}
 @a[[2,all]][3]@  &  $=$  &  @a[2][all][3]@  & $=$  &  @a[2][3]@  & (here, @all@ is redundant)  \\
 @a[[all,3]][2]@  &  $=$  &  @a[all][3][2]@  & $=$  &  @a[2][3]@  & (here, @all@ is effective)
+\begin{cquote}
+\begin{tabular}{@{}cccccl@{}}
+@x[[2,all]][3]@ & $\equiv$      & @x[2][all][3]@  & $\equiv$    & @x[2][3]@  & (here, @all@ is redundant)  \\
+@x[[all,3]][2]@ & $\equiv$      & @x[all][3][2]@  & $\equiv$    & @x[2][3]@  & (here, @all@ is effective)
 \end{tabular}
+Narrating progress through each of the @-[-][-][-]@ expressions gives, firstly, a definition of @-[all]@, and secondly, a generalization of C's @-[i]@.
+\noindent Where @all@ is redundant:
+\begin{tabular}{ll}
+@a@  & 2-dimensional, want subscripts for coarse then fine \\
+@a[2]@  & 1-dimensional, want subscript for fine; lock coarse = 2 \\
+@a[2][all]@  & 1-dimensional, want subscript for fine \\
+@a[2][all][3]@  & 0-dimensional; lock fine = 3
+\end{cquote}
+Narrating progress through each of the @-[-][-][-]@\footnote{
+The first ``\lstinline{-}'' is a variable expression and the remaining ``\lstinline{-}'' are subscript expressions.}
+expressions gives, firstly, a definition of @-[all]@, and secondly, a generalization of C's @-[i]@.
+Where @all@ is redundant:
+\begin{cquote}
+\begin{tabular}{@{}ll@{}}
+@x@  & 2-dimensional, want subscripts for coarse then fine \\
+@x[2]@  & 1-dimensional, want subscript for fine; lock coarse == 2 \\
+@x[2][all]@  & 1-dimensional, want subscript for fine \\
+@x[2][all][3]@  & 0-dimensional; lock fine == 3
 \end{tabular}
 \noindent Where @all@ is effective:
 \begin{tabular}{ll}
 @a@  & 2-dimensional, want subscripts for coarse then fine \\
 @a[all]@  & 2-dimensional, want subscripts for fine then coarse \\
 @a[all][3]@  & 1-dimensional, want subscript for coarse; lock fine = 3 \\
 @a[all][3][2]@  & 0-dimensional; lock coarse = 2
+\end{cquote}
+Where @all@ is effective:
+\begin{cquote}
+\begin{tabular}{@{}ll@{}}
+@x@  & 2-dimensional, want subscripts for coarse then fine \\
+@x[all]@  & 2-dimensional, want subscripts for fine then coarse \\
+@x[all][3]@  & 1-dimensional, want subscript for coarse; lock fine == 3 \\
+@x[all][3][2]@  & 0-dimensional; lock coarse == 2
 \end{tabular}
+\end{cquote}
 The semantics of @-[all]@ is to dequeue from the front of the ``want subscripts'' list and re-enqueue at its back.
+For example, in a two dimensional matrix, this semantics conceptually transposes the matrix by reversing the subscripts.
 The semantics of @-[i]@ is to dequeue from the front of the ``want subscripts'' list and lock its value to be @i@.
+Contiguous arrays, and slices of them, are all realized by the same underlying parameterized type.
+It includes stride information in its metatdata.
+The @-[all]@ operation is a conversion from a reference to one instantiation, to a reference to another instantiation.
+Contiguous arrays, and slices of them, are all represented by the same underlying parameterized type, which includes stride information in its metatdata.
+\PAB{Do not understand this sentence: The \lstinline{-[all]} operation is a conversion from a reference to one instantiation to a reference to another instantiation.}
 The running example's @all@-effective step, stated more concretely, is:
 \begin{tabular}{ll}
 @a@       & : 5 of ( 7 of float each spaced 1 float apart ) each spaced 7 floats apart \\
 @a[all]@  & : 7 of ( 5 of float each spaced 7 floats apart ) each spaced 1 float apart
+\begin{cquote}
+\begin{tabular}{@{}ll@{}}
+@x@       & : 5 of ( 7 of @float@ each spaced 1 @float@ apart ) each spaced 7 @floats@ apart \\
+@x[all]@  & : 7 of ( 5 of @float@ each spaced 7 @float@s apart ) each spaced 1 @float@ apart
 \end{tabular}
+\end{cquote}
 \begin{figure}
 \includegraphics{measuring-like-layout}
+\caption{Visualization of subscripting, by numeric value, and by \lstinline[language=CFA]{all}.
+        Here \lstinline[language=CFA]{x} has type \lstinline[language=CFA]{array( float, 5, 7 )}, understood as 5 rows by 7 columns.
+        The horizontal layout represents contiguous memory addresses while the vertical layout uses artistic license.
+        The vertical shaded band highlights the location of the targeted element, 2.3.
+        Any such vertical contains various interpretations of a single address.}
+\caption{Visualization of subscripting by value and by \lstinline[language=CFA]{all}, for \lstinline{x} of type \lstinline{array( float, 5, 7 )} understood as 5 rows by 7 columns.
+The horizontal layout represents contiguous memory addresses while the vertical layout is conceptual.
+The vertical shaded band highlights the location of the targeted element, 2.3.
+Any such vertical slice contains various interpretations of a single address.}
 \label{fig:subscr-all}
 \end{figure}
-\noindent BEGIN: Paste looking for a home
-The world of multidimensional array implementation has, or abuts, four relevant levels of abstraction, highest to lowest:
-, purpose:
-If you are doing linear algebra, you might call its dimensions, "column" and "row."
-If you are treating an acrostic poem as a grid of characters, you might say,
-the direction of reading the phrases vs the direction of reading the keyword.
-, flexible-stride memory:
-assuming, from here on, a need to see/use contiguous memory,
-this model offers the ability to slice by (provide an index for) any dimension
-, fixed-stride memory:
-this model offers the ability to slice by (provide an index for) only the coarsest dimension
-, explicit-displacement memory:
-no awareness of dimensions, so no distinguishing them; just the ability to access memory at a distance from a reference point
-C offers style-3 arrays.  Fortran, Matlab and APL offer style-2 arrays.
-Offering style-2 implies offering style-3 as a sub-case.
-My CFA arrays are style-2.
-Some debate is reasonable as to whether the abstraction actually goes $ 1 < \{2, 3\} < 4 $,
-rather than my numerically-ordered chain.
-According to the diamond view, styles 2 and 3 are at the same abstraction level, just with 3 offering a more limited set of functionality.
-The chain view reflects the design decision I made in my mission to offer a style-2 abstraction;
-I chose to build it upon a style-3 abstraction.
-(Justification of the decision follows, after the description of the design.)
-The following discussion first dispenses with API styles 1 and 4, then elaborates on my work with styles 2 and 3.
-Style 1 is not a concern of array implementations.
-It concerns documentation and identifier choices of the purpose-specific API.
-If one is offering a matrix-multiply function, one must specify which dimension(s) is/are being summed over
-(or rely on the familiar convention of these being the first argument's rows and second argument's columns).
-Some libraries offer a style-1 abstraction that is not directly backed by a single array
-(e.g. make quadrants contiguous, as may help cache coherence during a parallel matrix multiply),
-but such designs are out of scope for a discussion on arrays; they are applications of several arrays.
-I typically include style-1 language with examples to help guide intuition.
-It is often said that C has row-major arrays while Fortran has column-major arrays.
-This comparison brings an unhelpful pollution of style-1 thinking into issues of array implementation.
-Unfortunately, ``-major'' has two senses: the program's order of presenting indices and the array's layout in memory.
-(The program's order could be either lexical, as in @x[1,2,3]@ subscripting, or runtime, as in the @x[1][2][3]@ version.)
-Style 2 is concerned with introducing a nontrivial relationship between program order and memory order,
-while style 3 sees program order identical with memory order.
-Both C and (the style-3 subset of) Fortran actually use the same relationship here:
-an earlier subscript in program order controls coarser steps in memory.
-The job of a layer-2/3 system is to implement program-ordered subscripting according to a defined memory layout.
-C and Fortran do not use opposite orders in doing this job.
-Fortran is only ``backward'' in its layer-1 conventions for reading/writing and linear algebra.
-Fortran subscripts as $m(c,r)$.  When I use style-1 language, I am following the C/mathematical convention of $m(r,c)$.
-Style 4 is the inevitable target of any array implementation.
-The hardware offers this model to the C compiler, with bytes as the unit of displacement.
-C offers this model to its programmer as pointer arithmetic, with arbitrary sizes as the unit.
-I consider casting a multidimensional array as a single-dimensional array/pointer,
-then using @x[i]@ syntax to access its elements, to be a form of pointer arithmetic.
-But style 4 is not offering arrays.
-Now stepping into the implementation
-of CFA's new type-3 multidimensional arrays in terms of C's existing type-2 multidimensional arrays,
-it helps to clarify that even the interface is quite low-level.
-A C/CFA array interface includes the resulting memory layout.
-The defining requirement of a type-3 system is the ability to slice a column from a column-finest matrix.
-The required memory shape of such a slice is set, before any discussion of implementation.
-The implementation presented here is how the CFA array library wrangles the C type system,
-to make it do memory steps that are consistent with this layout.
-TODO: do I have/need a presentation of just this layout, just the semantics of -[all]?
 Figure~\ref{fig:subscr-all} shows one element (in the shaded band) accessed two different ways: as @x[2][3]@ and as @x[all][3][2]@.
 …
 The subscript operator presents what's really inside, by casting to the type below the wedge of lie.
 %  Does x[all] have to lie too?  The picture currently glosses over how it it advertizes a size of 7 floats.  I'm leaving that as an edge case benignly misrepresented in the picture.  Edge cases only have to be handled right in the code.
+%  Does x[all] have to lie too?  The picture currently glosses over how it it advertises a size of 7 floats.  I'm leaving that as an edge case benignly misrepresented in the picture.  Edge cases only have to be handled right in the code.
 Casting, overlapping and lying are unsafe.
 …
 The @arpk@ structure and its @-[i]@ operator are thus defined as:
+\begin{lstlisting}
+forall( ztype(N),               // length of current dimension
+        dtype(S) | sized(S),    // masquerading-as
+        dtype E_im,             // immediate element, often another array
+        dtype E_base            // base element, e.g. float, never array
+ ) {
+struct arpk {
+        S strides[N];           // so that sizeof(this) is N of S
+};
+// expose E_im, stride by S
+E_im & ?[?]( arpk(N, S, E_im, E_base) & a, ptrdiff_t i ) {
+        return (E_im &) a.strides[i];
+}
+}
+\end{lstlisting}
+\begin{cfa}
+forall( ztype(N),                       $\C{// length of current dimension}$
+        dtype(S) | sized(S),    $\C{// masquerading-as}$
+        dtype E_im,                             $\C{// immediate element, often another array}$
+        dtype E_base                    $\C{// base element, e.g. float, never array}$
+) { // distribute forall to each element
+        struct arpk {
+                S strides[N];           $\C{// so that sizeof(this) is N of S}$
+        };
+        // expose E_im, stride by S
+        E_im & ?[?]( arpk(N, S, E_im, E_base) & a, ptrdiff_t i ) {
+                return (E_im &) a.strides[i];
+        }
+}
+\end{cfa}
 An instantiation of the @arpk@ generic is given by the @array(E_base, N0, N1, ...)@ expansion, which is @arpk( N0, Rec, Rec, E_base )@, where @Rec@ is @array(E_base, N1, ...)@.
 …
 \begin{tabular}{rl}
 C      &  @void f( size_t n, size_t m, float a[n][m] );@ \\
+C      &  @void f( size_t n, size_t m, float x[n][m] );@ \\
 Java   &  @void f( float[][] a );@
 \end{tabular}
 Java's safety against undefined behaviour assures the callee that, if @a@ is non-null, then @a.length@ is a valid access (say, evaluating to the number $\ell$) and if @i@ is in $[0, \ell)$ then @a[i]@ is a valid access.
+Java's safety against undefined behaviour assures the callee that, if @x@ is non-null, then @a.length@ is a valid access (say, evaluating to the number $\ell$) and if @i@ is in $[0, \ell)$ then @x[i]@ is a valid access.
 If a value of @i@ outside this range is used, a runtime error is guaranteed.
 In these respects, C offers no guarantees at all.
 Notably, the suggestion that @n@ is the intended size of the first dimension of @a@ is documentation only.
 Indeed, many might prefer the technically equivalent declarations @float a[][m]@ or @float (*a)[m]@ as emphasizing the ``no guarantees'' nature of an infrequently used language feature, over using the opportunity to explain a programmer intention.
 Moreover, even if @a[0][0]@ is valid for the purpose intended, C's basic infamous feature is the possibility of an @i@, such that @a[i][0]@ is not valid for the same purpose, and yet, its evaluation does not produce an error.
+Notably, the suggestion that @n@ is the intended size of the first dimension of @x@ is documentation only.
+Indeed, many might prefer the technically equivalent declarations @float x[][m]@ or @float (*a)[m]@ as emphasizing the ``no guarantees'' nature of an infrequently used language feature, over using the opportunity to explain a programmer intention.
+Moreover, even if @x[0][0]@ is valid for the purpose intended, C's basic infamous feature is the possibility of an @i@, such that @x[i][0]@ is not valid for the same purpose, and yet, its evaluation does not produce an error.
 Java's lack of expressiveness for more applied properties means these outcomes are possible:
 \begin{itemize}
 \item @a[0][17]@ and @a[2][17]@ are valid accesses, yet @a[1][17]@ is a runtime error, because @a[1]@ is a null pointer
 \item the same observation, now because @a[1]@ refers to an array of length 5
 \item execution times vary, because the @float@ values within @a@ are sometimes stored nearly contiguously, and other times, not at all
+\item @x[0][17]@ and @x[2][17]@ are valid accesses, yet @x[1][17]@ is a runtime error, because @x[1]@ is a null pointer
+\item the same observation, now because @x[1]@ refers to an array of length 5
+\item execution times vary, because the @float@ values within @x@ are sometimes stored nearly contiguously, and other times, not at all
 \end{itemize}
 C's array has none of these limitations, nor do any of the ``array language'' comparators discussed in this section.
 This Java level of safety and expressiveness is also exemplified in the C family, with the commonly given advice [TODO:cite example], for C++ programmers to use @std::vector@ in place of the C++ language's array, which is essentially the C array.
 The advice is that, while a vector is also more powerful (and quirky) than an array, its capabilities include options to preallocate with an upfront size, to use an available bound-checked accessor (@a.at(i)@ in place of @a[i]@), to avoid using @push_back@, and to use a vector of vectors.
+The advice is that, while a vector is also more powerful (and quirky) than an array, its capabilities include options to preallocate with an upfront size, to use an available bound-checked accessor (@a.at(i)@ in place of @x[i]@), to avoid using @push_back@, and to use a vector of vectors.
 Used with these restrictions, out-of-bound accesses are stopped, and in-bound accesses never exercise the vector's ability to grow, which is to say, they never make the program slow to reallocate and copy, and they never invalidate the program's other references to the contained values.
 Allowing this scheme the same referential integrity assumption that \CFA enjoys [TODO:xref], this scheme matches Java's safety and expressiveness exactly.
 …
 Futhark restricts these expressions syntactically to variables and constants, while a full-strength dependent system does not.
 CFA's hybrid presentation, @forall( [N] )@, has @N@ belonging to the type system, yet has no instances.
+\CFA's hybrid presentation, @forall( [N] )@, has @N@ belonging to the type system, yet has no instances.
 Belonging to the type system means it is inferred at a call site and communicated implicitly, like in Dex and unlike in Futhark.
 Having no instances means there is no type for a variable @i@ that constrains @i@ to be in the range for @N@, unlike Dex, [TODO: verify], but like Futhark.
 …
 \section{Future Work}
+\section{Future work}
 \subsection{Declaration syntax}
 …
 I will not discuss the core of this project, which has a tall mission already, to improve type safety, maintain appropriate C compatibility and offer more flexibility about storage use.
 It also has a candidate stretch goal, to adapt \CFA's @forall@ generic system to communicate generalized enumerations:
 \begin{lstlisting}
+\begin{cfa}
 forall( T | is_enum(T) )
 void show_in_context( T val ) {
 …
 enum weekday { mon, tue, wed = 500, thu, fri };
 show_in_context( wed );
 \end{lstlisting}
+\end{cfa}
 with output
 \begin{lstlisting}
+\begin{cfa}
 mon
 tue < ready
 …
 thu
 fri
 \end{lstlisting}
+\end{cfa}
 The details in this presentation aren't meant to be taken too precisely as suggestions for how it should look in \CFA.
 But the example shows these abilities:
 …
 The structural assumptions required for the domain of an array in Dex are given by the trait (there, ``interface'') @Ix@, which says that the parameter @n@ is a type (which could take an argument like @weekday@) that provides two-way conversion with the integers and a report on the number of values.
 Dex's @Ix@ is analogous the @is_enum@ proposed for \CFA above.
 \begin{lstlisting}
+\begin{cfa}
 interface Ix n
  get_size n : Unit -> Int
  ordinal : n -> Int
  unsafe_from_ordinal n : Int -> n
 \end{lstlisting}
+get_size n : Unit -> Int
+ordinal : n -> Int
+unsafe_from_ordinal n : Int -> n
+\end{cfa}
 Dex uses this foundation of a trait (as an array type's domain) to achieve polymorphism over shapes.
 …
 In the photograph instantiation, it's the tuple-type of $ \langle \mathrm{img\_wd}, \mathrm{img\_ht} \rangle $.
 This use of a tuple-as-index is made possible by the built-in rule for implementing @Ix@ on a pair, given @Ix@ implementations for its elements
 \begin{lstlisting}
+\begin{cfa}
 instance {a b} [Ix a, Ix b] Ix (a & b)
  get_size = \(). size a * size b
  ordinal = \(i, j). (ordinal i * size b) + ordinal j
  unsafe_from_ordinal = \o.
+get_size = \(). size a * size b
+ordinal = \(i, j). (ordinal i * size b) + ordinal j
+unsafe_from_ordinal = \o.
 bs = size b
 (unsafe_from_ordinal a (idiv o bs), unsafe_from_ordinal b (rem o bs))
 \end{lstlisting}
+\end{cfa}
 and by a user-provided adapter expression at the call site that shows how to indexing with a tuple is backed by indexing each dimension at a time
 \begin{lstlisting}
+\begin{cfa}
 img_trans :: (img_wd,img_ht)=>Real
 img_trans.(i,j) = img.i.j
 result = pairwise img_trans
 \end{lstlisting}
+\end{cfa}
 [TODO: cite as simplification of example from https://openreview.net/pdf?id=rJxd7vsWPS section 4]
 …
 void * malloc( size_t );
 // C, user
 struct tm * el1 = malloc(      sizeof(struct tm) );
+struct tm * el1 = malloc( sizeof(struct tm) );
 struct tm * ar1 = malloc( 10 * sizeof(struct tm) );

TabularUnified doc/theses/mike_brooks_MMath/background.tex ¶

-                      rbb336a6
+                      rdbff8ec
 \section{Reading Declarations}
+\section{Reading declarations}
 A significant area of confusion for reading C declarations results from embedding a declared variable in a declaration, mimicking the way the variable is used in executable statements.
 …
 \subsection{Multi-Dimensional}
+\subsection{Multi-dimensional}
 As in the last section, multi-dimensional array declarations are examined.
 …
 \subsection{Design Issues}
+\subsection{Design issues}
 \label{toc:lst:issue}
 …
 \subsection{Preexisting Linked-List Libraries}
+\subsection{Preexisting linked-list libraries}
 Two preexisting linked-list libraries are used throughout, to show examples of the concepts being defined,
 …
 \subsection{Link attachment: Intrusive vs.\ Wrapped}
+\subsection{Link attachment: intrusive vs.\ wrapped}
 \label{toc:lst:issue:attach}
 …
 \subsection{Simultaneity: Single vs.\ Multi-Static vs.\ Dynamic}
+\subsection{Simultaneity: single vs.\ multi-static vs.\ dynamic}
 \label{toc:lst:issue:simultaneity}
 …
 \subsection{User integration: Preprocessed vs.\ Type-System Mediated}
+\subsection{User integration: preprocessed vs.\ type-system mediated}
 % example of poor error message due to LQ's preprocessed integration
 …
 \subsection{List identity: Headed vs.\ Ad-hoc}
+\subsection{List identity: headed vs.\ ad-hoc}
 \label{toc:lst:issue:ident}
 …
 \subsection{End treatment: Cased vs.\ Uniform }
+\subsection{End treatment: cased vs.\ uniform }
 This issue is implementation-level, relevant to achieving high performance.

TabularUnified doc/theses/mike_brooks_MMath/conclusion.tex ¶

rbb336a6	rdbff8ec
7	7	\section{Strings}
8	8
9		\section{Future Work}
	9	\section{Future work}

TabularUnified doc/theses/mike_brooks_MMath/intro.tex ¶

-                      rbb336a6
+                      rdbff8ec
 \section{Linked List}
+\section{Linked list}
 A linked-list provides a homogeneous container often with $O(log N)$/$O(N)$ access to elements using successor and predecessor operations.
 …
 \subsection{Ill-Typed Expressions}
+\subsection{Ill-typed expressions}
 C reports many ill-typed expressions as warnings.
 …
 \section{Contributions}
 \subsection{Linked List}
+\subsection{Linked list}
 \subsection{Array}

TabularUnified doc/theses/mike_brooks_MMath/programs/bkgd-carray-arrty.c ¶

-                      rbb336a6
+                      rdbff8ec
 void stx2() { const T x[10];
 //            x[5] = 3.14; // bad
+                        }
+}
 void stx3() { T const x[10];
 //            x[5] = 3.14; // bad
+                        }
+}
 // Local Variables: //

TabularUnified doc/theses/mike_brooks_MMath/programs/hello-accordion.cfa ¶

-                      rbb336a6
+                      rdbff8ec
 #include <stdlib.hfa>
 #include <array.hfa>
+#include <locale.h>                                                     // setlocale
 …
+forall( T, [Nclients], [Ncosts] )
+struct request {
+        unsigned int requestor_id;
+        array( T, Nclients ) impacted_client_ids; // nested VLA
+        array( float, Ncosts ) cost_contribs; // nested VLA
+        float total_cost;
+forall( T, @[NprovTerty]@, @[Nmunicipalities]@ )
+struct CanadaPop {
+        array( T, @NprovTerty@ ) provTerty; $\C{// nested VLA}$
+        array( T, @Nmunicipalities@ ) municipalities; $\C{// nested VLA}$
+        int total_pt, total_mun;
 };
 …
 // TODO: understand (fix?) why these are needed (autogen seems to be failing ... is typeof as struct member nayok?)
 forall( T, [Nclients], [Ncosts] )
         void ?{}( T &, request( T, Nclients, Ncosts ) & this ) {}
+forall( T, [NprovTerty], [Nmunicipalities] )
+        void ?{}( T &, CanadaPop( T, NprovTerty, Nmunicipalities ) & this ) {}
 forall( T &, [Nclients], [Ncosts] )
         void ^?{}( request( T, Nclients, Ncosts ) & this ) {}
+forall( T &, [NprovTerty], [Nmunicipalities] )
+        void ^?{}( CanadaPop( T, NprovTerty, Nmunicipalities ) & this ) {}
 …
+forall( T, [Nclients], [Ncosts] )
+void summarize( request( T, Nclients, Ncosts ) & r ) {
+        r.total_cost = 0;
+        for( i; Ncosts )
+                r.total_cost += r.cost_contribs[i];
+        // say the cost is per-client, to make output vary
+        r.total_cost *= Nclients;
+forall( T, [NprovTerty], [Nmunicipalities] )
+void check( CanadaPop( T, NprovTerty, Nmunicipalities ) & pop ) with( pop ) {
+        total_pt = total_mun = 0;
+        for ( i; NprovTerty ) total_pt += provTerty[i];
+        for ( i; Nmunicipalities ) total_mun += municipalities[i];
+}
 …
 int main( int argc, char * argv[] ) {
+        const int ncl = ato( argv[1] );
+        const int nco = 2;
+        request( int, ncl, nco ) r;
+        r.cost_contribs[0] = 100;
+        r.cost_contribs[1] = 0.1;
+        summarize(r);
+        sout | "Total cost:" | r.total_cost;
+        const int npt = ato( argv[1] ), nmun = ato( argv[2] );
+        @CanadaPop( int, npt, nmun ) pop;@
+        // read in population numbers
+        @check( pop );@
+        sout | setlocale( LC_NUMERIC, getenv( "LANG" ) );
+        sout | "Total province/territory:" | pop.total_pt;
+        sout | "Total municipalities:" | pop.total_mun;
+}
 /*
+$\$$ ./a.out 5
+Total cost: 500.5
+$\$$ ./a.out 6
+Total cost: 600.6
+$\$$ ./a.out  13  3573
+Total province/territory: 36,991,981
+Total municipalities: 36,991,981
 */
+// Local Variables: //
+// compile-command: "sed -f sedcmd hello-accordion.cfa > ../build/tmp.cfa; cfa ../build/tmp.cfa -Wall -Wextra" //
+// End: //

TabularUnified doc/theses/mike_brooks_MMath/programs/hello-array.cfa ¶

-                      rbb336a6
+                      rdbff8ec
 forall( [N] ) // array bound
 array(bool, N) & f( array(float, N) & a, array(float, N) & b ) {
         array(bool, N) & ret = *alloc(); // sizeof used by alloc
         for( i; N ) {
                 ret[i] = 0.005 > 2 * (abs(a[i] - b[i])) / (abs(a[i]) + abs(b[i]));
+forall( [@N@] )                                                         $\C{// array dimension}$
+array( bool, @N@) & f( array( float, @N@ ) & x, array( float, @N@ ) & y ) {
+        array( bool, @N@ ) & ret = *@alloc@();  $\C{// sizeof ret  used by alloc}$
+        for ( i; @N@ ) {
+                ret[i] = 0.005 > 2 * (abs( x[i] - y[i] )) / (abs( x[i]) + abs(y[i] ));
+        }
         return ret;
 …
 int main( int argc, char * argv[] ) {
         int n = ato( argv[1] );
         array(float, n) a, b; // VLA
         for ( i; n ) {
                 a[i] = 3.14 / (i + 1);
                 b[i] = a[i] + 0.005 ;
+        const int @n@ = ato( argv[1] );                 $\C{// deduce conversion type}$
+        array( float, @n@ ) x, y;                               $\C{// VLAs}$
+        for ( i; n ) {                                                  $\C{// initialize arrays}$
+                x[i] = 3.14 / (i + 1);
+                y[i] = x[i] + 0.005 ;
+        }
         array(bool, n) & result = f( a, b ); // call
         sout | "result: " | nonl;
+        array( bool, @n@ ) & result = @f( x, y )@; $\C{// call}$
+        sout | "result: " | nonl;                               $\C{// print result}$
         for ( i; n )
                 sout | result[i] | nonl;
         sout | nl;
         free( &result ); // free returned storage
+        free( &result );                                                $\C{// free result storage}$
+}
 /*
 …
 void fred() {
         array(float, 10) a;
         array(float, 20) b;
         f( a, a );
         f( b, b );
         f( a, b );
+        array( float, @10@ ) x;
+        array( float, @20@ ) y;
+        f( x, x );
+        f( y, y );
+//      f( x, y );
+}
 #ifdef SHOWERR1
 forall( [M], [N] )
 void bad( array(float, M) &a, array(float, N) &b ) {
         f( a, a ); // ok
         f( b, b ); // ok
         f( a, b ); // error
+void bad( array(float, M) &x, array(float, N) &y ) {
+        f( x, x );              $\C[1.5in]{// ok}$
+        f( y, y );              $\C{// ok}$
+        f( x, y );              $\C{// error}\CRT$
+}
 #endif
 …
 forall( [M], [N] )
+void bad_fixed( array(float, M) & a, array(float, N) & b ) {
+        if ( M == N ) {
+                f( a, (array(float, M) &)b ); // cast b to matching type
+        }
+void bad_fixed( array( float, M ) & x, array( float, N ) & y ) {
+        if ( M == N )
+                f( x, @(array( float, M ) &)@y ); $\C{// cast y to matching type}$
+}
+// Local Variables: //
+// compile-command: "sed -f sedcmd hello-array.cfa > ../build/tmp.cfa; cfa ../build/tmp.cfa -Wall -Wextra" //
+// End: //

TabularUnified doc/theses/mike_brooks_MMath/programs/hello-md.cfa ¶

-                      rbb336a6
+                      rdbff8ec
 forall( [N] )
 void print1d_cstyle( array(float, N) & c );
+void print1d_cstyle( array( float, N ) & r ); $\C{// C style}$
 forall( [N], C & | ar( C, float, N ) )
+forall( [N], C & @| ar( C, float, N )@ ) $\C{// add trait}$
 void print1d( C & c );
 …
 forall( [N] )
+void print1d_cstyle( array(float, N) & c ) {
+        for ( i; N ) {
+                sout | c[i] | nonl;
+        }
+void print1d_cstyle( array( float, N ) & r ) { $\C{// C style}$
+        for ( i; N ) sout | r[i] | nonl;
         sout | nl;
+}
 …
 void fill( array(float, 5, 7) & a ) {
+void fill( array( float, 5, 7 ) & a ) {
         for ( i; (ptrdiff_t) 5 ) {
                 for ( j; 7 ) {
 …
 array( float, 5, 7 ) a;
 fill(a);
+array( float, 5, 7 ) m;
+fill( m );
 /*
+.0  0.1  0.2  0.3  0.4  0.5  0.6
+.0  1.1  1.2  1.3  1.4  1.5  1.6
+.0  2.1  2.2  2.3  2.4  2.5  2.6
+.0  3.1  3.2  3.3  3.4  3.5  3.6
+.0  4.1  4.2  4.3  4.4  4.5  4.6
+r/c   0     1     2     3     4     5     6
+  0.0  0.1  0.2  @0.3@  0.4  0.5  0.6
+  1.0  1.1  1.2  @1.3@  1.4  1.5  1.6
+  @2.0  2.1  2.2  2.3  2.4  2.5  2.6@
+  3.0  3.1  3.2  @3.3@  3.4  3.5  3.6
+  4.0  4.1  4.2  @4.3@  4.4  4.5  4.6
 */
 …
+print1d_cstyle( a[ 2 ] );  // 2.0  2.1  2.2  2.3  2.4  2.5  2.6
+print1d_cstyle( m[ 2 ] );  $\C{// row 2:  2.0  2.1  2.2  2.3  2.4  2.5  2.6}$
 print1d( a[ 2 ] );  // 2.0  2.1  2.2  2.3  2.4  2.5  2.6
+print1d( m[ 2 ] );  $\C{// row:  2.0  2.1  2.2  2.3  2.4  2.5  2.6}$
 print1d( a[ 2, all ] );  // 2.0  2.1  2.2  2.3  2.4  2.5  2.6
 print1d( a[ all, 3 ] );  // 0.3  1.3  2.3  3.3  4.3
+print1d( m[ 2, all ] );  $\C{// row 2:  2.0  2.1  2.2  2.3  2.4  2.5  2.6}$
+print1d( m[ all, 3 ] );  $\C{// column 3:  0.3  1.3  2.3  3.3  4.3}$
 print1d_cstyle( a[ 2, all ] );
+print1d_cstyle( m[ 2, all ] );
 …
 #ifdef SHOW_ERROR_1
 print1d_cstyle( a[ all, 2 ] );  // bad
+print1d_cstyle( m[ all, 2 ] );  $\C{// bad}$
 #endif

TabularUnified doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp ¶

-                      rbb336a6
+                      rdbff8ec
 class list {
         struct node {
                 @LIST_ENTRY(node) links;@
                 @El elem;@
+                LIST_ENTRY(node) links;
+                El elem;
         };
         LIST_HEAD(Impl, node);
 …
+        }
         void push_front( const El & src ) {
                 node * n = @new node()@;
+                node * n = new node();
                 n->elem = src;
                 LIST_INSERT_HEAD(&impl, n, links);

TabularUnified doc/theses/mike_brooks_MMath/programs/lst-issues-wrapped-byref.run.cpp ¶

rbb336a6	rdbff8ec
49	49	for (auto const& cur : reqs)
50	50	printf("{%d %d} ", cur->pri, cur->rqr);
51		printf("\n");
	51	printf("\n");
52	52
53	53	}

TabularUnified doc/theses/mike_brooks_MMath/string.tex ¶

-                      rbb336a6
+                      rdbff8ec
 \section{String}
 \subsection{Logical Overlap}
+\subsection{Logical overlap}
 \input{sharing-demo.tex}
 …
 \subsection{Memory Management}
+\subsection{Memory management}
 A centrepriece of the string module is its memory manager.  The managment scheme defines a large shared buffer for strings' text.  Allocation in this buffer is always bump-pointer; the buffer is compacted and/or relocated with growth when it fills.  A string is a smart pointer into this buffer.
 …
 \subsection{Avoiding Implicit Sharing}
+\subsection{Avoiding implicit sharing}
 There are tradeoffs associated with the copy-on-write mechanism.  Several quatitative matters are detailed in the [xref: Performance Assessment] section and the qualitiative issue of multi-threaded support is introduced here.  The \CFA sting library provides a switch to disable the sharing mechanism for situtations where it is inappropriate.
 …
 \subsection{Future Work}
+\subsection{Future work}
 To discuss: Unicode
 …
 \subsection{Performance Assessment}
+\subsection{Performance assessment}
 I assessed the CFA string library's speed and memory usage.  I present these results ineven quivalent cases, due to either micro-optimizations foregone, or fundamental costs of the added functionality.  They also show the benefits and tradeoffs, as >100\% effects, of switching to CFA, with the tradeoff points quantified.  The final test shows the overall win of the CFA text-sharing mechanism.  It exercises several operations together, showing CFA enabling clean user code to achieve performance that STL requires less-clean user code to achieve.

TabularUnified doc/theses/mike_brooks_MMath/uw-ethesis.tex ¶

rbb336a6	rdbff8ec
104	104	\lstset{language=cfa,belowskip=-1pt} % set default language to CFA
105	105	\lstnewenvironment{c++}[1][]{\lstset{language=[GNU]C++,escapechar=\$,moredelim=**[is][\color{red}]{@}{@},}\lstset{#1}}{}
	106	\lstnewenvironment{pascal}[1][]{\lstset{language=pascal,escapechar=\$,moredelim=**[is][\color{red}]{@}{@},}\lstset{#1}}{}
106	107	\lstset{inputpath={programs}}
107	108

TabularUnified libcfa/src/enum.cfa ¶

-                      rbb336a6
+                      rdbff8ec
 #include "enum.hfa"
 #include "fstream.hfa"
+#include <stdlib.h>                                                                             // qsort
 #include <string.h>
 #pragma GCC visibility push(default)
+int scmp( const void * str1, const void * str2 ) {
+    return -strcmp( *(char **)str1, *(char **)str2 );   // dscending order
+} // scmp
 forall( istype & | istream( istype ), E, V | CfaEnum( E, V ) )
 istype & ?|?( istype & is, E & e ) {
+//      printf( "here0\n" );
         if ( eof( is ) ) throwResume ExceptionInst( missing_data );
+        char val[256];
+        int args = fmt( is, "%255s", val );
+        if ( ! eof( is ) && args != 1 ) throwResume ExceptionInst( missing_data );
+        // Match input enumerator string to enumerator labels.
+        int len = -1;
+        const char * cpy[ 20 /*countof( E )*/ ];
+        int i = 0;
         for ( s; E ) {
+                if ( strcmp(val, label( s )) == 0 ) { e = s; break; }
+                cpy[i] = label( s );
+                printf( "%s\n", cpy[i] );
+                i += 1;
+        }
+        printf( "%d\n", i );
+        qsort( cpy, i, sizeof(char*), scmp );
+        i = 0;
+        for ( s; E ) {
+                printf( "%s\n", cpy[i] );
+                i += 1;
+        }
+        int j = 0;
+  X : for ( s; E ) {
+                len = strlen( cpy[j] );
+                printf( "%s %d\n", cpy[j], len );
+                char fmtstr[len + 16];
+                fmtstr[0] = ' ';                                                                // optional leadig whitespace
+                strcpy( &fmtstr[1], cpy[j] );                                   // copy format and add %n
+                strcpy( &fmtstr[len + 1], "%n" );
+                printf( "%s\n", fmtstr );
+                len = -1;
+                // scanf cursor does not move if no match
+                fmt( is, fmtstr, &len );
+                printf( "%s %d %d\n", fmtstr, len, j );
+          if ( eof( is ) ) { break; }
+          if ( len != -1 ) {
+                  for ( s; E ) {
+                          if ( strcmp( label( s ), cpy[j] ) == 0 ) { e = s; break X; }
+                  }
+          }
+                j += 1;
         } else {
+                fprintf( stderr, "invalid enumeration constant\n" );
+                abort();                                                                        // cannot use abort stream
+                //ExceptionInst( missing_data );
         } // for
+        printf( "X %s %d\n", label( e ), len );
+        if ( ! eof( is ) && len == -1 ) throwResume ExceptionInst( missing_data );
+        // if ( eof( is ) ) throwResume ExceptionInst( missing_data );
+        // char val[256];
+        // int args = fmt( is, "%255s", val );
+        // if ( ! eof( is ) && args != 1 ) throwResume ExceptionInst( missing_data );
+        // for ( s; E ) {
+        //      if ( strcmp(val, label( s )) == 0 ) { e = s; break; }
+        // } else {
+        //      fprintf( stderr, "invalid enumeration constant\n" );
+        //      abort();                                                                        // cannot use abort stream
+        // } // for
         return is;
+}

TabularUnified libcfa/src/iostream.cfa ¶

-                      rbb336a6
+                      rdbff8ec
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Mon Feb 12 09:26:05 2024
 // Update Count     : 1966
+// Last Modified On : Mon Jul  8 23:45:06 2024
+// Update Count     : 2018
 //
 …
+#define FALSE "false"
+#define TRUE "true"
 forall( istype & | basic_istream( istype ) ) {
         istype & ?|?( istype & is, bool & b ) {
                 if ( eof( is ) ) throwResume ExceptionInst( missing_data );
+                char val[6];
+                int args = fmt( is, "%5s", val );
+                if ( ! eof( is ) && args != 1 ) throwResume ExceptionInst( missing_data );
+                if ( strcmp( val, "true" ) == 0 ) b = true;
+                else if ( strcmp( val, "false" ) == 0 ) b = false;
+                else {
+                        fprintf( stderr, "invalid Boolean constant\n" );
+                        abort();                                                                        // cannot use abort stream
+                int len = -1;                                                                   // len not set if no match
+                // Optional leading whitespace at start of strings.
+                fmt( is, " " FALSE "%n", &len );                                // try false
+                if ( len != sizeof( FALSE ) - 1 ) {                             // remove null terminate
+                        fmt( is, " " TRUE "%n", &len );                         // try true
+                        if ( len != sizeof( TRUE ) - 1 ) throwResume ExceptionInst( missing_data );
+                        b = true;
+                } else {
+                        b = false;
                 } // if
                 return is;
 …
         } // ?|?
         istype & ?|?( istype & is, const char fmt[] ) {
+        istype & ?|?( istype & is, const char fmt[] ) {         // match text
                 if ( eof( is ) ) throwResume ExceptionInst( missing_data );
                 size_t len = strlen( fmt );
 …
                 strcpy( fmtstr, fmt );                                                  // copy format and add %n
                 strcpy( &fmtstr[len], "%n" );
+                int len2 = -1;
+                fmt( is, fmtstr, &len2 );
+                if ( ! eof( is ) && len2 == -1 ) throwResume ExceptionInst( missing_data );
+                len = -1;
+                // scanf cursor does not move if no match
+                fmt( is, fmtstr, &len );
+                if ( ! eof( is ) && len == -1 ) throwResume ExceptionInst( missing_data );
                 return is;
         } // ?|?

TabularUnified libcfa/src/iostream.hfa ¶

-                      rbb336a6
+                      rdbff8ec
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Sun Apr 21 07:32:19 2024
 // Update Count     : 744
+// Last Modified On : Sat Jul  6 11:33:31 2024
+// Update Count     : 758
 //
 …
         istype & ?|?( istype &, long double _Complex & );
+        istype & ?|?( istype &, const char [] );
+        // This is too restrictive as it prevents building a format in a string and using that format.
+        // inline istype & ?|?( istype &, char [] ) {                   // possible error, too restrictive to change
+        //      _Static_assert( false, "reading a character array without a maximum length is unsafe. Use input manipulator \"wdi( N, s )\", where \"char s[N]\" or fmt( s )." );
+        // }
+        istype & ?|?( istype &, const char [] );                        // match text
         // manipulators

TabularUnified libcfa/src/parseargs.cfa ¶

-                      rbb336a6
+                      rdbff8ec
 // Author           : Thierry Delisle
 // Created On       : Wed Oct 12 15:28:01 2022
 // Last Modified By :
 // Last Modified On :
 // Update Count     :
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Mon Jul  8 18:18:23 2024
+// Update Count     : 7
 //
 …
         extern FILE * stdout;
         extern int fileno(FILE *stream);
+        extern int fileno( FILE *stream );
         extern int fprintf ( FILE * stream, const char * format, ... );
         extern          long long int strtoll (const char* str, char** endptr, int base);
         extern unsigned long long int strtoull(const char* str, char** endptr, int base);
         extern                 double strtod  (const char* str, char** endptr);
+        extern          long long int strtoll ( const char* str, char** endptr, int base );
+        extern unsigned long long int strtoull( const char* str, char** endptr, int base );
+        extern                 double strtod  ( const char* str, char** endptr );
+}
 …
 #include "limits.hfa"
 #pragma GCC visibility push(default)
 extern int cfa_args_argc __attribute__((weak));
 extern char ** cfa_args_argv __attribute__((weak));
 extern char ** cfa_args_envp __attribute__((weak));
+#pragma GCC visibility push( default )
+extern int cfa_args_argc __attribute__(( weak ));
+extern char ** cfa_args_argv __attribute__(( weak ));
+extern char ** cfa_args_envp __attribute__(( weak ));
 forall([N])
 static void usage(char * cmd, const array( cfa_option, N ) & options, const char * usage, FILE * out)  __attribute__ ((noreturn));
+static void usage( char * cmd, const array( cfa_option, N ) & options, const char * usage, FILE * out )  __attribute__ (( noreturn ));
 //-----------------------------------------------------------------------------
 // checking
 forall([N])
 static void check_args( const array( cfa_option, N ) & options ) {
+        for(i; N) {
+                for(j; N) {
+                        if(i == j) continue;
+                        if( options[i].short_name != '\0'
+                        && options[i].short_name == options[j].short_name)
+                                abort("Parse Args error: two options have short name '%c' (%zu & %zu)", options[i].short_name, i, j);
+                        if(0 == strcmp(options[i].long_name, options[j].long_name)) abort("Parse Args error: two options have long name '%s' (%zu & %zu)", options[i].long_name, i, j);
+        for ( i; N ) {
+                for ( j; N ) {
+                        if ( i == j ) continue;
+                        if ( options[i].short_name != '\0'
+                        && options[i].short_name == options[j].short_name )
+                                abort( "Parse Args error: two options have short name '%c' (%zu & %zu)", options[i].short_name, i, j );
+                        if (0 == strcmp( options[i].long_name, options[j].long_name ))
+                                abort( "Parse Args error: two options have long name '%s' (%zu & %zu)", options[i].long_name, i, j );
+                }
+        }
 …
 forall([opt_count]) {
         void parse_args( const array( cfa_option, opt_count ) & options, const char * usage, char ** & left ) {
+                if( 0p != &cfa_args_argc ) {
+                        parse_args(cfa_args_argc, cfa_args_argv, options, usage, left );
+                }
+                else {
+                if ( 0p != &cfa_args_argc ) {
+                        parse_args( cfa_args_argc, cfa_args_argv, options, usage, left );
+                } else {
                         char * temp[1] = { 0p };
                         parse_args(0, temp, options, usage, left );
 …
                 char ** & left
         ) {
                 check_args(options);
+                check_args( options );
                 int maxv = 'h';
 …
+                {
                         int idx = 0;
                         for(i; opt_count) {
                                 if (options[i].short_name) {
                                         maxv = max(options[i].short_name, maxv);
+                        for ( i; opt_count ) {
+                                if ( options[i].short_name ) {
+                                        maxv = max( options[i].short_name, maxv );
                                         optstring[idx] = options[i].short_name;
                                         idx++;
                                         if(    ((intptr_t)options[i].parse) != ((intptr_t)parse_settrue)
                                         && ((intptr_t)options[i].parse) != ((intptr_t)parse_setfalse) ) {
+                                        if ( (intptr_t)options[i].parse != (intptr_t)parse_settrue
+                                                 && ((intptr_t)options[i].parse) != ((intptr_t)parse_setfalse) ) {
                                                 optstring[idx] = ':';
                                                 idx++;
 …
+                {
                         int idx = 0;
                         for(i; opt_count) {
                                 if(options[i].long_name) {
+                        for ( i; opt_count ) {
+                                if ( options[i].long_name ) {
                                         // we don't have the mutable keyword here, which is really what we would want
                                         int & val_ref = (int &)(const int &)options[i].val;
 …
                                         optarr[idx].flag = 0p;
                                         optarr[idx].val  = options[i].val;
                                         if(    ((intptr_t)options[i].parse) == ((intptr_t)parse_settrue)
                                         || ((intptr_t)options[i].parse) == ((intptr_t)parse_setfalse) ) {
+                                        if ( ((intptr_t)options[i].parse) == ((intptr_t)parse_settrue)
+                                                 || ((intptr_t)options[i].parse) == ((intptr_t)parse_setfalse) ) {
                                                 optarr[idx].has_arg = no_argument;
                                         } else {
 …
                 FILE * out = stderr;
                 NEXT_ARG:
                 for() {
+                for () {
                         int idx = 0;
                         int opt = getopt_long(argc, argv, optstring, optarr, &idx);
                         switch(opt) {
+                        int opt = getopt_long( argc, argv, optstring, optarr, &idx );
+                        switch( opt ) {
                                 case -1:
                                         if(&left != 0p) left = argv + optind;
+                                        if ( &left != 0p ) left = argv + optind;
                                         return;
                                 case 'h':
                                         out = stdout;
                                 case '?':
                                         usage(argv[0], options, usage, out);
+                                        usage( argv[0], options, usage, out );
                                 default:
                                         for(i; opt_count) {
                                                 if(opt == options[i].val) {
+                                        for ( i; opt_count ) {
+                                                if ( opt == options[i].val ) {
                                                         const char * arg = optarg ? optarg : "";
                                                         if( arg[0] == '=' ) { arg++; }
+                                                        if ( arg[0] == '=' ) { arg++; }
                                                         // work around for some weird bug
                                                         void * variable = options[i].variable;
                                                         bool (*parse_func)(const char *, void * ) = options[i].parse;
                                                         bool success = parse_func( arg, variable );
                                                         if(success) continue NEXT_ARG;
                                                         fprintf(out, "Argument '%s' for option %c could not be parsed\n\n", arg, (char)opt);
                                                         usage(argv[0], options, usage, out);
+                                                        if ( success ) continue NEXT_ARG;
+                                                        fprintf( out, "Argument '%s' for option %c could not be parsed\n\n", arg, (char)opt );
+                                                        usage( argv[0], options, usage, out );
+                                                }
+                                        }
                                         abort("Internal parse arg error\n");
+                                        abort( "Internal parse arg error\n" );
+                        }
 …
+}
 static inline int next_newline(const char * str) {
+static inline int next_newline( const char * str ) {
         int ret;
         const char * ptr = strstr(str, "\n");
         if(!ptr) return MAX;
         /* paranoid */ verify( str <= ptr);
+        const char * ptr = strstr( str, "\n" );
+        if ( ! ptr ) return MAX;
+        /* paranoid */ verify( str <= ptr );
         intptr_t low = (intptr_t)str;
         intptr_t hi  = (intptr_t)ptr;
 …
 //-----------------------------------------------------------------------------
 // Print usage
 static void printopt(FILE * out, int width, int max, char sn, const char * ln, const char * help) {
+static void printopt( FILE * out, int width, int max, char sn, const char * ln, const char * help ) {
         // check how wide we should be printing
         // this includes all options and the help message
         int hwidth = max - (11 + width);
         if(hwidth <= 0) hwidth = max;
+        if ( hwidth <= 0 ) hwidth = max;
         // check which pieces we have
         bool has_ln = ln && strcmp("", ln);
         bool has_help = help && strcmp("", help);
+        bool has_ln = ln && strcmp( "", ln );
+        bool has_help = help && strcmp( "", help );
         // print the small name if present
         if(sn != '\0') fprintf(out, "  -%c", sn);
         else fprintf(out, "    ");
+        if ( sn != '\0') fprintf( out, "  -%c", sn );
+        else fprintf( out, "    " );
         // print a comma if we have both short and long names
         if(sn != '\0' && has_ln) fprintf(out, ", ");
         else fprintf(out, "  ");
+        if ( sn != '\0' && has_ln ) fprintf( out, ", " );
+        else fprintf( out, "  " );
         // print the long name if present
         if(has_ln)        fprintf(out, "--%-*s", width, ln);
         else if(has_help) fprintf(out, "  %-*s", width, "");
         if(has_help) {
+        if ( has_ln ) fprintf( out, "--%-*s", width, ln );
+        else if ( has_help ) fprintf( out, "  %-*s", width, "" );
+        if ( has_help ) {
                 // print the help
                 // We need to wrap at the max width, and also indent newlines so everything is nice and pretty
                 // for each line to print
                 for() {
+                for () {
                         //find out if there is a newline
                         int nextnl = next_newline(help);
                         int real = min(min(strlen(help), hwidth), nextnl);
                         fprintf(out, "   %.*s", real, help);
                         // printf("%d %d\n", real, nextnl);
+                        int nextnl = next_newline( help );
+                        int real = min( min( strlen( help ), hwidth ), nextnl );
+                        fprintf( out, "   %.*s", real, help );
+                        // printf( "%d %d\n", real, nextnl );
                         help += real;
                         if( nextnl == real ) help++;
                         if('\0' == *help) break;
                         fprintf(out, "\n%*s", width + 8, "");
+                }
+        }
         fprintf(out, "\n");
+}
 void print_args_usage(cfa_option options[], const size_t opt_count, const char * usage, bool error)  __attribute__ ((noreturn)) {
+                        if ( nextnl == real ) help++;
+                        if ('\0' == *help ) break;
+                        fprintf( out, "\n%*s", width + 8, "" );
+                }
+        }
+        fprintf( out, "\n" );
+}
+void print_args_usage( cfa_option options[], const size_t opt_count, const char * usage, bool error )  __attribute__ ((noreturn )) {
         const array( cfa_option, opt_count ) & arr = (const array( cfa_option, opt_count ) &) *options;
         usage(cfa_args_argv[0], arr, usage, error ? stderr : stdout);
+}
 void print_args_usage(int , char * argv[], cfa_option options[], const size_t opt_count, const char * usage, bool error)  __attribute__ ((noreturn)) {
+        usage( cfa_args_argv[0], arr, usage, error ? stderr : stdout );
+}
+void print_args_usage( int , char * argv[], cfa_option options[], const size_t opt_count, const char * usage, bool error )  __attribute__ (( noreturn )) {
         const array( cfa_option, opt_count ) & arr = (const array( cfa_option, opt_count ) &) *options;
         usage(argv[0], arr, usage, error ? stderr : stdout);
+        usage( argv[0], arr, usage, error ? stderr : stdout );
+}
 forall( [N] ) {
         void print_args_usage( const array(cfa_option, N ) & options, const char * usage, bool error) {
                 usage(cfa_args_argv[0], options, usage, error ? stderr : stdout);
+        }
         void print_args_usage(int argc, char * argv[], const array( cfa_option, N ) & options, const char * usage, bool error) {
                 usage(argv[0], options, usage, error ? stderr : stdout);
+        void print_args_usage( const array(cfa_option, N ) & options, const char * usage, bool error ) {
+                usage( cfa_args_argv[0], options, usage, error ? stderr : stdout );
+        }
+        void print_args_usage( int argc, char * argv[], const array( cfa_option, N ) & options, const char * usage, bool error ) {
+                usage( argv[0], options, usage, error ? stderr : stdout );
+        }
+}
 forall([N])
 static void usage(char * cmd, const array( cfa_option, N ) & options, const char * help, FILE * out) __attribute__((noreturn)) {
+static void usage( char * cmd, const array( cfa_option, N ) & options, const char * help, FILE * out ) __attribute__(( noreturn )) {
         int width = 0;
+        {
                 for(i; N) {
                         if(options[i].long_name) {
                                 int w = strlen(options[i].long_name);
                                 if(w > width) width = w;
+                for ( i; N ) {
+                        if ( options[i].long_name ) {
+                                int w = strlen( options[i].long_name );
+                                if ( w > width ) width = w;
+                        }
+                }
 …
         int max_width = 1_000_000;
         int outfd = fileno(out);
         if(isatty(outfd)) {
+        int outfd = fileno( out );
+        if ( isatty( outfd ) ) {
                 struct winsize size;
                 int ret = ioctl(outfd, TIOCGWINSZ, &size);
                 if(ret < 0) abort( "ioctl error: (%d) %s\n", (int)errno, strerror(errno) );
+                int ret = ioctl( outfd, TIOCGWINSZ, &size );
+                if ( ret < 0 ) abort( "ioctl error: (%d) %s\n", (int)errno, strerror( errno) );
                 max_width = size.ws_col;
+        }
         fprintf(out, "Usage:\n  %s %s\n", cmd, help);
         for(i; N) {
                 printopt(out, width, max_width, options[i].short_name, options[i].long_name, options[i].help);
+        }
         fprintf(out, "  -%c, --%-*s   %s\n", 'h', width, "help", "print this help message");
         exit(out == stdout ? 0 : 1);
+        fprintf( out, "Usage:\n  %s %s\n", cmd, help );
+        for ( i; N ) {
+                printopt( out, width, max_width, options[i].short_name, options[i].long_name, options[i].help );
+        }
+        fprintf( out, "  -%c, --%-*s   %s\n", 'h', width, "help", "print this help message" );
+        exit( out == stdout ? 0 : 1 );
+}
 //-----------------------------------------------------------------------------
 // Typed argument parsing
 bool parse_yesno(const char * arg, bool & value ) {
         if(strcmp(arg, "yes") == 0) {
+bool parse_yesno( const char * arg, bool & value ) {
+        if ( strcmp( arg, "yes" ) == 0 ) {
                 value = true;
                 return true;
+        }
+        if(strcmp(arg, "Y") == 0) {
+        if ( strcmp( arg, "Y" ) == 0 ) {
                 value = true;
                 return true;
+        }
+        if(strcmp(arg, "y") == 0) {
+        if ( strcmp( arg, "y" ) == 0 ) {
                 value = true;
                 return true;
+        }
+        if(strcmp(arg, "no") == 0) {
+        if ( strcmp( arg, "no" ) == 0 ) {
                 value = false;
                 return true;
+        }
+        if(strcmp(arg, "N") == 0) {
+        if ( strcmp( arg, "N" ) == 0 ) {
                 value = false;
                 return true;
+        }
+        if(strcmp(arg, "n") == 0) {
+        if ( strcmp( arg, "n" ) == 0 ) {
                 value = false;
                 return true;
+        }
         return false;
+}
 bool parse_truefalse(const char * arg, bool & value) {
         if(strcmp(arg, "true") == 0) {
+bool parse_truefalse( const char * arg, bool & value ) {
+        if ( strcmp( arg, "true" ) == 0 ) {
                 value = true;
                 return true;
+        }
+        if(strcmp(arg, "false") == 0) {
+        if ( strcmp( arg, "false" )  == 0 ) {
                 value = false;
                 return true;
+        }
         return false;
+}
 bool parse_settrue (const char *, bool & value ) {
+bool parse_settrue ( const char *, bool & value ) {
         value = true;
         return true;
+}
 bool parse_setfalse(const char *, bool & value )  {
+bool parse_setfalse( const char *, bool & value )  {
         value = false;
         return true;
+}
 bool parse(const char * arg, const char * & value ) {
+bool parse( const char * arg, const char * & value ) {
         value = arg;
         return true;
+}
 bool parse(const char * arg, int & value) {
+bool parse( const char * arg, int & value ) {
         char * end;
         errno = 0;
+        long long int r = strtoll(arg, &end, 0);
+        if(errno) return false;
+        if(*end != '\0') return false;
+        if(r > (int)MAX) return false;
+        if(r < (int)MIN) return false;
+        long long int r = strtoll( arg, &end, 0 );
+        if ( errno ) return false;
+        if (*end != '\0') return false;
+        if ( r > (int)MAX ) return false;
+        if ( r < (int)MIN ) return false;
         value = r;
         return true;
+}
 static unsigned long long int strict_strtoull( const char * arg, int base) {
+static unsigned long long int strict_strtoull( const char * arg, int base ) {
         errno = 0;
+        {
                 const char * in = arg;
                 for() {
                         if('\0' == *in) {
+                for () {
+                        if ( '\0' == *in ) {
                                 errno = EINVAL;
                                 return 0;
+                        }
                         if(!isspace(*in)) break;
+                        if ( ! isspace(*in )) break;
                         in++;
+                }
                 if(!isdigit(*in)) {
+                if ( ! isdigit(*in )) {
                         errno = EINVAL;
                         return 0;
+                }
+        }
         *char end;
         unsigned long long int r = strtoull(arg, &end, base);
         if(*end != '\0') errno = EINVAL;
         if(errno) return 0;
+        unsigned long long int r = strtoull( arg, &end, base );
+        if (*end != '\0') errno = EINVAL;
+        if ( errno ) return 0;
         return r;
+}
+bool parse(const char * arg, unsigned & value) {
+        unsigned long long int r = strict_strtoull(arg, 0);
+        if(errno) return false;
+        if(r > (unsigned)MAX) return false;
+bool parse( const char * arg, unsigned & value ) {
+        unsigned long long int r = strict_strtoull( arg, 0 );
+        if ( errno ) return false;
+        if ( r > (unsigned)MAX ) return false;
         value = r;
         return true;
+}
+bool parse(const char * arg, unsigned long & value) {
+        unsigned long long int r = strict_strtoull(arg, 0);
+        if(errno) return false;
+        if(r > (unsigned long)MAX) return false;
+bool parse( const char * arg, unsigned long & value ) {
+        unsigned long long int r = strict_strtoull( arg, 0 );
+        if ( errno ) return false;
+        if ( r > (unsigned long)MAX ) return false;
         value = r;
         return true;
+}
+bool parse(const char * arg, unsigned long long & value) {
+        unsigned long long int r = strict_strtoull(arg, 0);
+        if(errno) return false;
+        if(r > (unsigned long long)MAX) return false;
+bool parse( const char * arg, unsigned long long & value ) {
+        unsigned long long int r = strict_strtoull( arg, 0 );
+        if ( errno ) return false;
+        if ( r > (unsigned long long)MAX ) return false;
         value = r;
         return true;
+}
 bool parse(const char * arg, double & value) {
+bool parse( const char * arg, double & value ) {
         char * end;
+        double r = strtod(arg, &end);
+        if(*end != '\0') return false;
+        double r = strtod( arg, &end );
+        if ( *end != '\0') return false;
         value = r;
         return true;

TabularUnified libcfa/src/parseargs.hfa ¶

-                      rbb336a6
+                      rdbff8ec
 // Author           : Thierry Delisle
 // Created On       : Wed Oct 12 15:28:01 2022
 // Last Modified By :
 // Last Modified On :
 // Update Count     :
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Mon Jul  8 18:18:14 2024
+// Update Count     : 2
 //
 #pragma once
 …
 static inline void ?{}( cfa_option & this ) {}
 forall(T & | { bool parse(const char *, T & ); })
+forall(T & | { bool parse( const char *, T & ); })
 static inline void ?{}( cfa_option & this, char short_name, const char * long_name, const char * help, T & variable ) {
         this.val        = 0;

TabularUnified src/Parser/ExpressionNode.cpp ¶

rbb336a6	rdbff8ec
483	483	Default: // char default string type
484	484	default:
485		strtype = new ast::BasicType( ast::BasicKind::Char~~, ast::CV::Const~~ );
	485	strtype = new ast::BasicType( ast::BasicKind::Char );
486	486	} // switch
487	487	ast::ArrayType * at = new ast::ArrayType(

TabularUnified src/Parser/parser.yy ¶

-                      rbb336a6
+                      rdbff8ec
 // Created On       : Sat Sep  1 20:22:55 2001
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Thu Jun 27 14:45:57 2024
 // Update Count     : 6705
+// Last Modified On : Tue Jul  9 10:29:01 2024
+// Update Count     : 6713
 //
 …
         c_declaration ';'
         | cfa_declaration ';'                                                           // CFA
         | static_assert                                                                         // C11
+        | static_assert ';'                                                                     // C11
+        ;
 static_assert:
         STATICASSERT '(' constant_expression ',' string_literal ')' ';' // C11
+        STATICASSERT '(' constant_expression ',' string_literal ')' // C11
                 { $$ = DeclarationNode::newStaticAssert( $3, maybeMoveBuild( $5 ) ); }
         | STATICASSERT '(' constant_expression ')' ';'          // CFA
+        | STATICASSERT '(' constant_expression ')'                      // CFA
                 { $$ = DeclarationNode::newStaticAssert( $3, build_constantStr( yylloc, *new string( "\"\"" ) ) ); }
 …
                 { $$ = $2; }                                                                    // mark all fields in list
         | cfa_typedef_declaration ';'                                           // CFA
         | static_assert                                                                         // C11
+        | static_assert ';'                                                                     // C11
+        ;
 …
                         $$ = $6;
+                }
+        | ';'                                                                                           // empty declaration
+                { $$ = nullptr; }
+        ;

Context Navigation

Legend:

TabularUnified INSTALL ¶

TabularUnified doc/theses/mike_brooks_MMath/array.tex ¶

TabularUnified doc/theses/mike_brooks_MMath/background.tex ¶

TabularUnified doc/theses/mike_brooks_MMath/conclusion.tex ¶

TabularUnified doc/theses/mike_brooks_MMath/intro.tex ¶

TabularUnified doc/theses/mike_brooks_MMath/programs/bkgd-carray-arrty.c ¶

TabularUnified doc/theses/mike_brooks_MMath/programs/hello-accordion.cfa ¶

TabularUnified doc/theses/mike_brooks_MMath/programs/hello-array.cfa ¶

TabularUnified doc/theses/mike_brooks_MMath/programs/hello-md.cfa ¶

TabularUnified doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp ¶

TabularUnified doc/theses/mike_brooks_MMath/programs/lst-issues-wrapped-byref.run.cpp ¶

TabularUnified doc/theses/mike_brooks_MMath/string.tex ¶

TabularUnified doc/theses/mike_brooks_MMath/uw-ethesis.tex ¶

TabularUnified libcfa/src/enum.cfa ¶

TabularUnified libcfa/src/iostream.cfa ¶

TabularUnified libcfa/src/iostream.hfa ¶

TabularUnified libcfa/src/parseargs.cfa ¶

TabularUnified libcfa/src/parseargs.hfa ¶

TabularUnified src/Parser/ExpressionNode.cpp ¶

TabularUnified src/Parser/parser.yy ¶

Download in other formats: