Back to Repositories

Testing Array Hash Map Operations in hello-algo

A comprehensive test suite for validating array-based hash map implementation in Go, covering core operations like insertion, retrieval, deletion, and iteration. This test file ensures the correctness of a hash map data structure while demonstrating idiomatic Go testing patterns.

Test Coverage Overview

The test suite provides thorough coverage of array hash map operations:
  • Key-value pair insertion validation
  • Data retrieval accuracy testing
  • Element removal verification
  • Iteration methods testing across keys, values, and pairs
  • Edge case handling for various data operations

Implementation Analysis

The testing approach utilizes Go’s native testing framework with table-driven test patterns. It implements a structured workflow that validates hash map functionality through sequential operations, ensuring atomic testing of each feature while maintaining test isolation and clarity.

The implementation leverages Go’s testing.T struct for assertion handling and uses fmt for output verification.

Technical Details

Testing tools and configuration:
  • Go testing package (testing)
  • Standard fmt package for output formatting
  • Custom hash map implementation (newArrayHashMap)
  • Structured key-value pair testing methodology
  • In-memory test data management

Best Practices Demonstrated

The test suite exemplifies several testing best practices:
  • Clear test case organization and progression
  • Comprehensive operation verification
  • Explicit test data setup and cleanup
  • Proper test isolation
  • Readable output formatting
  • Effective use of Go’s testing primitives

krahets/hello-algo

codes/go/chapter_hashing/array_hash_map_test.go

            
// File: array_hash_map_test.go
// Created Time: 2022-12-14
// Author: msk397 ([email protected])

package chapter_hashing

import (
	"fmt"
	"testing"
)

func TestArrayHashMap(t *testing.T) {
	/* 初始化哈希表 */
	hmap := newArrayHashMap()

	/* 添加操作 */
	// 在哈希表中添加键值对 (key, value)
	hmap.put(12836, "小哈")
	hmap.put(15937, "小啰")
	hmap.put(16750, "小算")
	hmap.put(13276, "小法")
	hmap.put(10583, "小鸭")
	fmt.Println("\n添加完成后,哈希表为\nKey -> Value")
	hmap.print()

	/* 查询操作 */
	// 向哈希表中输入键 key ,得到值 value
	name := hmap.get(15937)
	fmt.Println("\n输入学号 15937 ,查询到姓名 " + name)

	/* 删除操作 */
	// 在哈希表中删除键值对 (key, value)
	hmap.remove(10583)
	fmt.Println("\n删除 10583 后,哈希表为\nKey -> Value")
	hmap.print()

	/* 遍历哈希表 */
	fmt.Println("\n遍历键值对 Key->Value")
	for _, kv := range hmap.pairSet() {
		fmt.Println(kv.key, " -> ", kv.val)
	}

	fmt.Println("\n单独遍历键 Key")
	for _, key := range hmap.keySet() {
		fmt.Println(key)
	}

	fmt.Println("\n单独遍历值 Value")
	for _, val := range hmap.valueSet() {
		fmt.Println(val)
	}
}