jaro@ecf.toronto.edu (Jaro A Pristupa) (01/17/89)
TITLE: AUTOMATIC DATA STRUCTURES IN "ORGANIZED C"
BY: Jiri Soukup, Code Farms Inc.
DATE: Wednesday, January 18, 1989
TIME: 10:00 - 11:00
PLACE: Galbraith Building, Room 404
ABSTRACT
Organized C is a new method of working with organizations of data in C
programs. Compared to C++ and other object oriented languages, it is more
automatic and easier to use; it also has the advantage of not being a new
language. It has been implemented as a preprocessor that runs both under
UNIX and DOS.
Organized C is just as efficient as hand coded programs both in memory
and speed, and it contains a number of useful database-like features. For
example, organizations of data can be saved/received from disk in a single
command.
Compared to using regular C, organized C reduces the total coding/debug-
ging time 3 to 4 times, while producing more readable and maintainable code.
Though the method is applicable to any C program, it suits, in particular,
problems dealing with graphs, trees and chains such as occur in CAD programs
for electronic circuits or in the design and access of local in-core databases.
---------------------
Jaro Pristupa
jaro@vrga.ele.utoronto.ca