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 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560
|
# /=====================================================================\ #
# | LaTeXML::Post::Scan | #
# | Scan for ID's etc | #
# |=====================================================================| #
# | Part of LaTeXML: | #
# | Public domain software, produced as part of work done by the | #
# | United States Government & not subject to copyright in the US. | #
# |---------------------------------------------------------------------| #
# | Bruce Miller <bruce.miller@nist.gov> #_# | #
# | http://dlmf.nist.gov/LaTeXML/ (o o) | #
# \=========================================================ooo==U==ooo=/ #
package LaTeXML::Post::Scan;
use strict;
use warnings;
use LaTeXML::Util::Pathname;
use LaTeXML::Common::XML;
use LaTeXML::Post;
use base qw(LaTeXML::Post::Processor);
# NOTE: This module is one that probably needs a lot of customizability.
sub new {
my ($class, %options) = @_;
my $self = $class->SUPER::new(%options);
$$self{db} = $options{db};
$$self{handlers} = {};
$self->registerHandler('ltx:document' => \§ion_handler);
$self->registerHandler('ltx:part' => \§ion_handler);
$self->registerHandler('ltx:chapter' => \§ion_handler);
$self->registerHandler('ltx:section' => \§ion_handler);
$self->registerHandler('ltx:appendix' => \§ion_handler);
$self->registerHandler('ltx:subsection' => \§ion_handler);
$self->registerHandler('ltx:subsubsection' => \§ion_handler);
$self->registerHandler('ltx:paragraph' => \§ion_handler);
$self->registerHandler('ltx:subparagraph' => \§ion_handler);
$self->registerHandler('ltx:bibliography' => \§ion_handler);
$self->registerHandler('ltx:index' => \§ion_handler);
$self->registerHandler('ltx:glossary' => \§ion_handler);
$self->registerHandler('ltx:table' => \&captioned_handler);
$self->registerHandler('ltx:figure' => \&captioned_handler);
$self->registerHandler('ltx:float' => \&captioned_handler);
$self->registerHandler('ltx:listing' => \&captioned_handler);
$self->registerHandler('ltx:theorem' => \§ion_handler);
$self->registerHandler('ltx:proof' => \§ion_handler);
$self->registerHandler('ltx:equation' => \&labelled_handler);
$self->registerHandler('ltx:equationgroup' => \&labelled_handler);
$self->registerHandler('ltx:item' => \&labelled_handler);
$self->registerHandler('ltx:listingline' => \&labelled_handler);
$self->registerHandler('ltx:anchor' => \&anchor_handler);
$self->registerHandler('ltx:note' => \¬e_handler);
$self->registerHandler('ltx:bibitem' => \&bibitem_handler);
$self->registerHandler('ltx:bibentry' => \&bibentry_handler);
$self->registerHandler('ltx:indexmark' => \&indexmark_handler);
$self->registerHandler('ltx:glossaryentry' => \&glossaryentry_handler);
$self->registerHandler('ltx:glossarydefinition' => \&glossaryentry_handler);
$self->registerHandler('ltx:ref' => \&ref_handler);
$self->registerHandler('ltx:bibref' => \&bibref_handler);
$self->registerHandler('ltx:glossaryref' => \&glossaryref_handler);
$self->registerHandler('ltx:navigation' => \&navigation_handler);
$self->registerHandler('ltx:rdf' => \&rdf_handler);
$self->registerHandler('ltx:declare' => \&declare_handler);
$self->registerHandler('ltx:rawhtml' => \&rawhtml_handler);
return $self; }
sub registerHandler {
my ($self, $tag, $handler) = @_;
$$self{handlers}{$tag} = $handler;
return; }
sub process {
my ($self, $doc, $root) = @_;
# I think we really need an ID here to establish the root node in the DB,
# even if the document didn't have one originally.
# And for the common case of a single docucment, we'd like to be silent about it,
# UNLESS there seem to be multiple documents which would lead to a conflict.
my $id = $root->getAttribute('xml:id');
if (!defined $id) {
$id = "Document";
if (my $preventry = $$self{db}->lookup("ID:$id")) {
if (my $loc = $doc->siteRelativeDestination) {
my $prevloc = $preventry->getValue('location');
if ((defined $prevloc) && ($loc ne $prevloc)) {
Warn('unexpected', 'location', undef,
"Using default ID='$id', "
. "but there's an apparent conflict with location '$loc' and previous '$prevloc'"); } } }
$root->setAttribute('xml:id' => $id); }
# By default, 1st document processed is considered the root of the site
my $siteentry = $$self{db}->lookup('SITE_ROOT');
if (!$siteentry) {
$siteentry = $$self{db}->register('SITE_ROOT', id => $id); }
my $siteid = $siteentry->getValue('id');
$self->scan($doc, $root, $$doc{parent_id});
# Set up interconnections on multidocument site.
$$self{db}->register("DOCUMENT:" . ($doc->siteRelativeDestination || ''), id => $id);
# Question: If (on multidoc sites) a doc contains a single node (say ltx:chapter)
# might it make sense to treat the doc as ONLY that node?
# Alternative: May be necessary to extract title from that child?
# Find a plausible parent doc, unless this is the root, or already has one
# Either by relative id's, destination location, or default to the site itself.
my $entry = $$self{db}->lookup("ID:$id");
if (($id ne $siteid) && !$entry->getValue('parent')) {
my $parent_id;
if (!$parent_id) { # Look for parent assuming it's id is component of $id
my $upid = $id;
while ($upid =~ s/\.[^\.]+$//) {
if ($$self{db}->lookup("ID:$upid")) {
$parent_id = $upid; last; } } }
if (!$parent_id) { # Look for parent as index.xml in a containing directory.
my $loc = $entry->getValue('location');
my $dir = $loc;
while (($dir) = pathname_split($dir)) {
if (my $pentry = $$self{db}->lookup("DOCUMENT:" . pathname_concat($dir, 'index.xml'))) {
my $pid = $pentry->getValue('id');
if ($pid && ($pid ne $id)) {
$parent_id = $pid; last; } } } }
if (!$parent_id) { # Else default to the id of the site itself.
$parent_id = $siteid; }
if ($parent_id && ($parent_id ne $id)) {
$entry->setValues(parent => $parent_id);
# Children are added in the order that they were scanned
$self->addAsChild($id, $parent_id); }
else {
Info('expected', 'parent', undef, "No parent document found for '$id'"); } }
NoteLog("Scan: DBStatus: " . $$self{db}->status);
return $doc; }
sub scan {
my ($self, $doc, $node, $parent_id) = @_;
no warnings 'recursion';
my $tag = $doc->getQName($node);
my $handler = $$self{handlers}{$tag} || \&default_handler;
&$handler($self, $doc, $node, $tag, $parent_id);
return; }
sub scanChildren {
my ($self, $doc, $node, $parent_id) = @_;
no warnings 'recursion';
foreach my $child ($node->childNodes) {
if ($child->nodeType == XML_ELEMENT_NODE) {
$self->scan($doc, $child, $parent_id); } }
return; }
sub addAsChild {
my ($self, $id, $parent_id) = @_;
# Find the ancestor that maintains a children list
while (my $parent = $parent_id && $$self{db}->lookup("ID:$parent_id")) {
if ($parent->hasValue('children')) {
$parent->pushNew('children', $id);
last; }
else {
$parent_id = $parent->getValue('parent'); } }
return; }
sub pageID {
my ($self, $doc) = @_;
return $doc->getDocumentElement->getAttribute('xml:id'); }
# Compute a "Fragment ID", ie. an ID based on the given ID,
# but which is potentially shortened so that it need only be
# unique within the given page.
sub inPageID {
my ($self, $doc, $node) = @_;
my $id = $node->getAttribute('xml:id');
my $baseid = $doc->getDocumentElement->getAttribute('xml:id') || '';
# And we're using label-based ids in the target document...
if ($$self{labelids}) {
if (my $labels = $node->getAttribute('labels')) {
my ($l) = split(' ', $labels);
$l =~ s/^LABEL://;
$id = $l;
if (my $baselabels = $doc->getDocumentElement->getAttribute('labels')) {
my ($bl) = split(' ', $baselabels);
$bl =~ s/^LABEL://;
$baseid = $bl; } } }
if (!$id) {
return $id; }
elsif ($baseid eq $id) {
return; }
elsif ($baseid && ($id =~ /^\Q$baseid\E\.(.*)$/)) {
return $1; }
elsif ($$doc{split_from_id} && ($id =~ /^\Q$$doc{split_from_id}\E\.(.*)$/)) {
return $1; }
else {
return $id; } }
sub noteLabels {
my ($self, $node) = @_;
if (my $id = $node->getAttribute('xml:id')) {
if (my $labels = $node->getAttribute('labels')) {
my @labels = split(' ', $node->getAttribute('labels'));
foreach my $label (@labels) {
$$self{db}->register($label, id => orNull($id)); }
return [@labels]; } }
return; }
# Clean up a node before insertion into database.
sub cleanNode {
my ($self, $doc, $node) = @_;
return $node unless $node;
# Clone the node, and get the ID's unique (at least) within the originating document
my $cleaned = $doc->cloneNode($node);
# Remove indexmark (anything else ?)
map { $_->parentNode->removeChild($_) } $doc->findnodes('.//ltx:indexmark', $cleaned);
return $cleaned; }
# Assumes $node has been cloned, if needed.
# Set to something smallish (eg. 6) to forcibly truncate toctitle/toccaption
our $TOCTEXT_MAX_LENGTH = undef;
sub truncateNode {
my ($self, $doc, $node) = @_;
return $node if !$node || !defined $TOCTEXT_MAX_LENGTH;
my @children = $node->childNodes;
my $n = $TOCTEXT_MAX_LENGTH;
my $trunc = 0;
while ($n && @children) {
my $c = shift(@children);
if ($c->nodeType == XML_TEXT_NODE) {
my $s = $c->textContent;
my @w = split(/\s/, $s);
if (scalar(@w) > $n) {
$c->setData(join(' ', @w[0 .. $n]));
$trunc = 1; $n = 0; }
else {
$n--; } }
else {
$n--; } }
if ($trunc || (scalar(@children) > 1)) {
map { $node->removeChild($_) } @children; # Remove any remaining children.
$node->appendText("\x{2026}"); }
return $node; }
sub addCommon {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
my $inlist;
if (my $listnames = $node->getAttribute('inlist')) {
$inlist = { map { ($_ => 1) } split(/\s/, $listnames) }; }
my %props = (
id => orNull($id),
type => orNull($tag),
parent => orNull($parent_id),
labels => orNull($self->noteLabels($node)),
location => orNull($doc->siteRelativeDestination),
pageid => orNull($self->pageID($doc)),
fragid => orNull($self->inPageID($doc, $node)),
inlist => $inlist,
);
# Figure out sane, safe naming?
foreach my $tagnode ($doc->findnodes('ltx:tags/ltx:tag', $node)) {
my $key;
if (my $role = $tagnode->getAttribute('role')) {
if ($role =~ /.*refnum$/) {
$key = $role; }
else {
$key = 'tag:' . $role; } }
else {
$key = 'refnum'; }
$props{$key} = $self->cleanNode($doc, $tagnode); }
return %props; }
sub default_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
no warnings 'recursion';
my $id = $node->getAttribute('xml:id');
if ($id) {
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id));
$self->addAsChild($id, $parent_id); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
sub section_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if ($id) {
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id),
primary => 1,
title => orNull($self->cleanNode($doc, $doc->findnode('ltx:title', $node))),
toctitle => orNull($self->cleanNode($doc, $doc->findnode('ltx:toctitle', $node))),
children => [],
stub => orNull($node->getAttribute('stub')));
$self->addAsChild($id, $parent_id); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
sub captioned_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if ($id) {
# We're actually trying to find the shallowest caption
# Not one nested in another figure/table/float/whoknowswhat !
my ($caption) = ($doc->findnode('child::ltx:caption', $node),
$doc->findnode('descendant::ltx:caption', $node));
my ($toccaption) = ($doc->findnode('child::ltx:toccaption', $node),
$doc->findnode('descendant::ltx:toccaption', $node));
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id),
role => orNull($node->getAttribute('role')),
caption => orNull($self->cleanNode($doc, $caption)),
### toccaption => orNull($self->cleanNode($doc,
### $doc->findnode('descendant::ltx:toccaption', $node))));
toccaption => orNull($self->truncateNode($doc, $self->cleanNode($doc, $toccaption))));
$self->addAsChild($id, $parent_id); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
sub labelled_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if ($id) {
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id),
role => orNull($node->getAttribute('role')),
);
$self->addAsChild($id, $parent_id); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
# Maybe with some careful redesign of the schema, this would fall under labelled?
sub note_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if ($id) {
my $note = $self->cleanNode($doc, $node);
map { $note->removeChild($_) } $doc->findnodes('.//ltx:tags', $note);
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id),
role => orNull($node->getAttribute('role')),
note => $note,
);
$self->addAsChild($id, $parent_id); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
sub anchor_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if ($id) {
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id),
title => orNull($self->cleanNode($doc, $node)),
);
$self->addAsChild($id, $parent_id); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
sub ref_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if (my $label = $node->getAttribute('labelref')) { # Only record refs of labels
# Don't scan refs from TOC or 'cited' bibblock
if (!$doc->findnodes('ancestor::ltx:tocentry'
. '| ancestor::ltx:bibblock[contains(@class,"ltx_bib_cited")]',
$node)) {
my $entry = $$self{db}->register($label);
$entry->noteAssociation(referrers => $parent_id); } }
# Usually, a ref won't YET have content; but if it does, we should scan it.
$self->default_handler($doc, $node, $tag, $parent_id);
return; }
sub bibref_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
# Don't scan refs from 'cited' bibblock
if (!$doc->findnodes('ancestor::ltx:bibblock[contains(@class,"ltx_bib_cited")]', $node)) {
if (my $keys = $node->getAttribute('bibrefs')) {
# Citation specifies main 'bibliography', as well as any specific others (eg. per chapter)
my $l = $node->getAttribute('inlist');
my @lists = (($l ? split(/\s+/, $l) : ()), 'bibliography');
foreach my $bibkey (split(',', $keys)) {
if ($bibkey) {
foreach my $list (@lists) { # Records a *reference* to a bibkey! (for each list)
my $entry = $$self{db}->register("BIBLABEL:$list:$bibkey");
$entry->noteAssociation(referrers => $parent_id); } } } } }
# Usually, a bibref will have, at most, some ltx:bibphrase's; should be scanned.
$self->default_handler($doc, $node, $tag, $parent_id);
return; }
sub glossaryref_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $list = $node->getAttribute('inlist');
my $key = $node->getAttribute('key');
if ($key && $list) {
my $entry = $$self{db}->register(join(':', 'GLOSSARY', $list, $key));
$entry->noteAssociation(referrers => $parent_id); }
$self->default_handler($doc, $node, $tag, $parent_id);
return; }
# Note that index entries get stored in simple form; just the terms & location.
# They will be turned into a tree, sorted, possibly permuted, whatever, by MakeIndex.
# [the only content of indexmark should be un-marked up(?) don't recurse]
sub indexmark_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
# Get the actual phrases, and any see_also phrases (if any)
# Do these need ->cleanNode ???
my @phrases = $doc->findnodes('ltx:indexphrase', $node);
my @seealso = $doc->findnodes('ltx:indexsee', $node);
my $key = join(':', 'INDEX', map { $_->getAttribute('key') } @phrases);
my $inlist;
if (my $listnames = $node->getAttribute('inlist')) {
$inlist = { map { ($_ => 1) } split(/\s/, $listnames) }; }
my $entry = $$self{db}->lookup($key)
|| $$self{db}->register($key, phrases => [@phrases], see_also => [], inlist => $inlist);
if (@seealso) {
$entry->pushNew('see_also', @seealso); }
else {
$entry->noteAssociation(referrers => $parent_id => ($node->getAttribute('style') || 'normal')); }
return; }
# This handles glossaryentry or glossarydefinition
# * glossarydefinition is the original description of the item,
# randomly (perhaps) located in the document
# * glossaryentry is the duplicate(?) of the above
# located within a glossarylist.
# Probably, the latter is what should be referenced
sub glossaryentry_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
# Only register the id for the glossaryentry (in the glossarylist) as desired target
my $id = ($tag eq 'ltx:glossaryentry' ? $node->getAttribute('xml:id') : undef);
my $p;
my $lists = $node->getAttribute('inlist') ||
(($p = $doc->findnode('ancestor::ltx:glossarylist[@lists] | ancestor::ltx:glossary[@lists]', $node))
&& $p->getAttribute('lists'))
|| 'glossary';
my $key = $node->getAttribute('key');
my @phrases = $doc->findnodes('ltx:glossaryphrase', $node);
# Create an entry for EACH list (they could be distinct definitions)
foreach my $list (split(/\s+/, $lists)) {
my $gkey = join(':', 'GLOSSARY', $list, $key);
my $entry = $$self{db}->lookup($gkey) || $$self{db}->register($gkey);
$entry->setValues(map { ('phrase:' . ($_->getAttribute('role') || 'label') => $_) } @phrases);
$entry->setValues(id => $id) if $id; }
if ($id) {
$$self{db}->register("ID:$id",
$self->addCommon($doc, $node, $tag, $parent_id)); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
# Note this bit of perversity:
# <ltx:bibentry> is a semantic bibliographic entry,
# as generated from a BibTeX file.
# <ltx:bibitem> is a formatted bibliographic entry,
# as generated from an explicit thebibliography environment (eg. manually, or in a .bbl),
# or as formatted from a <ltx:bibentry> by MakeBibliography.
# For a bibitem, we'll store the bibliographic metadata in the DB, keyed by the ID of the item.
sub bibitem_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('xml:id');
if ($id) {
my $key = $node->getAttribute('key');
my $bib = $doc->findnode('ancestor-or-self::ltx:bibliography', $node);
# Probably should only be one list, but just in case?
my @lists = split(/\s+/, ($bib && $bib->getAttribute('lists')) || 'bibliography');
if ($key) {
foreach my $list (@lists) { # BIBLABEL is for the reference to a biblio. item/entry
$$self{db}->register("BIBLABEL:$list:$key", id => orNull($id)); } }
# The actual bibliographic data is recorded keyed by the xml:id of the bibitem!
# Do these need ->cleanNode ???
$$self{db}->register("ID:$id", id => orNull($id), type => orNull($tag), parent => orNull($parent_id), bibkey => orNull($key),
location => orNull($doc->siteRelativeDestination),
pageid => orNull($self->pageID($doc)),
fragid => orNull($self->inPageID($doc, $node)),
authors => orNull($doc->findnode('ltx:tags/ltx:tag[@role="authors"]', $node)),
fullauthors => orNull($doc->findnode('ltx:tags/ltx:tag[@role="fullauthors"]', $node)),
year => orNull($doc->findnode('ltx:tags/ltx:tag[@role="year"]', $node)),
number => orNull($doc->findnode('ltx:tags/ltx:tag[@role="number"]', $node)),
refnum => orNull($doc->findnode('ltx:tags/ltx:tag[@role="refnum"]', $node)),
title => orNull($doc->findnode('ltx:tags/ltx:tag[@role="title"]', $node)),
keytag => orNull($doc->findnode('ltx:tags/ltx:tag[@role="key"]', $node)),
typetag => orNull($doc->findnode('ltx:tags/ltx:tag[@role="bibtype"]', $node))); }
$self->scanChildren($doc, $node, $id || $parent_id);
return; }
# For a bibentry, we'll only store the citation key, so we know it's there.
sub bibentry_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
# The actual bibliographic data is recorded keyed by the xml:id of the bibitem
# AFTER the bibentry has been formatted into a bibitem by MakeBibliography!
# So, there's really nothing to do now.
## HOWEVER; this ultimately requires formatting the bibliography twice (for complex sites).
## This needs to be reworked!
return; }
sub declare_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
# See preprocess_symbols for the extraction of the "defined" symbol (if any)
# Also recognize marks for definition, notation...
my $type = $node->getAttribute('type');
my $sort = $node->getAttribute('sortkey');
my $decl_id = $node->getAttribute('xml:id');
my $term = $self->cleanNode($doc, $doc->findnode('child::ltx:tags/ltx:tag[@role="term"]', $node));
my $description = $self->cleanNode($doc, $doc->findnode('child::ltx:text', $node));
my $definiens = $node->getAttribute('definiens');
if (defined $type && ($type eq 'definition')) {
if ((!defined $definiens) && (defined $term)) {
# Extract the definiens from the term nade
my (@syms) = $doc->findnodes('descendant-or-self::ltx:XMTok[@meaning]', $term);
# We're probably not defining a relation, so put non-relations first.
@syms = ((grep { ($_->getAttribute('role') || '') ne 'RELOP'; } @syms), @syms);
# HACK; remove apparent definitions to lists
# [these will have to be handled much more intentionally]
@syms = grep { $_->getAttribute('meaning') !~ /^delimited-/ } @syms;
$definiens = $syms[0] && $syms[0]->getAttribute('meaning'); }
if (defined $definiens) {
$$self{db}->register("DECLARATION:global:$definiens",
$self->addCommon($doc, $node, $tag, $parent_id),
description => $description); } }
elsif ((!$type) && $parent_id) { # No type? Assume local definition. (or should be explicit scope?
if ($decl_id && ($description || $doc->findnode('ltx:tags/ltx:tag', $node))) {
$$self{db}->register("DECLARATION:local:$decl_id",
$self->addCommon($doc, $node, $tag, $parent_id),
description => $description); } }
if ($sort) { # It only goes into Notation tables/indices if a sortkey.
$$self{db}->register("NOTATION:" . ($definiens || $decl_id || $sort),
$self->addCommon($doc, $node, $tag, $parent_id),
sortkey => $sort, description => $description); }
# No real benefit to scan the contents? (and makes it SLOW)
# $self->default_handler($doc,$node,$tag,$parent_id);
return; }
# I'm thinking we shouldn't acknowledge navigation data at all?
sub navigation_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
return; }
# RDF should be recorded with its "about" designation, or its immediate parent
sub rdf_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
my $id = $node->getAttribute('about');
if (!($id && ($id =~ s/^#//))) {
$id = $parent_id; }
my $property = $node->getAttribute('property');
my $value = $node->getAttribute('resource') || $node->getAttribute('content');
return unless ($property && $value);
$$self{db}->register("ID:$id", $property => orNull($value));
return; }
# I'm thinking we shouldn't acknowledge rawhtml data at all?
sub rawhtml_handler {
my ($self, $doc, $node, $tag, $parent_id) = @_;
return; }
sub orNull {
return (grep { defined } @_) ? @_ : undef; }
# ================================================================================
1;
|