The Simons     Component Library

           

---

Set.h

//
//  SCL : Simons Component Library
//
//
//  Filename:   Set.h
//  Contents:   Set class
//  Author:     Anthony J H Simons
//  Revised:    22 November 2005

// This software is distributed free in the hope that others will
// find it useful.  However, it comes WITHOUT ANY WARRANTY.  No
// liability can be accepted for software failure, merchantability
// or fitness for a particular purpose.  You can redistribute this
// software in its original form, or in a modified form, provided
// that this disclaimer is retained in the file banner.

#ifndef SCL_SET
#define SCL_SET

#include "Unordered.h"          // Include my superclass type
#include "SetID.h"              // Include my pointer type

#include "EntryID.h"            // Depend on the pointer type


class Set : public Unordered {
private:
        Natural alloc;                  // capacity of table
        Natural items;                  // count of elements
        ObjectID* block;
        struct Memo {
                Integer index;          // index of item-rank
                Integer slot;           // place in hash table
                Memo() : index(0), slot(0) {}
        } *memo;
        enum Constants { OFFSET = 3 };
        Integer locate(ObjectID) const;
        Void expand();                  // expand hash table
        Void compact(Integer);          // rehash after remove
        Void memoSeek(Integer) const;   // find ith element
        Void memoReset() const;         // find 0th element
protected:
        Set(const Set&);
        Void deepRemove(EntryID);
public:
        Set();
        virtual ~Set();
        Set(CollectionID);
        virtual ObjectID clone() const;
        virtual Natural size() const;
        virtual Boolean has(ObjectID) const;
        virtual Natural count(ObjectID) const;
        virtual ObjectID find(ObjectID) const;
        virtual ObjectID item(Integer) const;
        virtual Void add(ObjectID);
        virtual Void remove(ObjectID);
};


inline SetID::SetID() {}

inline SetID::~SetID() {}

inline SetID::SetID(const Null* null) :
        UnorderedID(null) {}
        
inline SetID::SetID(const Set* set) :
        UnorderedID(set) {}
        
inline SetID::SetID(const SetID& pointer) :
        UnorderedID(pointer) {}
        
inline SetID& SetID::operator=(const Set* set) {
        assign(set);
        return *this;
}

inline SetID& SetID::operator=(const SetID& pointer) {
        assign(pointer);
        return *this;
}


#endif

---