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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
* task.h
*
* Fri Feb 24 08:16:29 CET 2012
* Copyright 2012 Bent Bisballe Nyeng
* deva@aasimon.org
****************************************************************************/
/*
* This file is part of Munia.
*
* Munia is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Munia 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 Munia; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#ifndef __MUNIA_TASK_H__
#define __MUNIA_TASK_H__
#include <list>
#include <string>
#include <stdio.h>
#include <assert.h>
//#include <queue>
/*
Task:
id
subtasks
// tags
title
description
// primary_assignment
// secondary_assignment
Protocol:
Server -> client:
update [id] [title] [description];
move [id] [x] [y];
add [id] [title] [description] [x] [y];
del [id]
Client -> server:
update [id] [title] [description];
move [id] [x] [y];
add [title] [description] [x] [y];
del [id]
title and description are " encapsulated utf-8 string with " escaped with a backslash.
x and y are integers as strings
id are an integer as a string
*/
/*
typedef struct {
int x, y;
int id;
std::string title;
std::string desc;
} task_t;
*/
/*
protocol:
add_task title description parent_id
del_task id
update_task id title description
move_task id parent
copy_task id parent
*/
typedef struct {
int id;
int parent_id;
std::string title;
std::string desc;
} task_t;
//typedef std::list<task_t> TaskList;
class CompareByParentid {
public:
bool operator()(const task_t &a, const task_t &b) const {
return a.parent_id < b.parent_id;
}
};
class TaskList : public std::list<task_t>{
public:
TaskList() {}
~TaskList(){}
void insert(task_t t) {
printf("inserting task %d with parent %d\n", t.id, t.parent_id);
if(t.parent_id == -1) {
std::list<task_t>::push_front(t);
return;
}
std::list<task_t>::iterator it;
for(it = begin(); it != end(); ++it) {
printf("\tcomparing %d and %d\n", t.parent_id, it->id);
if(t.parent_id == it->id) {
break;
}
}
assert(it != end());
std::list<task_t>::insert(++it, t);
// std::list<task_t>::push_back(t);
// std::list<task_t>::sort(CompareByParentid());
}
void move(task_t t) {
std::list<task_t>::iterator it;
for(it = begin(); it != end(); it++) {
if(t.id == it->id) {
break;
}
}
assert(it != end());
// if(it != end()) {
std::list<task_t>::erase(it);
// }
insert(t);
}
void push_back(task_t t) {
insert(t);
}
private:
std::list<task_t> list;
};
extern TaskList tasklist;
//typedef std::priority_queue<task_t, std::vector<task_t>, CompareByParentid> TaskList;
task_t create_task(std::string title, std::string desc,
/*int x, int y*/ int parent_id);
TaskList load_tasklist_from_file(std::string file);
bool save_tasklist_to_file(TaskList t, std::string file);
#endif/*__MUNIA_TASK_H__*/
|
