QuickHashIntHash::exists

This method checks whether a key is part of the hash

&reftitle.description; public `bool` `QuickHashIntHash::exists` `int` `key`

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

&reftitle.parameters;

`key`

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

&reftitle.returnvalues;

Returns &true; when the entry was found, or &false; when the entry is not found.

&reftitle.examples;

### `QuickHashIntHash::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 hash: ", microtime( true ), "\n";
    $hash = new QuickHashIntHash( 100000 );
    echo "Adding elements: ", microtime( true ), "\n";
    foreach( $existingEntries as $key )
    {
         $hash->add( $key, 56 );
    }

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

&example.outputs.similar;

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