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.

示例

示例 #1 QuickHashIntSet::exists() example

<?php
//generate 200000 elements
$array = range( 0, 199999 );
$existingEntries = array_rand( array_flip( $array ), 180000 );
$testForEntries = array_rand( array_flip( $array ), 1000 );
$foundCount = 0;

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

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

以上示例的输出类似于:

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

add a note add a note

User Contributed Notes

There are no user contributed notes for this page.
To Top