1 package SQL::Translator::Schema::Graph;
6 $Data::Dumper::Maxdepth = 3;
8 use SQL::Translator::Schema::Graph::Node;
9 use SQL::Translator::Schema::Graph::Edge;
10 use SQL::Translator::Schema::Graph::Port;
11 use SQL::Translator::Schema::Graph::CompoundEdge;
12 use SQL::Translator::Schema::Graph::HyperEdge;
14 use constant Node => 'SQL::Translator::Schema::Graph::Node';
15 use constant Edge => 'SQL::Translator::Schema::Graph::Edge';
16 use constant Port => 'SQL::Translator::Schema::Graph::Port';
17 use constant CompoundEdge => 'SQL::Translator::Schema::Graph::CompoundEdge';
18 use constant HyperEdge => 'SQL::Translator::Schema::Graph::HyperEdge';
20 use Class::MakeMethods::Template::Hash (
21 'new --and_then_init' => 'new',
23 'translator' => {class => 'SQL::Translator'},
25 'hash' => [ qw( node ) ],
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 if ($table->is_trivial_link) { $node->is_trivial_link(1); }
43 else { $node->is_trivial_link(0); }
45 $node->order($self->order_incr());
46 $node->name( $self->translator->format_package_name($table->name) );
47 $node->table( $table );
48 $node->primary_key( ($table->primary_key->fields)[0] );
50 # Primary key may have a differenct accessor method name
51 $node->primary_key_accessor(
52 defined($self->translator->format_pk_name)
53 ? $self->translator->format_pk_name->( $node->name, $node->primary_key )
58 foreach my $node ($self->node_values){
59 foreach my $field ($node->table->get_fields){
60 if (!$field->is_foreign_key && !$field->is_primary_key) { $node->data_fields->{$field->name} = 1; }
61 elsif($field->is_foreign_key) {
62 my $that = $self->node($field->foreign_key_reference->reference_table);
64 #this means we have an incomplete schema
72 #can you believe this sh*t just to get a field obj?
73 thatfield => $self->translator->schema->get_table($field->foreign_key_reference->reference_table)->get_field(($field->foreign_key_reference->reference_fields)[0])
76 $node->edgecount($that->name, $node->edgecount($that->name)+1);
78 $node->has($that->name, $node->has($that->name)+1);
79 $that->many($node->name, $that->many($node->name)+1);
81 $that->edgecount($node->name, $that->edgecount($node->name)+1);
83 #warn "\t" . $node->name . "\t" . $node->edgecount($that->name);
84 $node->push_edges( $edge );
85 $that->push_edges( $edge->flip );
89 #warn Dumper($node->edgecount());
94 # type MM relationships
97 foreach my $lnode (sort $self->node_values){
98 next if $lnode->table->is_data;
99 foreach my $inode1 (sort $self->node_values){
100 #linknode can't link to itself
101 next if $inode1 eq $lnode;
103 my @inode1_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode1 } $lnode->edges;
104 next unless @inode1_imports;
106 foreach my $inode2 (sort $self->node_values){
107 #linknode can't link to itself
108 next if $inode2 eq $lnode;
110 #identify tables that import keys to linknode
111 my %i = map {$_->thatnode->name => 1} grep { $_->type eq 'import'} $lnode->edges;
113 if(scalar(keys %i) == 1) {
115 last if $inode1 eq $inode2;
118 my @inode2_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode2 } $lnode->edges;
119 next unless @inode2_imports;
121 my $cedge = CompoundEdge->new();
124 #warn join ' ', map {$_->thisfield->name} map {$_->flip} $lnode->edges;
125 #warn join ' ', map {$_->thisfield->name} $lnode->edges;
126 #warn join ' ', map {$_->thisfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
127 #warn join ' ', map {$_->thatfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
130 grep {$_->type eq 'import'
132 ($_->thatnode eq $inode1 or $_->thatnode eq $inode2)
136 if(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) == 1){
137 $cedge->type('one2one');
139 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
140 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
142 elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) == 1){
143 $cedge->type('many2one');
145 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
146 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
148 elsif(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) > 1){
151 elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) > 1){
152 $cedge->type('many2many');
154 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
155 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
157 #warn Dumper($cedge);
159 $inode1->push_compoundedges($cedge);
160 $inode2->push_compoundedges($cedge) unless $inode1 eq $inode2;
161 # if($inode1->name ne $inode2->name){
162 # my $flipped_cedge = $cedge;
163 # foreach my $flipped_cedge_edge ($flipped_cedge->edges){
164 # warn Dumper $flipped_cedge_edge;
165 # warn "\t". Dumper $flipped_cedge_edge->flip;
172 my $graph = $self; #hack
173 my $log = Log::Log4perl->get_logger('SQL.Translator.Schema.Graph');
178 # this code needs to move to Graph.pm
179 foreach my $node_from ($graph->node_values) {
181 next unless $node_from->table->is_data or !$node_from->table->is_trivial_link;
183 foreach my $cedge ( $node_from->compoundedges ) {
185 my $hyperedge = SQL::Translator::Schema::Graph::HyperEdge->new();
188 foreach my $edge ($cedge->edges) {
189 if ($edge->thisnode->name eq $node_from->name) {
190 $hyperedge->vianode($edge->thatnode);
192 if ($edge->thatnode->name ne $cedge->via->name) {
193 $node_to ||= $graph->node($edge->thatnode->table->name);
196 $hyperedge->push_thisnode($edge->thisnode);
197 $hyperedge->push_thisfield($edge->thisfield);
198 $hyperedge->push_thisviafield($edge->thatfield);
201 if ($edge->thisnode->name ne $cedge->via->name) {
202 $node_to ||= $graph->node($edge->thisnode->table->name);
204 $hyperedge->push_thatnode($edge->thisnode);
205 $hyperedge->push_thatfield($edge->thisfield);
206 $hyperedge->push_thatviafield($edge->thatfield);
208 $log->debug($edge->thisfield->name);
209 $log->debug($edge->thatfield->name);
212 if ($hyperedge->count_thisnode == 1 and $hyperedge->count_thatnode == 1) {
213 $hyperedge->type('one2one');
214 } elsif ($hyperedge->count_thisnode > 1 and $hyperedge->count_thatnode == 1) {
215 $hyperedge->type('many2one');
216 } elsif ($hyperedge->count_thisnode == 1 and $hyperedge->count_thatnode > 1) {
217 $hyperedge->type('one2many');
218 } elsif ($hyperedge->count_thisnode > 1 and $hyperedge->count_thatnode > 1) {
219 $hyperedge->type('many2many');
222 $log->debug($_) foreach sort keys %::SQL::Translator::Schema::Graph::HyperEdge::;
224 #node_to won't always be defined b/c of multiple edges to a single other node
225 if (defined($node_to)) {
226 $log->debug($node_from->name);
227 $log->debug($node_to->name);
229 if (scalar($hyperedge->thisnode) > 1) {
230 $log->debug($hyperedge->type ." via ". $hyperedge->vianode->name);
232 foreach my $thisnode ( $hyperedge->thisnode ) {
233 $log->debug($thisnode->name .' '.
234 $hyperedge->thisfield_index(0)->name .' -> '.
235 $hyperedge->thisviafield_index($i)->name .' '.
236 $hyperedge->vianode->name .' '.
237 $hyperedge->thatviafield_index(0)->name .' <- '.
238 $hyperedge->thatfield_index(0)->name .' '.
239 $hyperedge->thatnode_index(0)->name ."\n"
244 #warn Dumper($hyperedge) if $hyperedge->type eq 'many2many';
245 $node_from->push_hyperedges($hyperedge);