Object Oriented Programming in ficl

Contents



Introduction

Review of OO ideas

Click here for a short review of OO ideas, terms, and implementations in other languages, or here for an introduction to the terms and principles of Object Oriented Programming

Design goals of Ficl OO syntax

Ficl's object extensions provide the traditional OO benefits of associating data with the code that manipulates it, and reuse through single inheritance. Ficl also has some unusual capabilities that support interoperation with systems written in C.

Acknowledgements

Ficl is not the first Forth to include Object Oriented extensions. Ficl's OO syntax owes a debt to the work of John Hayes and Dick Pountain, among others. OO Ficl is different from other OO Forths in a few ways, though (some things never change). First, unlike several implementations, the syntax is documented (below) beyond the source code. In Ficl's spirit of working with C code, the OO syntax provides means to adapt existing data structures. I've tried to make Ficl's OO model simple and safe by unifying classes and objects, providing late binding by default, and separating namespaces so that methods and regular Forth words are not easily confused.



Tutorial

It's helpful to have some familiarity with Forth and the customary Forth stack notation to understand this tutorial. To get started, take a look at this Forth tutorial.

This tutorial works best if you follow along by pasting the examples into ficlWin, the Win32 version of Ficl included with the release sources (or some other build that includes the OO part of softcore.c).

You need to use this incantation to make Ficl's OOP words visible to the interpreter:

ONLY   ( Reset to default search order )
ALSO OOP DEFINITIONS  ( Add OOP wordlist to search order )
??? not found
If you run into this error message you will need to repeat the above incantation to reset the search order. Ficl resets to a default search order if it runs into an error.
For beginners
To see the effect of the commands above, type ORDER after each word. You can repeat the sequence above if you like. All of the above words are described in the Standard

To start, we'll work with the base class OBJECT. Try this:

object
FiclWin's stack viewer shows that the stack now holds two values - the one on top is the address of class and the other is the address of a special class called METACLASS that describes the behavior of all classes (including itself). If you're using someother version of Ficl, you can type .s to view the contents of the stack non-destructively. Now try:
 
object --> methods
The line above contains three words. The first is the name of a class, so it pushes its signature on the stack. The next word (-->) finds a method in the context of class object and executes it. In this case, the name of the method is methods. Its job is to list all the methods that a class knows. What you get when you execute this line is a list of all the class methods Ficl provides.

Now let's create a class that can do something interesting with the simulated hardware that FiclWin provides...

object --> sub c-led

Causes base-class OBJECT to derive from itself a new class called c-led.

About class naming
I like to prefix the names of classes with "c-", and the names of member variables with a dot, but this is just a convention. If you don't like it, you can pick your own.
About !oreg
The following methods use the !oreg word defined by FiclWin to control its simulated LED bar. Usage: !oreg ( value -- ). To test it, try 0xff !oreg or 0 !oreg.

Now we'll add some instance variables and methods to the new class...

  
c-byte obj: .state     \  an instance variable

: init   { 2:this -- }
    0 dup !oreg
    this --> .state --> set 
    ." initializing an instance of "
    this --> class --> id type cr ;

