1 package SQL::Translator::Schema::Graph;
7 use SQL::Translator::Schema::Graph::Node;
8 use SQL::Translator::Schema::Graph::Edge;
9 use SQL::Translator::Schema::Graph::Port;
10 use SQL::Translator::Schema::Graph::CompoundEdge;
11 use SQL::Translator::Schema::Graph::HyperEdge;
13 use constant Node => 'SQL::Translator::Schema::Graph::Node';
14 use constant Edge => 'SQL::Translator::Schema::Graph::Edge';
15 use constant Port => 'SQL::Translator::Schema::Graph::Port';
16 use constant CompoundEdge => 'SQL::Translator::Schema::Graph::CompoundEdge';
17 use constant HyperEdge => 'SQL::Translator::Schema::Graph::HyperEdge';
19 use Class::MakeMethods::Template::Hash (
20 'new --and_then_init' => 'new',
22 'translator' => {class => 'SQL::Translator'},
24 'hash' => [ qw( node ) ],
25 'scalar' => [ qw( baseclass ) ],
26 'number --counter' => [ qw( order ) ],
32 # build package objects
34 foreach my $table ($self->translator->schema->get_tables){
35 die __PACKAGE__." table ".$table->name." doesn't have a primary key!" unless $table->primary_key;
36 die __PACKAGE__." table ".$table->name." can't have a composite primary key!" if ($table->primary_key->fields)[1];
38 my $node = Node->new();
40 $self->node_push($table->name => $node);
42 $node->order($self->order_incr());
43 $node->name( $self->translator->format_package_name($table->name) );
44 $node->base( $self->baseclass );
45 $node->table( $table );
46 $node->primary_key( ($table->primary_key->fields)[0] );
48 # Primary key may have a differenct accessor method name
49 $node->primary_key_accessor(
50 defined($self->translator->format_pk_name)
51 ? $self->translator->format_pk_name->( $node->name, $node->primary_key )
56 foreach my $node ($self->node_values){
57 foreach my $field ($node->table->get_fields){
58 next unless $field->is_foreign_key;
60 my $that = $self->node($field->foreign_key_reference->reference_table);
62 #this means we have an incomplete schema
70 thatfield => ($field->foreign_key_reference->reference_fields)[0]
74 $node->has($that->name, $node->has($that->name)+1);
75 $that->many($node->name, $that->many($node->name)+1);
77 $node->push_edges( $edge );
78 $that->push_edges( $edge->flip );
83 # type MM relationships
85 foreach my $lnode (sort $self->node_values){
86 next if $lnode->table->is_data;
87 foreach my $inode1 (sort $self->node_values){
88 next if $inode1 eq $lnode;
90 my @inode1_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode1 } $lnode->edges;
91 next unless @inode1_imports;
93 foreach my $inode2 (sort $self->node_values){
94 my %i = map {$_->thatnode->name => 1} grep { $_->type eq 'import'} $lnode->edges;
95 if(scalar(keys %i) == 1) {
97 last if $inode1 eq $inode2;
100 next if $inode2 eq $lnode;
101 my @inode2_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode2 } $lnode->edges;
102 next unless @inode2_imports;
104 my $cedge = CompoundEdge->new();
107 $cedge->push_edges( map {$_->flip} grep {$_->type eq 'import' and ($_->thatnode eq $inode1 or $_->thatnode eq $inode2)} $lnode->edges);
109 if(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) == 1){
110 $cedge->type('one2one');
112 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
113 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
115 elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) == 1){
116 $cedge->type('many2one');
118 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
119 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
121 elsif(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) > 1){
124 elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) > 1){
125 $cedge->type('many2many');
127 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
128 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
131 $inode1->push_compoundedges($cedge);
132 $inode2->push_compoundedges($cedge) unless $inode1 eq $inode2;