item.h
来自「Binary Search Tree - with additional rec」· C头文件 代码 · 共 30 行
H
30 行
//item.h - header file for item and key definition.#include <stdio.h>#ifndef _ITEM_H#define _ITEM_Htypedef struct { int num; char name[30];} workerRec;typedef workerRec Item;typedef int Key;typedef int BOOL;#define EQ(key1, key2) (((key1) > (key2)) - ((key1) < (key2)))
// here can the user change the Equal parameter
// then when he want check EQ() with two strings or
// anything other.
#define ZERO 0#define ZERO_SMALLER (-1)
#define ZERO_GREATER 1
#define ERROR() fprintf(stderr, "Error...\n");#endif //_ITEM_H
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?