Annotation of mstools/samples/gdidemo/maze.h, revision 1.1

1.1     ! root        1: /*---------------------------------------------------------------------------*\
        !             2: | MAZE DEMO HEADER FILE
        !             3: |
        !             4: |
        !             5: | created: 31-Oct-90
        !             6: | history: 31-Oct-90 <chriswil> created.
        !             7: |
        !             8: \*---------------------------------------------------------------------------*/
        !             9: 
        !            10: #ifdef WIN16
        !            11: #define APIENTRY FAR PASCAL
        !            12: typedef WORD WPARAM;
        !            13: //#else
        !            14: //typedef DWORD WPARAM;
        !            15: #endif
        !            16: 
        !            17: 
        !            18: #define MAZECLASS  "MAZEDEMO"
        !            19: #define MAZETITLE  "Maze Demo"
        !            20: 
        !            21: 
        !            22: typedef struct _MAZEDATA
        !            23: {
        !            24:     int nMaze;
        !            25: } MAZEDATA;
        !            26: typedef MAZEDATA      *PMAZEDATA;
        !            27: typedef MAZEDATA NEAR *NPMAZEDATA;
        !            28: typedef MAZEDATA FAR  *LPMAZEDATA;
        !            29: 
        !            30: 
        !            31: /*
        !            32: ** MAZE WINDOW ROUTINES (maze.c)
        !            33: */
        !            34: HWND  FAR      CreateMazeWindow(HWND,int);
        !            35: LONG  APIENTRY MazeProc(HWND,UINT,WPARAM,LONG);
        !            36: BOOL           MazeCreateProc(HWND);
        !            37: VOID           MazeDestroyProc(HWND);
        !            38: BOOL           MazeCommandProc(HWND,WPARAM,LONG);
        !            39: VOID           MazePaintProc(HWND);
        !            40: 
        !            41: 
        !            42: VOID DrawMaze(HWND);

unix.superglobalmegacorp.com

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