1 package SQL::Translator::Schema::Graph;
6 $Data::Dumper::Maxdepth = 3;
8 use Log::Log4perl qw(:easy);
9 Log::Log4perl->easy_init($ERROR);
10 use SQL::Translator::Schema::Graph::Node;
11 use SQL::Translator::Schema::Graph::Edge;
12 use SQL::Translator::Schema::Graph::Port;
13 use SQL::Translator::Schema::Graph::CompoundEdge;
14 use SQL::Translator::Schema::Graph::HyperEdge;
16 use constant Node => 'SQL::Translator::Schema::Graph::Node';
17 use constant Edge => 'SQL::Translator::Schema::Graph::Edge';
18 use constant Port => 'SQL::Translator::Schema::Graph::Port';
19 use constant CompoundEdge => 'SQL::Translator::Schema::Graph::CompoundEdge';
20 use constant HyperEdge => 'SQL::Translator::Schema::Graph::HyperEdge';
22 use Class::MakeMethods::Template::Hash (
23 'new --and_then_init' => 'new',
25 'translator' => {class => 'SQL::Translator'},
27 'hash' => [ qw( node translator) ],
28 'number --counter' => [ qw( order ) ],
35 # build package objects
37 foreach my $table ($self->translator->schema->get_tables){
38 die __PACKAGE__." table ".$table->name." doesn't have a primary key!" unless $table->primary_key;
39 die __PACKAGE__." table ".$table->name." can't have a composite primary key!" if ($table->primary_key->fields)[1];
41 my $node = Node->new();
43 $self->node_push($table->name => $node);
45 if ($table->is_trivial_link) { $node->is_trivial_link(1); }
46 else { $node->is_trivial_link(0); }
48 $node->order($self->order_incr());
49 $node->name( $self->translator->format_package_name($table->name) );
50 $node->table( $table );
51 $node->primary_key( ($table->primary_key->fields)[0] );
53 # Primary key may have a differenct accessor method name
54 $node->primary_key_accessor(
55 defined($self->translator->format_pk_name)
56 ? $self->translator->format_pk_name->( $node->name, $node->primary_key )
61 foreach my $node ($self->node_values){
62 foreach my $field ($node->table->get_fields){
63 if (!$field->is_foreign_key && !$field->is_primary_key) { $node->data_fields->{$field->name} = 1; }
64 elsif($field->is_foreign_key) {
65 my $that = $self->node($field->foreign_key_reference->reference_table);
67 #this means we have an incomplete schema
75 #can you believe this sh*t just to get a field obj?
76 thatfield => $self->translator->schema->get_table($field->foreign_key_reference->reference_table)->get_field(($field->foreign_key_reference->reference_fields)[0])
79 $node->edgecount($that->name, $node->edgecount($that->name)+1);
81 $node->has($that->name, $node->has($that->name)+1);
82 $that->many($node->name, $that->many($node->name)+1);
84 $that->edgecount($node->name, $that->edgecount($node->name)+1);
86 #warn "\t" . $node->name . "\t" . $node->edgecount($that->name);
87 $node->push_edges( $edge );
88 $that->push_edges( $edge->flip );
92 #warn Dumper($node->edgecount());
97 # type MM relationships
100 foreach my $lnode (sort $self->node_values){
101 next if $lnode->table->is_data;
102 foreach my $inode1 (sort $self->node_values){
103 #linknode can't link to itself
104 next if $inode1 eq $lnode;
106 my @inode1_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode1 } $lnode->edges;
107 next unless @inode1_imports;
109 foreach my $inode2 (sort $self->node_values){
110 #linknode can't link to itself
111 next if $inode2 eq $lnode;
113 #identify tables that import keys to linknode
114 my %i = map {$_->thatnode->name => 1} grep { $_->type eq 'import'} $lnode->edges;
116 if(scalar(keys %i) == 1) {
118 last if $inode1 eq $inode2;
121 my @inode2_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode2 } $lnode->edges;
122 next unless @inode2_imports;
124 my $cedge = CompoundEdge->new();
127 #warn join ' ', map {$_->thisfield->name} map {$_->flip} $lnode->edges;
128 #warn join ' ', map {$_->thisfield->name} $lnode->edges;
129 #warn join ' ', map {$_->thisfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
130 #warn join ' ', map {$_->thatfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
133 grep {$_->type eq 'import'
135 ($_->thatnode eq $inode1 or $_->thatnode eq $inode2)
139 if(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) == 1){
140 $cedge->type('one2one');
142 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
143 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
145 elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) == 1){
146 $cedge->type('many2one');
148 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
149 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
151 elsif(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) > 1){
154 elsif(scalar(@inode1_imports) > 1 and scalar(@inode2_imports) > 1){
155 $cedge->type('many2many');
157 $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
158 $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
160 #warn Dumper($cedge);
162 $inode1->push_compoundedges($cedge);
163 $inode2->push_compoundedges($cedge) unless $inode1 eq $inode2;
164 # if($inode1->name ne $inode2->name){
165 # my $flipped_cedge = $cedge;
166 # foreach my $flipped_cedge_edge ($flipped_cedge->edges){
167 # warn Dumper $flipped_cedge_edge;
168 # warn "\t". Dumper $flipped_cedge_edge->flip;
175 my $graph = $self; #hack
176 my $log = Log::Log4perl->get_logger('SQL.Translator.Schema.Graph');
181 # this code needs to move to Graph.pm
182 foreach my $node_from ($graph->node_values) {
184 next unless $node_from->table->is_data or !$node_from->table->is_trivial_link;
186 foreach my $cedge ( $node_from->compoundedges ) {
188 my $hyperedge = SQL::Translator::Schema::Graph::HyperEdge->new();
191 foreach my $edge ($cedge->edges) {
192 if ($edge->thisnode->name eq $node_from->name) {
193 $hyperedge->vianode($edge->thatnode);
195 if ($edge->thatnode->name ne $cedge->via->name) {
196 $node_to ||= $graph->node($edge->thatnode->table->name);
199 $hyperedge->push_thisnode($edge->thisnode);
200 $hyperedge->push_thisfield($edge->thisfield);
201 $hyperedge->push_thisviafield($edge->thatfield);
204 if ($edge->thisnode->name ne $cedge->via->name) {
205 $node_to ||= $graph->node($edge->thisnode->table->name);
207 $hyperedge->push_thatnode($edge->thisnode);
208 $hyperedge->push_thatfield($edge->thisfield);
209 $hyperedge->push_thatviafield($edge->thatfield);
211 $log->debug($edge->thisfield->name);
212 $log->debug($edge->thatfield->name);
215 if ($hyperedge->count_thisnode == 1 and $hyperedge->count_thatnode == 1) {
216 $hyperedge->type('one2one');
217 } elsif ($hyperedge->count_thisnode > 1 and $hyperedge->count_thatnode == 1) {
218 $hyperedge->type('many2one');
219 } elsif ($hyperedge->count_thisnode == 1 and $hyperedge->count_thatnode > 1) {
220 $hyperedge->type('one2many');
221 } elsif ($hyperedge->count_thisnode > 1 and $hyperedge->count_thatnode > 1) {
222 $hyperedge->type('many2many');
225 $log->debug($_) foreach sort keys %::SQL::Translator::Schema::Graph::HyperEdge::;
227 #node_to won't always be defined b/c of multiple edges to a single other node
228 if (defined($node_to)) {
229 $log->debug($node_from->name);
230 $log->debug($node_to->name);
232 if (scalar($hyperedge->thisnode) > 1) {
233 $log->debug($hyperedge->type ." via ". $hyperedge->vianode->name);
235 foreach my $thisnode ( $hyperedge->thisnode ) {
236 $log->debug($thisnode->name .' '.
237 $hyperedge->thisfield_index(0)->name .' -> '.
238 $hyperedge->thisviafield_index($i)->name .' '.
239 $hyperedge->vianode->name .' '.
240 $hyperedge->thatviafield_index(0)->name .' <- '.
241 $hyperedge->thatfield_index(0)->name .' '.
242 $hyperedge->thatnode_index(0)->name ."\n"
247 #warn Dumper($hyperedge) if $hyperedge->type eq 'many2many';
248 $node_from->push_hyperedges($hyperedge);
257 get the SQL::Translator instance that instatiated me
263 $self->{'translator'} = shift if @_;
264 return $self->{'translator'};