* version 2 as published by the Free Software Foundation.
*/
-#ifndef HASH_SET_H
-#define HASH_SET_H
+#ifndef HASHSET_H
+#define HASHSET_H
#include "hashtable.h"
template<typename _Key>
-struct LinkNode {
+struct Linknode {
_Key key;
- LinkNode<_Key> *prev;
- LinkNode<_Key> *next;
+ Linknode<_Key> *prev;
+ Linknode<_Key> *next;
};
template<typename _Key, typename _KeyInt, int _Shift, unsigned int (*hash_function)(_Key), bool (*equals)(_Key, _Key)>
-class HashSet;
+class Hashset;
-template<typename _Key, typename _KeyInt, int _Shift, unsigned int (*hash_function)(_Key) = default_hash_function<_Key, _Shift, _KeyInt>, bool (*equals)(_Key, _Key) = default_equals<_Key> >
-class HSIterator {
+template<typename _Key, typename _KeyInt, int _Shift, unsigned int (*hash_function)(_Key) = defaultHashFunction<_Key, _Shift, _KeyInt>, bool (*equals)(_Key, _Key) = defaultEquals<_Key> >
+class SetIterator {
public:
- HSIterator(LinkNode<_Key> *_curr, HashSet <_Key, _KeyInt, _Shift, hash_function, equals> * _set) :
+ SetIterator(Linknode<_Key> *_curr, Hashset <_Key, _KeyInt, _Shift, hash_function, equals> *_set) :
curr(_curr),
set(_set)
{
}
+ SetIterator(SetIterator *s) : curr(s->curr),
+ last(s->last),
+ set(s->set) {
+ }
+
/** Override: new operator */
- void * operator new(size_t size) {
+ void *operator new(size_t size) {
return ourmalloc(size);
}
}
/** Override: new[] operator */
- void * operator new[](size_t size) {
+ void *operator new[](size_t size) {
return ourmalloc(size);
}
}
bool hasNext() {
- return curr!=NULL;
+ return curr != NULL;
}
_Key next() {
- _Key k=curr->key;
- last=curr;
- curr=curr->next;
+ _Key k = curr->key;
+ last = curr;
+ curr = curr->next;
return k;
}
}
void remove() {
- _Key k=last->key;
+ _Key k = last->key;
set->remove(k);
}
private:
- LinkNode<_Key> *curr;
- LinkNode<_Key> *last;
- HashSet <_Key, _KeyInt, _Shift, hash_function, equals> * set;
+ Linknode<_Key> *curr;
+ Linknode<_Key> *last;
+ Hashset <_Key, _KeyInt, _Shift, hash_function, equals> *set;
};
-template<typename _Key, typename _KeyInt, int _Shift = 0, unsigned int (*hash_function)(_Key) = default_hash_function<_Key, _Shift, _KeyInt>, bool (*equals)(_Key, _Key) = default_equals<_Key> >
-class HashSet {
+template<typename _Key, typename _KeyInt, int _Shift = 0, unsigned int (*hash_function)(_Key) = defaultHashFunction<_Key, _Shift, _KeyInt>, bool (*equals)(_Key, _Key) = defaultEquals<_Key> >
+class Hashset {
public:
- HashSet(unsigned int initialcapacity = 16, double factor = 0.5) :
- table(new HashTable<_Key, LinkNode<_Key> *, _KeyInt, _Shift, hash_function, equals>(initialcapacity, factor)),
+ Hashset(unsigned int initialcapacity = 16, double factor = 0.5) :
+ table(new Hashtable<_Key, Linknode<_Key> *, _KeyInt, _Shift, hash_function, equals>(initialcapacity, factor)),
list(NULL),
tail(NULL)
{
}
/** @brief Hashset destructor */
- ~HashSet() {
- LinkNode<_Key> *tmp=list;
- while(tmp!=NULL) {
- LinkNode<_Key> *tmpnext=tmp->next;
+ ~Hashset() {
+ Linknode<_Key> *tmp = list;
+ while (tmp != NULL) {
+ Linknode<_Key> *tmpnext = tmp->next;
ourfree(tmp);
- tmp=tmpnext;
+ tmp = tmpnext;
}
delete table;
}
- HashSet<_Key, _KeyInt, _Shift, hash_function, equals> * copy() {
- HashSet<_Key, _KeyInt, _Shift, hash_function, equals> *copy=new HashSet<_Key, _KeyInt, _Shift, hash_function, equals>(table->getCapacity(), table->getLoadFactor());
- HSIterator<_Key, _KeyInt, _Shift, hash_function, equals> * it=iterator();
- while(it->hasNext())
+ Hashset<_Key, _KeyInt, _Shift, hash_function, equals> *copy() {
+ Hashset<_Key, _KeyInt, _Shift, hash_function, equals> *copy = new Hashset<_Key, _KeyInt, _Shift, hash_function, equals>(table->getCapacity(), table->getLoadFactor());
+ SetIterator<_Key, _KeyInt, _Shift, hash_function, equals> *it = iterator();
+ while (it->hasNext())
copy->add(it->next());
delete it;
return copy;
}
void reset() {
- LinkNode<_Key> *tmp=list;
- while(tmp!=NULL) {
- LinkNode<_Key> *tmpnext=tmp->next;
+ Linknode<_Key> *tmp = list;
+ while (tmp != NULL) {
+ Linknode<_Key> *tmpnext = tmp->next;
ourfree(tmp);
- tmp=tmpnext;
+ tmp = tmpnext;
}
- list=tail=NULL;
+ list = tail = NULL;
table->reset();
}
+ void resetAndDelete() {
+ Linknode<_Key> *tmp = list;
+ while (tmp != NULL) {
+ Linknode<_Key> *tmpnext = tmp->next;
+ ourfree(tmp);
+ tmp = tmpnext;
+ }
+ list = tail = NULL;
+ table->resetAndDeleteKeys();
+ }
+
/** @brief Adds a new key to the hashset. Returns false if the key
* is already present. */
- void addAll(HashSet<_Key, _KeyInt, _Shift, hash_function, equals> * table) {
- HSIterator<_Key, _KeyInt, _Shift, hash_function, equals> * it=iterator();
- while(it->hasNext())
+ void addAll(Hashset<_Key, _KeyInt, _Shift, hash_function, equals> *table) {
+ SetIterator<_Key, _KeyInt, _Shift, hash_function, equals> *it = iterator();
+ while (it->hasNext())
add(it->next());
delete it;
- }
+ }
/** @brief Adds a new key to the hashset. Returns false if the key
* is already present. */
bool add(_Key key) {
- LinkNode<_Key> * val=table->get(key);
- if (val==NULL) {
- LinkNode<_Key> * newnode=(LinkNode<_Key> *)ourmalloc(sizeof(struct LinkNode<_Key>));
- newnode->prev=tail;
- newnode->next=NULL;
- newnode->key=key;
- if (tail!=NULL)
- tail->next=newnode;
+ Linknode<_Key> *val = table->get(key);
+ if (val == NULL) {
+ Linknode<_Key> *newnode = (Linknode<_Key> *)ourmalloc(sizeof(struct Linknode<_Key>));
+ newnode->prev = tail;
+ newnode->next = NULL;
+ newnode->key = key;
+ if (tail != NULL)
+ tail->next = newnode;
else
- list=newnode;
- tail=newnode;
+ list = newnode;
+ tail = newnode;
table->put(key, newnode);
return true;
} else
return false;
}
+ /** @brief Return random key from set. */
+
+ _Key getRandomElement() {
+ if (getSize() == 0)
+ return NULL;
+ else if (getSize() < 6) {
+ uint count = random() % getSize();
+ Linknode<_Key> *ptr = list;
+ while (count > 0) {
+ ptr = ptr->next;
+ count--;
+ }
+ return ptr->key;
+ } else
+ return table->getRandomValue()->key;
+ }
+
/** @brief Gets the original key corresponding to this one from the
* hashset. Returns NULL if not present. */
_Key get(_Key key) {
- LinkNode<_Key> * val=table->get(key);
- if (val!=NULL)
+ Linknode<_Key> *val = table->get(key);
+ if (val != NULL)
return val->key;
else
return NULL;
}
bool contains(_Key key) {
- return table->get(key)!=NULL;
+ return table->get(key) != NULL;
}
bool remove(_Key key) {
- LinkNode<_Key> * oldlinknode;
- oldlinknode=table->get(key);
- if (oldlinknode==NULL) {
+ Linknode<_Key> *oldlinknode;
+ oldlinknode = table->get(key);
+ if (oldlinknode == NULL) {
return false;
}
table->remove(key);
//remove link node from the list
- if (oldlinknode->prev==NULL)
- list=oldlinknode->next;
+ if (oldlinknode->prev == NULL)
+ list = oldlinknode->next;
else
- oldlinknode->prev->next=oldlinknode->next;
- if (oldlinknode->next!=NULL)
- oldlinknode->next->prev=oldlinknode->prev;
+ oldlinknode->prev->next = oldlinknode->next;
+ if (oldlinknode->next != NULL)
+ oldlinknode->next->prev = oldlinknode->prev;
else
- tail=oldlinknode->prev;
+ tail = oldlinknode->prev;
ourfree(oldlinknode);
return true;
}
- unsigned int getSize() {
+ unsigned int getSize() const {
return table->getSize();
}
- bool isEmpty() {
- return getSize()==0;
+ bool isEmpty() const {
+ return getSize() == 0;
}
- HSIterator<_Key, _KeyInt, _Shift, hash_function, equals> * iterator() {
- return new HSIterator<_Key, _KeyInt, _Shift, hash_function, equals>(list, this);
+ SetIterator<_Key, _KeyInt, _Shift, hash_function, equals> *iterator() {
+ return new SetIterator<_Key, _KeyInt, _Shift, hash_function, equals>(list, this);
}
/** Override: new operator */
- void * operator new(size_t size) {
+ void *operator new(size_t size) {
return ourmalloc(size);
}
}
/** Override: new[] operator */
- void * operator new[](size_t size) {
+ void *operator new[](size_t size) {
return ourmalloc(size);
}
ourfree(p);
}
private:
- HashTable<_Key, LinkNode<_Key>*, _KeyInt, _Shift, hash_function, equals> * table;
- LinkNode<_Key> *list;
- LinkNode<_Key> *tail;
+ Hashtable<_Key, Linknode<_Key> *, _KeyInt, _Shift, hash_function, equals> *table;
+ Linknode<_Key> *list;
+ Linknode<_Key> *tail;
};
#endif
projects / satune.git / blobdiff