std::hash is a template class in the C++ Standard Template Library (STL) that
provides a default hash function for certain types. It is used to define the hash
function for unordered containers, such as unordered_map, unordered_set, and 
unordered_multimap.

A hash function is a function that takes in an object of a certain type, and 
produces an integer value (the "hash code") that is used to index the object in the
container. The hash code should be evenly distributed across the range of integers,
and different objects should have different hash codes.

Here is an example program that demonstrates the use of std::hash for a 
user-defined type:

Copy code
#include <iostream>
#include <unordered_map>
#include <functional>

struct Point {
    int x;
    int y;
    Point(int x_coord, int y_coord) : x(x_coord), y(y_coord) {}
};

// Define a hash function for Point objects
namespace std {
    template<> struct hash<Point> {
        std::size_t operator()(const Point& point) const {
            return std::hash<int>()(point.x) ^ std::hash<int>()(point.y);
        }
    };
}

int main() {
    // Create an unordered_map of Point objects to strings
    std::unordered_map<Point, std::string> map;
    
    // Insert elements into the map
    map.insert({Point(1, 2), "one-two"});
    map.insert({Point(3, 4), "three-four"});
    map.insert({Point(5, 6), "five-six"});
    
    // Search for an element in the map
    auto search = map.find(Point(3, 4));
    if (search != map.end()) {
        std::cout << "Found: " << search->second << std::endl;
    } else {
        std::cout << "Not found" << std::endl;
    }
    
    // Iterate through the elements in the map
    for (const auto& element : map) {
        std::cout << element.first.x << ", " << element.first.y << " " << element.second << std::endl;
    }
    
    return 0;
}
This program defines a struct Point, and then defines a hash function for Point objects. The hash function is defined in the std namespace, and it uses the xor operator to combine the hash codes of the x and y coordinates.

It then creates an unordered_map container of Point objects to strings, and then inserts three elements into the map. It then searches for the element with key Point(3,4) , and if it is found, it prints the value associated with it. Finally, it iterates through all the elements in the map and prints their key-value pairs.

It's important to note that the default hash function provided by the STL is not always the best option for a given type. If the type has a natural ordering, it's often better to use a hash function based on that ordering instead of the default one.