: on   { led# 2:this -- }
    this --> .state --> get
    1 led# lshift or dup !oreg
    this --> .state --> set  ;
: off   { led# 2:this -- }
    this --> .state --> get
    1 led# lshift invert and dup !oreg
    this --> .state --> set ;
end-class
The first line adds an instance variable called .state to the class. This particular instance variable is an object - it will be an instance of c-byte, one of ficl's stock classes (the source for which can be found in the distribution in sorftowrds/classes.fr). Try this...
c-led --> see .state
The see method (inherited from object) decompiles methods so that you can see exactly what they do. There's also a debug method that lets you step through a method.

Next we've defined a method called init. This line also declares a local variable called this (the 2 in front tells Ficl that this is a double-cell local). All methods by convention expect the address of the class and instance on top of the stack when called. The next four lines define init's behavior. It first clears the simulated LED bar and .state. The rest displays some text and causes the instance to print its class name (this --> class --> id).
The init method is special for Ficl objects: whenever you create an initialized instance using new or new-array, Ficl calls the class's init method for you on that instance. The default init method supplied by object sets the instance variables to zero (see the source code in ficl/softwords/oo.fr).
The ON and OFF methods defined above hide the details of turning LEDs on and off. The interface to FiclWin's simulated hardware is handled by !OREG. The class keeps the LED state in a shadow variable (.STATE) so that ON and OFF can work in terms of LED number rather than a bitmask.

Now make an instance of the new class: 

c-led --> new led
And try a few things...
led --> methods
led --> pedigree
1 led --> on
1 led --> off
Or you could type this with the same effect:
led  2dup  --> methods  --> pedigree
Notice (from the output of methods) that we've overridden the init method supplied by object, and added two more methods for the member variables. If you type WORDS, you'll see that these methods are not visible outside the context of the class that contains them. The method finder --> uses the class to look up methods. You can use this word in a definition, as we did in init, and it performs late binding, meaning that the mapping from message (method name) to method (the code) is deferred until run-time. To see this, you can decompile the init method like this:
c-led --> see init
or
led --> class --> see init

More About Instance Variables

Untyped instance variable methods (created by cell: cells: char: and chars:) just push the address of the corresponding instance variable when invoked on an instance of the class. It's up to you to remember the size of the instance variable and manipulate it with the usual Forth words for fetching and storing. 

As advertised earlier, Ficl provides ways to objectify existing data structures without changing them. Instead, you can create a Ficl class that models the structure, and instantiate a ref from this class, supplying the address of the structure. After that, the ref instance behaves as a Ficl object, but its instance variables take on the values in the existing structure. Example (from ficlclass.fr):

object subclass c-wordlist
    c-wordlist ref: .parent
    c-ptr     obj: .name
    c-cell    obj: .size
    c-word    ref: .hash
    : ?
        2drop ." ficl wordlist " cr ;
    : push  drop  >search ;
    : pop   2drop previous ;
    : set-current   drop set-current ;
    : words   --> push  words previous ;
end-class
In this case, c-wordlist describes Ficl's wordlist structure; named-wid creates a wordlist and binds it to a ref instance of c-wordlist. The fancy footwork with POSTPONE and early binding is required because classes are immediate. An equivalent way to define named-wid with late binding is:
: named-wid   ( "name" -- )
    wordlist  postpone c-wordlist --> ref ;
To do the same thing at run-time (and call it my-wordlist):
wordlist   
c-wordlist --> ref  my-wordlist
Now you can deal with the wordlist through the ref instance:
my-wordlist --> push
my-wordlist --> set-current
order
Ficl can also model linked lists and other structures that contain pointers to structures of the same or different types. The class constructor word ref: makes an aggregate reference to a particular class. See the instance variable glossary for an example.

Ficl can make arrays of instances, and aggregate arrays into class descripions. The class methods array and new-array create uninitialized and initialized arrays, respectively, of a class. In order to initialize an array, the class must define (or inherit) a reasonable init method. New-array invokes it on each member of the array in sequence from lowest to highest. Array instances and array members use the object methods index, next, and prev to navigate. Aggregate a member array of objects using array:. The objects are not automatically initialized in this case - your class initializer has to call array-init explicitly if you want this behavior.

For further examples of OOP in Ficl, please see the source file ficl/softwords/ficlclass.fr. This file wraps several Ficl internal data structures in objects and gives use examples.

Ficl String classes

c-string (ficl 2.04 and later) is a reasonably useful dynamic string class. Source code for the class is located in ficl/softwords/string.fr. Features: dynamic creation and resizing; deletion, concatenation, output, comparison; creation from quoted string constant (s").

Examples of use:

c-string --> new homer
s" In this house, " homer --> set
s" we obey the laws of thermodynamics!" homer --> cat
homer --> type

Early binding

Ficl also provides early binding if you ask for it. Early binding is not as safe as late binding, but it produces code that is more compact and efficient because it compiles method addresses rather then their names. In the preferred uses of early binding, the class is assumed to be the one you're defining. This kind of early binding can only be used inside a class definition. Early bound methods still expect to find a class and instance cell-pair on top of the stack when they run.
Here's an example that illustrates a potential problem:
object --> sub c1
: m1   { 2:this -- }  ." c1's m1" cr ;
: m2   { 2:this -- }  ." Running  " this  my=> m1 ; ( early )
: m3   { 2:this -- }  ." Running  " this --> m1     ( late )
end-class
c1     --> sub c2
: m1   { 2:this -- }  ." c2's m1" cr ;
end-class
c2 --> new i2
i2 --> m1   ( runs the m1 defined in c2 )
i2 --> m2   ( is this what you wanted? )
i2 --> m3   { runs the overridden m1)
Even though we overrode method m1 in class c2, the definition of m2 with early binding forced the use of m1 as defined in c1. If that's what you want, great, but more often you'll want the flexibility of overriding parent class behaviors appropriately. 
  1. my=> binds early to a method in the class being defined, as in the example above.
  2. my=[ ] binds a sequence of methods in the current class. Useful when the class has object members. Lines like this --> state --> set in the definition of c-led above can be replaced with this my=[ state set ] to get early binding.
  3. => (dangerous) pops a class off the stack and compiles the method in that class. Since you have to specify the class explicitly, there is a real danger that this will be out of sync with the class you really wanted. I recommend the my= operations.
Early binding using => is dangerous because it partially defeats the data-to-code matching mechanism object oriented languages were created to provide, but it does increase run-time speed by binding the method at compile time. In many cases, such as the init method, you can be reasonably certain of the class of thing you're working on. This is also true when invoking class methods, since all classes are instances of metaclass. Here's an example from the definition of metaclass in oo.fr (don't paste this into ficlWin - it's already there):
: new   \ ( class metaclass "name" -- )
    metaclass => instance --> init ;
Try this...
metaclass --> see new

Decompiling the method with SEE shows the difference between the two strategies. The early bound method is compiled inline, while the late-binding operator compiles the method name and code to find and execute it in the context of whatever class is supplied on the stack at run-time.
Notice that the primitive early-binding operator => requires a class at compile time. For this reason, classes are IMMEDIATE, meaning that they push their signature at compile time or run time. I'd recommend that you avoid early binding until you're very comfortable with Forth, object-oriented programming, and Ficl's OOP syntax.



Theory

All classes in Ficl are derived from the common base class OBJECT, as shown in the figure below. All classes are instances of METACLASS. This means that classes are objects, too. METACLASS implements the methods for messages sent to classes. Class methods create instances and subclasses, and give information about the class. Each class is represented by a data stucture of three elements:  In the figure below, METACLASS and OBJECT are real system-supplied classes. The others are contrived to illustrate the relationships among derived classes, instances, and the two system base classes. The dashed line with an arrow at the end indicates that the object/class at the arrow end is an instance of the class at the other end. The vertical line with a triangle denotes inheritance. 

Note for the curious: METACLASS behaves like a class - it responds to class messages and has the same properties as any other class. If you want to twist your brain in knots, you can think of METACLASS as an instance of itself. 
 


A Ficl object associates a class with an instance (the storage for one set of instance variables). This is done explicitly on Ficl's stack: any Ficl object is represented by a cell pair:

( instance-addr class-addr )
The instance-addr is the address of the object's storage, and the class-addr is the address of its class. Whenever a named Ficl object executes (eg. when you type its name and press enter at the Ficl prompt), it leaves this "signature". All methods by convention expect a class and instance on the stack when they execute, too. In many other OO languages, including C++, instances contain information about their classes (a vtable pointer, for example). By making this pairing explicit, Ficl can be OO about chunks of data that don't realize that they are objects, without sacrificing any robustness for native objects. That means that you can use Ficl to write object wrappers for data structures created in C, C++, or even assembly language, as long as you can determine how they're laid out in memory.
Whenever you create an object in Ficl, you specify its class. After that, the object always pushes its class and the address of its payload (instance variable space) when invoked by name.

Classes are special kinds of objects that store the methods of their instances, the size of an instance's payload, and a parent class pointer. Classes themselves are instances of a special base class called METACLASS, and all classes inherit from class OBJECT. While confusing at first, this gives Ficl a very simple syntax for constructing and using objects. Class methods include subclassing (SUB), creating initialized and uninitialized instances (NEW and INSTANCE), and creating reference instances (REF), described later. Classes also have methods for disassembling their methods (SEE), identifying themselves (ID), and listing their pedigree (PEDIGREE). All objects inherit (from OBJECT) methods for initializing instances and arrays of instances, for performing array operations, and for getting information about themselves.

Methods and messages

Methods are the functions that objects execute in response to messages. A message is a request to an object for a behavior that the object supports. When it receives a message, the target object looks up a method that performs the behavior for its class, and executes it. Any specific message may be bound to different methods in different objects, according to class. This separation of messages and methods allows objects to behave polymorphically. (In Ficl, methods are words defined in the context of a class, and messages are the names of those words.) Ficl classes associate messages with methods for their instances (a fancy way of saying that each class owns a wordlist). Ficl provides a late-binding operator --> that sends messages to objects at run-time, and an early-binding operator => that compiles a specific class's method. These operators are the only supported way to invoke methods. Regular Forth words are not visible to the method-binding operators, so there's no chance of confusing a message with a regular word of the same name.

OOP Glossary

Note: with the exception of the binding operators (the first two definitions here), all of the words in this section are internal factors that you don't need to worry about. These words provide method binding for all classes and instances. Also described are supporting words and execution factors. All are defined in softwords/oo.fr.
--> ( instance class "method-name" -- xn )
Late binding: looks up and executes the given method in the context of the class on top of the stack.
c-> ( instance class "method-name" -- xn exc )
Late binding with CATCH: looks up and CATCHes the given method in the context of the class on top of the stack, pushes zero or exception code upon return.
my=> comp: ( "method-name" -- )  exec: ( inst class -- xn )
Early binding: compiles code to execute the method of the class being defined. Only visible and valid in the scope of a --> sub .. end-class class definition.
my=[ comp: ( "obj1 obj2 .. method ]" -- ) exec:( inst class -- xn )
Early binding: compiles code to execute a chain of methods of the class being defined. Only visible and valid in the scope of a --> sub .. end-class class definition.
=> comp: ( class meta "method-name" -- ) exec: ( inst class -- xn )
Early binding: compiles code to execute the method of the class specified at compile time.
do-do-instance
When executed, causes the instance to push its ( instance class ) stack signature. Implementation factor of metaclass --> sub. Compiles .do-instance in the context of a class; .do-instance implements the does> part of a named instance.
exec-method ( instance class c-addr u -- xn )
Given the address and length of a message (method name) on the stack, finds the method in the context of the specified class and invokes it. Upon entry to the method, the instance and class are on top of the stack, as usual. If unable to find the method, prints an error message and aborts.
find-method-xt ( class "method-name" -- class xt )
Attempts to map the message to a method in the specified class. If successful, leaves the class and the execution token of the method on the stack. Otherwise prints an error message and aborts.
lookup-method ( class c-addr u -- class xt )
Given the address and length of a message (method name) on the stack, finds the method in the context of the specified class. If unable to find the method, prints an error message and aborts.
parse-method comp: ( "method-name" -- ) exec: ( -- c-addr u )
Parse "name" from the input stream and compile code to push its length and address when the enclosing definition runs.

Instance Variable Glossary

Note: these words are only visible when creating a subclass! To create a subclass, use the sub method on object or any class derived from it (not metaclass). Source code for Ficl OOP is in ficl/softwords/oo.fr. 
Instance variable words do two things: they create methods that do an action appropriate for the type of instance variable they represent, and they reserve space in the class template for the instance variable. We'll use the term instance variable to refer both to the method that gives access to a particular field of an object, and to the field itself. Rather than give esentially the same example over and over, here's one example that shows several of the instance variable construction words in use:
object subclass c-example
   cell:          .cell0
   c-4byte   obj: .nCells
 4 c-4byte array: .quad
            char: .length
79         chars: .name
end-clas
This class only defines instance variables, and it inherits some methods from object. Each untyped instance variable (.cell0, .length, .name) pushes its address when executed. Each object instance variable pushes the address and class of the aggregate object. Similar to C, an array instance variable leaves its base address (and its class) when executed. The word subclass is shorthand for --> sub
cell: ( offset "name" -- offset' )
Execution: ( -- cell-addr )
Create an untyped instance variable one cell wide. The instance variable leaves its payload's address when executed.
cells: ( offset nCells "name" -- offset' )
Execution: ( -- cell-addr )
Create an untyped instance variable n cells wide.
char: ( offset "name" -- offset' )
Execution: ( -- char-addr )
Create an untyped member variable one char wide
chars: ( offset nChars "name" -- offset' )
Execution: ( -- char-addr )
Create an untyped member variable n chars wide.
obj: ( offset class meta "name" -- offset' )
Execution: ( -- instance class )
Aggregate an uninitialized instance of class as a member variable of the class under construction.
array: ( offset n class meta "name" -- offset' )
Execution: ( -- instance class )
Aggregate an uninitialized array of instances of the class specified as a member variable of the class under construction.
ref: ( offset class meta "name" -- offset' )
Execution:  ( -- ref-instance ref-class )
Aggregate a reference to a class instance. There is no way to set the value of an aggregated ref - it's meant as a way to manipulate existing data structures with a Ficl OO model. For example, if your system contains a linked list of 4 byte quantities, you can make a class that represents a list element like this:
object subclass c-4list
c-4list ref: .link
c-4byte obj: .payload
end-class;

address-of-existing-list c-4list --> ref mylist

The last line binds the existing structure to an instance of the class we just created. The link method pushes the link value and the class c_4list, so that the link looks like an object to Ficl and like a struct to C (it doesn't carry any extra baggage for the object model - the Ficl methods alone take care of storing the class information).

Note: Since a ref: aggregate can only support one class, it's good for modeling static structures, but not appropriate for polymorphism. If you want polymorphism, aggregate a c_ref (see classes.fr for source) into your class - it has methods to set and get an object.

By the way, it is also possible to construct a pair of classes that contain aggregate pointers to each other. Here's an example:

object subclass akbar
suspend-class          \ put akbar on hold while we define jeff

object subclass jeff
    akbar ref: .significant-other
  ( your additional methods here )

end-class              \ done with jeff

akbar --> resume-class \ resume defining akbar
    jeff ref: .significant-other
  ( your additional methods here )
end-class              \ done with akbar

Class Methods Glossary

These words are methods of metaclass. They define the manipulations that can be performed on classes. Methods include various kinds of instantiation, programming tools, and access to member variables of classes. Source is in softwords/oo.fr.
instance ( class metaclass "name" -- instance class )
Create an uninitialized instance of the class, giving it the name specified. The method leaves the instance 's signature on the stack (handy if you want to initialize). Example:
c_ref --> instance uninit-ref  2drop
new ( class metaclass "name" -- )
Create an initialized instance of class, giving it the name specified. This method calls init to perform initialization.
array ( nObj class metaclass "name" -- nObjs instance class )
Create an array of nObj instances of the specified class. Instances are not initialized. Example:
c_4byte --> array  40-raw-bytes  2drop drop
new-array ( nObj class metaclass "name" -- )
Creates an initialized array of nObj instances of the class. Same syntax as array
alloc ( class metaclass -- instance class )
Creates an anonymous instance of class from the heap (using a call to ficlMalloc() to get the memory). Leaves the payload and class addresses on the stack. Usage example:
c-ref --> alloc  2constant instance-of-ref
Creates a double-cell constant that pushes the payload and class address of a heap instance of c-ref.
alloc-array ( nObj class metaclass -- instance class )
Same as new-array, but creates anonymous instances from the heap using a call to ficlMalloc(). Each instance is initialized using the class's init method
allot ( class metaclass -- instance class )
Creates an anonymous instance of class from the dictionary. Leaves the payload and class addresses on the stack. Usage example:
c-ref --> allot  2constant instance-of-ref
Creates a double-cell constant that pushes the payload and class address of a heap instance of c-ref.
allot-array ( nObj class metaclass -- instance class )
Same as new-array, but creates anonymous instances from the dictionary. Each instance is initialized using the class's init method
ref ( instance-addr class metaclass "name" -- )
Make a ref instance of the class that points to the supplied instance address. No new instance space is allotted. Instead, the instance refers to the address supplied on the stack forever afterward. For wrapping existing structures.
sub ( class metaclass -- old-wid addr[size] size )
Derive a subclass. You can add or override methods, and add instance variables. Alias: subclass. Examples:
c_4byte --> sub c_special4byte
( your new methods and instance variables here )
end-class

( --OR-- )

c_4byte subclass c_special4byte
( your new methods and instance variables here )
end-class
.size ( class metaclass -- instance-size )
Returns address of the class's instance size field, in address units. This is a metaclass member variable.
.super ( class metaclass -- superclass )
Returns address of the class's superclass field. This is a metaclass member variable.
.wid ( class metaclass -- wid )
Returns the address of the class's wordlist ID field. This is a metaclass member variable.
get-size
Returns the size of an instance of the class in address units. Imeplemented as
: get-size   metaclass => .size @ ;
get-wid
Returns the wordlist ID of the class. Implemented as
: get-wid   metaclass => .wid @ ;
get-super
Returns the class's superclass. Implemented as
: get-super   metaclass => .super @ ;
id ( class metaclass -- c-addr u )
Returns the address and length of a string that names the class.
methods ( class metaclass -- )
Lists methods of the class and all its superclasses
offset-of ( class metaclass "name" -- offset )
Pushes the offset from the instance base address of the named member variable. If the name is not that of an instance variable method, you get garbage. There is presently no way to detect this error. Example:
metaclass --> offset-of .wid
pedigree ( class metaclass -- )
Lists the pedigree of the class (inheritance trail)
see ( class metaclass "name" -- )
Decompiles the specified method - obect version of SEE, from the TOOLS wordset.
debug ( class metaclass "name" -- )
Invokes the debugger on the specified method - obect version of DEBUG.

OBJECT Methods Glossary

These are methods that are defined for all instances by the base class object. The methods include default initialization, array manipulations, aliases of class methods, upcasting, and programming tools.
init ( instance class -- )
Default initializer called automatically for all instances created with new or new-array. Zero-fills the instance. You do not normally need to invoke init explicitly.
array-init ( nObj instance class -- )
Applies init to an array of objects created by new-array. Note that array: does not cause aggregate arrays to be initialized automatically. You do not normally need to invoke array-init explicitly.
free ( instance class -- )
Releases memory used by an instance previously created with alloc or alloc-array. Note - this method is not presently protected against accidentally deleting something from the dictionary. If you do this, Bad Things are likely to happen. Be careful for the moment to apply free only to instances created with alloc or alloc-array.
class ( instance class -- class metaclass )
Convert an object signature into that of its class. Useful for calling class methods that have no object aliases.
super ( instance class -- instance parent-class )
Upcast an object to its parent class. The parent class of object is zero. Useful for invoking an overridden parent class method.
pedigree ( instance class -- )
Display an object's pedigree - its chain of inheritance. This is an alias for the corresponding class method.
size ( instance class -- sizeof(instance) )
Returns the size, in address units, of one instance. Does not know about arrays! This is an alias for the class method get-size
methods ( instance class -- )
Class method alias. Displays the list of methods of the class and all superclasses of the instance.
index ( n instance class -- instance[n] class )
Convert array-of-objects base signature into signature for array element n. No check for bounds overflow. Index is zero-based, like C, so:
0 my-obj --> index
\  is equivalent to
my-obj
Check out the description of -ROT for help in dealing with indices on the stack.
next ( instance[n] class -- instance[n+1] class )
Convert an array-object signature  into the signature of the next object in the array. No check for bounds overflow.
prev ( instance[n] class -- instance[n-1] class )
Convert an object signature into the signature of the previous object in the array. No check for bounds underflow.

Supplied Classes (See classes.fr)

metaclass
Describes all classes of Ficl. Contains class methods. Should never be directly instantiated or subclassed. Defined in oo.fr. Methods described above.
object
Mother of all Ficl objects. Defines default initialization and array indexing methods. Defined in oo.fr. Methods described above.
c-ref
Holds the signature of another object. Aggregate one of these into a data structure or container class to get polymorphic behavior. Methods & members:
get   ( inst class -- ref-inst ref-class )
set   ( ref-inst ref-class inst class -- )
.instance   \  cell member that holds the instance
      ( inst class -- a-addr ) 
.class      \  cell member that holds the class
      ( inst class -- a-addr )
c-byte
Primitive class derived from object, with a 1-byte payload. Set and get methods perform correct width fetch and store. Methods and members:
get   ( inst class -- c )
set   ( c inst class -- )
.payload    \ member holds instance's value
      ( inst class -- addr ) 

c-2byte
Primitive class derived from object, with a 2-byte payload. Set and get methods perform correct width fetch and store. Methods and members:
get   ( inst class -- 2byte )
set   ( 2byte inst class -- )
.payload   \ member holds instance's value
      ( inst class -- addr ) 
c-4byte
Primitive class derived from object, with a 4-byte payload. Set and get methods perform correct width fetch and store. Methods and members:
get   ( inst class -- x )
set   ( x inst class -- )
.payload    \ member holds instance's value
      ( inst class -- addr ) 
c-cell
Primitive class derived from object, with a cell payload (equivalent to c-4byte in 32 bit implementations, 64 bits wide on Alpha). Set and get methods perform correct width fetch and store. Methods and members:
get   ( inst class -- x )
set   ( x inst class -- )
.payload    \ member holds instance's value
      ( inst class -- addr ) 
c-ptr
Base class derived from object for pointers to non-object types. This class is not complete by itself: several methods depend on a derived class definition of @size. Methods and members:
.addr   ( inst class -- a-addr )
\  member variable - holds the pointer address

get-ptr   ( inst class -- ptr )
set-ptr   ( ptr inst class -- )
inc-ptr   ( inst class -- )
\ Adds @size to pointer address
dec-ptr   ( inst class -- )
\ Subtracts @size from pointer address

index-ptr   ( i inst class -- )
\ Adds i*@size to pointer address
c-bytePtr
Pointer to byte derived from c-ptr. Methods and members:
@size   ( inst class -- size )
\  Push size of the pointed-to thing

get   ( inst class -- c )
\ Fetch the pointer's referent byte

set   ( c inst class -- ) 
\ Store c at the pointer address
c-2bytePtr
Pointer to double byte derived from c-ptr. Methods and members:
@size   ( inst class -- size )
\  Push size of the pointed-to thing

get   ( inst class -- n )
\ Fetch the pointer's referent c-2byte

set   ( n inst class -- ) 
\ Store n at the pointer address
c-4bytePtr
Pointer to quad-byte derived from c-ptr. Methods and members:
@size   ( inst class -- size )
\  Push size of the pointed-to thing (a c-4byte)

get   ( inst class -- n )
\ Fetch the pointer's referent c-4byte

set   ( n inst class -- ) 
\ Store n at the pointer address
c-cellPtr
Pointer to cell derived from c-ptr. Methods and members:
@size   ( inst class -- size )
\  Push size of the pointed-to thing (a cell)

get   ( inst class -- x )
\ Fetch the pointer's referent cell

set   ( x inst class -- ) 
\ Store n at the pointer address
c-string (see string.fr)
Dynamically allocated string similar to MFC CString (Partial list of methods follows)
set ( c-addr u 2:this -- )
\ Initialize buffer to the specified string

get ( 2:this -- c-addr u ) 
\ Return buffer contents as counted string

cat ( c-addr u 2:this -- ) 
\ Append given string to end of buffer

compare ( 2string 2:this -- n )
\ Return result of lexical compare

type ( 2:this -- )
\ Print buffer to the output stream


hashcode ( 2:this -- x )
\ Return hashcode of string (as in dictionary)

free ( 2:this -- )
\ Release internal buffer
c-hashstring (see string.fr)
Derived from c-string. This class adds a hashcode member variable.