LINK.H (3831B)
1 // 2 // Copyright 2020 Electronic Arts Inc. 3 // 4 // TiberianDawn.DLL and RedAlert.dll and corresponding source code is free 5 // software: you can redistribute it and/or modify it under the terms of 6 // the GNU General Public License as published by the Free Software Foundation, 7 // either version 3 of the License, or (at your option) any later version. 8 9 // TiberianDawn.DLL and RedAlert.dll and corresponding source code is distributed 10 // in the hope that it will be useful, but with permitted additional restrictions 11 // under Section 7 of the GPL. See the GNU General Public License in LICENSE.TXT 12 // distributed with this program. You should have received a copy of the 13 // GNU General Public License along with permitted additional restrictions 14 // with this program. If not, see https://github.com/electronicarts/CnC_Remastered_Collection 15 16 /* $Header: F:\projects\c&c\vcs\code\link.h_v 2.17 16 Oct 1995 16:45:52 JOE_BOSTIC $ */ 17 /*********************************************************************************************** 18 *** C O N F I D E N T I A L --- W E S T W O O D S T U D I O S *** 19 *********************************************************************************************** 20 * * 21 * Project Name : Command & Conquer * 22 * * 23 * File Name : LINK.H * 24 * * 25 * Programmer : Joe L. Bostic * 26 * * 27 * Start Date : 01/15/95 * 28 * * 29 * Last Update : January 15, 1995 [JLB] * 30 * * 31 *---------------------------------------------------------------------------------------------* 32 * Functions: * 33 * - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ 34 35 #ifndef LINK_H 36 #define LINK_H 37 38 /* 39 ** This implements a simple linked list. It is possible to add, remove, and traverse the 40 ** list. Since this is a doubly linked list, it is possible to remove an entry from the 41 ** middle of an existing list. 42 */ 43 class LinkClass 44 { 45 public: 46 LinkClass(void); 47 virtual ~LinkClass(void); 48 49 virtual LinkClass * Get_Next(void) const; 50 virtual LinkClass * Get_Prev(void) const; 51 virtual LinkClass & Add(LinkClass & object); 52 virtual LinkClass & Add_Tail(LinkClass & object); 53 virtual LinkClass & Add_Head(LinkClass & object); 54 virtual LinkClass const & Head_Of_List(void) const; 55 virtual LinkClass & Head_Of_List(void) 56 { 57 return (LinkClass &)(((LinkClass const *)this)->Head_Of_List()); 58 }; 59 virtual LinkClass const & Tail_Of_List(void) const; 60 virtual LinkClass & Tail_Of_List(void) 61 { 62 return (LinkClass &)(((LinkClass const *)this)->Tail_Of_List()); 63 }; 64 virtual void Zap(void); 65 virtual LinkClass * Remove(void); 66 67 LinkClass & operator=(LinkClass & link); // Assignment operator. 68 LinkClass(LinkClass & link); // Copy constructor. 69 70 private: 71 /* 72 ** Pointers to previous and next link objects in chain. 73 */ 74 LinkClass * Next; 75 LinkClass * Prev; 76 }; 77 78 #endif