Implement efficient hash table data structure

Create a custom hash table implementation in Hy:

## Implementation Requirements:
- Create a hash table class with standard operations (get, put, delete)
- Implement collision resolution using either:
- Separate chaining (linked lists)
- Linear probing
- Quadratic probing
- Double hashing
- Add features for dynamic resizing and load factor management
- Implement efficient hash functions for different data types
- Support for custom key types with proper hash function protocols

## Documentation Requirements:
- Clear explanation of design choices
- Performance characteristics
- Usage examples
- Complexity analysis for all operations

## Testing Requirements:
- Basic operations
- Edge cases (empty table, duplicate keys)
- Performance benchmarking against Python's built-in dict
- Collision handling tests

This will provide a foundational data structure that can be used in other algorithms.