18 Introduction to the Examples

In this part we shall go through some slightly larger examples than those in the previous parts. However, none of them are too big, so they should still be easy to understand. The note-worthy parts of each example are described, and you may even find the odd comment in the code. Large, complicated programs benefit hugely from the odd well-placed and descriptive comment. This fact can't be stressed enough.

All the examples will run on a standard Amiga, except for the one which uses ReadArgs (an AmigaDOS 2.0 function). It is really worth upgrading your system to AmigaDOS 2.0 (or above) if you are still using previous versions. The ReadArgs example can only hint at the power and friendliness of the newer system functions. If you are fortunate enough to have an A4000 or an accelerated machine, then the timing example will give better (i.e., quicker) results.

Supplied with this Guide should be a directory of sources of most of the examples. Here's a complete catalogue:

`simple.e'

The simple program from the introduction. See 1.1 A Simple Program.

`while.e'

The slightly complicated WHILE loop. See 4.2.2 WHILE loop.

`address.e'

The program which prints the addresses of some variables. See 9.2.4 Finding addresses (making pointers).

`static.e'

The static data problem. See 9.5.7 Static data.

`static2.e'

The first solution to the static data problem. See 9.5.7 Static data.

`except.e'

An exception handler example. See 13.2 Raising an Exception.

`except2.e'

Another exception handler example. See 13.2 Raising an Exception.

`static3.e'

The second solution to the static data problem, using NEW. See 14.4.3 List and typed list allocation.

`float.e'

The floating-point example program. See 15.3 Floating-Point Functions.

`bintree.e'

The binary tree example. See 16.3 Binary Trees.

`tree.e'

The tree and integer_tree classes, as a module. See 17.4 Inheritance in E.

`tree-use.e'

A program to use the integer_tree class. See 17.4 Inheritance in E.

`set.e'

The simple, inefficient set class, as a module. See 17.5 Data-Hiding in E.

`set-use.e'

A program to use the set class. See 17.5 Data-Hiding in E.

`csv-estr.e'

The CSV reading program using E-strings. See 19 String Handling and I/O.

`csv-norm.e'

The CSV reading program using normal strings. See 19 String Handling and I/O.

`csv-buff.e'

The CSV reading program using normal strings and a large buffer. See 19 String Handling and I/O.

`csv.e'

The CSV reading program using normal strings, a large buffer, and an exception handler. See 19 String Handling and I/O.

`timing.e'

The timing example. See 20 Timing Expressions.

`args.e'

The argument parsing example for any AmigaDOS. See 21.1 Any AmigaDOS.

`args20.e'

The argument parsing example for any AmigaDOS 2.0 and above. See 21.2 AmigaDOS 2.0 (and above).

`gadgets.e'

The gadgets example. See 22.1 Gadgets.

`idcmp.e'

The IDCMP and gadgets example. See 22.2 IDCMP Messages.

`graphics.e'

The graphics example. See 22.3 Graphics.

`screens.e'

The screens example, without an exception handler. See 22.4 Screens.

`screens2.e'

The screens example again, but this time with an exception handler. See 22.4 Screens.

`dragon.e'

The dragon curve recursion example. See 23 Recursion Example.

Go to the Next or Previous section, the Detailed Contents, or the Amiga E Encyclopedia.