[176] | 1 | // -*- C++ -*- |
---|
| 2 | |
---|
| 3 | /* |
---|
| 4 | |
---|
| 5 | Heap Layers: An Extensible Memory Allocation Infrastructure |
---|
| 6 | |
---|
| 7 | Copyright (C) 2000-2003 by Emery Berger |
---|
| 8 | http://www.cs.umass.edu/~emery |
---|
| 9 | emery@cs.umass.edu |
---|
| 10 | |
---|
| 11 | This program is free software; you can redistribute it and/or modify |
---|
| 12 | it under the terms of the GNU General Public License as published by |
---|
| 13 | the Free Software Foundation; either version 2 of the License, or |
---|
| 14 | (at your option) any later version. |
---|
| 15 | |
---|
| 16 | This program is distributed in the hope that it will be useful, |
---|
| 17 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 18 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 19 | GNU General Public License for more details. |
---|
| 20 | |
---|
| 21 | You should have received a copy of the GNU General Public License |
---|
| 22 | along with this program; if not, write to the Free Software |
---|
| 23 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
---|
| 24 | |
---|
| 25 | */ |
---|
| 26 | |
---|
| 27 | #ifndef _SLLIST_H_ |
---|
| 28 | #define _SLLIST_H_ |
---|
| 29 | |
---|
| 30 | #include <assert.h> |
---|
| 31 | |
---|
| 32 | /** |
---|
| 33 | * @class SLList |
---|
| 34 | * @brief A "memory neutral" singly-linked list. |
---|
| 35 | * @author Emery Berger |
---|
| 36 | */ |
---|
| 37 | |
---|
| 38 | namespace HL { |
---|
| 39 | |
---|
| 40 | class SLList { |
---|
| 41 | public: |
---|
| 42 | |
---|
| 43 | inline SLList (void) { |
---|
| 44 | clear(); |
---|
| 45 | } |
---|
| 46 | |
---|
| 47 | class Entry; |
---|
| 48 | |
---|
| 49 | /// Clear the list. |
---|
| 50 | inline void clear (void) { |
---|
| 51 | head.next = NULL; |
---|
| 52 | } |
---|
| 53 | |
---|
| 54 | /// Get the head of the list. |
---|
| 55 | inline Entry * get (void) { |
---|
| 56 | const Entry * e = head.next; |
---|
| 57 | if (e == NULL) { |
---|
| 58 | return NULL; |
---|
| 59 | } |
---|
| 60 | head.next = e->next; |
---|
| 61 | return (Entry *) e; |
---|
| 62 | } |
---|
| 63 | |
---|
| 64 | private: |
---|
| 65 | |
---|
| 66 | /** |
---|
| 67 | * @brief Remove one item from the list. |
---|
| 68 | * @warning This method aborts the program if called. |
---|
| 69 | */ |
---|
| 70 | inline void remove (Entry *) { |
---|
| 71 | abort(); |
---|
| 72 | } |
---|
| 73 | |
---|
| 74 | public: |
---|
| 75 | |
---|
| 76 | /// Inserts an entry into the head of the list. |
---|
| 77 | inline void insert (Entry * e) { |
---|
| 78 | e->next = head.next; |
---|
| 79 | head.next = e; |
---|
| 80 | } |
---|
| 81 | |
---|
| 82 | /// An entry in the list. |
---|
| 83 | class Entry { |
---|
| 84 | public: |
---|
| 85 | inline Entry (void) |
---|
| 86 | : next (NULL) |
---|
| 87 | {} |
---|
| 88 | // private: |
---|
| 89 | // Entry * prev; |
---|
| 90 | public: |
---|
| 91 | Entry * next; |
---|
| 92 | }; |
---|
| 93 | |
---|
| 94 | private: |
---|
| 95 | |
---|
| 96 | /// The head of the list. |
---|
| 97 | Entry head; |
---|
| 98 | |
---|
| 99 | }; |
---|
| 100 | |
---|
| 101 | } |
---|
| 102 | |
---|
| 103 | #endif |
---|