320 |
my $draft; |
my $draft; |
321 |
|
|
322 |
foreach my $attr_name (sort keys %{ $self->{attrs} }) { |
foreach my $attr_name (sort keys %{ $self->{attrs} }) { |
323 |
$draft .= $attr_name . '=' . $self->{attrs}->{$attr_name} . "\n"; |
next unless(my $v = $self->{attrs}->{$attr_name}); |
324 |
|
$draft .= $attr_name . '=' . $v . "\n"; |
325 |
} |
} |
326 |
|
|
327 |
if ($self->{kwords}) { |
if ($self->{kwords}) { |
736 |
return $self->{hints}->{$key}; |
return $self->{hints}->{$key}; |
737 |
} |
} |
738 |
|
|
739 |
|
=head2 hints |
740 |
|
|
741 |
|
More perlish version of C<hint>. This one returns hash. |
742 |
|
|
743 |
|
my %hints = $rec->hints; |
744 |
|
|
745 |
|
=cut |
746 |
|
|
747 |
|
sub hints { |
748 |
|
my $self = shift; |
749 |
|
return $self->{hints}; |
750 |
|
} |
751 |
|
|
752 |
package Search::Estraier::Node; |
package Search::Estraier::Node; |
753 |
|
|