Debian Codegraph @

cuneiform_src/Kern/lns32/src/rbambuk.cpp

raw
1 /*
2 Copyright (c) 1993-2008, Cognitive Technologies
3 All rights reserved.
4
5 Разрешается повторное распространение и использование как в виде исходного кода,
6 так и в двоичной форме, с изменениями или без, при соблюдении следующих условий:
7
8 * При повторном распространении исходного кода должны оставаться указанное
9 выше уведомление об авторском праве, этот список условий и последующий
10 отказ от гарантий.
11 * При повторном распространении двоичного кода в документации и/или в
12 других материалах, поставляемых при распространении, должны сохраняться
13 указанная выше информация об авторском праве, этот список условий и
14 последующий отказ от гарантий.
15 * Ни название Cognitive Technologies, ни имена ее сотрудников не могут
16 быть использованы в качестве средства поддержки и/или продвижения
17 продуктов, основанных на этом ПО, без предварительного письменного
18 разрешения.
19
20 ЭТА ПРОГРАММА ПРЕДОСТАВЛЕНА ВЛАДЕЛЬЦАМИ АВТОРСКИХ ПРАВ И/ИЛИ ДРУГИМИ ЛИЦАМИ "КАК
21 ОНА ЕСТЬ" БЕЗ КАКОГО-ЛИБО ВИДА ГАРАНТИЙ, ВЫРАЖЕННЫХ ЯВНО ИЛИ ПОДРАЗУМЕВАЕМЫХ,
22 ВКЛЮЧАЯ ГАРАНТИИ КОММЕРЧЕСКОЙ ЦЕННОСТИ И ПРИГОДНОСТИ ДЛЯ КОНКРЕТНОЙ ЦЕЛИ, НО НЕ
23 ОГРАНИЧИВАЯСЬ ИМИ. НИ ВЛАДЕЛЕЦ АВТОРСКИХ ПРАВ И НИ ОДНО ДРУГОЕ ЛИЦО, КОТОРОЕ
24 МОЖЕТ ИЗМЕНЯТЬ И/ИЛИ ПОВТОРНО РАСПРОСТРАНЯТЬ ПРОГРАММУ, НИ В КОЕМ СЛУЧАЕ НЕ
25 НЕСЁТ ОТВЕТСТВЕННОСТИ, ВКЛЮЧАЯ ЛЮБЫЕ ОБЩИЕ, СЛУЧАЙНЫЕ, СПЕЦИАЛЬНЫЕ ИЛИ
26 ПОСЛЕДОВАВШИЕ УБЫТКИ, СВЯЗАННЫЕ С ИСПОЛЬЗОВАНИЕМ ИЛИ ПОНЕСЕННЫЕ ВСЛЕДСТВИЕ
27 НЕВОЗМОЖНОСТИ ИСПОЛЬЗОВАНИЯ ПРОГРАММЫ (ВКЛЮЧАЯ ПОТЕРИ ДАННЫХ, ИЛИ ДАННЫЕ,
28 СТАВШИЕ НЕГОДНЫМИ, ИЛИ УБЫТКИ И/ИЛИ ПОТЕРИ ДОХОДОВ, ПОНЕСЕННЫЕ ИЗ-ЗА ДЕЙСТВИЙ
29 ТРЕТЬИХ ЛИЦ И/ИЛИ ОТКАЗА ПРОГРАММЫ РАБОТАТЬ СОВМЕСТНО С ДРУГИМИ ПРОГРАММАМИ,
30 НО НЕ ОГРАНИЧИВАЯСЬ ЭТИМИ СЛУЧАЯМИ), НО НЕ ОГРАНИЧИВАЯСЬ ИМИ, ДАЖЕ ЕСЛИ ТАКОЙ
31 ВЛАДЕЛЕЦ ИЛИ ДРУГОЕ ЛИЦО БЫЛИ ИЗВЕЩЕНЫ О ВОЗМОЖНОСТИ ТАКИХ УБЫТКОВ И ПОТЕРЬ.
32
33 Redistribution and use in source and binary forms, with or without modification,
34 are permitted provided that the following conditions are met:
35
36 * Redistributions of source code must retain the above copyright notice,
37 this list of conditions and the following disclaimer.
38 * Redistributions in binary form must reproduce the above copyright notice,
39 this list of conditions and the following disclaimer in the documentation
40 and/or other materials provided with the distribution.
41 * Neither the name of the Cognitive Technologies nor the names of its
42 contributors may be used to endorse or promote products derived from this
43 software without specific prior written permission.
44
45 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
46 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
47 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
48 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
49 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
50 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
51 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
52 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
53 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
54 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
55 */
56
57 #include "lnslang.h"
58
59 #ifndef __SBAMBUK_H
60 # include "sbambuk.h"
61 #endif
62 #ifndef __RBAMBUK_H
63 # include "rbambuk.h"
64 #endif
65
66 #ifndef NDEBUG
67
68 #endif
69
70 TSegBambuk* sb_ = NULL;
71
72 Bool TRasterBambuk::makeIt( TSegBambuk* sb ) //build rasters by segbambuk
73 {
74 BEntry cur_entry, prev_entry;
75 BHandle cur_seg, prev_seg;
76 TBlackSeg* lower, *upper;
77
78 assert(sb);
79 sb_ = sb;
80
81 // create first line segments components...
82 cur_entry = 0;
83 cur_seg = sb_->firstEntryMember( cur_entry );
84 while (cur_seg != NULLBHandle){
85 if (( (*sb_)[cur_seg].dashHandle = startDash( cur_seg,
86 cur_entry
87 )
88 ) == NULLBHandle
89 ) return (WRONG());
90
91 cur_seg = sb_->nextMember( cur_seg );
92 };
93
94 for ( cur_entry = 1; cur_entry <= sb_->lastEntry(); cur_entry++ ){
95 prev_entry = cur_entry - 1;
96 prev_seg = sb_->firstEntryMember( prev_entry );
97 cur_seg = sb_->firstEntryMember( cur_entry );
98 if (prev_seg == NULLBHandle){
99 if (cur_seg == NULLBHandle)
100 goto BothLinesHasEnded;
101 lower = &((*sb_)[cur_seg]);
102 goto UpperLineHasEnded;
103 };
104 upper = &((*sb_)[prev_seg]);
105 assert( upper->dashHandle != NULLBHandle );
106 if (cur_seg == NULLBHandle)
107 goto LowerLineHasEnded;
108 lower = &((*sb_)[cur_seg]);
109
110 /***** main "two lines" loop *******/
111 while (TRUE){
112 assert(prev_seg != NULLBHandle);
113 assert(cur_seg != NULLBHandle);
114
115 #ifndef NDEBUG
116 //if (lines_processed ++ > 100){
117 // lines_processed = 1;
118 // printf( "." );
119 //};
120 #endif
121 // both segments are not processed yet,
122 // but they adresses are getted
123
124 /* Part 1/2 : Not intersected segments */
125 if (upper->right < lower->left){
126 completeDash( upper->dashHandle );
127 upper->nLower = NULLBHandle;
128 if ((prev_seg = sb_->nextMember( prev_seg ))==NULLBHandle)
129 goto UpperLineHasEnded;
130 upper = &((*sb_)[prev_seg]);
131 assert( upper->dashHandle != NULLBHandle );
132 continue;
133 };
134
135 if (lower->right < upper->left){
136 if (( lower->dashHandle = startDash( cur_seg,
137 cur_entry
138 )
139 ) == NULLBHandle
140 ) return (WRONG());
141
142 if ((cur_seg = sb_->nextMember( cur_seg ))==NULLBHandle)
143 goto LowerLineHasEnded;
144 lower = &((*sb_)[cur_seg]);
145 continue;
146 };
147
148 /* Part 2/2 : Intersected segments */
149 // first intersection - simple link they...
150 upper->nLower = cur_seg;
151 assert( upper->dashHandle != NULLBHandle );
152 lower->dashHandle = upper->dashHandle;
153 if (upper->right > lower->right){
154 ProcOtherLower:
155 // current lower has been processed, skip it.
156 assert( lower->dashHandle != NULLBHandle );
157 if ((cur_seg = sb_->nextMember( cur_seg ))==NULLBHandle){
158 // lower has ended - skip upper
159 if ((prev_seg = sb_->nextMember( prev_seg ))==NULLBHandle)
160 goto BothLinesHasEnded;
161 upper = &((*sb_)[prev_seg]);
162 assert( upper->dashHandle != NULLBHandle );
163 goto LowerLineHasEnded;
164 };
165 lower = &((*sb_)[ cur_seg ]);
166 while (upper->right > lower->right){
167 // start lower line
168 if (( lower->dashHandle = startDash( cur_seg,
169 cur_entry,
170 rasterEntry( upper )
171 )
172 ) == NULLBHandle
173 ) return (WRONG());
174
175 // get next lower
176 assert( lower->dashHandle != NULLBHandle );
177 if ((cur_seg = sb_->nextMember( cur_seg ))==NULLBHandle){
178 if ((prev_seg = sb_->nextMember( prev_seg ))==NULLBHandle)
179 goto BothLinesHasEnded;
180 upper = &((*sb_)[prev_seg]);
181 assert( upper->dashHandle != NULLBHandle );
182 goto LowerLineHasEnded;
183 };
184 lower = &((*sb_)[ cur_seg ]);
185 };
186 if (upper->right < lower->left){
187 // skip upper and loop
188 if ((prev_seg = sb_->nextMember( prev_seg ))==NULLBHandle)
189 goto UpperLineHasEnded;
190 upper = &((*sb_)[prev_seg]);
191 assert( upper->dashHandle != NULLBHandle );
192 continue;
193 };
194 // upper->left <= lower->right
195 // start lower line
196 if (( lower->dashHandle = startDash( cur_seg,
197 cur_entry,
198 rasterEntry( upper )
199 )
200 ) == NULLBHandle
201 ) return (WRONG());
202
203 goto ProcOtherUpper;
204 };
205
206 if (upper->right < lower->right){
207 ProcOtherUpper:
208 // get next upper
209 if ((prev_seg = sb_->nextMember( prev_seg ))==NULLBHandle){
210 // upper has ended - skip lower
211 if ((cur_seg = sb_->nextMember( cur_seg ))==NULLBHandle)
212 goto BothLinesHasEnded;
213 lower = &((*sb_)[cur_seg]);
214 goto UpperLineHasEnded;
215 };
216 upper = &((*sb_)[ prev_seg ]);
217 assert( upper->dashHandle != NULLBHandle );
218 while (upper->right < lower->right){
219 // complete upper line and may be join rasters
220 completeDash( upper->dashHandle );
221 upper->nLower = NULLBHandle;
222
223 joinRasters(rasterEntry( upper ), rasterEntry( lower ));
224 /*******************************************************/
225 // get next upper
226 if ((prev_seg = sb_->nextMember( prev_seg ))==NULLBHandle){
227 assert( lower->dashHandle != NULLBHandle );
228 if ((cur_seg = sb_->nextMember( cur_seg ))==NULLBHandle)
229 goto BothLinesHasEnded;
230 lower = &((*sb_)[cur_seg]);
231 goto UpperLineHasEnded;
232 };
233 upper = &((*sb_)[ prev_seg ]);
234 assert( upper->dashHandle != NULLBHandle );
235 };
236 if (upper->left > lower->right){
237 // skip lower and loop
238 assert( lower->dashHandle != NULLBHandle );
239 if ((cur_seg = sb_->nextMember( cur_seg ))==NULLBHandle)
240 goto LowerLineHasEnded;
241 lower = &((*sb_)[cur_seg]);
242 continue;
243 };
244 // upper->left <= lower->right
245 // complete upper line and may be join rasters
246 completeDash( upper->dashHandle );
247 upper->nLower = NULLBHandle;
248
249 joinRasters(rasterEntry( upper ), rasterEntry( lower ));
250 /******************************************************/
251
252 goto ProcOtherLower;
253 };
254 // both segments ended simultaneously
255 assert( upper->dashHandle != NULLBHandle );
256 assert( lower->dashHandle != NULLBHandle );
257
258 cur_seg = sb_->nextMember( cur_seg );
259 prev_seg = sb_->nextMember( prev_seg );
260 if (prev_seg == NULLBHandle){
261 if (cur_seg == NULLBHandle)
262 goto BothLinesHasEnded;
263 lower = &((*sb_)[cur_seg]);
264 goto UpperLineHasEnded;
265 };
266 upper = &((*sb_)[prev_seg]);
267 assert( upper->dashHandle != NULLBHandle );
268 if (cur_seg == NULLBHandle)
269 goto LowerLineHasEnded;
270 lower = &((*sb_)[cur_seg]);
271 }; //...while ((prev_seg != NULLBHandle) && (cur_seg != NULLBHandle)
272 /*** end of main "two lines" loop ****/
273 UpperLineHasEnded: // upper ended, lower is not processed yet
274 assert( cur_seg != NULLBHandle );
275 do if (((*sb_)[cur_seg].dashHandle = startDash( cur_seg,
276 cur_entry
277 )
278 ) == NULLBHandle
279 ) return (WRONG());
280 while (( cur_seg = sb_->nextMember( cur_seg) ) != NULLBHandle );
281 goto BothLinesHasEnded;
282
283 LowerLineHasEnded: // lower ended, upper is not processed yet
284 assert( prev_seg != NULLBHandle );
285 do {
286 completeDash( (*sb_)[prev_seg].dashHandle );
287 (*sb_)[prev_seg].nLower = NULLBHandle;
288 } while (( prev_seg = sb_->nextMember( prev_seg) ) != NULLBHandle );
289 goto BothLinesHasEnded;
290
291 BothLinesHasEnded: ; // ...
292 // static int dd = 0; // added to avoid compiler's objections 03-01-96 Akimenkov
293 }; // for
294
295 // complete last line segments components...
296 prev_seg = sb_->firstEntryMember( sb_->lastEntry() );
297 while (prev_seg != NULLBHandle){
298 completeDash( (*sb_)[prev_seg].dashHandle );
299 (*sb_)[prev_seg].nLower = NULLBHandle;
300 prev_seg = sb_->nextMember( prev_seg );
301 };
302
303 return TRUE;
304 }
305
306 void TRasterBambuk::joinRasters( BEntry first, BEntry second ){
307 if ( first != second ){
308 BHandle cur_dash;
309 assert( first != NULLBEntry );
310 assert( second != NULLBEntry );
311 // if (memberEntryCount(first) < memberEntryCount(second))
312 // swap( first, second );
313 cur_dash = firstEntryMember( second );
314 assert( cur_dash != NULLBHandle );
315 do (*this)[ cur_dash ].rasterEntry = first;
316 while ((cur_dash = nextMember( cur_dash )) != NULLBHandle );
317 appendMemberList( first, second );
318 count--;
319 };
320 }