92 |
=cut |
=cut |
93 |
|
|
94 |
sub _s { |
sub _s { |
95 |
my $text = $_[1] || return; |
my $text = $_[1]; |
96 |
|
return unless defined($text); |
97 |
$text =~ s/\s\s+/ /gs; |
$text =~ s/\s\s+/ /gs; |
98 |
$text =~ s/^\s+//; |
$text =~ s/^\s+//; |
99 |
$text =~ s/\s+$//; |
$text =~ s/\s+$//; |
321 |
my $draft; |
my $draft; |
322 |
|
|
323 |
foreach my $attr_name (sort keys %{ $self->{attrs} }) { |
foreach my $attr_name (sort keys %{ $self->{attrs} }) { |
324 |
$draft .= $attr_name . '=' . $self->{attrs}->{$attr_name} . "\n"; |
next unless defined(my $v = $self->{attrs}->{$attr_name}); |
325 |
|
$draft .= $attr_name . '=' . $v . "\n"; |
326 |
} |
} |
327 |
|
|
328 |
if ($self->{kwords}) { |
if ($self->{kwords}) { |
737 |
return $self->{hints}->{$key}; |
return $self->{hints}->{$key}; |
738 |
} |
} |
739 |
|
|
740 |
|
=head2 hints |
741 |
|
|
742 |
|
More perlish version of C<hint>. This one returns hash. |
743 |
|
|
744 |
|
my %hints = $rec->hints; |
745 |
|
|
746 |
|
=cut |
747 |
|
|
748 |
|
sub hints { |
749 |
|
my $self = shift; |
750 |
|
return $self->{hints}; |
751 |
|
} |
752 |
|
|
753 |
package Search::Estraier::Node; |
package Search::Estraier::Node; |
754 |
|
|