C++ (Cpp) HashNode::getValue Examples

Example #1

File: CTECHashTable.cpp Project: zeajenson/classproject_0.6_hashing

bool CTECHashTable<Type>:: contains(HashNode<Type> currentNode){
	bool isInTable = false;

	int possibleLocation = findPosition(currentNode);

	while(internalStorage[possibleLocation] != nullptr && !isInTable){
		if(internalStorage[possibleLocation] == currentNode.getValue()){
			isInTable = true;
		}
		possibleLocation = (possibleLocation + 1) % capacity;
	}

	return isInTable;
}

Example #2

File: CTECHashTable.cpp Project: zeajenson/classproject_0.6_hashing

bool CTECHashTable<Type>:: remove(HashNode<Type> currentNode){
	bool hasBeenRemoved = false;
	int possibleLocation = findPosition(currentNode);

	if(contains(currentNode)){
		while(internalStorage[possibleLocation] != nullptr && !hasBeenRemoved){
			if(internalStorage[possibleLocation] == currentNode.getValue()){
				hasBeenRemoved = true;
				internalStorage[possibleLocation] = nullptr;
			}
			possibleLocation = (possibleLocation + 1) % capacity;
		}
	}
	return hasBeenRemoved;
}

Example #3

File: CTECHashTable.cpp Project: smartman97/NodeProject

bool CTECHashTable<Type>::contains(HashNode<Type> currentNode)
{
	bool isInTable = false;

	int index = findPosition(currentNode);
	while (internalStorage[index] != nullptr&& !isInTable)
	{
		if(internalStorage[index]->getValue() == currentNode.getValue())
		{
			isInTable = true;
		}
		else
		{
			index = (index + 1) % capacity;
		}
	}

	return isInTable;
}

Example #4

File: HashTable.cpp Project: madeast/UpdateNodes

bool HashTable<Type> :: contains(HashNode<Type> currentNode)
{
    bool wasRemoved = false;
  
        int index = findPosition(currentNode);
        while(internalStorage[index] != nullptr && !wasRemoved)
        {
            if(internalStorage[index]->getValue() == currentNode.getValue())
            {
                wasRemoved = true;
                internalStorage[index] = nullptr;
                size--;
            }
            else
            {
                index = (index + 1) % capacity;
            }
        }
    
    return wasRemoved;
}