X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=lib%2FSQL%2FTranslator%2FSchema%2FGraph.pm;h=d0402739ab4c0be1127cffc59b1fdfde5426de51;hb=2bdef63659f546187a4d1266e88aa66671b228b7;hp=897e53562bbc205d53d722022535a2180ab78c9c;hpb=11ad2df91bcc0674faa8fb5b6bab52c9e4a73762;p=dbsrgits%2FSQL-Translator.git

diff --git a/lib/SQL/Translator/Schema/Graph.pm b/lib/SQL/Translator/Schema/Graph.pm
index 897e535..d040273 100644
--- a/lib/SQL/Translator/Schema/Graph.pm
+++ b/lib/SQL/Translator/Schema/Graph.pm
@@ -1,6 +1,16 @@
-package SQL::Translator::Schema::Graph;
-
+package # hide from pause
+  SQL::Translator::Schema::Graph;
 use strict;
+use warnings;
+
+use Carp;
+carp(
+  'SQL::Translator::Schema::Graph appears to be dead unmaintained and untested '
+. 'code. It will remain a part of the SQL::Translator distribution for some '
+. 'time, but eventually will be cleaned away. Please file a bug or contact the '
+. 'maintainers and let them know you are still using this functionality'
+);
+
 
 use base 'Class::Base';
 
@@ -28,7 +38,7 @@ use Class::MakeMethods::Template::Hash (
   'number --counter' => [ qw( order ) ],
 );
 
