X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2FID3FS%2FPath%2FNode.pm;h=377e8dd68f53582d40ae0abceba55cc1e818e430;hb=1c7e55d34956f90d235632995acf1238878db2a3;hp=4fe4f48fb72ae22a20ec6c0171e43dbcc427b803;hpb=cb45ec109897ea5a79841a5cc9b5d3dff040f761;p=id3fs.git

diff --git a/lib/ID3FS/Path/Node.pm b/lib/ID3FS/Path/Node.pm
index 4fe4f48..377e8dd 100644
--- a/lib/ID3FS/Path/Node.pm
+++ b/lib/ID3FS/Path/Node.pm
@@ -10,10 +10,17 @@ sub new
     my $self={};
     bless($self,$class);
 
-    $self->left(shift);
-    $self->op(shift);
-    $self->right(shift);
-
+    my $db=shift;
+    $self->{type}=shift;
+    $self->{name}=shift;
+    $self->{parents_id}=shift;
+    if($self->{type} ne "boolean")
+    {
+	my $table=ucfirst($self->{type});
+	$table .= "s" unless($table=~/s$/);
+	$self->{id}=$db->lookup_id($table, $self->{name}, $self->{parents_id});
+	return undef unless(defined($self->{id}));
+    }
     return $self;
 }
 
@@ -27,19 +34,22 @@ sub set
     return $self->{$name};
 }
 
-sub left  { return shift->set("left",  shift); }
-sub right { return shift->set("right", shift); }
-sub op    { return shift->set("op",    shift); }
+sub left       { return shift->set("left",       shift); }
+sub right      { return shift->set("right",      shift); }
+sub name       { return shift->set("name",       shift); }
+sub type       { return shift->set("type",       shift); }
+sub id         { return shift->set("id",         shift); }
+sub parents_id { return shift->set("parents_id", shift); }
 
 sub print
 {
     my($self)=@_;
-    my $op=$self->op();
+    my $op=$self->name();
     my $left=$self->left();
     my $right=$self->right();
     return "" unless($left || $right);
     my $str .= $self->print_node($left);
-    $str .= (" " . $op->{name} . " ") if($op);
+    $str .= (" " . $op . " ") if($op);
     $str .= $self->print_node($right);
     if($op || ($left && $right))
     {
@@ -58,45 +68,100 @@ sub print_node
 
 sub to_sql
 {
-    my($self, $andlevel)=@_;
-    $andlevel=1 unless(defined($andlevel));
-    my ($leftandlevel, $rightandlevel);
-    my ($leftstr, $rightstr);
-    my $op=$self->op();
+    my($self, $hasvals, $not, @joins)=@_;
+    $not=0 unless(defined($not));
+    my @outjoins=();
+    # init
+    unless(@joins)
+    {
+	@outjoins = @joins = ("INNER");
+    }
     my $left=$self->left();
     my $right=$self->right();
-    return ("", $andlevel) unless($left || $right);
-    ($leftstr, $leftandlevel) = $self->node_to_sql($left, $andlevel);
-    $andlevel=$self->max($andlevel, $leftandlevel);
-    if(defined($op) && (($op->{name} eq "AND") || ($op->{name} eq "NOT")))
+    return ("", @outjoins) unless($left || $right);
+    my ($leftstr, @leftjoins) = $self->node_to_sql($left, $hasvals, $not, @joins);
+    push(@joins, @leftjoins);
+    push(@outjoins, @leftjoins);
+    my $op=$self->name();
+    if(defined($op) && $self->type() eq "boolean")
     {
-	$andlevel++;
+	# if we are ANDing, add an inner join
+	# also if we are NOTing, but we are looking for a tag *value*
+	if( ($op eq "AND") || ($hasvals && ($op eq "NOT")))
+	{
+	    # hack - if right child is a NOT, we don't need extra join/brackets
+	    # NOT will do the same and we will end up with an extra one
+	    unless($right && $right->name() && $right->name() eq "NOT")
+	    {
+		push(@joins, "INNER");
+		push(@outjoins, "INNER");
+	    }
+	}
+	elsif($op eq "NOT")
+	{
+	    $not=1;
+	    push(@joins, "LEFT");
+	    push(@outjoins, "LEFT");
+#	    print("LEFT: ", $left->print(), "\n") if ($left);
+#	    print("RIGHT: ", $right->print(), "\n") if($right);
+	}
     }
-    ($rightstr, $rightandlevel) = $self->node_to_sql($right, $andlevel);
+    my ($rightstr, @rightjoins) = $self->node_to_sql($right, $hasvals, $not, @joins);
+    push(@outjoins, @rightjoins);
+#    print "LEFT (", scalar(@leftjoins), "): $leftstr\n";
+#    print "RIGHT (", scalar(@rightjoins), "): $rightstr\n";
     my $str=$leftstr;
-    $str .= (" " . $op->{name} . " ") if($op);
+    $str .= " $op " if($op && !$not);
     $str .= $rightstr;
     if($op || ($left && $right))
     {
 	$str="(" . $str . ")";
     }
-    return($str, $self->max($leftandlevel, $rightandlevel));
+#    print "STR: $str\n";
+    return($str, @outjoins);
 }
 
 sub node_to_sql
 {
-    my($self, $node, $andlevel)=@_;
-    return ("", $andlevel) unless(defined($node));
-    return $node->to_sql($andlevel) if(ref($node) eq "ID3FS::Path::Node");
-    # FIXME: switch to id when debugged
-#    return( ( "fxt" . $andlevel . "=\"" . $node->{id} . "\""), $andlevel);
-    return( ( "fxt" . $andlevel . "=\"" . $node->{name} . "\""), $andlevel);
+    my($self, $node, $hasvals, $not, @joins)=@_;
+    return ("", ()) unless(defined($node));
+    return $node->to_sql($hasvals, $not, @joins) if($node->type() eq "boolean");
+    my $sql;
+    my $cnt=scalar(@joins)+1;
+    if(defined($node->{parents_id}))
+    {
+	$sql= "(t" . scalar(@joins) . ".parents_id='$node->{parents_id}'";
+	$sql .= " AND t" . scalar(@joins) . ".id='" . $node->{id} . "'";
+    }
+    else
+    {
+	$sql= "(t" . scalar(@joins) .".parents_id=''";
+	$sql .= " AND t" . scalar(@joins) . ".id='" . $node->{id} . "'";
+    }
+    if($not && !$hasvals)
+    {
+	$sql .= " AND fxt" . scalar(@joins) . ".files_id IS NULL";
+    }
+    $sql .= ")";
+    return ($sql, ());
 }
 
-sub max
+sub used_tags
 {
-    my($self, $a, $b)=@_;
-    return(($a > $b) ? $a : $b);
+    my($self)=@_;
+    if($self->type() eq "boolean")
+    {
+	my @used=();
+	push(@used, $self->left()->used_tags())  if($self->left());
+	push(@used, $self->right()->used_tags()) if($self->right());
+	print "BOOL: ", $self->name(), join(', ', grep { defined; } @used), "\n";
+	return(grep { defined; } @used);
+    }
+    elsif($self->parents_id())
+    {
+	return([ $self->parents_id(), $self->id() ]);
+    }
+    return $self->id();
 }
 
 1;