1 package Text::Tradition::Collation;
3 use Encode qw( decode_utf8 );
6 use IPC::Run qw( run binary );
8 use Text::Tradition::Collation::Reading;
9 use Text::Tradition::Collation::RelationshipStore;
10 use Text::Tradition::Error;
12 use XML::LibXML::XPathContext;
18 default => sub { Graph->new() },
26 isa => 'Text::Tradition::Collation::RelationshipStore',
28 relationships => 'relationships',
29 related_readings => 'related_readings',
31 writer => '_set_relations',
36 isa => 'Text::Tradition',
41 isa => 'HashRef[Text::Tradition::Collation::Reading]',
45 _add_reading => 'set',
46 del_reading => 'delete',
47 has_reading => 'exists',
50 default => sub { {} },
53 has 'wit_list_separator' => (
62 default => 'base text',
79 isa => 'Text::Tradition::Collation::Reading',
80 writer => '_set_start',
86 isa => 'Text::Tradition::Collation::Reading',
93 Text::Tradition::Collation - a software model for a text collation
98 my $t = Text::Tradition->new(
99 'name' => 'this is a text',
101 'file' => '/path/to/tei_parallel_seg_file.xml' );
103 my $c = $t->collation;
104 my @readings = $c->readings;
105 my @paths = $c->paths;
106 my @relationships = $c->relationships;
108 my $svg_variant_graph = $t->collation->as_svg();
112 Text::Tradition is a library for representation and analysis of collated
113 texts, particularly medieval ones. The Collation is the central feature of
114 a Tradition, where the text, its sequence of readings, and its relationships
115 between readings are actually kept.
121 The constructor. Takes a hash or hashref of the following arguments:
125 =item * tradition - The Text::Tradition object to which the collation
128 =item * linear - Whether the collation should be linear; that is, whether
129 transposed readings should be treated as two linked readings rather than one,
130 and therefore whether the collation graph is acyclic. Defaults to true.
132 =item * baselabel - The default label for the path taken by a base text
133 (if any). Defaults to 'base text'.
135 =item * wit_list_separator - The string to join a list of witnesses for
136 purposes of making labels in display graphs. Defaults to ', '.
138 =item * ac_label - The extra label to tack onto a witness sigil when
139 representing another layer of path for the given witness - that is, when
140 a text has more than one possible reading due to scribal corrections or
141 the like. Defaults to ' (a.c.)'.
151 =head2 wit_list_separator
157 Simple accessors for collation attributes.
161 The meta-reading at the start of every witness path.
165 The meta-reading at the end of every witness path.
169 Returns all Reading objects in the graph.
171 =head2 reading( $id )
173 Returns the Reading object corresponding to the given ID.
175 =head2 add_reading( $reading_args )
177 Adds a new reading object to the collation.
178 See L<Text::Tradition::Collation::Reading> for the available arguments.
180 =head2 del_reading( $object_or_id )
182 Removes the given reading from the collation, implicitly removing its
183 paths and relationships.
185 =head2 merge_readings( $main, $second )
187 Merges the $second reading into the $main one.
188 The arguments may be either readings or reading IDs.
190 =head2 has_reading( $id )
192 Predicate to see whether a given reading ID is in the graph.
194 =head2 reading_witnesses( $object_or_id )
196 Returns a list of sigils whose witnesses contain the reading.
200 Returns all reading paths within the document - that is, all edges in the
201 collation graph. Each path is an arrayref of [ $source, $target ] reading IDs.
203 =head2 add_path( $source, $target, $sigil )
205 Links the given readings in the collation in sequence, under the given witness
206 sigil. The readings may be specified by object or ID.
208 =head2 del_path( $source, $target, $sigil )
210 Links the given readings in the collation in sequence, under the given witness
211 sigil. The readings may be specified by object or ID.
213 =head2 has_path( $source, $target );
215 Returns true if the two readings are linked in sequence in any witness.
216 The readings may be specified by object or ID.
220 Returns all Relationship objects in the collation.
222 =head2 add_relationship( $reading, $other_reading, $options )
224 Adds a new relationship of the type given in $options between the two readings,
225 which may be specified by object or ID. Returns a value of ( $status, @vectors)
226 where $status is true on success, and @vectors is a list of relationship edges
227 that were ultimately added.
228 See L<Text::Tradition::Collation::Relationship> for the available options.
234 $self->_set_relations( Text::Tradition::Collation::RelationshipStore->new( 'collation' => $self ) );
235 $self->_set_start( $self->add_reading( { 'collation' => $self, 'is_start' => 1 } ) );
236 $self->_set_end( $self->add_reading( { 'collation' => $self, 'is_end' => 1 } ) );
239 ### Reading construct/destruct functions
242 my( $self, $reading ) = @_;
243 unless( ref( $reading ) eq 'Text::Tradition::Collation::Reading' ) {
244 my %args = %$reading;
245 $reading = Text::Tradition::Collation::Reading->new(
246 'collation' => $self,
249 # First check to see if a reading with this ID exists.
250 if( $self->reading( $reading->id ) ) {
251 throw( "Collation already has a reading with id " . $reading->id );
253 $self->_add_reading( $reading->id => $reading );
254 # Once the reading has been added, put it in both graphs.
255 $self->sequence->add_vertex( $reading->id );
256 $self->relations->add_reading( $reading->id );
260 around del_reading => sub {
265 if( ref( $arg ) eq 'Text::Tradition::Collation::Reading' ) {
268 # Remove the reading from the graphs.
269 $self->sequence->delete_vertex( $arg );
270 $self->relations->delete_reading( $arg );
273 $self->$orig( $arg );
276 # merge_readings( $main, $to_be_deleted );
281 # We only need the IDs for adding paths to the graph, not the reading
282 # objects themselves.
283 my( $kept, $deleted, $combine_char ) = $self->_stringify_args( @_ );
285 # The kept reading should inherit the paths and the relationships
286 # of the deleted reading.
287 foreach my $path ( $self->sequence->edges_at( $deleted ) ) {
288 my @vector = ( $kept );
289 push( @vector, $path->[1] ) if $path->[0] eq $deleted;
290 unshift( @vector, $path->[0] ) if $path->[1] eq $deleted;
291 next if $vector[0] eq $vector[1]; # Don't add a self loop
292 my %wits = %{$self->sequence->get_edge_attributes( @$path )};
293 $self->sequence->add_edge( @vector );
294 my $fwits = $self->sequence->get_edge_attributes( @vector );
295 @wits{keys %$fwits} = values %$fwits;
296 $self->sequence->set_edge_attributes( @vector, \%wits );
298 $self->relations->merge_readings( $kept, $deleted, $combine_char );
300 # Do the deletion deed.
301 if( $combine_char ) {
302 my $kept_obj = $self->reading( $kept );
303 my $new_text = join( $combine_char, $kept_obj->text,
304 $self->reading( $deleted )->text );
305 $kept_obj->alter_text( $new_text );
307 $self->del_reading( $deleted );
311 # Helper function for manipulating the graph.
312 sub _stringify_args {
313 my( $self, $first, $second, $arg ) = @_;
315 if ref( $first ) eq 'Text::Tradition::Collation::Reading';
316 $second = $second->id
317 if ref( $second ) eq 'Text::Tradition::Collation::Reading';
318 return( $first, $second, $arg );
321 # Helper function for manipulating the graph.
322 sub _objectify_args {
323 my( $self, $first, $second, $arg ) = @_;
324 $first = $self->reading( $first )
325 unless ref( $first ) eq 'Text::Tradition::Collation::Reading';
326 $second = $self->reading( $second )
327 unless ref( $second ) eq 'Text::Tradition::Collation::Reading';
328 return( $first, $second, $arg );
335 # We only need the IDs for adding paths to the graph, not the reading
336 # objects themselves.
337 my( $source, $target, $wit ) = $self->_stringify_args( @_ );
339 # Connect the readings
340 $self->sequence->add_edge( $source, $target );
341 # Note the witness in question
342 $self->sequence->set_edge_attribute( $source, $target, $wit, 1 );
348 if( ref( $_[0] ) eq 'ARRAY' ) {
355 # We only need the IDs for adding paths to the graph, not the reading
356 # objects themselves.
357 my( $source, $target, $wit ) = $self->_stringify_args( @args );
359 if( $self->sequence->has_edge_attribute( $source, $target, $wit ) ) {
360 $self->sequence->delete_edge_attribute( $source, $target, $wit );
362 unless( keys %{$self->sequence->get_edge_attributes( $source, $target )} ) {
363 $self->sequence->delete_edge( $source, $target );
368 # Extra graph-alike utility
371 my( $source, $target, $wit ) = $self->_stringify_args( @_ );
372 return undef unless $self->sequence->has_edge( $source, $target );
373 return $self->sequence->has_edge_attribute( $source, $target, $wit );
376 =head2 clear_witness( @sigil_list )
378 Clear the given witnesses out of the collation entirely, removing references
379 to them in paths, and removing readings that belong only to them. Should only
380 be called via $tradition->del_witness.
385 my( $self, @sigils ) = @_;
387 # Clear the witness(es) out of the paths
388 foreach my $e ( $self->paths ) {
389 foreach my $sig ( @sigils ) {
390 $self->del_path( $e, $sig );
394 # Clear out the newly unused readings
395 foreach my $r ( $self->readings ) {
396 unless( $self->reading_witnesses( $r ) ) {
397 $self->del_reading( $r );
402 sub add_relationship {
404 my( $source, $target, $opts ) = $self->_stringify_args( @_ );
405 my( @vectors ) = $self->relations->add_relationship( $source,
406 $self->reading( $source ), $target, $self->reading( $target ), $opts );
407 # Force a full rank recalculation every time. Yuck.
408 $self->calculate_ranks() if $self->end->has_rank;
412 =head2 reading_witnesses( $reading )
414 Return a list of sigils corresponding to the witnesses in which the reading appears.
418 sub reading_witnesses {
419 my( $self, $reading ) = @_;
420 # We need only check either the incoming or the outgoing edges; I have
421 # arbitrarily chosen "incoming". Thus, special-case the start node.
422 if( $reading eq $self->start ) {
423 return map { $_->sigil } $self->tradition->witnesses;
426 foreach my $e ( $self->sequence->edges_to( $reading ) ) {
427 my $wits = $self->sequence->get_edge_attributes( @$e );
428 @all_witnesses{ keys %$wits } = 1;
430 return keys %all_witnesses;
433 =head1 OUTPUT METHODS
437 Returns an SVG string that represents the graph, via as_dot and graphviz.
444 my @cmd = qw/dot -Tsvg/;
446 my $dotfile = File::Temp->new();
448 # $dotfile->unlink_on_destroy(0);
449 binmode $dotfile, ':utf8';
450 print $dotfile $self->as_dot();
451 push( @cmd, $dotfile->filename );
452 run( \@cmd, ">", binary(), \$svg );
453 # HACK part 3 - remove silent node+edge
454 my $parser = XML::LibXML->new();
455 my $svgdom = $parser->parse_string( $svg );
456 my $xpc = XML::LibXML::XPathContext->new( $svgdom->documentElement );
457 $xpc->registerNs( 'svg', 'http://www.w3.org/2000/svg' );
458 my @hacknodes = $xpc->findnodes( '//svg:g[contains(child::svg:title, "#SILENT#")]' );
459 foreach my $h ( @hacknodes ) {
460 $h->parentNode->removeChild( $h );
462 return decode_utf8( $svgdom->toString() );
465 =head2 svg_subgraph( $from, $to )
467 Returns an SVG string that represents the portion of the graph given by the
468 specified range. The $from and $to variables refer to ranks within the graph.
473 my( $self, $from, $to ) = @_;
475 my $dot = $self->as_dot( $from, $to );
477 throw( "Could not output a graph with range $from - $to" );
480 my @cmd = qw/dot -Tsvg/;
482 my $dotfile = File::Temp->new();
484 # $dotfile->unlink_on_destroy(0);
485 binmode $dotfile, ':utf8';
487 push( @cmd, $dotfile->filename );
488 run( \@cmd, ">", binary(), \$svg );
489 $svg = decode_utf8( $svg );
494 =head2 as_dot( $from, $to )
496 Returns a string that is the collation graph expressed in dot
497 (i.e. GraphViz) format. If $from or $to is passed, as_dot creates
498 a subgraph rather than the entire graph.
503 my( $self, $startrank, $endrank ) = @_;
505 # Check the arguments
507 return if $endrank && $startrank > $endrank;
508 return if $startrank > $self->end->rank;
510 if( defined $endrank ) {
511 return if $endrank < 0;
512 $endrank = undef if $endrank == $self->end->rank;
515 # TODO consider making some of these things configurable
516 my $graph_name = $self->tradition->name;
517 $graph_name =~ s/[^\w\s]//g;
518 $graph_name = join( '_', split( /\s+/, $graph_name ) );
526 'fillcolor' => 'white',
531 'arrowhead' => 'open',
532 'color' => '#000000',
533 'fontcolor' => '#000000',
536 my $dot = sprintf( "digraph %s {\n", $graph_name );
537 $dot .= "\tgraph " . _dot_attr_string( \%graph_attrs ) . ";\n";
538 $dot .= "\tnode " . _dot_attr_string( \%node_attrs ) . ";\n";
540 # Output substitute start/end readings if necessary
542 $dot .= "\t\"#SUBSTART#\" [ label=\"...\" ];\n";
545 $dot .= "\t\"#SUBEND#\" [ label=\"...\" ];\n";
547 if( !$startrank && !$endrank ) {
549 $dot .= "\tsubgraph { rank=same \"#START#\" \"#SILENT#\" }\n";
550 $dot .= "\t\"#SILENT#\" [ color=white,penwidth=0,label=\"\" ];"
552 my %used; # Keep track of the readings that actually appear in the graph
553 foreach my $reading ( $self->readings ) {
554 # Only output readings within our rank range.
555 next if $startrank && $reading->rank < $startrank;
556 next if $endrank && $reading->rank > $endrank;
557 $used{$reading->id} = 1;
558 # Need not output nodes without separate labels
559 next if $reading->id eq $reading->text;
561 my $label = $reading->text;
562 $label =~ s/\"/\\\"/g;
563 $rattrs->{'label'} = $label;
564 # TODO make this an option?
565 # $rattrs->{'fillcolor'} = 'green' if $reading->is_common;
566 $dot .= sprintf( "\t\"%s\" %s;\n", $reading->id, _dot_attr_string( $rattrs ) );
570 my @edges = $self->paths;
571 my( %substart, %subend );
572 foreach my $edge ( @edges ) {
573 # Do we need to output this edge?
574 if( $used{$edge->[0]} && $used{$edge->[1]} ) {
575 my $label = $self->path_display_label( $self->path_witnesses( $edge ) );
576 my $variables = { %edge_attrs, 'label' => $label };
577 # Account for the rank gap if necessary
578 if( $self->reading( $edge->[1] )->has_rank
579 && $self->reading( $edge->[0] )->has_rank
580 && $self->reading( $edge->[1] )->rank
581 - $self->reading( $edge->[0] )->rank > 1 ) {
582 $variables->{'minlen'} = $self->reading( $edge->[1] )->rank
583 - $self->reading( $edge->[0] )->rank;
585 # EXPERIMENTAL: make edge width reflect no. of witnesses
586 my $extrawidth = scalar( $self->path_witnesses( $edge ) ) * 0.2;
587 $variables->{'penwidth'} = $extrawidth + 0.8; # gives 1 for a single wit
589 my $varopts = _dot_attr_string( $variables );
590 $dot .= sprintf( "\t\"%s\" -> \"%s\" %s;\n",
591 $edge->[0], $edge->[1], $varopts );
592 } elsif( $used{$edge->[0]} ) {
593 $subend{$edge->[0]} = 1;
594 } elsif( $used{$edge->[1]} ) {
595 $substart{$edge->[1]} = 1;
598 # Add substitute start and end edges if necessary
599 foreach my $node ( keys %substart ) {
600 my $witstr = $self->path_display_label ( $self->reading_witnesses( $self->reading( $node ) ) );
601 my $variables = { %edge_attrs, 'label' => $witstr };
602 my $varopts = _dot_attr_string( $variables );
603 $dot .= "\t\"#SUBSTART#\" -> \"$node\" $varopts;";
605 foreach my $node ( keys %subend ) {
606 my $witstr = $self->path_display_label ( $self->reading_witnesses( $self->reading( $node ) ) );
607 my $variables = { %edge_attrs, 'label' => $witstr };
608 my $varopts = _dot_attr_string( $variables );
609 $dot .= "\t\"$node\" -> \"#SUBEND#\" $varopts;";
612 if( !$startrank && !$endrank ) {
613 $dot .= "\t\"#END#\" -> \"#SILENT#\" [ color=white,penwidth=0 ];\n";
620 sub _dot_attr_string {
623 foreach my $k ( sort keys %$hash ) {
625 push( @attrs, $k.'="'.$v.'"' );
627 return( '[ ' . join( ', ', @attrs ) . ' ]' );
631 my( $self, @edge ) = @_;
632 # If edge is an arrayref, cope.
633 if( @edge == 1 && ref( $edge[0] ) eq 'ARRAY' ) {
637 my @wits = keys %{$self->sequence->get_edge_attributes( @edge )};
641 sub path_display_label {
644 my $maj = scalar( $self->tradition->witnesses ) * 0.6;
645 if( scalar @wits > $maj ) {
646 # TODO break out a.c. wits
649 return join( ', ', @wits );
656 Returns a GraphML representation of the collation. The GraphML will contain
657 two graphs. The first expresses the attributes of the readings and the witness
658 paths that link them; the second expresses the relationships that link the
659 readings. This is the native transfer format for a tradition.
668 my $datafile = 't/data/florilegium_tei_ps.xml';
669 my $tradition = Text::Tradition->new( 'input' => 'TEI',
674 ok( $tradition, "Got a tradition object" );
675 is( scalar $tradition->witnesses, 13, "Found all witnesses" );
676 ok( $tradition->collation, "Tradition has a collation" );
678 my $c = $tradition->collation;
679 is( scalar $c->readings, $READINGS, "Collation has all readings" );
680 is( scalar $c->paths, $PATHS, "Collation has all paths" );
681 is( scalar $c->relationships, 0, "Collation has all relationships" );
683 # Add a few relationships
684 $c->add_relationship( 'w123', 'w125', { 'type' => 'collated' } );
685 $c->add_relationship( 'w193', 'w196', { 'type' => 'collated' } );
686 $c->add_relationship( 'w257', 'w262', { 'type' => 'transposition' } );
688 # Now write it to GraphML and parse it again.
690 my $graphml = $c->as_graphml;
691 my $st = Text::Tradition->new( 'input' => 'Self', 'string' => $graphml );
692 is( scalar $st->collation->readings, $READINGS, "Reparsed collation has all readings" );
693 is( scalar $st->collation->paths, $PATHS, "Reparsed collation has all paths" );
694 is( scalar $st->collation->relationships, 3, "Reparsed collation has new relationships" );
704 my $graphml_ns = 'http://graphml.graphdrawing.org/xmlns';
705 my $xsi_ns = 'http://www.w3.org/2001/XMLSchema-instance';
706 my $graphml_schema = 'http://graphml.graphdrawing.org/xmlns ' .
707 'http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd';
709 # Create the document and root node
710 my $graphml = XML::LibXML->createDocument( "1.0", "UTF-8" );
711 my $root = $graphml->createElementNS( $graphml_ns, 'graphml' );
712 $graphml->setDocumentElement( $root );
713 $root->setNamespace( $xsi_ns, 'xsi', 0 );
714 $root->setAttributeNS( $xsi_ns, 'schemaLocation', $graphml_schema );
716 # Add the data keys for the graph
719 my @graph_attributes = qw/ version wit_list_separator baselabel linear ac_label /;
720 foreach my $datum ( @graph_attributes ) {
721 $graph_data_keys{$datum} = 'dg'.$gdi++;
722 my $key = $root->addNewChild( $graphml_ns, 'key' );
723 $key->setAttribute( 'attr.name', $datum );
724 $key->setAttribute( 'attr.type', $key eq 'linear' ? 'boolean' : 'string' );
725 $key->setAttribute( 'for', 'graph' );
726 $key->setAttribute( 'id', $graph_data_keys{$datum} );
729 # Add the data keys for nodes
736 is_start => 'boolean',
738 is_lacuna => 'boolean',
740 foreach my $datum ( keys %node_data ) {
741 $node_data_keys{$datum} = 'dn'.$ndi++;
742 my $key = $root->addNewChild( $graphml_ns, 'key' );
743 $key->setAttribute( 'attr.name', $datum );
744 $key->setAttribute( 'attr.type', $node_data{$datum} );
745 $key->setAttribute( 'for', 'node' );
746 $key->setAttribute( 'id', $node_data_keys{$datum} );
749 # Add the data keys for edges, i.e. witnesses
753 class => 'string', # Class, deprecated soon
754 witness => 'string', # ID/label for a path
755 relationship => 'string', # ID/label for a relationship
756 extra => 'boolean', # Path key
757 scope => 'string', # Relationship key
758 non_correctable => 'boolean', # Relationship key
759 non_independent => 'boolean', # Relationship key
761 foreach my $datum ( keys %edge_data ) {
762 $edge_data_keys{$datum} = 'de'.$edi++;
763 my $key = $root->addNewChild( $graphml_ns, 'key' );
764 $key->setAttribute( 'attr.name', $datum );
765 $key->setAttribute( 'attr.type', $edge_data{$datum} );
766 $key->setAttribute( 'for', 'edge' );
767 $key->setAttribute( 'id', $edge_data_keys{$datum} );
770 # Add the collation graph itself
771 my $sgraph = $root->addNewChild( $graphml_ns, 'graph' );
772 $sgraph->setAttribute( 'edgedefault', 'directed' );
773 $sgraph->setAttribute( 'id', $self->tradition->name );
774 $sgraph->setAttribute( 'parse.edgeids', 'canonical' );
775 $sgraph->setAttribute( 'parse.edges', scalar($self->paths) );
776 $sgraph->setAttribute( 'parse.nodeids', 'canonical' );
777 $sgraph->setAttribute( 'parse.nodes', scalar($self->readings) );
778 $sgraph->setAttribute( 'parse.order', 'nodesfirst' );
780 # Collation attribute data
781 foreach my $datum ( @graph_attributes ) {
782 my $value = $datum eq 'version' ? '3.0' : $self->$datum;
783 _add_graphml_data( $sgraph, $graph_data_keys{$datum}, $value );
788 # Add our readings to the graph
789 foreach my $n ( sort { $a->id cmp $b->id } $self->readings ) {
790 # Add to the main graph
791 my $node_el = $sgraph->addNewChild( $graphml_ns, 'node' );
792 my $node_xmlid = 'n' . $node_ctr++;
793 $node_hash{ $n->id } = $node_xmlid;
794 $node_el->setAttribute( 'id', $node_xmlid );
795 foreach my $d ( keys %node_data ) {
797 _add_graphml_data( $node_el, $node_data_keys{$d}, $nval )
802 # Add the path edges to the sequence graph
804 foreach my $e ( sort { $a->[0] cmp $b->[0] } $self->sequence->edges() ) {
805 # We add an edge in the graphml for every witness in $e.
806 foreach my $wit ( sort $self->path_witnesses( $e ) ) {
807 my( $id, $from, $to ) = ( 'e'.$edge_ctr++,
808 $node_hash{ $e->[0] },
809 $node_hash{ $e->[1] } );
810 my $edge_el = $sgraph->addNewChild( $graphml_ns, 'edge' );
811 $edge_el->setAttribute( 'source', $from );
812 $edge_el->setAttribute( 'target', $to );
813 $edge_el->setAttribute( 'id', $id );
815 # It's a witness path, so add the witness
817 my $key = $edge_data_keys{'witness'};
818 # Is this an ante-corr witness?
819 my $aclabel = $self->ac_label;
820 if( $wit =~ /^(.*)\Q$aclabel\E$/ ) {
821 # Keep the base witness
823 # ...and record that this is an 'extra' reading path
824 _add_graphml_data( $edge_el, $edge_data_keys{'extra'}, $aclabel );
826 _add_graphml_data( $edge_el, $edge_data_keys{'witness'}, $base );
827 _add_graphml_data( $edge_el, $edge_data_keys{'class'}, 'path' );
831 # Add the relationship graph to the XML
832 $self->relations->as_graphml( $graphml_ns, $root, \%node_hash,
833 $node_data_keys{'id'}, \%edge_data_keys );
835 # Save and return the thing
836 my $result = decode_utf8( $graphml->toString(1) );
840 sub _add_graphml_data {
841 my( $el, $key, $value ) = @_;
842 return unless defined $value;
843 my $data_el = $el->addNewChild( $el->namespaceURI, 'data' );
844 $data_el->setAttribute( 'key', $key );
845 $data_el->appendText( $value );
850 Returns a CSV alignment table representation of the collation graph, one
851 row per witness (or witness uncorrected.)
857 my $table = $self->make_alignment_table;
858 my $csv = Text::CSV_XS->new( { binary => 1, quote_null => 0 } );
860 # Make the header row
861 $csv->combine( map { $_->{'witness'} } @{$table->{'alignment'}} );
862 push( @result, decode_utf8( $csv->string ) );
863 # Make the rest of the rows
864 foreach my $idx ( 0 .. $table->{'length'} - 1 ) {
865 my @rowobjs = map { $_->{'tokens'}->[$idx] } @{$table->{'alignment'}};
866 my @row = map { $_ ? $_->{'t'} : $_ } @rowobjs;
867 $csv->combine( @row );
868 push( @result, decode_utf8( $csv->string ) );
870 return join( "\n", @result );
873 =head2 make_alignment_table( $use_refs, $include_witnesses )
875 Return a reference to an alignment table, in a slightly enhanced CollateX
876 format which looks like this:
878 $table = { alignment => [ { witness => "SIGIL",
879 tokens => [ { t => "TEXT" }, ... ] },
881 tokens => [ { t => "TEXT" }, ... ] },
885 If $use_refs is set to 1, the reading object is returned in the table
886 instead of READINGTEXT; if not, the text of the reading is returned.
888 If $include_witnesses is set to a hashref, only the witnesses whose sigil
889 keys have a true hash value will be included.
893 sub make_alignment_table {
894 my( $self, $noderefs, $include ) = @_;
895 unless( $self->linear ) {
896 throw( "Need a linear graph in order to make an alignment table" );
898 my $table = { 'alignment' => [], 'length' => $self->end->rank - 1 };
899 my @all_pos = ( 1 .. $self->end->rank - 1 );
900 foreach my $wit ( sort { $a->sigil cmp $b->sigil } $self->tradition->witnesses ) {
902 next unless $include->{$wit->sigil};
904 # print STDERR "Making witness row(s) for " . $wit->sigil . "\n";
905 my @wit_path = $self->reading_sequence( $self->start, $self->end, $wit->sigil );
906 my @row = _make_witness_row( \@wit_path, \@all_pos, $noderefs );
907 push( @{$table->{'alignment'}},
908 { 'witness' => $wit->sigil, 'tokens' => \@row } );
909 if( $wit->is_layered ) {
910 my @wit_ac_path = $self->reading_sequence( $self->start, $self->end,
911 $wit->sigil.$self->ac_label );
912 my @ac_row = _make_witness_row( \@wit_ac_path, \@all_pos, $noderefs );
913 push( @{$table->{'alignment'}},
914 { 'witness' => $wit->sigil.$self->ac_label, 'tokens' => \@ac_row } );
920 sub _make_witness_row {
921 my( $path, $positions, $noderefs ) = @_;
923 map { $char_hash{$_} = undef } @$positions;
925 foreach my $rdg ( @$path ) {
926 my $rtext = $rdg->text;
927 $rtext = '#LACUNA#' if $rdg->is_lacuna;
928 print STDERR "rank " . $rdg->rank . "\n" if $debug;
929 # print STDERR "No rank for " . $rdg->id . "\n" unless defined $rdg->rank;
930 $char_hash{$rdg->rank} = $noderefs ? { 't' => $rdg }
933 my @row = map { $char_hash{$_} } @$positions;
934 # Fill in lacuna markers for undef spots in the row
935 my $last_el = shift @row;
936 my @filled_row = ( $last_el );
937 foreach my $el ( @row ) {
938 # If we are using node reference, make the lacuna node appear many times
939 # in the table. If not, use the lacuna tag.
940 if( $last_el && _el_is_lacuna( $last_el ) && !defined $el ) {
941 $el = $noderefs ? $last_el : { 't' => '#LACUNA#' };
943 push( @filled_row, $el );
949 # Tiny utility function to say if a table element is a lacuna
952 return 1 if $el->{'t'} eq '#LACUNA#';
953 return 1 if ref( $el->{'t'} ) eq 'Text::Tradition::Collation::Reading'
954 && $el->{'t'}->is_lacuna;
958 # Helper to turn the witnesses along columns rather than rows. Assumes
963 return $result unless scalar @$table;
964 my $nrows = scalar @{$table->[0]};
965 foreach my $idx ( 0 .. $nrows - 1 ) {
966 foreach my $wit ( 0 .. $#{$table} ) {
967 $result->[$idx]->[$wit] = $table->[$wit]->[$idx];
973 =head1 NAVIGATION METHODS
975 =head2 reading_sequence( $first, $last, $sigil, $backup )
977 Returns the ordered list of readings, starting with $first and ending
978 with $last, for the witness given in $sigil. If a $backup sigil is
979 specified (e.g. when walking a layered witness), it will be used wherever
980 no $sigil path exists. If there is a base text reading, that will be
981 used wherever no path exists for $sigil or $backup.
985 # TODO Think about returning some lazy-eval iterator.
986 # TODO Get rid of backup; we should know from what witness is whether we need it.
988 sub reading_sequence {
989 my( $self, $start, $end, $witness ) = @_;
991 $witness = $self->baselabel unless $witness;
992 my @readings = ( $start );
995 while( $n && $n->id ne $end->id ) {
996 if( exists( $seen{$n->id} ) ) {
997 throw( "Detected loop for $witness at " . $n->id );
1001 my $next = $self->next_reading( $n, $witness );
1003 throw( "Did not find any path for $witness from reading " . $n->id );
1005 push( @readings, $next );
1008 # Check that the last reading is our end reading.
1009 my $last = $readings[$#readings];
1010 throw( "Last reading found from " . $start->text .
1011 " for witness $witness is not the end!" ) # TODO do we get this far?
1012 unless $last->id eq $end->id;
1017 =head2 next_reading( $reading, $sigil );
1019 Returns the reading that follows the given reading along the given witness
1025 # Return the successor via the corresponding path.
1027 my $answer = $self->_find_linked_reading( 'next', @_ );
1028 return undef unless $answer;
1029 return $self->reading( $answer );
1032 =head2 prior_reading( $reading, $sigil )
1034 Returns the reading that precedes the given reading along the given witness
1040 # Return the predecessor via the corresponding path.
1042 my $answer = $self->_find_linked_reading( 'prior', @_ );
1043 return $self->reading( $answer );
1046 sub _find_linked_reading {
1047 my( $self, $direction, $node, $path ) = @_;
1049 # Get a backup if we are dealing with a layered witness
1051 my $aclabel = $self->ac_label;
1052 if( $path && $path =~ /^(.*)\Q$aclabel\E$/ ) {
1056 my @linked_paths = $direction eq 'next'
1057 ? $self->sequence->edges_from( $node )
1058 : $self->sequence->edges_to( $node );
1059 return undef unless scalar( @linked_paths );
1061 # We have to find the linked path that contains all of the
1062 # witnesses supplied in $path.
1063 my( @path_wits, @alt_path_wits );
1064 @path_wits = sort( $self->_witnesses_of_label( $path ) ) if $path;
1065 @alt_path_wits = sort( $self->_witnesses_of_label( $alt_path ) ) if $alt_path;
1068 foreach my $le ( @linked_paths ) {
1069 if( $self->sequence->has_edge_attribute( @$le, $self->baselabel ) ) {
1072 my @le_wits = sort $self->path_witnesses( $le );
1073 if( _is_within( \@path_wits, \@le_wits ) ) {
1074 # This is the right path.
1075 return $direction eq 'next' ? $le->[1] : $le->[0];
1076 } elsif( _is_within( \@alt_path_wits, \@le_wits ) ) {
1080 # Got this far? Return the alternate path if it exists.
1081 return $direction eq 'next' ? $alt_le->[1] : $alt_le->[0]
1084 # Got this far? Return the base path if it exists.
1085 return $direction eq 'next' ? $base_le->[1] : $base_le->[0]
1088 # Got this far? We have no appropriate path.
1089 warn "Could not find $direction node from " . $node->id
1090 . " along path $path";
1096 my( $set1, $set2 ) = @_;
1097 my $ret = @$set1; # will be 0, i.e. false, if set1 is empty
1098 foreach my $el ( @$set1 ) {
1099 $ret = 0 unless grep { /^\Q$el\E$/ } @$set2;
1104 # Return the string that joins together a list of witnesses for
1105 # display on a single path.
1106 sub _witnesses_of_label {
1107 my( $self, $label ) = @_;
1108 my $regex = $self->wit_list_separator;
1109 my @answer = split( /\Q$regex\E/, $label );
1113 =head2 common_readings
1115 Returns the list of common readings in the graph (i.e. those readings that are
1116 shared by all non-lacunose witnesses.)
1120 sub common_readings {
1122 my @common = grep { $_->is_common } $self->readings;
1126 =head2 path_text( $sigil, $mainsigil [, $start, $end ] )
1128 Returns the text of a witness (plus its backup, if we are using a layer)
1129 as stored in the collation. The text is returned as a string, where the
1130 individual readings are joined with spaces and the meta-readings (e.g.
1131 lacunae) are omitted. Optional specification of $start and $end allows
1132 the generation of a subset of the witness text.
1137 my( $self, $wit, $start, $end ) = @_;
1138 $start = $self->start unless $start;
1139 $end = $self->end unless $end;
1140 my @path = grep { !$_->is_meta } $self->reading_sequence( $start, $end, $wit );
1141 return join( ' ', map { $_->text } @path );
1144 =head1 INITIALIZATION METHODS
1146 These are mostly for use by parsers.
1148 =head2 make_witness_path( $witness )
1150 Link the array of readings contained in $witness->path (and in
1151 $witness->uncorrected_path if it exists) into collation paths.
1152 Clear out the arrays when finished.
1154 =head2 make_witness_paths
1156 Call make_witness_path for all witnesses in the tradition.
1160 # For use when a collation is constructed from a base text and an apparatus.
1161 # We have the sequences of readings and just need to add path edges.
1162 # When we are done, clear out the witness path attributes, as they are no
1164 # TODO Find a way to replace the witness path attributes with encapsulated functions?
1166 sub make_witness_paths {
1168 foreach my $wit ( $self->tradition->witnesses ) {
1169 # print STDERR "Making path for " . $wit->sigil . "\n";
1170 $self->make_witness_path( $wit );
1174 sub make_witness_path {
1175 my( $self, $wit ) = @_;
1176 my @chain = @{$wit->path};
1177 my $sig = $wit->sigil;
1178 foreach my $idx ( 0 .. $#chain-1 ) {
1179 $self->add_path( $chain[$idx], $chain[$idx+1], $sig );
1181 if( $wit->is_layered ) {
1182 @chain = @{$wit->uncorrected_path};
1183 foreach my $idx( 0 .. $#chain-1 ) {
1184 my $source = $chain[$idx];
1185 my $target = $chain[$idx+1];
1186 $self->add_path( $source, $target, $sig.$self->ac_label )
1187 unless $self->has_path( $source, $target, $sig );
1191 $wit->clear_uncorrected_path;
1194 =head2 calculate_ranks
1196 Calculate the reading ranks (that is, their aligned positions relative
1197 to each other) for the graph. This can only be called on linear collations.
1201 sub calculate_ranks {
1203 # Walk a version of the graph where every node linked by a relationship
1204 # edge is fundamentally the same node, and do a topological ranking on
1205 # the nodes in this graph.
1206 my $topo_graph = Graph->new();
1210 foreach my $r ( $self->readings ) {
1211 next if exists $rel_containers{$r->id};
1212 my @rels = $r->related_readings( 'colocated' );
1214 # Make a relationship container.
1216 my $rn = 'rel_container_' . $rel_ctr++;
1217 $topo_graph->add_vertex( $rn );
1219 $rel_containers{$_->id} = $rn;
1222 # Add a new node to mirror the old node.
1223 $rel_containers{$r->id} = $r->id;
1224 $topo_graph->add_vertex( $r->id );
1229 foreach my $r ( $self->readings ) {
1230 foreach my $n ( $self->sequence->successors( $r->id ) ) {
1231 my( $tfrom, $tto ) = ( $rel_containers{$r->id},
1232 $rel_containers{$n} );
1233 # $DB::single = 1 unless $tfrom && $tto;
1234 $topo_graph->add_edge( $tfrom, $tto );
1238 # Now do the rankings, starting with the start node.
1239 my $topo_start = $rel_containers{$self->start->id};
1240 my $node_ranks = { $topo_start => 0 };
1241 my @curr_origin = ( $topo_start );
1242 # A little iterative function.
1243 while( @curr_origin ) {
1244 @curr_origin = _assign_rank( $topo_graph, $node_ranks, @curr_origin );
1246 # Transfer our rankings from the topological graph to the real one.
1247 foreach my $r ( $self->readings ) {
1248 if( defined $node_ranks->{$rel_containers{$r->id}} ) {
1249 $r->rank( $node_ranks->{$rel_containers{$r->id}} );
1251 # Die. Find the last rank we calculated.
1252 my @all_defined = sort { $node_ranks->{$rel_containers{$a->id}}
1253 <=> $node_ranks->{$rel_containers{$b->id}} }
1255 my $last = pop @all_defined;
1256 throw( "Ranks not calculated after $last - do you have a cycle in the graph?" );
1262 my( $graph, $node_ranks, @current_nodes ) = @_;
1263 # Look at each of the children of @current_nodes. If all the child's
1264 # parents have a rank, assign it the highest rank + 1 and add it to
1265 # @next_nodes. Otherwise skip it; we will return when the highest-ranked
1266 # parent gets a rank.
1268 foreach my $c ( @current_nodes ) {
1269 warn "Current reading $c has no rank!"
1270 unless exists $node_ranks->{$c};
1271 # print STDERR "Looking at child of node $c, rank "
1272 # . $node_ranks->{$c} . "\n";
1273 foreach my $child ( $graph->successors( $c ) ) {
1274 next if exists $node_ranks->{$child};
1275 my $highest_rank = -1;
1277 foreach my $parent ( $graph->predecessors( $child ) ) {
1278 if( exists $node_ranks->{$parent} ) {
1279 $highest_rank = $node_ranks->{$parent}
1280 if $highest_rank <= $node_ranks->{$parent};
1287 my $c_rank = $highest_rank + 1;
1288 # print STDERR "Assigning rank $c_rank to node $child \n";
1289 $node_ranks->{$child} = $c_rank;
1290 push( @next_nodes, $child );
1296 =head2 flatten_ranks
1298 A convenience method for parsing collation data. Searches the graph for readings
1299 with the same text at the same rank, and merges any that are found.
1305 my %unique_rank_rdg;
1306 foreach my $rdg ( $self->readings ) {
1307 next unless $rdg->has_rank;
1308 my $key = $rdg->rank . "||" . $rdg->text;
1309 if( exists $unique_rank_rdg{$key} ) {
1311 # print STDERR "Combining readings at same rank: $key\n";
1312 $self->merge_readings( $unique_rank_rdg{$key}, $rdg );
1314 $unique_rank_rdg{$key} = $rdg;
1319 =head2 calculate_common_readings
1321 Goes through the graph identifying the readings that appear in every witness
1322 (apart from those with lacunae at that spot.) Marks them as common and returns
1327 use Text::Tradition;
1329 my $cxfile = 't/data/Collatex-16.xml';
1330 my $t = Text::Tradition->new(
1332 'input' => 'CollateX',
1335 my $c = $t->collation;
1337 my @common = $c->calculate_common_readings();
1338 is( scalar @common, 8, "Found correct number of common readings" );
1339 my @marked = sort $c->common_readings();
1340 is( scalar @common, 8, "All common readings got marked as such" );
1341 my @expected = qw/ n1 n12 n16 n19 n20 n5 n6 n7 /;
1342 is_deeply( \@marked, \@expected, "Found correct list of common readings" );
1348 sub calculate_common_readings {
1351 my $table = $self->make_alignment_table( 1 );
1352 foreach my $idx ( 0 .. $table->{'length'} - 1 ) {
1353 my @row = map { $_->{'tokens'}->[$idx]->{'t'} } @{$table->{'alignment'}};
1355 foreach my $r ( @row ) {
1357 $hash{$r->id} = $r unless $r->is_meta;
1359 $hash{'UNDEF'} = $r;
1362 if( keys %hash == 1 && !exists $hash{'UNDEF'} ) {
1363 my( $r ) = values %hash;
1365 push( @common, $r );
1371 =head2 text_from_paths
1373 Calculate the text array for all witnesses from the path, for later consistency
1374 checking. Only to be used if there is no non-graph-based way to know the
1379 sub text_from_paths {
1381 foreach my $wit ( $self->tradition->witnesses ) {
1382 my @text = split( /\s+/,
1383 $self->reading_sequence( $self->start, $self->end, $wit->sigil ) );
1384 $wit->text( \@text );
1385 if( $wit->is_layered ) {
1386 my @uctext = split( /\s+/,
1387 $self->reading_sequence( $self->start, $self->end,
1388 $wit->sigil.$self->ac_label ) );
1389 $wit->text( \@uctext );
1394 =head1 UTILITY FUNCTIONS
1396 =head2 common_predecessor( $reading_a, $reading_b )
1398 Find the last reading that occurs in sequence before both the given readings.
1400 =head2 common_successor( $reading_a, $reading_b )
1402 Find the first reading that occurs in sequence after both the given readings.
1406 use Text::Tradition;
1408 my $cxfile = 't/data/Collatex-16.xml';
1409 my $t = Text::Tradition->new(
1411 'input' => 'CollateX',
1414 my $c = $t->collation;
1416 is( $c->common_predecessor( 'n9', 'n23' )->id,
1417 'n20', "Found correct common predecessor" );
1418 is( $c->common_successor( 'n9', 'n23' )->id,
1419 '#END#', "Found correct common successor" );
1421 is( $c->common_predecessor( 'n19', 'n17' )->id,
1422 'n16', "Found correct common predecessor for readings on same path" );
1423 is( $c->common_successor( 'n21', 'n26' )->id,
1424 '#END#', "Found correct common successor for readings on same path" );
1430 ## Return the closest reading that is a predecessor of both the given readings.
1431 sub common_predecessor {
1433 my( $r1, $r2 ) = $self->_objectify_args( @_ );
1434 return $self->common_in_path( $r1, $r2, 'predecessors' );
1437 sub common_successor {
1439 my( $r1, $r2 ) = $self->_objectify_args( @_ );
1440 return $self->common_in_path( $r1, $r2, 'successors' );
1443 sub common_in_path {
1444 my( $self, $r1, $r2, $dir ) = @_;
1445 my $iter = $r1->rank > $r2->rank ? $r1->rank : $r2->rank;
1446 $iter = $self->end->rank - $iter if $dir eq 'successors';
1448 my @last_checked = ( $r1, $r2 );
1450 while( !@candidates ) {
1452 foreach my $lc ( @last_checked ) {
1453 foreach my $p ( $lc->$dir ) {
1454 if( $all_seen{$p->id} ) {
1455 push( @candidates, $p );
1457 $all_seen{$p->id} = 1;
1458 push( @new_lc, $p );
1462 @last_checked = @new_lc;
1464 my @answer = sort { $a->rank <=> $b->rank } @candidates;
1465 return $dir eq 'predecessors' ? pop( @answer ) : shift ( @answer );
1469 Text::Tradition::Error->throw(
1470 'ident' => 'Collation error',
1476 __PACKAGE__->meta->make_immutable;
1482 =item * Get rid of $backup in reading_sequence