UT_ConcurrentSet.h

Go to the documentation of this file.

/*
 * PROPRIETARY INFORMATION.  This software is proprietary to
 * Side Effects Software Inc., and is not to be reproduced,
 * transmitted, or disclosed in any way without written permission.
 *
 * NAME:        UT_ConcurrentHashMap.h (UT Library, C++)
 *
 * COMMENTS:    Wrapper around Intel TBB's concurrent_unordered_set container.
 *              Microsoft will probably have an implementation of this in their
 *              Concurrent Runtime Parallel Patterns Library (PPL) since they
 *              already have concurrent_vector and concurrent_queue.
 *
 */

#ifndef __UT_CONCURRENTSET_H_INCLUDED__
#define __UT_CONCURRENTSET_H_INCLUDED__

#include "UT_API.h"
#include <SYS/SYS_Types.h>
#include <hboost/container_hash/hash.hpp>
#include <oneapi/tbb/concurrent_unordered_set.h>
#include <utility>


template
<
    typename K,
    typename H = hboost::hash<K>,
    typename P = std::equal_to<K>,
    typename A = tbb::tbb_allocator<K>
>
using UT_ConcurrentSet = tbb::concurrent_unordered_set<K, H, P, A>;


template<typename K, typename H, typename E, typename A>
int64
UTgetMemoryUsage(const UT_ConcurrentSet<K, H, E, A> &set, const bool inclusive)
{
    int64 mem = 0;
    if (inclusive)
        mem += sizeof(set);

    // The size of the buckets (a mutex and a pointer to the first node)
    mem += set.bucket_count()*(sizeof(intptr_t) + sizeof(void *));
    // The size of the nodes (a mutex, a pointer to the next node,
    // and a K for the value)
    mem += set.size()*(sizeof(intptr_t) + sizeof(void *) + sizeof(K));

    return mem;
}

#endif // __UT_CONCURRENTSET_H_INCLUDED__