Commit | Line | Data |
0caaf4c3 |
1 | package SQL::Translator::Schema::Graph; |
2 | |
3 | use strict; |
4 | |
5 | use Data::Dumper; |
6 | |
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; |
12 | |
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'; |
18 | |
19 | use Class::MakeMethods::Template::Hash ( |
20 | 'new --and_then_init' => 'new', |
21 | object => [ |
22 | 'translator' => {class => 'SQL::Translator'}, |
23 | ], |
24 | 'hash' => [ qw( node ) ], |
25 | 'scalar' => [ qw( baseclass ) ], |
26 | 'number --counter' => [ qw( order ) ], |
27 | ); |
28 | |
29 | sub init { |
30 | my $self = shift; |
31 | # |
32 | # build package objects |
33 | # |
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]; |
37 | |
38 | my $node = Node->new(); |
39 | |
40 | $self->node_push($table->name => $node); |
41 | |
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] ); |
47 | |
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 ) |
52 | : undef |
53 | ); |
54 | } |
55 | |
56 | foreach my $node ($self->node_values){ |
57 | foreach my $field ($node->table->get_fields){ |
58 | next unless $field->is_foreign_key; |
59 | |
60 | my $that = $self->node($field->foreign_key_reference->reference_table); |
61 | |
62 | #this means we have an incomplete schema |
63 | next unless $that; |
64 | |
65 | my $edge = Edge->new( |
66 | type => 'import', |
67 | thisnode => $node, |
68 | thisfield => $field, |
69 | thatnode => $that, |
70 | thatfield => ($field->foreign_key_reference->reference_fields)[0] |
71 | ); |
72 | |
73 | |
74 | $node->has($that->name, $node->has($that->name)+1); |
75 | $that->many($node->name, $that->many($node->name)+1); |
76 | |
77 | $node->push_edges( $edge ); |
78 | $that->push_edges( $edge->flip ); |
79 | } |
80 | } |
81 | |
82 | # |
83 | # type MM relationships |
84 | # |
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; |
89 | |
90 | my @inode1_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode1 } $lnode->edges; |
91 | next unless @inode1_imports; |
92 | |
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) { |
96 | } else { |
97 | last if $inode1 eq $inode2; |
98 | } |
99 | |
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; |
103 | |
104 | my $cedge = CompoundEdge->new(); |
105 | $cedge->via($lnode); |
106 | |
107 | $cedge->push_edges( map {$_->flip} grep {$_->type eq 'import' and ($_->thatnode eq $inode1 or $_->thatnode eq $inode2)} $lnode->edges); |
108 | |
109 | if(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) == 1){ |
110 | $cedge->type('one2one'); |
111 | |
112 | $inode1->via($inode2->name,$inode1->via($inode2->name)+1); |
113 | $inode2->via($inode1->name,$inode2->via($inode1->name)+1); |
114 | } |
115 | elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) == 1){ |
116 | $cedge->type('many2one'); |
117 | |
118 | $inode1->via($inode2->name,$inode1->via($inode2->name)+1); |
119 | $inode2->via($inode1->name,$inode2->via($inode1->name)+1); |
120 | } |
121 | elsif(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) > 1){ |
122 | #handled above |
123 | } |
124 | elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) > 1){ |
125 | $cedge->type('many2many'); |
126 | |
127 | $inode1->via($inode2->name,$inode1->via($inode2->name)+1); |
128 | $inode2->via($inode1->name,$inode2->via($inode1->name)+1); |
129 | } |
130 | |
131 | $inode1->push_compoundedges($cedge); |
132 | $inode2->push_compoundedges($cedge) unless $inode1 eq $inode2; |
133 | |
134 | } |
135 | } |
136 | } |
137 | } |
138 | |
139 | 1; |