print(table.get('August')) # 미스(miss): 존재하지 않는 키이므로 None을 출력
print(table.get('September')) # 히트(hit): 30을 출력
모든 것이 정상적으로 동작한다면 객체
1
,
000
개를 저장할 수 있는 배열에
Entry
객체
3
개가
이
3
개의 (키, 값) 쌍에 대해 생성될 것이다.
put
()
과
get
()
의 성능은 배열 내
Entry
객체 개
수와는 독립적이므로 각 행동은 상수 시간 성능, 즉
O
(
1
)으로 고려될 수 있다.
get
(
key
)
가
key
에 대한 해시 코드로 식별된 버킷에서
Entry
를 찾는 데 실패하면
미스
miss
가
발생한다.
get
(
key
)
는 인자로 들어오는
key
가 일치하는
key
의
Entry
를 찾으면
히트
hit
가 발
생한다. 두 동작은 일반적이다. 하지만 두 키에 대한 해시 코드가 같은 버킷을 계산하는 경우에
발생하는
충돌을 해결할 전략
은
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.