BlobHashSet.h

Go to the documentation of this file.

/* -*- c++ -*-
 * Copyright (C) 2007-2015 Hypertable, Inc.
 *
 * This file is part of Hypertable.
 *
 * Hypertable is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 3
 * of the License, or any later version.
 *
 * Hypertable is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Hypertable. If not, see <http://www.gnu.org/licenses/>
 */

#ifndef Common_BlobHashSet_h
#define Common_BlobHashSet_h

#include <Common/BlobHashTraits.h>

#include <unordered_set>

namespace Hypertable {

template <class TraitsT = BlobHashTraits<> >
class BlobHashSet : public std::unordered_set<Blob, typename TraitsT::hasher,
                                              typename TraitsT::key_equal> {
private:
  typedef std::unordered_set<Blob, typename TraitsT::hasher,
                             typename TraitsT::key_equal> Base;

public:
  typedef typename Base::iterator iterator;
  typedef typename Base::key_type key_type;
  typedef typename Base::value_type value_type;
  typedef typename TraitsT::key_allocator key_allocator;
  typedef std::pair<iterator, bool> InsRet;

  BlobHashSet() { }

  BlobHashSet(size_t n_buckets) : Base(n_buckets) { }

  InsRet insert(const void *buf, size_t len) {
    return insert_blob(len, Base::insert(value_type(buf, len)));
  }

  InsRet insert(const String &s) {
    return insert_blob(s.size(), Base::insert(value_type(s.data(), s.size())));
  }

  InsRet insert(const Blob &blob) {
    return insert_blob(blob.size, Base::insert(blob));
  }

  iterator find(const Blob &blob) { return Base::find(blob); }

  iterator find(const String &s) {
    return Base::find(Blob(s.data(), s.size()));
  }

  key_allocator &key_alloc() { return m_alloc; }

private:
  key_allocator m_alloc;

  InsRet insert_blob(size_t len, InsRet rv) {
    if (rv.second)
      const_cast<const void *&>(rv.first->start) =
          m_alloc.dup(rv.first->start, len);

    return rv;
  }
};

}

#endif