-use vars qw/$DEBUG/;
+our $DEBUG;
 $DEBUG = 0 unless defined $DEBUG;
 
 sub init {
@@ -38,59 +48,59 @@ sub init {
   # build package objects
   #
   foreach my $table ($self->translator->schema->get_tables){
-	die __PACKAGE__." table ".$table->name." doesn't have a primary key!" unless $table->primary_key;
-	die __PACKAGE__." table ".$table->name." can't have a composite primary key!" if ($table->primary_key->fields)[1];
+   die __PACKAGE__." table ".$table->name." doesn't have a primary key!" unless $table->primary_key;
+   die __PACKAGE__." table ".$table->name." can't have a composite primary key!" if ($table->primary_key->fields)[1];
 
-	my $node = Node->new();
+   my $node = Node->new();
 
-	$self->node_push($table->name => $node);
+   $self->node_push($table->name => $node);
 
-	if ($table->is_trivial_link) { $node->is_trivial_link(1); }
-	else { $node->is_trivial_link(0); }
+   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->table( $table );
-	$node->primary_key( ($table->primary_key->fields)[0] );
+   $node->order($self->order_incr());
+   $node->name( $self->translator->format_package_name($table->name) );
+   $node->table( $table );
+   $node->primary_key( ($table->primary_key->fields)[0] );
 
-	# Primary key may have a differenct accessor method name
-	$node->primary_key_accessor(
-								defined($self->translator->format_pk_name)
-								? $self->translator->format_pk_name->( $node->name, $node->primary_key )
-								: undef
-							   );
+   # Primary key may have a differenct accessor method name
+   $node->primary_key_accessor(
+                        defined($self->translator->format_pk_name)
+                        ? $self->translator->format_pk_name->( $node->name, $node->primary_key )
+                        : undef
+                        );
   }
 
   foreach my $node ($self->node_values){
-	foreach my $field ($node->table->get_fields){
-	  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);
+   foreach my $field ($node->table->get_fields){
+     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
-	  next unless $that;
+     #this means we have an incomplete schema
+     next unless $that;
 
-	  my $edge = Edge->new(
-						   type => 'import',
-						   thisnode => $node,
-						   thisfield => $field,
-						   thatnode => $that,
-						   #can you believe this sh*t just to get a field obj?
-						   thatfield => $self->translator->schema->get_table($field->foreign_key_reference->reference_table)->get_field(($field->foreign_key_reference->reference_fields)[0])
-						  );
+     my $edge = Edge->new(
+                     type => 'import',
+                     thisnode => $node,
+                     thisfield => $field,
+                     thatnode => $that,
+                     #can you believe this sh*t just to get a field obj?
+                     thatfield => $self->translator->schema->get_table($field->foreign_key_reference->reference_table)->get_field(($field->foreign_key_reference->reference_fields)[0])
+                    );
 
-	  $node->edgecount($that->name, $node->edgecount($that->name)+1);
+     $node->edgecount($that->name, $node->edgecount($that->name)+1);
 
-	  $node->has($that->name, $node->has($that->name)+1);
-	  $that->many($node->name, $that->many($node->name)+1);
+     $node->has($that->name, $node->has($that->name)+1);
+     $that->many($node->name, $that->many($node->name)+1);
 
-	  $that->edgecount($node->name, $that->edgecount($node->name)+1);
+     $that->edgecount($node->name, $that->edgecount($node->name)+1);
 
           #warn "\t" . $node->name . "\t" . $node->edgecount($that->name);
-	  $node->push_edges( $edge );
-	  $that->push_edges( $edge->flip );
+     $node->push_edges( $edge );
+     $that->push_edges( $edge->flip );
       }
-	}
+   }
 
     #warn Dumper($node->edgecount());
     #warn "*****";
@@ -101,69 +111,69 @@ sub init {
   #
   #foreach linknode
   foreach my $lnode (sort $self->node_values){
-	next if $lnode->table->is_data;
-	foreach my $inode1 (sort $self->node_values){
-	  #linknode can't link to itself
-	  next if $inode1 eq $lnode;
-
-	  my @inode1_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode1 } $lnode->edges;
-	  next unless @inode1_imports;
-
-	  foreach my $inode2 (sort $self->node_values){
-		#linknode can't link to itself
-		next if $inode2 eq $lnode;
-
-		#identify tables that import keys to linknode
-		my %i = map {$_->thatnode->name => 1} grep { $_->type eq 'import'} $lnode->edges;
-
-		if(scalar(keys %i) == 1) {
-		} else {
-		  last if $inode1 eq $inode2;
-		}
-
-		my @inode2_imports =  grep { $_->type eq 'import' and $_->thatnode eq $inode2 } $lnode->edges;
-		next unless @inode2_imports;
-
-		my $cedge = CompoundEdge->new();
-		$cedge->via($lnode);
-
-		#warn join ' ', map {$_->thisfield->name} map {$_->flip} $lnode->edges;
-		#warn join ' ', map {$_->thisfield->name} $lnode->edges;
-		#warn join ' ', map {$_->thisfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
-		#warn join ' ', map {$_->thatfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
-		$cedge->push_edges(
-						   map {$_->flip}
-						   grep {$_->type eq 'import'
-								   and
-								 ($_->thatnode eq $inode1 or $_->thatnode eq $inode2)
-							    } $lnode->edges
-						  );
-
-		if(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) == 1){
-		  $cedge->type('one2one');
-
-		  $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
-		  $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
-		}
-		elsif(scalar(@inode1_imports)  > 1 and scalar(@inode2_imports) == 1){
-		  $cedge->type('many2one');
-
-		  $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
-		  $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
-		}
-		elsif(scalar(@inode1_imports) == 1 and scalar(@inode2_imports)  > 1){
-		  #handled above
-		}
-		elsif(scalar(@inode1_imports)  > 1 and scalar(@inode2_imports)  > 1){
-		  $cedge->type('many2many');
-
-		  $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
-		  $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
-		}
+   next if $lnode->table->is_data;
+   foreach my $inode1 (sort $self->node_values){
+     #linknode can't link to itself
+     next if $inode1 eq $lnode;
+
+     my @inode1_imports = grep { $_->type eq 'import' and $_->thatnode eq $inode1 } $lnode->edges;
+     next unless @inode1_imports;
+
+     foreach my $inode2 (sort $self->node_values){
+      #linknode can't link to itself
+      next if $inode2 eq $lnode;
+
+      #identify tables that import keys to linknode
+      my %i = map {$_->thatnode->name => 1} grep { $_->type eq 'import'} $lnode->edges;
+
+      if(scalar(keys %i) == 1) {
+      } else {
+        last if $inode1 eq $inode2;
+      }
+
+      my @inode2_imports =  grep { $_->type eq 'import' and $_->thatnode eq $inode2 } $lnode->edges;
+      next unless @inode2_imports;
+
+      my $cedge = CompoundEdge->new();
+      $cedge->via($lnode);
+
+      #warn join ' ', map {$_->thisfield->name} map {$_->flip} $lnode->edges;
+      #warn join ' ', map {$_->thisfield->name} $lnode->edges;
+      #warn join ' ', map {$_->thisfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
+      #warn join ' ', map {$_->thatfield->name} map {$_->flip} grep {$_->type eq 'import'} $lnode->edges;
+      $cedge->push_edges(
+                     map {$_->flip}
+                     grep {$_->type eq 'import'
+                           and
+                         ($_->thatnode eq $inode1 or $_->thatnode eq $inode2)
+                         } $lnode->edges
+                    );
+
+      if(scalar(@inode1_imports) == 1 and scalar(@inode2_imports) == 1){
+        $cedge->type('one2one');
+
+        $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
+        $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
+      }
+      elsif(scalar(@inode1_imports)  > 1 and scalar(@inode2_imports) == 1){
+        $cedge->type('many2one');
+
+        $inode1->via($inode2->name,$inode1->via($inode2->name)+1);
+        $inode2->via($inode1->name,$inode2->via($inode1->name)+1);
+      }
+      elsif(scalar(@inode1_imports) == 1 and scalar(@inode2_imports)  > 1){
+        #handled above
+      }
+      elsif(scalar(@inode1_imports)  > 1 and scalar(@inode2_imports)  > 1){
+        $cedge->type('many2many');
+
+        $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;
+      $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){
@@ -171,8 +181,8 @@ sub init {
 #            warn "\t". Dumper $flipped_cedge_edge->flip;
 #          }
 #        }
-	  }
-	}
+     }
+   }
   }
 
   my $graph = $self; #hack