Return to tree.h CVS log

Up to [WindowsNT SDKs] / mstools / samples / sdktools / windiff

Annotation of mstools/samples/sdktools/windiff/tree.h, revision 1.1.1.1

1.1       root        1: 
                      2: /******************************************************************************\
                      3: *       This is a part of the Microsoft Source Code Samples. 
                      4: *       Copyright (C) 1993 Microsoft Corporation.
                      5: *       All rights reserved. 
                      6: *       This source code is only intended as a supplement to 
                      7: *       Microsoft Development Tools and/or WinHelp documentation.
                      8: *       See these sources for detailed information regarding the 
                      9: *       Microsoft samples programs.
                     10: \******************************************************************************/
                     11: 
                     12: /*
                     13:  * TREE.H
                     14:  *
                     15:  * NOTE: include gutils.h before this.
                     16:  */
                     17: 
                     18: /* handle for a tree */
                     19: typedef struct tree FAR * TREE;
                     20: 
                     21: /* keys in these trees are DWORDs */
                     22: typedef DWORD TREEKEY;
                     23: 
                     24: /* A place-holder understood only by tree_search and
                     25:  * tree_addafter
                     26:  */
                     27: typedef struct treeitem FAR * TREEITEM;
                     28: 
                     29: /* pointer to one of these place holders */
                     30: typedef TREEITEM FAR * PTREEITEM;
                     31: 
                     32: 
                     33: TREE APIENTRY tree_create(HANDLE hHeap);
                     34: void APIENTRY tree_delete(TREE tree);
                     35: LPVOID APIENTRY tree_update(TREE tree, TREEKEY key, LPVOID value, UINT length);
                     36: LPVOID APIENTRY tree_find(TREE tree, TREEKEY key);
                     37: LPVOID APIENTRY tree_search(TREE tree, TREEKEY key, PTREEITEM place);
                     38: LPVOID APIENTRY tree_addafter(TREE tree, PTREEITEM place, TREEKEY key, LPVOID value,
                     39:                         UINT length);
                     40: TREE APIENTRY ctree_create(HANDLE hHeap);
                     41: void APIENTRY ctree_delete(TREE tree);
                     42: LPVOID APIENTRY ctree_update(TREE tree, TREEKEY key, LPVOID value, UINT length);
                     43: long APIENTRY ctree_getcount(TREE tree, TREEKEY key);
                     44: LPVOID APIENTRY ctree_find(TREE tree, TREEKEY key);

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