Return to B1tlt.h CVS log

Up to [CSRG BSD Unix] / 43BSD / contrib / B / src / bsmall

Annotation of 43BSD/contrib/B/src/bsmall/B1tlt.h, revision 1.1.1.1

1.1       root        1: /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1984. */
                      2: /* $Header: B1tlt.h,v 1.1 84/06/28 00:48:39 timo Exp $ */
                      3: 
                      4: /************************************************************************/
                      5: /* Private definitions for small texts, lists and tables module         */
                      6: /* A text is modelled as a sequence of len characters.                  */
                      7: /*                                                                      */
                      8: /* A list is modelled as a sequence of len values,                      */
                      9: /*         each of which corresponds to a list entry.                   */
                     10: /*                                                                      */
                     11: /* A table is modelled as a sequence of len values,                     */
                     12: /*         each of which corresponds to a table entry;                  */
                     13: /*     table entries are modelled as a compound with two fields.        */
                     14: /************************************************************************/
                     15: 
                     16: #define Cts(v) (*Ats(v))
                     17: #define Dts(v) (*(Ats(v)+1))
                     18: 
                     19: #define List_elem(l, i) (*(Ats(l)+i)) /*counts from 0; takes no copy*/
                     20: #define Key(t, i) (Ats(*(Ats(t)+i))) /*Ditto*/
                     21: #define Assoc(t, i) (Ats(*(Ats(t)+i))+1) /*Ditto*/
                     22: 
                     23: bool found();
                     24: value list_elem();
                     25: value key_elem();

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.