minString

Section: OATH Reference Manual (3O)
Updated: 26 August 1991
Index Return to Main Contents
 

NAME

minString (minStringA, minStringG, pMinStringG, dlMinStringG) - a spatially minimizing string implementation  

SYNOPSIS

#include <oath/minString.h>  

DESCRIPTION

The minString is a spatially optimizing implementation of abstract type string. If the minString is a const string, it is represented as a pMinStringG which contains a simple char*. In this form modification is not possible.

Non-const minStrings are represented as a dlMinStringG which contains a doubly-linked list of nodes (n.b. this is not a dlList). The linked-list implmentation is made up of dlcNodeP's, which contain pointers to the next dlcNodeP, the previous dlcNodeP, and a characterA which is said to be "at" or in front of that node.  

DERIVATION

minString : string : list : deq : fifoQueue : seq : queue : bag : obj

minString is an implementation type.  

STATIC OPERATIONS

minStringA minStringA:: isa (objA)
minStringA::isa(O) returns O if it is truly a minString; otherwise it returns Nil.
 

INTERNAL OPERATIONS

 

MEMBER OPERATIONS

 

SEE ALSO

OATH(3O), list(3O), minStringPos(3O), character(3O)  

AUTHOR

Brian M. Kennedy (Computer Science Center, Texas Instruments Incorporated)  

BUGS

The virtual functions lowercase and uppercase are not implemented.


 

Index

NAME
SYNOPSIS
DESCRIPTION
DERIVATION
STATIC OPERATIONS
INTERNAL OPERATIONS
MEMBER OPERATIONS
SEE ALSO
AUTHOR
BUGS

This document was created by man2html, using the manual pages.
Time: 20:37:49 GMT, July 24, 2024