X-Git-Url: http://erislabs.net/gitweb/?p=id3fs.git;a=blobdiff_plain;f=lib%2FID3FS%2FPath%2FNode.pm;h=b71406deb46b88dbfa43e57e58585523d6dfe0de;hp=8362f3462750d6bac4c161e96d88eefa4023b76e;hb=718b120fd81446b15dcf83bc16ab8af5cb642fb1;hpb=9f98f6108a1d4666fd103a8a75df33d50db6940b

diff --git a/lib/ID3FS/Path/Node.pm b/lib/ID3FS/Path/Node.pm
index 8362f34..b71406d 100644
--- a/lib/ID3FS/Path/Node.pm
+++ b/lib/ID3FS/Path/Node.pm
@@ -1,8 +1,30 @@
+# id3fs - a FUSE-based filesystem for browsing audio metadata
+# Copyright (C) 2010  Ian Beckwith <ianb@erislabs.net>
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
 package ID3FS::Path::Node;
 
 use strict;
 use warnings;
 
+require Exporter;
+use vars qw(@ISA @EXPORT $TYPE_BOOL $TYPE_TAG $TYPE_ARTIST $TYPE_ALBUM $TYPE_FILE);
+@ISA=qw(Exporter);
+@EXPORT=qw($TYPE_BOOL $TYPE_TAG $TYPE_ARTIST $TYPE_ALBUM $TYPE_FILE);
+($TYPE_BOOL, $TYPE_TAG, $TYPE_ARTIST, $TYPE_ALBUM, $TYPE_FILE)=(1..5);
+
 sub new
 {
     my $proto=shift;
@@ -10,10 +32,20 @@ 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} != $TYPE_BOOL)
+    {
+	my $table='';
+	if   ($self->{type} == $TYPE_TAG)    { $table="tags";    }
+	elsif($self->{type} == $TYPE_ARTIST) { $table="artists"; }
+	elsif($self->{type} == $TYPE_ALBUM)  { $table="albums";  }
+	elsif($self->{type} == $TYPE_FILE)   { $table="files";   }
+	$self->{id}=$db->lookup_id($table, $self->{name}, $self->{parents_id});
+	return undef unless(defined($self->{id}));
+    }
     return $self;
 }
 
@@ -27,125 +59,92 @@ 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
+sub to_sql
 {
-    my($self)=@_;
-    my $op=$self->op();
-    my $left=$self->left();
-    my $right=$self->right();
-    return "" unless($left || $right);
-    my $str .= $self->print_node($left);
-    $str .= (" " . $op->{name} . " ") if($op);
-    $str .= $self->print_node($right);
-    if($op || ($left && $right))
+    my($self, $hasvals, $not, @joins)=@_;
+    $not=0 unless(defined($not));
+    my @outjoins=();
+    unless(@joins)
     {
-	$str="(" . $str . ")";
+	@outjoins = @joins = ("INNER");
     }
-    return $str;
-}
+    my $str='';
 
-sub print_node
-{
-    my($self, $node)=@_;
-    return "" unless(defined($node));
-    return $node->print() if(ref($node) eq "ID3FS::Path::Node");
-    return $node->{name};
-}
+    if($self->type() != $TYPE_BOOL)
+    {
+	$str .= "t" . scalar(@joins) . ".id='" . $self->{id} . "'";
+	if($not && !$hasvals)
+	{
+	    $str = "(" . $str . " AND fxt" . scalar(@joins) . ".files_id IS NULL)";
+	}
+	return ($str, @outjoins);
+    }
 
