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
|
# encoding=UTF-8
# Copyright © 2008, 2009 Jakub Wilk <jwilk@jwilk.net>
#
# This package 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; version 2 dated June, 1991.
#
# This package 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.
'''
Models for hidden text.
See Lizardtech DjVu Reference (DjVu 3):
- 3.3.2 Hidden text.
- 8.3.5 Text Chunk.
'''
import copy
import weakref
import itertools
import djvu.decode
import djvu.sexpr
from djvusmooth.varietes import not_overridden, wref
from djvusmooth.models import MultiPageModel
class Node(object):
def __new__(cls, sexpr, owner):
if len(sexpr) == 6 and isinstance(sexpr[5], djvu.sexpr.StringExpression):
cls = LeafNode
else:
cls = InnerNode
return object.__new__(cls)
def __init__(self, sexpr, owner):
self._owner = owner
self._type = djvu.const.get_text_zone_type(sexpr[0].value)
x0, y0, x1, y1 = (sexpr[i].value for i in xrange(1, 5))
self._x = x0
self._y = y0
self._w = x1 - x0
self._h = y1 - y0
self._link_left = self._link_right = self._link_parent = wref(None)
@property
def sexpr(self):
return self._construct_sexpr()
def _construct_sexpr(self):
raise NotImplementedError
@apply
def separator():
def get(self):
return djvu.const.TEXT_ZONE_SEPARATORS[self._type]
return property(get)
@apply
def x():
def get(self):
return self._x
def set(self, value):
self._x = value
self._notify_change()
return property(get, set)
@apply
def y():
def get(self):
return self._y
def set(self, value):
self._y = value
self._notify_change()
return property(get, set)
@apply
def w():
def get(self):
return self._w
def set(self, value):
self._w = value
self._notify_change()
return property(get, set)
@apply
def h():
def get(self):
return self._h
def set(self, value):
self._h = value
self._notify_change()
return property(get, set)
@apply
def rect():
def get(self):
return self._x, self._y, self._w, self._h
def set(self, value):
self._x, self._y, self._w, self._h = value
self._notify_change()
return property(get, set)
@apply
def type():
def get(self):
return self._type
return property(get)
@apply
def left_sibling():
def get(self):
link = self._link_left()
if link is None:
raise StopIteration
return link
return property(get)
@apply
def right_sibling():
def get(self):
link = self._link_right()
if link is None:
raise StopIteration
return link
return property(get)
@apply
def parent():
def get(self):
link = self._link_parent()
if link is None:
raise StopIteration
return link
return property(get)
@apply
def left_child():
def get(self):
raise StopIteration
return property(get)
def delete(self):
try:
parent = self.parent
except StopIteration:
return
parent.remove_child(self)
def remove_child(self, child):
raise NotImplementedError
def strip(self, zone_type):
raise NotImplementedError
def is_leaf(self):
return False
def is_inner(self):
return False
def notify_select(self):
self._owner.notify_node_select(self)
def notify_deselect(self):
self._owner.notify_node_deselect(self)
def _notify_change(self):
return self._owner.notify_node_change(self)
def _notify_children_change(self):
return self._owner.notify_node_children_change(self)
class LeafNode(Node):
def is_leaf(self):
return True
def __init__(self, sexpr, owner):
Node.__init__(self, sexpr, owner)
self._text = sexpr[5].value.decode('UTF-8', 'replace')
def _construct_sexpr(self):
x, y, w, h = self.x, self.y, self.w, self.h
return djvu.sexpr.Expression((self.type, x, y, x + w, y + h, self.text))
@apply
def text():
def get(self):
return self._text
def set(self, value):
self._text = value
self._notify_change()
return property(get, set)
def remove_child(self, child):
raise TypeError('%r is not having children' % (self,))
def strip(self, zone_type):
if self.type <= zone_type:
return self.text, self.separator
return self
def __getitem__(self, n):
raise TypeError
def __len__(self):
raise TypeError
def __iter__(self):
raise TypeError
class InnerNode(Node):
def is_inner(self):
return True
def __init__(self, sexpr, owner):
Node.__init__(self, sexpr, owner)
self._set_children(Node(child, self._owner) for child in sexpr[5:])
def _set_children(self, children):
self._children = list(children)
prev = None
for child in self._children:
child._link_left = wref(prev)
child._link_parent = wref(self)
prev = child
prev = None
for child in reversed(self._children):
child._link_right = wref(prev)
prev = child
def _construct_sexpr(self):
x, y, w, h = self.x, self.y, self.w, self.h
if self._children:
child_sexprs = (child.sexpr for child in self)
else:
# FIXME: this needs a better solution
child_sexprs = (djvu.sexpr.Expression(''),)
return djvu.sexpr.Expression(
itertools.chain(
(self.type, x, y, x + w, y + h),
child_sexprs
)
)
@apply
def text():
return property()
@apply
def left_child():
def get(self):
return iter(self._children).next()
return property(get)
def remove_child(self, child):
child_idx = self._children.index(child)
if child_idx - 1 >= 0:
self._children[child_idx - 1]._link_right = child._link_right
if child_idx + 1 < len(self._children):
self._children[child_idx + 1]._link_left = child._link_left
child._link_left = child._link_right = child._link_parent = wref(None)
del self._children[child_idx]
self._notify_children_change()
def strip(self, zone_type):
stripped_children = [child.strip(zone_type) for child in self._children]
if self.type <= zone_type:
texts = [text for text, child_separator in stripped_children]
return child_separator.join(texts), self.separator
else:
node_children = [child for child in stripped_children if isinstance(child, Node)]
if node_children:
self._set_children(node_children)
return self
else:
texts = [text for text, child_separator in stripped_children]
text = child_separator.join(texts)
return Node(
djvu.sexpr.Expression((
self.type,
self.x, self.y,
self.x + self.w, self.y + self.h,
text
)), self._owner
)
return self
def __getitem__(self, n):
return self._children[n]
def __len__(self):
return len(self._children)
def __iter__(self):
return iter(self._children)
class Text(MultiPageModel):
def get_page_model_class(self, n):
return PageText
class PageTextCallback(object):
@not_overridden
def notify_node_change(self, node):
pass
@not_overridden
def notify_node_children_change(self, node):
pass
@not_overridden
def notify_node_select(self, node):
pass
@not_overridden
def notify_node_deselect(self, node):
pass
@not_overridden
def notify_tree_change(self, node):
pass
class PageText(object):
def __init__(self, n, original_data):
self._callbacks = weakref.WeakKeyDictionary()
self._original_sexpr = original_data
self.revert()
self._n = n
def register_callback(self, callback):
if not isinstance(callback, PageTextCallback):
raise TypeError
self._callbacks[callback] = 1
@apply
def root():
def get(self):
return self._root
return property(get)
@apply
def raw_value():
def get(self):
if self._root is None:
return None
return self._root.sexpr
def set(self, sexpr):
if sexpr:
self._root = Node(sexpr, self)
else:
self._root = None
self.notify_tree_change()
return property(get, set)
def strip(self, zone_type):
zone_type = djvu.const.get_text_zone_type(zone_type) # ensure it's not a plain Symbol
if self._root is None:
return
stripped_root = self._root.strip(zone_type)
if not isinstance(stripped_root, Node):
stripped_root = None
self._root = stripped_root
self.notify_tree_change()
def clone(self):
return copy.copy(self)
def export(self, djvused):
if not self._dirty:
return
djvused.select(self._n + 1)
djvused.set_text(self.raw_value)
def revert(self):
self.raw_value = self._original_sexpr
self._dirty = False
def notify_node_change(self, node):
self._dirty = True
for callback in self._callbacks:
callback.notify_node_change(node)
def notify_node_children_change(self, node):
self._dirty = True
for callback in self._callbacks:
callback.notify_node_children_change(node)
def notify_node_select(self, node):
for callback in self._callbacks: callback.notify_node_select(node)
def notify_node_deselect(self, node):
for callback in self._callbacks: callback.notify_node_deselect(node)
def notify_tree_change(self):
self._dirty = True
for callback in self._callbacks:
callback.notify_tree_change(self._root)
def get_preorder_nodes(self):
if self.root is None:
return ()
return _get_preorder_nodes(self.root)
def get_postorder_nodes(self):
if self.root is None:
return ()
return _get_postorder_nodes(self.root)
def get_leafs(self):
if self.root is None:
return ()
return _get_leafs(self.root)
def _get_preorder_nodes(node):
yield node
if isinstance(node, LeafNode):
return
for child in node:
for item in _get_preorder_nodes(child):
yield item
def _get_postorder_nodes(node):
if isinstance(node, InnerNode):
for child in node:
for item in _get_postorder_nodes(child):
yield item
yield node
def _get_leafs(node):
if isinstance(node, LeafNode):
yield node
else:
for child in node:
for item in _get_leafs(child):
yield item
__all__ = 'Text', 'PageText'
# vim:ts=4 sw=4 et
|