I have the following code:
if ($#results >= 0) {
$count=0;
$numb=1;
$period=".";
foreach $i (@results) {
chomp($i);
($link,$name,$descrip,$keywords,$game) = split(/\|/,$i);
Its working all right. My question is: If I have a database of 3,000 lines it will be fast? Or there is a better code? Its just a simple search, not a sofisticated one like Links Manager.
Thiago Moretti
Quote:
@results = grep(/$searchstr/,@mydata); if ($#results >= 0) {
$count=0;
$numb=1;
$period=".";
foreach $i (@results) {
chomp($i);
($link,$name,$descrip,$keywords,$game) = split(/\|/,$i);
Its working all right. My question is: If I have a database of 3,000 lines it will be fast? Or there is a better code? Its just a simple search, not a sofisticated one like Links Manager.
Thiago Moretti