-sub to_sql
-{
-    my($self, $parent, @joins)=@_;
-    @joins=("INNER") unless(@joins);
-    my @newjoins=();
-    my (@leftjoins, @rightjoins);
-    my ($leftstr, $rightstr);
-    my $op=$self->op();
     my $left=$self->left();
     my $right=$self->right();
-    return ("", @joins) unless($left || $right);
-    ($leftstr, @leftjoins) = $self->node_to_sql($left, $parent, @joins);
-#    print "LEFT: $leftstr\n";
-#    $andlevel=$self->max($andlevel, $leftandlevel);
+    return ("", @outjoins) unless($left || $right);
+
+    my ($leftstr, @leftjoins) = $left->to_sql($hasvals, $not, @joins) if($left);
+    push(@joins, @leftjoins);
+    push(@outjoins, @leftjoins);
+
+    my $op=$self->name();
     if(defined($op))
     {
-	if($op->{name} eq "AND")
+	my $join=undef;
+	# 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(@newjoins, "INNER");
+	    # if we are ANDing or ORing, add an inner join
+	    # also if we are NOTing, but we are looking for a tag *value*
+	    if($op eq "AND")
+	    {
+		$join= "INNER";
+	    }
+	    elsif($op eq "NOT")
+	    {
+		$not=1;
+		$join = ($hasvals ? "INNER" : "LEFT");
+	    }
+	    elsif($op eq "OR")
+	    {
+		$join="INNER" unless($left && $left->name() && $left->name() eq "NOT")
+	    }
 	}
-	elsif($op->{name} eq "NOT")
+	if($join)
 	{
-	    push(@newjoins, "LEFT");
+	    push(@joins, $join);
+	    push(@outjoins, $join);
 	}
     }
-    push(@joins, @newjoins);
-    ($rightstr, @rightjoins) = $self->node_to_sql($right, $parent, @joins);
-#    print "RIGHT: $rightstr\n";
-    my $str=$leftstr;
-    $str .= (" " . $op->{name} . " ") if($op);
+    my ($rightstr, @rightjoins) = $right->to_sql($hasvals, $not, @joins) if($right);
+    push(@outjoins, @rightjoins);
+    $str = $leftstr;
+    $str .= " $op " if($op && !$not);
     $str .= $rightstr;
-    if($op || ($left && $right))
-    {
-	$str="(" . $str . ")";
-    }
-#    print "LEFTJOINS: ", join(', ', @leftjoins), "\n";
-#    print "RIGHTJOINS:", join(', ', @rightjoins), "\n";
-#    print "NEWJOINS: ",  join(', ', @newjoins), "\n";
-#    print "STR: $str\n";
-#    return($str, $self->max($leftandlevel, $rightandlevel));
-    my @sidejoins=((scalar(@leftjoins) > scalar(@rightjoins)) ? @leftjoins : @rightjoins);
-    my @alljoins=(@newjoins, @sidejoins);
-    return($str, @alljoins);
-}
-
-sub node_to_sql
-{
-    my($self, $node, $parent, @joins)=@_;
-    return ("", @joins) unless(defined($node));
-    return $node->to_sql($parent, @joins) if(ref($node) eq "ID3FS::Path::Node");
-    my $sql;
-    my $cnt=scalar(@joins)+1;
-    if(defined($node->{parents_id}))
-    {
-	$sql= "(t" . scalar(@joins) . ".parents_id='$node->{parents_id}'";
-	$sql .= " AND fxt" . scalar(@joins) . ".tags_id='" . $node->{id} . "')";
-    }
-    else
-    {
-	$sql= "(t" . scalar(@joins) .".parents_id=''";
-	$sql .= " AND fxt" . scalar(@joins) . ".tags_id='" . $node->{id} . "')";
-    }
-    return ($sql, @joins);
+    $str=("(" . $str . ")") if($op && $left && $right);
+    return($str, @outjoins);
 }
 
 sub used_tags
 {
     my($self)=@_;
-    my @used=(grep { defined; }  ($self->node_used_tags($self->left()),
-				  $self->node_used_tags($self->right())));
-    return(@used);
-}
-
-sub node_used_tags
-{
-    my($self, $node)=@_;
-    return (undef) unless(defined($node));
-    return $node->used_tags() if(ref($node) eq "ID3FS::Path::Node");
-    if(defined($node->{parents_id}))
+    if($self->type() == $TYPE_BOOL)
     {
-	return([ $node->{parents_id}, $node->{id} ]);
+	my @used=();
+	push(@used, $self->left()->used_tags())  if($self->left());
+	push(@used, $self->right()->used_tags()) if($self->right());
+	return(grep { defined; } @used);
     }
-    return $node->{id};
-}
-
-
-sub max
-{
-    my($self, $a, $b)=@_;
-    return(($a > $b) ? $a : $b);
+    return $self->id();
 }
 
 1;