Ignore:
Timestamp:
Nov 23, 2000, 7:36:41 PM (25 years ago)
Author:
umoeller
Message:

Updates for V0.9.6.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/include/helpers/tree.h

    r7 r13  
     1
     2/*
     3 *@@sourcefile tree.h:
     4 *      header file for tree.c (red-black balanced binary trees).
     5 *      See remarks there.
     6 */
     7
     8/*
     9 *      Written:    97/11/18  Jonathan Schultz <jonathan@imatix.com>
     10 *      Revised:    98/12/08  Jonathan Schultz <jonathan@imatix.com>
     11 *
     12 *      Copyright (C) 1991-99 iMatix Corporation.
     13 *      Copyright (C) 2000 Ulrich M”ller.
     14 *      This file is part of the XWorkplace source package.
     15 *      XWorkplace is free software; you can redistribute it and/or modify
     16 *      it under the terms of the GNU General Public License as published
     17 *      by the Free Software Foundation, in version 2 as it comes in the
     18 *      "COPYING" file of the XWorkplace main distribution.
     19 *      This program is distributed in the hope that it will be useful,
     20 *      but WITHOUT ANY WARRANTY; without even the implied warranty of
     21 *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     22 *      GNU General Public License for more details.
     23 */
     24
     25
    126/*  ----------------------------------------------------------------<Prolog>-
    227    Name:       sfltree.h
     
    5277     *@@ TREE:
    5378     *      tree node.
     79     *
     80     *      To use the tree functions, all your structures
     81     *      must have a TREE structure as their first member.
     82     *
     83     *      Example:
     84     *
     85     +      typedef struct _MYTREENODE
     86     +      {
     87     +          TREE        tree;
     88     +          char        acMyData[1000];
     89     +      } MYTREENODE, *PMYTREENODE;
     90     *
     91     *      See tree.c for an introduction to the tree functions.
    5492     */
    5593
     
    6199        unsigned long   id;
    62100        TREE_COLOUR     colour;
    63     } TREE;
     101    } TREE, *PTREE;
    64102
    65103    // The tree algorithm needs to know how to sort the data.
Note: See TracChangeset for help on using the changeset viewer.