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
|
package todolist
import "sort"
type TodoList struct {
Data []*Todo
}
func (t *TodoList) Load(todos []*Todo) {
t.Data = todos
}
func (t *TodoList) Add(todo *Todo) {
todo.Id = t.NextId()
t.Data = append(t.Data, todo)
}
func (t *TodoList) Delete(id int) {
i := -1
for index, todo := range t.Data {
if todo.Id == id {
i = index
}
}
t.Data = append(t.Data[:i], t.Data[i+1:]...)
}
func (t *TodoList) Complete(id int) {
todo := t.FindById(id)
todo.Complete()
t.Delete(id)
t.Data = append(t.Data, todo)
}
func (t *TodoList) Uncomplete(id int) {
todo := t.FindById(id)
todo.Uncomplete()
t.Delete(id)
t.Data = append(t.Data, todo)
}
func (t *TodoList) Archive(id int) {
todo := t.FindById(id)
todo.Archived = true
t.Delete(id)
t.Data = append(t.Data, todo)
}
func (t *TodoList) Unarchive(id int) {
todo := t.FindById(id)
todo.Archived = false
t.Delete(id)
t.Data = append(t.Data, todo)
}
func (t *TodoList) IndexOf(todoToFind *Todo) int {
for i, todo := range t.Data {
if todo.Id == todoToFind.Id {
return i
}
}
return -1
}
func (t *TodoList) Prioritize(id int) {
todo := t.FindById(id)
todo.IsPriority = true
t.Delete(id)
t.Data = append(t.Data, todo)
}
func (t *TodoList) Unprioritize(id int) {
todo := t.FindById(id)
todo.IsPriority = false
t.Delete(id)
t.Data = append(t.Data, todo)
}
type ByDate []*Todo
func (a ByDate) Len() int { return len(a) }
func (a ByDate) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a ByDate) Less(i, j int) bool {
t1Due := a[i].CalculateDueTime()
t2Due := a[j].CalculateDueTime()
return t1Due.Before(t2Due)
}
func (t *TodoList) Todos() []*Todo {
sort.Sort(ByDate(t.Data))
return t.Data
}
func (t *TodoList) MaxId() int {
maxId := 0
for _, todo := range t.Data {
if todo.Id > maxId {
maxId = todo.Id
}
}
return maxId
}
func (t *TodoList) NextId() int {
var found bool
maxID := t.MaxId()
for i := 1; i <= maxID; i++ {
found = false
for _, todo := range t.Data {
if todo.Id == i {
found = true
break
}
}
if !found {
return i
}
}
return maxID + 1
}
func (t *TodoList) FindById(id int) *Todo {
for _, todo := range t.Data {
if todo.Id == id {
return todo
}
}
return nil
}
func (t *TodoList) GarbageCollect() {
var toDelete []*Todo
for _, todo := range t.Data {
if todo.Archived {
toDelete = append(toDelete, todo)
}
}
for _, todo := range toDelete {
t.Delete(todo.Id)
}
}
|
