1 package ID3FS::Path::Node;
9 my $class=ref($proto) || $proto;
22 my($self, $name, $val)=@_;
27 return $self->{$name};
30 sub left { return shift->set("left", shift); }
31 sub right { return shift->set("right", shift); }
32 sub op { return shift->set("op", shift); }
38 my $left=$self->left();
39 my $right=$self->right();
40 return "" unless($left || $right);
41 my $str .= $self->print_node($left);
42 $str .= (" " . $op->{name} . " ") if($op);
43 $str .= $self->print_node($right);
44 if($op || ($left && $right))
46 $str="(" . $str . ")";
54 return "" unless(defined($node));
55 return $node->print() if(ref($node) eq "ID3FS::Path::Node");
61 my($self, $parent, @injoins)=@_;
62 my @childjoins=@injoins;
68 @outjoins = @childjoins = ("INNER");
70 print "OUT: ", join(', ', @outjoins), "\n";
71 print "CLD: ", join(', ', @childjoins), "\n";
72 my (@leftjoins, @rightjoins);
73 my ($leftstr, $rightstr);
75 my $left=$self->left();
76 my $right=$self->right();
77 return ("", @outjoins) unless($left || $right);
78 ($leftstr, @leftjoins) = $self->node_to_sql($left, $parent, @childjoins);
79 # $andlevel=$self->max($andlevel, $leftandlevel);
82 if($op->{name} eq "AND")
84 push(@childjoins, "INNER");
85 push(@outjoins, "INNER");
87 elsif($op->{name} eq "NOT")
89 push(@childjoins, "LEFT");
90 push(@outjoins, "LEFT");
93 ($rightstr, @rightjoins) = $self->node_to_sql($right, $parent, @leftjoins, @childjoins);
94 print "LEFT (", scalar(@leftjoins), "): $leftstr\n";
95 print "RIGHT (", scalar(@rightjoins), "): $rightstr\n";
97 $str .= (" " . $op->{name} . " ") if($op);
99 if($op || ($left && $right))
101 $str="(" . $str . ")";
104 # return($str, $self->max($leftandlevel, $rightandlevel));
105 my @oldout=@outjoins;
106 @outjoins = (@leftjoins, @outjoins, @rightjoins);
109 print "ME (", (defined($op) ? $op->{name} : ""), "): ";
110 print(scalar(@outjoins), " = " , scalar(@leftjoins), " + ", scalar(@oldout),
111 " + ", scalar(@rightjoins), "\n");
113 return($str, @outjoins);
118 my($self, $node, $parent, @joins)=@_;
119 return ("", ()) unless(defined($node));
120 return $node->to_sql($parent, @joins) if(ref($node) eq "ID3FS::Path::Node");
122 my $cnt=scalar(@joins)+1;
123 if(defined($node->{parents_id}))
125 $sql= "(t" . scalar(@joins) . ".parents_id='$node->{parents_id}'";
126 $sql .= " AND fxt" . scalar(@joins) . ".tags_id='" . $node->{id} . "')";
130 $sql= "(t" . scalar(@joins) .".parents_id=''";
131 $sql .= " AND fxt" . scalar(@joins) . ".tags_id='" . $node->{id} . "')";
139 my @used=(grep { defined; } ($self->node_used_tags($self->left()),
140 $self->node_used_tags($self->right())));
147 return (undef) unless(defined($node));
148 return $node->used_tags() if(ref($node) eq "ID3FS::Path::Node");
149 if(defined($node->{parents_id}))
151 return([ $node->{parents_id}, $node->{id} ]);
159 my($self, $a, $b)=@_;
160 return(($a > $b) ? $a : $b);