-
Recent Posts
Recent Comments
Categories
Tags
apache beer beernutz bigbrother boston bottle buttons cartography computers conditioning css database deadlock draft economics firebug freedom gmail hexadecimal homebrewing html java javascript maps mbta mustache outlook performance podcasts politics productivity programming quality random recipe sea stackoverflow subway surveillance taxes testing tricks tv web wedding-
POD: Search::Lemur::Database
NAME
Search::Lemur::Database
VERSION
Version 1.0
DESCRIPTION
Represent information about an available database.
Main Methods
num()Get the database number. This number is useful to pass to
Lemur->
d()to specify which database you want to use.title()Get the title of this database.
stem()Gets the stemming status of this database. Returns 1 if the
database is stemmed, 0 if not.
stop()Returns the stop word status of this database. Returns 1 if
the database is stop-worded, 0 if not.
numdocs()Returns the number of documents in this database.
numterms()Returns the number of terms in this database.
numuniq()Returns the number of unique terms in this database.
avgdoclen()Returns the average document length in this database.
Test equality between this database and the given one (used mostly for
testing).
AUTHOR
Patrick Kaeding,
<pkaeding at cpan.org>BUGS
Please report any bugs or feature requests to
bug-search-lemur at rt.cpan.org, or through the web interface athttp://rt.cpan.org/NoAuth/ReportBug.html.
I will be notified, and then you’ll automatically be notified of progress on
your bug as I make changes.
SUPPORT
You can find documentation for this module with the perldoc command.
perldoc Search::LemurYou can also look for information at:http://annocpan.org/dist/Search-Lemur
http://cpanratings.perl.org/d/Search-Lemur
http://rt.cpan.org/NoAuth/Bugs.html
http://search.cpan.org/dist/Search-Lemur
ACKNOWLEDGEMENTS
COPYRIGHT & LICENSE
Copyright 2007 Patrick Kaeding, all rights reserved.
This program is free software; you can redistribute it and/or modify it
under the same terms as Perl itself.