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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
|
/***************************************************************************
kfixedsizebuffer.cpp - description
-------------------
begin : Mit Jun 03 2003
copyright : (C) 2003 by Friedrich W. H. Kossebau
email : [email protected]
***************************************************************************/
/***************************************************************************
* *
* This library is free software; you can redistribute it and/or *
* modify it under the terms of the GNU Library General Public *
* License version 2 as published by the Free Software Foundation. *
* *
***************************************************************************/
//#include <kdebug.h>
// c specific
#include <string.h>
// lib specific
#include "kfixedsizebuffer.h"
using namespace KHE;
KFixedSizeBuffer::KFixedSizeBuffer( char *D, unsigned int S, char FUC )
: Data( D ),
Size( S ),
FillUpChar( FUC ),
ReadOnly( true ),
Modified( false ),
AutoDelete( false )
{
}
KFixedSizeBuffer::KFixedSizeBuffer( unsigned int S, char FUC )
: Data( new char[S] ),
Size( S ),
FillUpChar( FUC ),
ReadOnly( false ),
Modified( false ),
AutoDelete( true )
{
reset( 0, S );
}
KFixedSizeBuffer::~KFixedSizeBuffer()
{
if( AutoDelete )
delete [] Data;
}
int KFixedSizeBuffer::insert( int Pos, const char* D, int InputLength )
{
// check all parameters
if( Pos >= (int)Size || InputLength == 0 )
return 0;
if( Pos + InputLength > (int)Size )
InputLength = Size - Pos;
unsigned int BehindInsertPos = Pos + InputLength;
// fmove right data behind the input range
memmove( &Data[BehindInsertPos], &Data[Pos], Size-BehindInsertPos );
// insert input
memcpy( &Data[Pos], D, InputLength );
Modified = true;
return InputLength;
}
int KFixedSizeBuffer::remove( KSection Remove )
{
if( Remove.start() >= (int)Size || Remove.width() == 0 )
return 0;
Remove.restrictEndTo( Size-1 );
int RemoveLength = Remove.width();
int BehindRemovePos = Remove.end()+1;;
// fmove right data behind the input range
memmove( &Data[Remove.start()], &Data[BehindRemovePos], Size-BehindRemovePos );
// clear freed space
reset( Size-RemoveLength, RemoveLength );
Modified = true;
return RemoveLength;
}
unsigned int KFixedSizeBuffer::replace( KSection Remove, const char* D, unsigned int InputLength )
{
// check all parameters
if( Remove.startsBehind( Size-1 ) || (Remove.width()==0 && InputLength==0) )
return 0;
Remove.restrictEndTo( Size-1 );
if( Remove.start() + InputLength > Size )
InputLength = Size - Remove.start();
int SizeDiff = InputLength - Remove.width();
// is input longer than removed?
if( SizeDiff > 0 )
{
unsigned int BehindInsertPos = Remove.start() + InputLength;
// fmove right data behind the input range
memmove( &Data[BehindInsertPos], &Data[Remove.end()+1], Size-BehindInsertPos );
}
// is input smaller than removed?
else if( SizeDiff < 0 )
{
unsigned int BehindRemovePos = Remove.end()+1;
// fmove right data behind the input range
memmove( &Data[Remove.start()+InputLength], &Data[BehindRemovePos], Size-BehindRemovePos );
// clear freed space
reset( Size+SizeDiff, -SizeDiff );
}
// insert input
memcpy( &Data[Remove.start()], D, InputLength );
Modified = true;
return InputLength;
}
int KFixedSizeBuffer::move( int DestPos, KSection SourceSection )
{
// check all parameters
if( SourceSection.start() >= (int)Size || SourceSection.width() == 0
|| DestPos > (int)Size || SourceSection.start() == DestPos )
return SourceSection.start();
SourceSection.restrictEndTo( Size-1 );
bool ToRight = DestPos > SourceSection.start();
int MovedLength = SourceSection.width();
int DisplacedLength = ToRight ? DestPos - SourceSection.end()-1 : SourceSection.start() - DestPos;
// find out section that is smaller
int SmallPartLength, LargePartLength, SmallPartStart, LargePartStart, SmallPartDest, LargePartDest;
// moving part is smaller?
if( MovedLength < DisplacedLength )
{
SmallPartStart = SourceSection.start();
SmallPartLength = MovedLength;
LargePartLength = DisplacedLength;
// moving part moves right?
if( ToRight )
{
SmallPartDest = DestPos - MovedLength;
LargePartStart = SourceSection.end()+1;
LargePartDest = SourceSection.start();
}
else
{
SmallPartDest = DestPos;
LargePartStart = DestPos;
LargePartDest = DestPos + MovedLength;
}
}
else
{
LargePartStart = SourceSection.start();
LargePartLength = MovedLength;
SmallPartLength = DisplacedLength;
// moving part moves right?
if( ToRight )
{
LargePartDest = DestPos - MovedLength;
SmallPartStart = SourceSection.end()+1;
SmallPartDest = SourceSection.start();
}
else
{
LargePartDest = DestPos;
SmallPartStart = DestPos;
SmallPartDest = DestPos + MovedLength;
}
}
// copy smaller part to tempbuffer
char *Temp = new char[SmallPartLength];
memcpy( Temp, &Data[SmallPartStart], SmallPartLength );
// move the larger part
memmove( &Data[LargePartDest], &Data[LargePartStart], LargePartLength );
// copy smaller part to its new dest
memcpy( &Data[SmallPartDest], Temp, SmallPartLength );
delete [] Temp;
Modified = true;
return MovedLength < DisplacedLength ? SmallPartDest : LargePartDest;
}
int KFixedSizeBuffer::fill( const char FChar, int FillLength, unsigned int Pos )
{
// nothing to fill
if( Pos >= Size )
return 0;
unsigned int LengthToEnd = Size - Pos;
if( FillLength < 0 || FillLength > (int)LengthToEnd )
FillLength = LengthToEnd;
memset( &Data[Pos], FChar, FillLength );
Modified = true;
return FillLength;
}
int KFixedSizeBuffer::compare( const KDataBuffer &Other, KSection OtherRange, unsigned int Pos )
{
//kdDebug() << QString("Pos: %1, OtherRange: (%3/%4)" ).arg(Pos).arg(OtherRange.start()).arg(OtherRange.end())
// << endl;
// test other values
if( OtherRange.startsBehind(Other.size()-1) )
return 1;
// check own values
if( Pos >= Size )
return -1;
int ValueByLength = 0; // default: equal
KSection Range( Pos, OtherRange.width(), true );
int Last = Other.size()-1;
//
if( OtherRange.endsBehind(Last) )
{
// make shorter
OtherRange.setEnd( Last );
if( OtherRange.width() < Range.width() )
ValueByLength = 1;
}
Last = Size-1;
if( Range.endsBehind(Last) )
{
// make shorter
Range.setEnd( Last );
if( OtherRange.width() > Range.width() )
ValueByLength = -1;
}
//kdDebug()
// << QString( "Range: (%1/%2), OtherRange: (%3/%4)" ).arg(Range.start()).arg(Range.end()).arg(OtherRange.start()).arg(OtherRange.end())
// << endl;
int oi = OtherRange.start();
for( int i=Range.start(); i<=Range.end(); ++i,++oi )
{
char OD = Other.datum(oi);
char D = Data[i];
//kdDebug() << QString("%1==%2").arg((int)D).arg((int)OD) << endl;
if( OD == D )
continue;
return OD < D ? 1 : -1;
}
return ValueByLength;
}
int KFixedSizeBuffer::find( const char*/*KeyData*/, int /*Length*/, KSection /*Section*/ ) const { return 0; }
int KFixedSizeBuffer::rfind( const char*, int /*Length*/, int /*Pos*/ ) const { return 0; }
void KFixedSizeBuffer::reset( unsigned int Pos, unsigned int Length )
{
memset( &Data[Pos], FillUpChar, Length );
}
|