Some SQL_TYPE mapping stuff

[dbsrgits/SQL-Translator.git] / lib / SQL / Translator / Schema / Graph.pm

diff --git a/lib/SQL/Translator/Schema/Graph.pm b/lib/SQL/Translator/Schema/Graph.pm
index e389350..d13c56b 100644 (file)
--- a/lib/SQL/Translator/Schema/Graph.pm
+++ b/lib/SQL/Translator/Schema/Graph.pm
@@ -3,7 +3,10 @@ package SQL::Translator::Schema::Graph;
 use strict;
 
 use Data::Dumper;
+local $Data::Dumper::Maxdepth = 3;
 
+use Log::Log4perl qw(:easy);
+Log::Log4perl->easy_init($ERROR);
 use SQL::Translator::Schema::Graph::Node;
 use SQL::Translator::Schema::Graph::Edge;
 use SQL::Translator::Schema::Graph::Port;
@@ -22,12 +25,12 @@ use Class::MakeMethods::Template::Hash (
                         'translator' => {class => 'SQL::Translator'},
                        ],
   'hash' => [ qw( node ) ],
-  'scalar' => [ qw( baseclass ) ],
   'number --counter' => [ qw( order ) ],
 );
 
 sub init {
   my $self = shift;
+
   #
   # build package objects
   #
@@ -39,9 +42,11 @@ sub init {
 
        $self->node_push($table->name => $node);
 
+       if ($table->is_trivial_link) { $node->is_trivial_link(1); }
+       else { $node->is_trivial_link(0); }
+
        $node->order($self->order_incr());
        $node->name( $self->translator->format_package_name($table->name) );
-       $node->base( $self->baseclass );
        $node->table( $table );
        $node->primary_key( ($table->primary_key->fields)[0] );
 
@@ -55,8 +60,8 @@ sub init {
 
   foreach my $node ($self->node_values){
        foreach my $field ($node->table->get_fields){
-         next unless $field->is_foreign_key;
-
+         if (!$field->is_foreign_key && !$field->is_primary_key) { $node->data_fields->{$field->name} = 1; }
+         elsif($field->is_foreign_key) {
          my $that = $self->node($field->foreign_key_reference->reference_table);
 
          #this means we have an incomplete schema
@@ -77,10 +82,15 @@ sub init {
          $that->many($node->name, $that->many($node->name)+1);
 
          $that->edgecount($node->name, $that->edgecount($node->name)+1);
-warn $node->name . "\t" . $that->edgecount($node->name);
+
+          #warn "\t" . $node->name . "\t" . $node->edgecount($that->name);
          $node->push_edges( $edge );
          $that->push_edges( $edge->flip );
+      }
        }
+
+    #warn Dumper($node->edgecount());
+    #warn "*****";
   }
 
   #
@@ -147,12 +157,99 @@ warn $node->name . "\t" . $that->edgecount($node->name);
                  $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
                  $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
                }
+#warn Dumper($cedge);
 
                $inode1->push_compoundedges($cedge);
                $inode2->push_compoundedges($cedge) unless $inode1 eq $inode2;
+#        if($inode1->name ne $inode2->name){
+#          my $flipped_cedge = $cedge;
+#          foreach my $flipped_cedge_edge ($flipped_cedge->edges){
+#            warn Dumper $flipped_cedge_edge;
+#            warn "\t". Dumper $flipped_cedge_edge->flip;
+#          }
+#        }
          }
        }
   }
+
+  my $graph = $self; #hack
+  my $log   = Log::Log4perl->get_logger('SQL.Translator.Schema.Graph');
+
+  #
+  # create methods
+  #
+  # this code needs to move to Graph.pm
+  foreach my $node_from ($graph->node_values) {
+
+    next unless $node_from->table->is_data or !$node_from->table->is_trivial_link;
+
+    foreach my $cedge ( $node_from->compoundedges ) {
+
+      my $hyperedge = SQL::Translator::Schema::Graph::HyperEdge->new();
+
+      my $node_to;
+      foreach my $edge ($cedge->edges) {
+        if ($edge->thisnode->name eq $node_from->name) {
+          $hyperedge->vianode($edge->thatnode);
+
+          if ($edge->thatnode->name ne $cedge->via->name) {
+            $node_to ||= $graph->node($edge->thatnode->table->name);
+          }
+
+          $hyperedge->push_thisnode($edge->thisnode);
+          $hyperedge->push_thisfield($edge->thisfield);
+          $hyperedge->push_thisviafield($edge->thatfield);
+
+        } else {
+          if ($edge->thisnode->name ne $cedge->via->name) {
+            $node_to ||= $graph->node($edge->thisnode->table->name);
+          }
+          $hyperedge->push_thatnode($edge->thisnode);
+          $hyperedge->push_thatfield($edge->thisfield);
+          $hyperedge->push_thatviafield($edge->thatfield);
+        }
+        $log->debug($edge->thisfield->name);
+        $log->debug($edge->thatfield->name);
+      }
+
+      if ($hyperedge->count_thisnode == 1 and $hyperedge->count_thatnode == 1) {
+        $hyperedge->type('one2one');
+      } elsif ($hyperedge->count_thisnode  > 1 and $hyperedge->count_thatnode == 1) {
+        $hyperedge->type('many2one');
+      } elsif ($hyperedge->count_thisnode == 1 and $hyperedge->count_thatnode  > 1) {
+        $hyperedge->type('one2many');
+      } elsif ($hyperedge->count_thisnode  > 1 and $hyperedge->count_thatnode  > 1) {
+        $hyperedge->type('many2many');
+      }
+
+      $log->debug($_) foreach sort keys %::SQL::Translator::Schema::Graph::HyperEdge::;
+
+      #node_to won't always be defined b/c of multiple edges to a single other node
+      if (defined($node_to)) {
+        $log->debug($node_from->name);
+        $log->debug($node_to->name);
+
+        if (scalar($hyperedge->thisnode) > 1) {
+          $log->debug($hyperedge->type ." via ". $hyperedge->vianode->name);
+          my $i = 0;
+          foreach my $thisnode ( $hyperedge->thisnode ) {
+            $log->debug($thisnode->name .' '.
+                        $hyperedge->thisfield_index(0)->name .' -> '.
+                        $hyperedge->thisviafield_index($i)->name .' '.
+                        $hyperedge->vianode->name .' '.
+                        $hyperedge->thatviafield_index(0)->name .' <- '.
+                        $hyperedge->thatfield_index(0)->name .' '.
+                        $hyperedge->thatnode_index(0)->name ."\n"
+                       );
+            $i++;
+          }
+        }
+        #warn Dumper($hyperedge) if $hyperedge->type eq 'many2many';
+        $node_from->push_hyperedges($hyperedge);
+      }
+    }
+  }
+
 }
 
 1;