QuickHashIntSet::exists

(PECL quickhash >= Unknown)

QuickHashIntSet::existsThis method checks whether a key is part of the set

˵��

public QuickHashIntSet::exists ( int $key ) : bool

This method checks whether an entry with the provided key exists in the set.

����

key

The key of the entry to check for whether it exists in the set.

����ֵ

Returns TRUE when the entry was found, or FALSE when the entry is not found.

����

Example #1 QuickHashIntSet::exists() example

<?php
//generate 200000 elements
$array range0199999 );
$existingEntries array_randarray_flip$array ), 180000 );
$testForEntries array_randarray_flip$array ), 1000 );
$foundCount 0;

echo 
"Creating set: "microtimetrue ), "\n";
$set = new QuickHashIntSet100000 );
echo 
"Adding elements: "microtimetrue ), "\n";
foreach( 
$existingEntries as $key )
{
     
$set->add$key );
}

echo 
"Doing 1000 tests: "microtimetrue ), "\n";
foreach( 
$testForEntries as $key )
{
     
$foundCount += $set->exists$key );
}
echo 
"Done, $foundCount found: "microtimetrue ), "\n";
?>

�������̵���������ڣ�

Creating set: 1263588703.0748
Adding elements: 1263588703.0757
Doing 1000 tests: 1263588703.7851
Done, 898 found: 1263588703.7897