LINK.H 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172
  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. // TiberianDawn.DLL and RedAlert.dll and corresponding source code is distributed
  9. // in the hope that it will be useful, but with permitted additional restrictions
  10. // under Section 7 of the GPL. See the GNU General Public License in LICENSE.TXT
  11. // distributed with this program. You should have received a copy of the
  12. // GNU General Public License along with permitted additional restrictions
  13. // with this program. If not, see https://github.com/electronicarts/CnC_Remastered_Collection
  14. /* $Header: /CounterStrike/LINK.H 1 3/03/97 10:25a Joe_bostic $ */
  15. /***********************************************************************************************
  16. *** 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 ***
  17. ***********************************************************************************************
  18. * *
  19. * Project Name : Command & Conquer *
  20. * *
  21. * File Name : LINK.H *
  22. * *
  23. * Programmer : Joe L. Bostic *
  24. * *
  25. * Start Date : 01/15/95 *
  26. * *
  27. * Last Update : January 15, 1995 [JLB] *
  28. * *
  29. *---------------------------------------------------------------------------------------------*
  30. * Functions: *
  31. * - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
  32. #ifndef LINK_H
  33. #define LINK_H
  34. /*
  35. ** This implements a simple linked list. It is possible to add, remove, and traverse the
  36. ** list. Since this is a doubly linked list, it is possible to remove an entry from the
  37. ** middle of an existing list.
  38. */
  39. class LinkClass
  40. {
  41. public:
  42. LinkClass(NoInitClass const &) {};
  43. LinkClass(void) : Next(0), Prev(0) {};
  44. virtual ~LinkClass(void);
  45. virtual LinkClass * Get_Next(void) const;
  46. virtual LinkClass * Get_Prev(void) const;
  47. virtual LinkClass & Add(LinkClass & object);
  48. virtual LinkClass & Add_Tail(LinkClass & object);
  49. virtual LinkClass & Add_Head(LinkClass & object);
  50. virtual LinkClass & Head_Of_List(void);
  51. virtual LinkClass & Tail_Of_List(void);
  52. virtual void Zap(void);
  53. virtual LinkClass * Remove(void);
  54. LinkClass & operator=(LinkClass const & link); // Assignment operator.
  55. LinkClass(LinkClass const & link); // Copy constructor.
  56. private:
  57. /*
  58. ** Pointers to previous and next link objects in chain.
  59. */
  60. LinkClass * Next;
  61. LinkClass * Prev;
  62. };
  63. #endif