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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
|
/* This file is part of the KDE libraries
Copyright (C) 2003 Hamish Rodda <rodda@kde.org>
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.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef KATESUPERCURSOR_H
#define KATESUPERCURSOR_H
#include "katecursor.h"
class KateDocument;
class KateView;
/**
* Possible additional features:
* - Notification when a cursor enters or exits a view
* - suggest something :)
*
* Unresolved issues:
* - testing, testing, testing
* - ie. everything which hasn't already been tested, you can see that which has inside the #ifdefs
* - api niceness
*/
/**
* A cursor which updates and gives off various interesting signals.
*
* This aims to be a working version of what KateCursor was originally intended to be.
*
* @author Hamish Rodda
**/
class KateSuperCursor : public TQObject, public KateDocCursor, public Kate::Cursor
{
Q_OBJECT
public:
/**
* bool privateC says: if private, than don't show to apps using the cursorinterface in the list,
* all internally only used SuperCursors should be private or people could modify them from the
* outside breaking kate's internals
*/
KateSuperCursor(KateDocument* doc, bool privateC, const KateTextCursor& cursor, TQObject* parent = 0L, const char* name = 0L);
KateSuperCursor(KateDocument* doc, bool privateC, int lineNum = 0, int col = 0, TQObject* parent = 0L, const char* name = 0L);
~KateSuperCursor ();
public:
// KTextEditor::Cursor interface
void position(uint *line, uint *col) const;
bool setPosition(uint line, uint col);
bool insertText(const TQString& text);
bool removeText(uint numberOfCharacters);
TQChar currentChar() const;
/**
* @returns true if the cursor is situated at the start of the line, false if it isn't.
*/
bool atStartOfLine() const;
/**
* @returns true if the cursor is situated at the end of the line, false if it isn't.
*/
bool atEndOfLine() const;
/**
* Returns how this cursor behaves when text is inserted at the cursor.
* Defaults to not moving on insert.
*/
bool moveOnInsert() const;
/**
* Change the behavior of the cursor when text is inserted at the cursor.
*
* If @p moveOnInsert is true, the cursor will end up at the end of the insert.
*/
void setMoveOnInsert(bool moveOnInsert);
/**
* Debug: output the position.
*/
operator TQString();
// Reimplementations;
virtual void setLine(int lineNum);
virtual void setCol(int colNum);
virtual void setPos(const KateTextCursor& pos);
virtual void setPos(int lineNum, int colNum);
signals:
/**
* The cursor's position was directly changed by the program.
*/
void positionDirectlyChanged();
/**
* The cursor's position was changed.
*/
void positionChanged();
/**
* Athough an edit took place, the cursor's position was unchanged.
*/
void positionUnChanged();
/**
* The cursor's surrounding characters were both deleted simultaneously.
* The cursor is automatically placed at the start of the deleted region.
*/
void positionDeleted();
/**
* A character was inserted immediately before the cursor.
*
* Whether the char was inserted before or after this cursor depends on
* moveOnInsert():
* @li true -> the char was inserted before
* @li false -> the char was inserted after
*/
void charInsertedAt();
/**
* The character immediately before the cursor was deleted.
*/
void charDeletedBefore();
/**
* The character immediately after the cursor was deleted.
*/
void charDeletedAfter();
//BEGIN METHODES TO CALL FROM KATE DOCUMENT TO KEEP CURSOR UP TO DATE
public:
void editTextInserted ( uint line, uint col, uint len);
void editTextRemoved ( uint line, uint col, uint len);
void editLineWrapped ( uint line, uint col, bool newLine = true );
void editLineUnWrapped ( uint line, uint col, bool removeLine = true, uint length = 0 );
void editLineInserted ( uint line );
void editLineRemoved ( uint line );
//END
private:
KateDocument *m_doc;
bool m_moveOnInsert : 1;
bool m_lineRemoved : 1;
bool m_privateCursor : 1;
};
/**
* Represents a range of text, from the start() to the end().
*
* Also tracks its position and emits useful signals.
*/
class KateSuperRange : public TQObject, public KateRange
{
friend class KateSuperRangeList;
Q_OBJECT
public:
/// Determine how the range reacts to characters inserted immediately outside the range.
enum InsertBehaviour {
/// Don't expand to encapsulate new characters in either direction. This is the default.
DoNotExpand = 0,
/// Expand to encapsulate new characters to the left of the range.
ExpandLeft = 0x1,
/// Expand to encapsulate new characters to the right of the range.
ExpandRight = 0x2
};
/**
* Constructor. Takes posession of @p start and @p end.
*/
KateSuperRange(KateSuperCursor* start, KateSuperCursor* end, TQObject* parent = 0L, const char* name = 0L);
KateSuperRange(KateDocument* doc, const KateRange& range, TQObject* parent = 0L, const char* name = 0L);
KateSuperRange(KateDocument* doc, const KateTextCursor& start, const KateTextCursor& end, TQObject* parent = 0L, const char* name = 0L);
virtual ~KateSuperRange();
// fulfill KateRange requirements
virtual KateTextCursor& start();
virtual KateTextCursor& end();
virtual const KateTextCursor& start() const;
virtual const KateTextCursor& end() const;
void allowZeroLength(bool yes=true){m_allowZeroLength=yes;}
/**
* Returns the super start cursor.
*/
KateSuperCursor& superStart();
const KateSuperCursor& superStart() const;
/**
* Returns the super end cursor.
*/
KateSuperCursor& superEnd();
const KateSuperCursor& superEnd() const;
/**
* Returns how this range reacts to characters inserted immediately outside the range.
*/
int behaviour() const;
/**
* Determine how the range should react to characters inserted immediately outside the range.
*
* TODO does this need a custom function to enable determining of the behavior based on the
* text that is inserted / deleted?
*
* @sa InsertBehaviour
*/
void setBehaviour(int behaviour);
/**
* Start and end must be valid and start <= end.
*/
virtual bool isValid() const;
/**
* This is for use where the ranges are used in a heirachy,
* ie. their parents are KateSuperRanges which completely
* encapsulate them.
*
* @todo constrain children when their position changes deliberately;
* eliminate() children when they are equivalent to their parents
*
* @returns true if the range contains the cursor and no children
* also contain it; false otherwise.
*/
bool owns(const KateTextCursor& cursor) const;
/**
* Returns true if the range includes @p cursor 's character.
* Returns false if @p cursor == end().
*/
bool includes(const KateTextCursor& cursor) const;
/**
* Returns true if the range includes @p line
*/
bool includes(uint lineNum) const;
/**
* Returns true if the range totally encompasses @p line
*/
bool includesWholeLine(uint lineNum) const;
/**
* Returns whether @p cursor is the site of a boundary of this range.
*/
bool boundaryAt(const KateTextCursor& cursor) const;
/**
* Returns whether there is a boundary of this range on @p line.
*/
bool boundaryOn(uint lineNum) const;
signals:
/**
* More interesting signals that aren't worth implementing here:
* firstCharDeleted: start()::charDeleted()
* lastCharDeleted: end()::previousCharDeleted()
*/
/**
* The range's position changed.
*/
void positionChanged();
/**
* The range's position was unchanged.
*/
void positionUnChanged();
/**
* The contents of the range changed.
*/
void contentsChanged();
/**
* Either cursor's surrounding characters were both deleted.
*/
void boundaryDeleted();
/**
* The range now contains no characters (ie. the start and end cursors are the same).
*
* To eliminate this range under different conditions, connect the other signal directly
* to this signal.
*/
void eliminated();
/**
* Indicates the region needs re-drawing.
*/
void tagRange(KateSuperRange* range);
public slots:
void slotTagRange();
private slots:
void slotEvaluateChanged();
void slotEvaluateUnChanged();
private:
void init();
void evaluateEliminated();
void evaluatePositionChanged();
KateSuperCursor* m_start;
KateSuperCursor* m_end;
bool m_evaluate;
bool m_startChanged;
bool m_endChanged;
bool m_deleteCursors;
bool m_allowZeroLength;
};
class KateSuperCursorList : public TQPtrList<KateSuperCursor>
{
protected:
virtual int compareItems(TQPtrCollection::Item item1, TQPtrCollection::Item item2);
};
class KateSuperRangeList : public TQObject, public TQPtrList<KateSuperRange>
{
Q_OBJECT
public:
/**
* @sa autoManage()
*/
KateSuperRangeList(bool autoManage = true, TQObject* parent = 0L, const char* name = 0L);
/**
* Semi-copy constructor.
*
* Does not copy auto-manage value, as that would make it too easy to perform
* double-deletions.
*
* Also, does not connect signals and slots to save time, as this is mainly
* used by the document itself while drawing (call connectAll() to re-constitute)
*/
KateSuperRangeList(const TQPtrList<KateSuperRange>& rangeList, TQObject* parent = 0L, const char* name = 0L);
virtual ~KateSuperRangeList() {}
/**
* Append another list.
* If this object was created by the semi-copy constructor, it may not connect items
* (unless connectAll() has already been called), call connectAll().
*/
void appendList(const TQPtrList<KateSuperRange>& rangeList);
/**
* Connect items that are not connected. This only needs to be called once,
* and only if this was created with the semi-copy constructor.
*/
void connectAll();
/**
* Override to emit rangeEliminated() signals.
*/
virtual void clear();
/**
* Automanage is a combination of autodeleting of the objects and
* removing of any eliminated() ranges.
*/
bool autoManage() const;
/**
* @sa autoManage()
*/
void setAutoManage(bool autoManage);
/**
* This is just a straight-forward list so that there is no confusion about whether
* this list should be auto-managed (ie. it shouldn't, to avoid double deletions).
*/
TQPtrList<KateSuperRange> rangesIncluding(const KateTextCursor& cursor);
TQPtrList<KateSuperRange> rangesIncluding(uint line);
/**
* @retval true if one of the ranges in the list includes @p cursor
* @retval false otherwise
*/
bool rangesInclude(const KateTextCursor& cursor);
/**
* Construct a list of boundaries, and return the first, or 0L if there are none.
* If @p start is defined, the first boundary returned will be at or after @p start.
*
* @returns the first boundary location
*/
KateSuperCursor* firstBoundary(const KateTextCursor* start = 0L);
/**
* @returns the next boundary, or 0L if there are no more.
*/
KateSuperCursor* nextBoundary();
/**
* @returns the current boundary
*/
KateSuperCursor* currentBoundary();
signals:
/**
* The range now contains no characters (ie. the start and end cursors are the same).
* If autoManage() is true, the range will be deleted after the signal has processed.
*/
void rangeEliminated(KateSuperRange* range);
/**
* There are no ranges left.
*/
void listEmpty();
/**
* Connected to all ranges if connect()ed.
*/
void tagRange(KateSuperRange* range);
protected:
/**
* internal reimplementation
*/
virtual int compareItems(TQPtrCollection::Item item1, TQPtrCollection::Item item2);
/**
* internal reimplementation
*/
virtual TQPtrCollection::Item newItem(TQPtrCollection::Item d);
private slots:
void slotEliminated();
void slotDeleted(TQObject* range);
private:
bool m_autoManage;
bool m_connect;
KateSuperCursorList m_columnBoundaries;
bool m_trackingBoundaries;
};
#endif
// kate: space-indent on; indent-width 2; replace-tabs on;
|