-
Notifications
You must be signed in to change notification settings - Fork 0
/
header.cpp
executable file
·152 lines (126 loc) · 3.46 KB
/
header.cpp
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
/* mDownloader - a multiple-threads downloading accelerator program that is based on Myget.
* Homepage: http://qinchuan.me/article.php?id=100
* 2015 By Richard (qc2105@qq.com)
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* Myget - A download accelerator for GNU/Linux
* Homepage: http://myget.sf.net
* 2005 by xiaosuo
*/
#include <cstring>
#include <cassert>
#include "header.h"
#include "utils.h"
/*********************************************
* class HeadDataNode implement
* *******************************************/
//HeadDataNode::HeadDataNode(const HeadDataNode &that);
HeadDataNode::~HeadDataNode()
{
//delete[] attrName;
//delete[] attrValue;
};
//HeadDataNode&
//HeadDataNode::operator = (const HeadDataNode &that);
/*******************************************
* class HeadData implement
*******************************************/
//HeadData::HeadData(const HeadDataNode &that);
HeadData::~HeadData()
{
HeadDataNode *it;
for(it = head; it != NULL; it = it->next){
//delete it;
}
};
//HeadData&
//HeadData::operator = (const HeadData&that);
const char*
HeadData::get_attr(const char *attrName)
{
HeadDataNode *it;
assert(attrName != NULL);
for(it = head; it != NULL; it = it->next){
if(strcmp(attrName, it->attrName) == 0)
return it->attrValue;
}
return NULL;
}
int
HeadData::set_attr(const char *attrName, const char *attrValue)
{
HeadDataNode *it;
assert(attrName != NULL && attrValue != NULL);
for(it = head; it != NULL; it = it->next){
if(strcmp(attrName, it->attrName) == 0)
break;
}
if(it != NULL){
delete[] it->attrValue;
it->attrValue = StrDup(attrValue);
return 0;
}else{
it = new HeadDataNode;
it->attrName = StrDup(attrName);
it->attrValue = StrDup(attrValue);
it->next = head;
head = it;
return 1;
}
};
int
HeadData::remove_attr(const char *attrName)
{
HeadDataNode *it;
assert(attrName != NULL);
for(it = head; it != NULL; it = it->next){
if(strcmp(attrName, it->attrName) == 0)
break;
}
if(it != NULL){
if(it == head){
head = it->next;
delete it;
}else{
HeadDataNode *pre;
for(pre = head; pre->next != it; it = it->next) ;
pre->next = it->next;
delete it;
}
return 0;
}else{
return 1;
}
};
void
HeadData::remove_all()
{
HeadDataNode *it;
for(it = head; it != NULL; it = it->next){
delete it;
}
head = NULL;
};
int
HeadData::traversal( int(*trav_fun)(HeadDataNode*) )
{
HeadDataNode *it;
int ret;
for(it = head; it != NULL; it = it->next){
if((ret=trav_fun(it)) != 0) return ret;
}
return 0;
};