-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathList.cpp
More file actions
149 lines (114 loc) · 2.76 KB
/
List.cpp
File metadata and controls
149 lines (114 loc) · 2.76 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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
/*
Rf433 - Arduino libary to transmit arbitrary RF433 signals
Copyright (c) 2018 François Terrier. All right reserved.
Contributors:
- François Terrier / fterrier(at)gmail(dot)com
Project home: https://github.com/fterrier/dwarf433
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "List.h"
#include <Arduino.h>
// List
List::List() {
List(1);
}
List::List(int s) {
maxSize = s;
currentSize = 0;
iteratorSize = 0;
iterators = new Iterator*[0];
head = new Elem;
head->value = NULL;
head->next = NULL;
curr = head;
}
List::~List() {
iteratorSize = 0;
delete [] iterators;
iterators = new Iterator*[0];
volatile Elem *r = head;
while (r != NULL) {
volatile Elem *n = r->next;
delete r;
r = n;
}
currentSize = 0;
}
void List::shrink() {
volatile Elem *r = head->next;
for (int i=0;i<iteratorSize;i++) {
Iterator *it = iterators[i];
if (it->atElem(r)) {
it->reset(head);
}
}
head->next = r->next;
currentSize = currentSize - 1;
delete r;
}
bool List::addInt(int value) {
volatile Elem *elem = new Elem;
if (elem == NULL) {
shrink();
return false;
}
elem->value = value;
elem->next = NULL;
curr->next = elem;
curr = elem;
currentSize = currentSize + 1;
if (currentSize == maxSize) {
shrink();
}
return true;
}
Iterator* List::iterator() {
Iterator *it = new Iterator(head);
Iterator **its= new Iterator*[iteratorSize + 1];
memcpy(its, iterators, iteratorSize*sizeof(Iterator*));
its[iteratorSize] = it;
iteratorSize = iteratorSize + 1;
delete [] iterators;
iterators = its;
return it;
}
int List::len() {
return currentSize;
}
// Iterator
Iterator::Iterator() {
elem = NULL;
head = false;
}
Iterator::Iterator(volatile Elem *e) {
elem = e;
head = true;
}
bool Iterator::atHead() {
return head;
}
void Iterator::reset(volatile Elem *e) {
head = true;
elem = e;
}
bool Iterator::atElem(volatile Elem *e) {
return elem == e;
}
int Iterator::next() {
head = false;
elem = elem->next;
return elem->value;
}
bool Iterator::hasNext() {
return elem->next != NULL;
}