# How hash-table and hash-map are different?

In the context of CS, how the hash-table and hash-map are different?

I was watching a part of "Algorithm with Swift" video in Udacity, and I discovered the terms "hash-table" and "hash-map" are somewhat confusing.

As far as I understand,

• hash table → stores keys only → Swift Set.
• hash map → stores key/value pairs → Swift Dictionary.

But, Wikipedia is talking hash-table is same thing with hash-map. Here I could not find any help.

Is this formal or widely accepted CS term? Am I understanding correctly? If I'm wrong, please correct me. Thanks.

I know industry uses their own terms that can be different, and I am asking about academia because I believe terms are more consistent in academia. If it's not, I just would abandon to learn academic terms.