Scribd Logo
Upload

Welcome to Scribd!

  • GP Hash Table

    Uploaded by

    Moca Andrei
    51 views1 page
    This code defines a hash function that XORs an integer with a random number to generate hashes. It then defines a hash table that uses this custom hash function to store key-value pairs of type <key, int>. The hash table will hash keys using the random XOR function to determine indices in the table.

    Original Description:

    Original Title

    gp_hash_table.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This code defines a hash function that XORs an integer with a random number to generate hashes. It then defines a hash table that uses this custom hash function to store key-value pairs of type <key, int>. The hash table will hash keys using the random XOR function to determine indices in the table.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    51 views1 page

    GP Hash Table

    Uploaded by

    Moca Andrei
    This code defines a hash function that XORs an integer with a random number to generate hashes. It then defines a hash table that uses this custom hash function to store key-value pairs of type <key, int>. The hash table will hash keys using the random XOR function to determine indices in the table.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().

    count();
    struct chash {
    int operator()(int x) const { return x ^ RANDOM; }
    };
    gp_hash_table<key, int, chash> table;

    You might also like