mdebray/tvl-depot
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
tvl-depot/scratch
History
William Carroll 155dff562a Impl part 3/3 for Memo 
Refactor the caching policy for the Memo by evicting the elements that have been
the least-recently-accessed.

Python's heapq module default to a min-heap. By storing our heap elements
as (UnixTime, a), we can guarantee that when we call heappop, we will get the
element with the lowest UnixTime value in heap (i.e. the oldest). When we call
heappush, we use (time.time(), key) and these values -- by having the largest
UnixTime, will propogate to the bottom of the min-heap.
2020-07-01 15:13:56 +01:00
..
crack_the_coding_interview Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00
data_structures_and_algorithms Impl part 3/3 for Memo 2020-07-01 15:13:56 +01:00
deepmind Progress with InterviewCake's coin problem 2020-03-31 14:43:03 +01:00
groceries Convert grocery list to an .org file 2020-07-01 10:45:28 +01:00
haskell-programming-from-first-principles Complete exercises for Reader and State chapters 2020-07-01 10:42:57 +01:00
README.md Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00

README.md

Scratch

The purpose of the scratch directory is to host practice exercises. Practice encompasses things like working on data structures and algorithms problems for upcoming coding interviews or general aptitude as well as writing code snippets to help me learn a new programming language or understand an unfamiliar concept.