散列表基本操作

enum hashFlag: short
{
	EMPTY = 0,
	INUSE = 1,
	DELETED = 2
};

typedef struct hashNode {
	int data_ = 0;
	hashFlag flag_ = EMPTY;
} hashNode;

typedef struct ht {
	hashNode* head_ = nullptr;
	size_t size_ = 0;
	size_t capacity_ = 0;
} *hashTable;

hashTable initHash(size_t capacity = 10)
{
	hashTable HT = new ht;
	HT->capacity_ = capacity;
	HT->size_ = 0;
	HT->head_ = new hashNode[HT->capacity_];
	for (size_t index = 0; index < HT->capacity_; ++index) {
		HT->head_[index].data_ = 0;
		HT->head_[index].flag_ = EMPTY;
	}

	return HT;
}

void destroyHash(hashTable table)
{
	delete[] table->head_;
	delete table;

	return;
}

bool hashFind(hashTable table, int data)
{
	size_t inc = 0;
	do {
		if (table->head_[(data + inc) % table->capacity_].flag_ == INUSE) {
			if (table->head_[(data + inc) % table->capacity_].data_ == data) {
				return true;
			}
		}

		++inc;
	} while (table->head_[(data + inc) % table->capacity_].flag_ != EMPTY && inc != table->capacity_);

	return false;
}

bool hashInsert(hashTable table, int data)
{
	size_t inc = 0;
	do {
		if (table->head_[(data + inc) % table->capacity_].flag_ != INUSE) {
			table->head_[(data + inc) % table->capacity_].data_ = data;
			table->head_[(data + inc) % table->capacity_].flag_ = INUSE;

			return true;
		}

		++inc;
	} while (inc != table->capacity_);

	return false;
}

bool hashDelete(hashTable table, int data)
{
	size_t inc = 0;
	do {
		if (table->head_[(data + inc) % table->capacity_].flag_ == INUSE) {
			if (table->head_[(data + inc) % table->capacity_].data_ == data) {
				table->head_[(data + inc) % table->capacity_].flag_ = DELETED;

				return true;
			}
		}

		++inc;
	} while (table->head_[(data + inc) % table->capacity_].flag_ != EMPTY && inc != table->capacity_);

	return false;
}