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
|
/*
* This file is part of the html renderer for KDE.
*
* Copyright (C) 2000 Lars Knoll ([email protected])
* Copyright (C) 2003 Apple Computer, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* 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 BIDI_H
#define BIDI_H
#include <tqstring.h>
#include "rendering/render_object.h"
namespace khtml {
class RenderArena;
class RenderBlock;
class RenderObject;
class InlineBox;
class BidiContext {
public:
BidiContext(unsigned char level, TQChar::Direction embedding, BidiContext *parent = 0, bool override = false);
~BidiContext();
void ref() const;
void deref() const;
unsigned char level;
bool override : 1;
TQChar::Direction dir : 5;
TQChar::Direction basicDir : 5;
BidiContext *parent;
// refcounting....
mutable int count;
};
struct BidiRun {
BidiRun(int _start, int _stop, RenderObject *_obj, BidiContext *context, TQChar::Direction dir)
: start( _start ), stop( _stop ), obj( _obj ), box(0), nextRun(0)
{
if(dir == TQChar::DirON) dir = context->dir;
level = context->level;
// add level of run (cases I1 & I2)
if( level % 2 ) {
if(dir == TQChar::DirL || dir == TQChar::DirAN || dir == TQChar::DirEN)
level++;
} else {
if( dir == TQChar::DirR )
level++;
else if( dir == TQChar::DirAN || dir == TQChar::DirEN)
level += 2;
}
}
void detach(RenderArena* renderArena);
// Overloaded new operator.
void* operator new(size_t sz, RenderArena* renderArena) throw();
// Overridden to prevent the normal delete from being called.
void operator delete(void* ptr, size_t sz);
private:
// The normal operator new is disallowed.
void* operator new(size_t sz) throw();
public:
int start;
int stop;
RenderObject *obj;
InlineBox* box;
// explicit + implicit levels here
uchar level;
bool compact : 1;
BidiRun* nextRun;
};
struct BidiIterator;
struct BidiState;
struct InlineMinMaxIterator
{
/* InlineMinMaxIterator is a class that will iterate over all render objects that contribute to
inline min/max width calculations. Note the following about the way it walks:
(1) Positioned content is skipped (since it does not contribute to min/max width of a block)
(2) We do not drill into the children of floats or replaced elements, since you can't break
in the middle of such an element.
(3) Inline flows (e.g., <a>, <span>, <i>) are walked twice, since each side can have
distinct borders/margin/padding that contribute to the min/max width.
*/
RenderObject* parent;
RenderObject* current;
bool endOfInline;
bool skipPositioned;
InlineMinMaxIterator(RenderObject* p, RenderObject* o, bool eOI=false, bool skipPos=true)
:parent(p), current(o), endOfInline(eOI), skipPositioned(skipPos) {}
inline RenderObject* next();
};
inline RenderObject* InlineMinMaxIterator::next()
{
RenderObject* result = 0;
bool oldEndOfInline = endOfInline;
endOfInline = false;
while (current != 0 || (current == parent))
{
//kDebug( 6040 ) << "current = " << current;
if (!oldEndOfInline &&
(current == parent ||
(!current->isFloating() && !current->isReplaced() && !current->isPositioned())))
result = current->firstChild();
if (!result) {
// We hit the end of our inline. (It was empty, e.g., <span></span>.)
if (!oldEndOfInline && current->isInlineFlow()) {
result = current;
endOfInline = true;
break;
}
while (current && current != parent) {
result = current->nextSibling();
if (result) break;
current = current->parent();
if (current && current != parent && current->isInlineFlow()) {
result = current;
endOfInline = true;
break;
}
}
}
if (!result) break;
if ((!skipPositioned || !result->isPositioned()) && (result->isText() || result->isBR() ||
result->isFloatingOrPositioned() || result->isReplaced() || result->isGlyph() || result->isInlineFlow()))
break;
current = result;
result = 0;
}
// Update our position.
current = result;
return current;
}
}
#endif
|
