=head1 NAME UML::Sequence - Render UML sequence diagrams, often by running the code. =head1 SYNOPSIS use UML::Sequence; my $tree = UML::Sequence->new(\@methods, \@outline, \&parse_method); print $tree->build_xml_sequence('Title'); =head1 DESCRIPTION To use this package, or see how to use it, see L and L. This class helps produce UML sequence diagrams. build_xml_sequence returns a string (suitable for printing to a file) which the seq2svg.pl script converts into svg. To control the appearance of the sequence diagram, pass to the constructor: 1 a reference to an array containing the signatures you want to hear about or a reference to a hash whose keys are the signatures you want 2 a reference to an array containing the lines in the outline of calls 3 a reference to a sub which takes signatures and returns class and method names To build the array references and supply the code reference consult UML::Sequence::SimpleSeq, UML::Sequence::JavaSeq, or UML::Sequence::PerlSeq. To see one way to call these look in the supplied genericseq script. =head2 EXPORT None, this module is object oriented. =cut package UML::Sequence; require 5.005_62; use strict; use warnings; our $VERSION = '0.08'; use UML::Sequence::Activation; sub new { my $class = shift; # standard my $methods_to_include = shift; # array or hash of methods you want to see my $input = shift; # the outline of calls my $parse_signature = shift; # code ref which returns class and method my $grab_methods = shift; # coderef to return method name my $methods_hash; if (ref($methods_to_include) =~ /ARRAY/) { $methods_hash = _build_methods_hash($methods_to_include); } else { $methods_hash = $methods_to_include; } my $stack = []; my $root = { LEVEL => -1, DATA => [], NAME => scalar &$parse_signature($input->[0]), INPUT => $input->[0], DISCARD => 0, }; shift @$input; my $self = {}; $self->{TREE} = $root; $self->{STACK} = $stack; $self->{INCLUDE} = $methods_hash; $self->{SIGPARSE} = $parse_signature; $self->{GRABMETHODS} = $grab_methods; bless $self, $class; push @$stack, $root; # 2. foreach (@$input) { my $input_line = $_; my $depth; $depth = ($input_line =~ s/^(\s+)//) ? length($1) : 0; $self->_update_stack($input_line, $depth); } return $self; } sub _grab_outline_text { # 1a. _run_dprof(@_); # 1b. my $input = _read_dprofpp(); # The next line uses the sample data in __DATA__ see the comment there # my $input = _read_sample(); return $input; } sub _build_methods_hash { my $methods_list = shift; my %methods_hash; foreach my $method (@$methods_list) { $methods_hash{$method}++; } return \%methods_hash; } #sub _read_sample { # my @retval = map { chomp $_; $_; } ; # return \@retval; #} sub _update_stack { my $self = shift; my $method = shift; my $level = shift; my $new_node = { LEVEL => $level, DATA => [], NAME => $method, # # DAA save original input line, which may contain # extra stuff # INPUT => $method, # DISCARD => 0, }; pop @{$self->{STACK}} while ($level <= $self->{STACK}[-1]{LEVEL}); $new_node->{DISCARD} = $self->{STACK}[-1]{DISCARD}; unless (defined($self->{INCLUDE}{$method})) { # # the line may have magic, try to capture the extra stuff # my $methods = $self->{GRABMETHODS}->([ $method ]); my @methods; if ( ref( $methods ) eq 'ARRAY' ) { @methods = @{ $methods }; } else { @methods = keys %$methods; } $method = shift @methods; $new_node->{DISCARD} = ($method && $self->{INCLUDE}{$method}); } push @{$self->{STACK}[-1]{DATA}}, $new_node; push @{$self->{STACK}}, $new_node; } sub print_tree { my $self = shift; return _print_tree($self->{TREE}, ""); } sub _print_tree { my $root = shift; my $indent = shift; my $retval; return unless defined $root; # recursion base return if ($root->{DISCARD}); $retval = "$indent$root->{NAME}\n"; foreach my $child (@{$root->{DATA}}) { my $child_output = _print_tree($child, "$indent "); $retval .= $child_output if $child_output; } return $retval; } sub build_xml_sequence { my $self = shift; my $title = shift; $self->{ARROW_NUM} = 0; $self->{ARROW_LIST} = "\n"; $self->_build_xml_sequence($self->{TREE}); $self->{ARROW_LIST} .= "\n"; $self->_build_class_list(); if ($title) { return "\n\n" . "$self->{CLASS_LIST}\n" . "$self->{ARROW_LIST}\n"; } else { return "\n\n$self->{CLASS_LIST}\n" . "$self->{ARROW_LIST}\n"; } } sub _build_xml_sequence { my $self = shift; my $root = shift; # you must pass this in, $self->{TREE} never changes my $hasreturn = shift; # recursion bases return unless defined $root; return if $root->{DISCARD}; my $root_call = $root->{NAME}; return unless defined $root_call; my $class = $self->{SIGPARSE}($root_call); # put into to class list, if it isn't already there push @{$self->{CLASSES}}, $class unless defined $self->{ACTIVATIONS}{$class}; # create activation and add it to the list for this class my $activation = UML::Sequence::Activation->new(); $activation->starts($self->{ARROW_NUM}); my $offset = UML::Sequence::Activation ->find_offset($self->{ACTIVATIONS}{$class}); $activation->offset($offset); push @{$self->{ACTIVATIONS}{$class}}, $activation; my $asyncs = 0; # visit children foreach my $child (@{$root->{DATA}}) { next if $child->{DISCARD}; # # DAA updated to report returnlist, iterator, conditional, urgency, # and annotation # my ($child_class, $method, $returns, $iterator, $urgent, $condition, $annot) = $self->{SIGPARSE}($child->{INPUT}); my $child_offset = UML::Sequence::Activation ->find_offset($self->{ACTIVATIONS}{$child_class}) unless ($child_class eq '_EXTERNAL'); # # DAA add pending annotation # my $closetag = "/>\n"; # # until we figure out how to use CDATA and a text element w/ # XML::DOM, we'll have to force dquotes to squotes # $annot=~s/"/'/g, $closetag = ">\n\n\n", $annot = undef if $annot; $self->{ARROW_NUM}++; $method=~s/\s+$//; $method .= ' !' if $urgent; $method = '* ' . $method if $iterator; $method = "$condition $method" if $condition; my $type = ($child_class eq '_EXTERNAL') ? 'async' : 'call'; $asyncs++ if ($type eq 'async'); $self->{ARROW_LIST} .= ($type eq 'async') ? " _build_xml_sequence($child, $returns) unless ($type eq 'async'); # # DAA add return values if any # $self->{ARROW_LIST} .= " \n" if $returns; } $self->{ARROW_NUM}++ if $hasreturn; $activation->ends($self->{ARROW_NUM}); # # if outermost, and it had an external, add external class # to output # if ($asyncs && ($self->{TREE}{NAME} eq $root->{NAME})) { unshift @{$self->{CLASSES}}, '_EXTERNAL'; # create activation and add it to the list for this class my $activation = UML::Sequence::Activation->new(); $activation->starts(0); my $offset = UML::Sequence::Activation ->find_offset($self->{ACTIVATIONS}{_EXTERNAL}); $activation->offset($offset); $activation->ends($self->{ARROW_NUM}); push @{$self->{ACTIVATIONS}{_EXTERNAL}}, $activation; } } sub _build_class_list { my $self = shift; $self->{CLASS_LIST} = "\n"; foreach my $class (@{$self->{CLASSES}}) { my ($starts, $ends) = UML::Sequence::Activation ->find_bounds($self->{ACTIVATIONS}{$class}); $self->{CLASS_LIST} .= " \n" . " \n"; foreach my $activation (@{$self->{ACTIVATIONS}{$class}}) { my $act_start = $activation->starts(); my $act_end = $activation->ends(); my $act_offset = $activation->offset(); $self->{CLASS_LIST} .= " \n"; } $self->{CLASS_LIST} .= " \n \n"; } $self->{CLASS_LIST} .= "\n"; } 1; =head1 AUTHOR Phil Crow, Version 0.06 updates by Dean Arnold, =head1 SEE ALSO L L L =head1 COPYRIGHT Copyright(C) 2003-2006, Philip Crow, all rights reserved. You may modify and/or redistribute this code in the same manner as Perl itself. =cut # This data is a small subset of a typical dprofpp -T output. # It's used by _read_sample so you can debug with a small input set. # Use _read_sample in place of _read_dprofpp to switch to this set. __DATA__ DiePair::new Die::new Die::new DiePair::roll Die::roll Die::roll DiePair::total DiePair::doubles DiePair::to_string