FXHash.h

/********************************************************************************
*                                                                               *
*                       H a s h   T a b l e   C l a s s                         *
*                                                                               *
*********************************************************************************
* Copyright (C) 2003,2023 by Jeroen van der Zijp.   All Rights Reserved.        *
*********************************************************************************
* This library is free software; you can redistribute it and/or modify          *
* it under the terms of the GNU Lesser General Public License as published by   *
* the Free Software Foundation; either version 3 of the License, or             *
* (at your option) any later version.                                           *
*                                                                               *
* This library 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 Lesser General Public License for more details.                           *
*                                                                               *
* You should have received a copy of the GNU Lesser General Public License      *
* along with this program.  If not, see <http://www.gnu.org/licenses/>          *
********************************************************************************/
#ifndef FXHASH_H
#define FXHASH_H

namespace FX {


class FXAPI FXHash {
protected:
  struct Entry {
    const void *key;
    void       *data;
    };
protected:
  Entry  *table;
protected:

  // Change size of the table & hash existing contents
  FXbool no(FXival n);

  // Change number of used entries
  void used(FXival u){ ((FXival*)table)[-2]=u; }

  // Change number of free entries
  void free(FXival f){ ((FXival*)table)[-3]=f; }

  // Resize the table to the given size, keeping contents
  FXbool resize(FXival n);
public:

  FXHash();

  FXHash(const FXHash& other);

  FXival no() const { return ((FXival*)table)[-1]; }

  FXival used() const { return ((FXival*)table)[-2]; }

  FXival free() const { return ((FXival*)table)[-3]; }

  FXbool empty() const { return ((FXival*)table)[-1]<=1; }

  FXHash &operator=(const FXHash& other);

  FXHash& adopt(FXHash& other);

  FXival find(const void* ky) const;

  FXbool has(const void* ky) const { return 0<=find(ky); }

  void*& at(const void* ky);

  void *const& at(const void* ky) const;

  void*& operator[](const void* ky){ return at(ky); }

  void *const& operator[](const void* ky) const { return at(ky); }

  void* insert(const void* ky,void* ptr=nullptr){ return swap(ptr,at(ky)); }

  void* remove(const void* ky);

  void* erase(FXival pos);

  FXbool empty(FXival pos) const { return (table[pos].key==nullptr)||(table[pos].key==(const void*)-1L); }

  const void* key(FXival pos) const { return table[pos].key; }

  void*& data(FXival pos){ return table[pos].data; }

  void *const& data(FXival pos) const { return table[pos].data; }

  FXbool clear();

 ~FXHash();
  };

}

#endif