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 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->base( $self->baseclass );
48 $node->table( $table );
49 $node->primary_key( ($table->primary_key->fields)[0] );
51 # Primary key may have a differenct accessor method name
52 $node->primary_key_accessor(
53 defined($self->translator->format_pk_name)
54 ? $self->translator->format_pk_name->( $node->name, $node->primary_key )
59 foreach my $node ($self->node_values){
60 foreach my $field ($node->table->get_fields){
61 if (!$field->is_foreign_key && !$field->is_primary_key) { $node->data_fields->{$field->name} = 1; }
62 elsif($field->is_foreign_key) {
63 my $that = $self->node($field->foreign_key_reference->reference_table);
65 #this means we have an incomplete schema
73 #can you believe this sh*t just to get a field obj?
74 thatfield => $self->translator->schema->get_table($field->foreign_key_reference->reference_table)->get_field(($field->foreign_key_reference->reference_fields)[0])
77 # $node->edgecount($that->name, $node->edgecount($that->name)+1);
78 $node->edgecount($that->name, $node->edgecount($that->name)+1);
80 $node->has($that->name, $node->has($that->name)+1);
81 $that->many($node->name, $that->many($node->name)+1);
83 # $that->edgecount($node->name, $that->edgecount($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);
161 $inode1->push_compoundedges($cedge);
162 $inode2->push_compoundedges($cedge) unless $inode1 eq $inode2;