GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — livecode/engine/src/datastructures.h at develop · livecode/livecode
This repository was archived by the owner on Aug 31, 2021. It is now read-only.
Expand file tree/ Copy pathdatastructures.hMore file actions 104 lines (89 loc) · 1.62 KB / Copy pathdatastructures.hFile metadata and controls104 lines (89 loc) · 1.62 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 /* Copyright (C) 2003-2015 LiveCode Ltd. This file is part of LiveCode. LiveCode is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License v3 as published by the Free Software Foundation. LiveCode is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with LiveCode. If not see <http://www.gnu.org/licenses/>. */ template <typename T> struct MCLinkedListNode { private: MCLinkedListNode *m_next; T m_data; public: MCLinkedListNode(T p_data = NULL) { m_next = NULL; m_data = p_data; } void clear() { if (m_next != NULL) { m_next->clear(); delete m_next; m_next = NULL; } } MCLinkedListNode *next() { return m_next; } T data() { return m_data; } void append(T p_data) { if (m_next == NULL) m_next = new MCLinkedListNode(p_data); else m_next->append(p_data); } }; template<typename T> struct MCLinkedList { private: MCLinkedListNode<T> *m_first; uint4 m_length; public: MCLinkedList<T>() { m_first = NULL; m_length = 0; } ~MCLinkedList<T>() { clear(); } uint4 length() { return m_length; } MCLinkedListNode<T> *first() { return m_first; } void append(T p_data) { if (m_first == NULL) m_first = new MCLinkedListNode<T>(p_data); else m_first->append(p_data); } void clear() { if (m_first != NULL) { m_first->clear(); delete m_first; m_first = NULL; } } }; |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |