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
|
/*
* sl-merge.h: Part of GNU CSSC.
*
*
* Copyright (C) 1997, Free Software Foundation, Inc.
*
* 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, USA.
*
* CSSC was originally Based on MySC, by Ross Ridge, which was
* placed in the Public Domain.
*
*
* Merge and remove member functions of the template range_list.
*
* @(#) CSSC sl-merge.c 1.1 93/11/09 17:18:03
*
*/
#include "cssc.h"
#include "sid.h"
#include "sid_list.h"
#ifndef CSSC__SL_MERGE_H__
#define CSSC__SL_MERGE_H__
template <class TYPE>
range_list<TYPE> &
range_list<TYPE>::merge(range_list<TYPE> const &list) {
if (!valid() || !list.valid()) {
return *this;
}
range<TYPE> *sp = list.head;
if (sp == NULL) {
return *this;
}
ASSERT(valid());
sp = do_copy_list(sp);
if (head == NULL) {
head = sp;
} else {
range<TYPE> *dp = head;
while(dp->next != NULL) {
dp = dp->next;
}
dp->next = sp;
}
clean();
return *this;
}
template <class TYPE>
range_list<TYPE> &
range_list<TYPE>::remove(range_list<TYPE> const &list) {
if (!valid() || !list.valid()) {
return *this;
}
range<TYPE> *sp = list.head;
if (sp == NULL) {
return *this;
}
if (head == NULL) {
return *this;
}
while(sp != NULL) {
range<TYPE> *dp = head;
while(dp != NULL) {
if (sp->from <= dp->from
&& sp->to >= dp->from) {
dp->from = sp->to;
++dp->from;
}
if (sp->to >= dp->to
&& sp->from <= dp->to) {
dp->to = sp->from;
--dp->to;
}
if (sp->from > dp->from && sp->to < dp->to) {
range<TYPE> *p = new range<TYPE>;
p->from = dp->from;
p->to = sp->from;
--p->to;
sp->from = dp->to;
++sp->from;
p->next = head->next;
head = p;
}
dp = dp->next;
}
sp = sp->next;
}
clean();
return *this;
}
#endif /* __SL_MERGE_C__ */
/* Local variables: */
/* mode: c++ */
/* End: */
|
