Skip to content

Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
cclauss merged 10 commits into from
Jul 30, 2023
Merged

Pythonic implementation of LRU Cache #4630

Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
d23bcf5
Added a more pythonic implementation of LRU_Cache.[#4628]
yatharthmathur Aug 18, 2021
2c9d524
Added test cases and doctest
yatharthmathur Aug 19, 2021
e5b6af1
Fixed doc tests
yatharthmathur Aug 19, 2021
fc53f3b
Added more tests in doctests and fixed return types fixes [#4628]
yatharthmathur Aug 19, 2021
b237fb3
better doctests
yatharthmathur Aug 19, 2021
b931537
added doctests to main()
yatharthmathur Aug 19, 2021
59fec2a
Added dutch_national_flag.py in sorts. fixing [#4636]
yatharthmathur Aug 19, 2021
73e9c44
Delete dutch_national_flag.py
yatharthmathur Aug 19, 2021
34b70da
Update lru_cache_pythonic.py
cclauss Oct 23, 2021
4f7c0c0
Remove pontification
cclauss Nov 8, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
113 changes: 113 additions & 0 deletions other/lru_cache_pythonic.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
def __init__(self, capacity: int) -> None:
"""
Initialize an LRU Cache with given capacity.
capacity : int -> the capacity of the LRU Cache
>>> cache = LRUCache(2)
>>> cache
{}
"""
self.remaining: int = capacity

def get(self, key: Hashable) -> Any:
"""
This method returns the value associated with the key.
key : A hashable object that is mapped to a value in the LRU cache.
return -> Any object that has been stored as a value in the LRU cache.

>>> cache = LRUCache(2)
>>> cache.put(1,1)
>>> cache.get(1)
1
>>> cache.get(2)
Traceback (most recent call last):
...
KeyError: '2 not found.'
"""
if key not in self:
raise KeyError(f"{key} not found.")
val = self.pop(key) # Pop the key-value and re-insert to maintain the order
self[key] = val
return val

def put(self, key: Hashable, value: Any) -> None:
"""
This method puts the value associated with the key provided in the LRU cache.
key : A hashable object that is mapped to a value in the LRU cache.
value: Any object that is to be associated with the key in the LRU cache.
>>> cache = LRUCache(2)
>>> cache.put(3,3)
>>> cache
{3: 3}
>>> cache.put(2,2)
>>> cache
{3: 3, 2: 2}
"""
# To pop the last value inside of the LRU cache
if key in self:
self.pop(key)
self[key] = value
return

if self.remaining > 0:
self.remaining -= 1
# To pop the least recently used item from the dictionary
else:
self.pop(next(iter(self)))
self[key] = value


def main() -> None:
"""Example test case with LRU_Cache of size 2
>>> main()
1
Key=2 not found in cache
Key=1 not found in cache
3
4
"""
cache = LRUCache(2) # Creates an LRU cache with size 2
cache.put(1, 1) # cache = {1:1}
cache.put(2, 2) # cache = {1:1, 2:2}
try:
print(cache.get(1)) # Prints 1
except KeyError:
print("Key not found in cache")
cache.put(
3, 3
) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
try:
print(cache.get(2))
except KeyError:
print("Key=2 not found in cache") # Prints key not found
cache.put(
4, 4
) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
try:
print(cache.get(1))
except KeyError:
print("Key=1 not found in cache") # Prints key not found
try:
print(cache.get(3)) # Prints value 3
except KeyError:
print("Key not found in cache")

try:
print(cache.get(4)) # Prints value 4
except KeyError:
print("Key not found in cache")


if __name__ == "__main__":
import doctest

doctest.testmod()
main()
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all 
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Pythonic implementation of LRU Cache by yatharthmathur · Pull Request #4630 · TheAlgorithms/Python · GitHub
Skip to content
Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 10 commits into

from

Jul 30, 2023
 Merged


Pythonic implementation of LRU Cache
#4630
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
d23bcf5

Added a more pythonic implementation of LRU_Cache.[#4628]


yatharthmathur Aug 18, 2021
2c9d524

Added test cases and doctest


yatharthmathur Aug 19, 2021
e5b6af1

Fixed doc tests


yatharthmathur Aug 19, 2021
fc53f3b

Added more tests in doctests and fixed return types fixes [#4628]


yatharthmathur Aug 19, 2021
b237fb3

better doctests


yatharthmathur Aug 19, 2021
b931537

added doctests to main()


yatharthmathur Aug 19, 2021
59fec2a

Added dutch_national_flag.py in sorts. fixing [#4636]


yatharthmathur Aug 19, 2021
73e9c44

Delete dutch_national_flag.py


yatharthmathur Aug 19, 2021
34b70da

Update lru_cache_pythonic.py


cclauss Oct 23, 2021
4f7c0c0

Remove pontification


cclauss Nov 8, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


113 changes: 113 additions & 0 deletions
other/lru_cache_pythonic.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
 def __init__(self, capacity: int) -> None:
 """
 Initialize an LRU Cache with given capacity.
 capacity : int -> the capacity of the LRU Cache
 >>> cache = LRUCache(2)
 >>> cache
 {}
 """
 self.remaining: int = capacity

 def get(self, key: Hashable) -> Any:
 """
 This method returns the value associated with the key.
 key : A hashable object that is mapped to a value in the LRU cache.
 return -> Any object that has been stored as a value in the LRU cache.

 >>> cache = LRUCache(2)
 >>> cache.put(1,1)
 >>> cache.get(1)
 1
 >>> cache.get(2)
 Traceback (most recent call last):
 ...
 KeyError: '2 not found.'
 """
 if key not in self:
 raise KeyError(f"{key} not found.")
 val = self.pop(key) # Pop the key-value and re-insert to maintain the order
 self[key] = val
 return val

 def put(self, key: Hashable, value: Any) -> None:
 """
 This method puts the value associated with the key provided in the LRU cache.
 key : A hashable object that is mapped to a value in the LRU cache.
 value: Any object that is to be associated with the key in the LRU cache.
 >>> cache = LRUCache(2)
 >>> cache.put(3,3)
 >>> cache
 {3: 3}
 >>> cache.put(2,2)
 >>> cache
 {3: 3, 2: 2}
 """
 # To pop the last value inside of the LRU cache
 if key in self:
 self.pop(key)
 self[key] = value
 return

 if self.remaining > 0:
 self.remaining -= 1
 # To pop the least recently used item from the dictionary
 else:
 self.pop(next(iter(self)))
 self[key] = value


def main() -> None:
 """Example test case with LRU_Cache of size 2
 >>> main()
 1
 Key=2 not found in cache
 Key=1 not found in cache
 3
 4
 """
 cache = LRUCache(2) # Creates an LRU cache with size 2
 cache.put(1, 1) # cache = {1:1}
 cache.put(2, 2) # cache = {1:1, 2:2}
 try:
 print(cache.get(1)) # Prints 1
 except KeyError:
 print("Key not found in cache")
 cache.put(
 3, 3
 ) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
 try:
 print(cache.get(2))
 except KeyError:
 print("Key=2 not found in cache") # Prints key not found
 cache.put(
 4, 4
 ) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
 try:
 print(cache.get(1))
 except KeyError:
 print("Key=1 not found in cache") # Prints key not found
 try:
 print(cache.get(3)) # Prints value 3
 except KeyError:
 print("Key not found in cache")

 try:
 print(cache.get(4)) # Prints value 4
 except KeyError:
 print("Key not found in cache")


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Force GitHub README to respect dark mode
(function() {
var style = document.createElement('style');
style.textContent = '
.markdown-body {
color-scheme: dark light;
}
.markdown-body pre { background: #161b22 !important; }
.markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }
.markdown-body table th, .markdown-body table td { border-color: #30363d !important; }
.markdown-body img { background: #0d1117; }
.markdown-body blockquote { border-left-color: #8b949e; }
.markdown-body hr { border-color: #30363d; }
';
document.head.appendChild(style);
})();
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Pythonic implementation of LRU Cache by yatharthmathur · Pull Request #4630 · TheAlgorithms/Python · GitHub
Skip to content
Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 10 commits into

from

Jul 30, 2023
 Merged


Pythonic implementation of LRU Cache
#4630
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
d23bcf5

Added a more pythonic implementation of LRU_Cache.[#4628]


yatharthmathur Aug 18, 2021
2c9d524

Added test cases and doctest


yatharthmathur Aug 19, 2021
e5b6af1

Fixed doc tests


yatharthmathur Aug 19, 2021
fc53f3b

Added more tests in doctests and fixed return types fixes [#4628]


yatharthmathur Aug 19, 2021
b237fb3

better doctests


yatharthmathur Aug 19, 2021
b931537

added doctests to main()


yatharthmathur Aug 19, 2021
59fec2a

Added dutch_national_flag.py in sorts. fixing [#4636]


yatharthmathur Aug 19, 2021
73e9c44

Delete dutch_national_flag.py


yatharthmathur Aug 19, 2021
34b70da

Update lru_cache_pythonic.py


cclauss Oct 23, 2021
4f7c0c0

Remove pontification


cclauss Nov 8, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


113 changes: 113 additions & 0 deletions
other/lru_cache_pythonic.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
 def __init__(self, capacity: int) -> None:
 """
 Initialize an LRU Cache with given capacity.
 capacity : int -> the capacity of the LRU Cache
 >>> cache = LRUCache(2)
 >>> cache
 {}
 """
 self.remaining: int = capacity

 def get(self, key: Hashable) -> Any:
 """
 This method returns the value associated with the key.
 key : A hashable object that is mapped to a value in the LRU cache.
 return -> Any object that has been stored as a value in the LRU cache.

 >>> cache = LRUCache(2)
 >>> cache.put(1,1)
 >>> cache.get(1)
 1
 >>> cache.get(2)
 Traceback (most recent call last):
 ...
 KeyError: '2 not found.'
 """
 if key not in self:
 raise KeyError(f"{key} not found.")
 val = self.pop(key) # Pop the key-value and re-insert to maintain the order
 self[key] = val
 return val

 def put(self, key: Hashable, value: Any) -> None:
 """
 This method puts the value associated with the key provided in the LRU cache.
 key : A hashable object that is mapped to a value in the LRU cache.
 value: Any object that is to be associated with the key in the LRU cache.
 >>> cache = LRUCache(2)
 >>> cache.put(3,3)
 >>> cache
 {3: 3}
 >>> cache.put(2,2)
 >>> cache
 {3: 3, 2: 2}
 """
 # To pop the last value inside of the LRU cache
 if key in self:
 self.pop(key)
 self[key] = value
 return

 if self.remaining > 0:
 self.remaining -= 1
 # To pop the least recently used item from the dictionary
 else:
 self.pop(next(iter(self)))
 self[key] = value


def main() -> None:
 """Example test case with LRU_Cache of size 2
 >>> main()
 1
 Key=2 not found in cache
 Key=1 not found in cache
 3
 4
 """
 cache = LRUCache(2) # Creates an LRU cache with size 2
 cache.put(1, 1) # cache = {1:1}
 cache.put(2, 2) # cache = {1:1, 2:2}
 try:
 print(cache.get(1)) # Prints 1
 except KeyError:
 print("Key not found in cache")
 cache.put(
 3, 3
 ) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
 try:
 print(cache.get(2))
 except KeyError:
 print("Key=2 not found in cache") # Prints key not found
 cache.put(
 4, 4
 ) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
 try:
 print(cache.get(1))
 except KeyError:
 print("Key=1 not found in cache") # Prints key not found
 try:
 print(cache.get(3)) # Prints value 3
 except KeyError:
 print("Key not found in cache")

 try:
 print(cache.get(4)) # Prints value 4
 except KeyError:
 print("Key not found in cache")


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Highlight search terms from Google/DuckDuckGo/Bing referrer
(function() {
var ref = document.referrer;
var terms = [];
if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {
var url = new URL(ref);
var q = url.searchParams.get('q') || url.searchParams.get('p');
if (q) {
terms = q.split(/\s+/).filter(function(t) { return t.length > 2; });
}
}
if (terms.length === 0) return;
var style = document.createElement('style');
style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';
document.head.appendChild(style);
function highlight(node) {
if (node.nodeType === 3) { // text node
var text = node.textContent;
var found = false;
terms.forEach(function(term) {
var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi');
if (regex.test(text)) {
found = true;
var frag = document.createDocumentFragment();
var parts = text.split(regex);
parts.forEach(function(part, i) {
if (i % 2 === 0) {
frag.appendChild(document.createTextNode(part));
} else {
var span = document.createElement('span');
span.className = 'userscript-highlight';
span.textContent = part;
frag.appendChild(span);
}
});
node.parentNode.replaceChild(frag, node);
}
});
} else if (node.nodeType === 1 && node.childNodes) { // element
var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];
if (!skipTags.includes(node.tagName)) {
Array.from(node.childNodes).forEach(highlight);
}
}
}
highlight(document.body);
// Re-highlight on dynamic content
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1 || node.nodeType === 3) highlight(node);
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Pythonic implementation of LRU Cache by yatharthmathur · Pull Request #4630 · TheAlgorithms/Python · GitHub
Skip to content
Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 10 commits into

from

Jul 30, 2023
 Merged


Pythonic implementation of LRU Cache
#4630
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
d23bcf5

Added a more pythonic implementation of LRU_Cache.[#4628]


yatharthmathur Aug 18, 2021
2c9d524

Added test cases and doctest


yatharthmathur Aug 19, 2021
e5b6af1

Fixed doc tests


yatharthmathur Aug 19, 2021
fc53f3b

Added more tests in doctests and fixed return types fixes [#4628]


yatharthmathur Aug 19, 2021
b237fb3

better doctests


yatharthmathur Aug 19, 2021
b931537

added doctests to main()


yatharthmathur Aug 19, 2021
59fec2a

Added dutch_national_flag.py in sorts. fixing [#4636]


yatharthmathur Aug 19, 2021
73e9c44

Delete dutch_national_flag.py


yatharthmathur Aug 19, 2021
34b70da

Update lru_cache_pythonic.py


cclauss Oct 23, 2021
4f7c0c0

Remove pontification


cclauss Nov 8, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


113 changes: 113 additions & 0 deletions
other/lru_cache_pythonic.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
 def __init__(self, capacity: int) -> None:
 """
 Initialize an LRU Cache with given capacity.
 capacity : int -> the capacity of the LRU Cache
 >>> cache = LRUCache(2)
 >>> cache
 {}
 """
 self.remaining: int = capacity

 def get(self, key: Hashable) -> Any:
 """
 This method returns the value associated with the key.
 key : A hashable object that is mapped to a value in the LRU cache.
 return -> Any object that has been stored as a value in the LRU cache.

 >>> cache = LRUCache(2)
 >>> cache.put(1,1)
 >>> cache.get(1)
 1
 >>> cache.get(2)
 Traceback (most recent call last):
 ...
 KeyError: '2 not found.'
 """
 if key not in self:
 raise KeyError(f"{key} not found.")
 val = self.pop(key) # Pop the key-value and re-insert to maintain the order
 self[key] = val
 return val

 def put(self, key: Hashable, value: Any) -> None:
 """
 This method puts the value associated with the key provided in the LRU cache.
 key : A hashable object that is mapped to a value in the LRU cache.
 value: Any object that is to be associated with the key in the LRU cache.
 >>> cache = LRUCache(2)
 >>> cache.put(3,3)
 >>> cache
 {3: 3}
 >>> cache.put(2,2)
 >>> cache
 {3: 3, 2: 2}
 """
 # To pop the last value inside of the LRU cache
 if key in self:
 self.pop(key)
 self[key] = value
 return

 if self.remaining > 0:
 self.remaining -= 1
 # To pop the least recently used item from the dictionary
 else:
 self.pop(next(iter(self)))
 self[key] = value


def main() -> None:
 """Example test case with LRU_Cache of size 2
 >>> main()
 1
 Key=2 not found in cache
 Key=1 not found in cache
 3
 4
 """
 cache = LRUCache(2) # Creates an LRU cache with size 2
 cache.put(1, 1) # cache = {1:1}
 cache.put(2, 2) # cache = {1:1, 2:2}
 try:
 print(cache.get(1)) # Prints 1
 except KeyError:
 print("Key not found in cache")
 cache.put(
 3, 3
 ) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
 try:
 print(cache.get(2))
 except KeyError:
 print("Key=2 not found in cache") # Prints key not found
 cache.put(
 4, 4
 ) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
 try:
 print(cache.get(1))
 except KeyError:
 print("Key=1 not found in cache") # Prints key not found
 try:
 print(cache.get(3)) # Prints value 3
 except KeyError:
 print("Key not found in cache")

 try:
 print(cache.get(4)) # Prints value 4
 except KeyError:
 print("Key not found in cache")


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Strip utm_, fbclid, gclid, etc. from all links on page
(function() {
var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',
'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',
'ref', 'ref_src', 'source', 'medium', 'campaign'];
function cleanUrl(url) {
try {
var u = new URL(url, window.location.origin);
var changed = false;
trackingParams.forEach(function(p) {
if (u.searchParams.has(p)) {
u.searchParams.delete(p);
changed = true;
}
});
return changed ? u.toString() : url;
} catch (e) {
return url;
}
}
function cleanLinks() {
document.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
cleanLinks();
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1) {
if (node.tagName === 'A') cleanLinks();
node.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '
Pythonic implementation of LRU Cache by yatharthmathur · Pull Request #4630 · TheAlgorithms/Python · GitHub
Skip to content
Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 10 commits into

from

Jul 30, 2023
 Merged


Pythonic implementation of LRU Cache
#4630
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
d23bcf5

Added a more pythonic implementation of LRU_Cache.[#4628]


yatharthmathur Aug 18, 2021
2c9d524

Added test cases and doctest


yatharthmathur Aug 19, 2021
e5b6af1

Fixed doc tests


yatharthmathur Aug 19, 2021
fc53f3b

Added more tests in doctests and fixed return types fixes [#4628]


yatharthmathur Aug 19, 2021
b237fb3

better doctests


yatharthmathur Aug 19, 2021
b931537

added doctests to main()


yatharthmathur Aug 19, 2021
59fec2a

Added dutch_national_flag.py in sorts. fixing [#4636]


yatharthmathur Aug 19, 2021
73e9c44

Delete dutch_national_flag.py


yatharthmathur Aug 19, 2021
34b70da

Update lru_cache_pythonic.py


cclauss Oct 23, 2021
4f7c0c0

Remove pontification


cclauss Nov 8, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


113 changes: 113 additions & 0 deletions
other/lru_cache_pythonic.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
 def __init__(self, capacity: int) -> None:
 """
 Initialize an LRU Cache with given capacity.
 capacity : int -> the capacity of the LRU Cache
 >>> cache = LRUCache(2)
 >>> cache
 {}
 """
 self.remaining: int = capacity

 def get(self, key: Hashable) -> Any:
 """
 This method returns the value associated with the key.
 key : A hashable object that is mapped to a value in the LRU cache.
 return -> Any object that has been stored as a value in the LRU cache.

 >>> cache = LRUCache(2)
 >>> cache.put(1,1)
 >>> cache.get(1)
 1
 >>> cache.get(2)
 Traceback (most recent call last):
 ...
 KeyError: '2 not found.'
 """
 if key not in self:
 raise KeyError(f"{key} not found.")
 val = self.pop(key) # Pop the key-value and re-insert to maintain the order
 self[key] = val
 return val

 def put(self, key: Hashable, value: Any) -> None:
 """
 This method puts the value associated with the key provided in the LRU cache.
 key : A hashable object that is mapped to a value in the LRU cache.
 value: Any object that is to be associated with the key in the LRU cache.
 >>> cache = LRUCache(2)
 >>> cache.put(3,3)
 >>> cache
 {3: 3}
 >>> cache.put(2,2)
 >>> cache
 {3: 3, 2: 2}
 """
 # To pop the last value inside of the LRU cache
 if key in self:
 self.pop(key)
 self[key] = value
 return

 if self.remaining > 0:
 self.remaining -= 1
 # To pop the least recently used item from the dictionary
 else:
 self.pop(next(iter(self)))
 self[key] = value


def main() -> None:
 """Example test case with LRU_Cache of size 2
 >>> main()
 1
 Key=2 not found in cache
 Key=1 not found in cache
 3
 4
 """
 cache = LRUCache(2) # Creates an LRU cache with size 2
 cache.put(1, 1) # cache = {1:1}
 cache.put(2, 2) # cache = {1:1, 2:2}
 try:
 print(cache.get(1)) # Prints 1
 except KeyError:
 print("Key not found in cache")
 cache.put(
 3, 3
 ) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
 try:
 print(cache.get(2))
 except KeyError:
 print("Key=2 not found in cache") # Prints key not found
 cache.put(
 4, 4
 ) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
 try:
 print(cache.get(1))
 except KeyError:
 print("Key=1 not found in cache") # Prints key not found
 try:
 print(cache.get(3)) # Prints value 3
 except KeyError:
 print("Key not found in cache")

 try:
 print(cache.get(4)) # Prints value 4
 except KeyError:
 print("Key not found in cache")


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Auto-enable theater mode on YouTube
(function() {
function tryTheater() {
var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]');
if (btn && !btn.classList.contains('activated')) {
btn.click();
}
}
// Try immediately
tryTheater();
// Try after navigation (SPA)
var lastUrl = location.href;
setInterval(function() {
if (location.href !== lastUrl) {
lastUrl = location.href;
setTimeout(tryTheater, 500);
}
}, 1000);
// Also try on player load
var observer = new MutationObserver(tryTheater);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Pythonic implementation of LRU Cache by yatharthmathur · Pull Request #4630 · TheAlgorithms/Python · GitHub
Skip to content
Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 10 commits into

from

Jul 30, 2023
 Merged


Pythonic implementation of LRU Cache
#4630
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
d23bcf5

Added a more pythonic implementation of LRU_Cache.[#4628]


yatharthmathur Aug 18, 2021
2c9d524

Added test cases and doctest


yatharthmathur Aug 19, 2021
e5b6af1

Fixed doc tests


yatharthmathur Aug 19, 2021
fc53f3b

Added more tests in doctests and fixed return types fixes [#4628]


yatharthmathur Aug 19, 2021
b237fb3

better doctests


yatharthmathur Aug 19, 2021
b931537

added doctests to main()


yatharthmathur Aug 19, 2021
59fec2a

Added dutch_national_flag.py in sorts. fixing [#4636]


yatharthmathur Aug 19, 2021
73e9c44

Delete dutch_national_flag.py


yatharthmathur Aug 19, 2021
34b70da

Update lru_cache_pythonic.py


cclauss Oct 23, 2021
4f7c0c0

Remove pontification


cclauss Nov 8, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


113 changes: 113 additions & 0 deletions
other/lru_cache_pythonic.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
 def __init__(self, capacity: int) -> None:
 """
 Initialize an LRU Cache with given capacity.
 capacity : int -> the capacity of the LRU Cache
 >>> cache = LRUCache(2)
 >>> cache
 {}
 """
 self.remaining: int = capacity

 def get(self, key: Hashable) -> Any:
 """
 This method returns the value associated with the key.
 key : A hashable object that is mapped to a value in the LRU cache.
 return -> Any object that has been stored as a value in the LRU cache.

 >>> cache = LRUCache(2)
 >>> cache.put(1,1)
 >>> cache.get(1)
 1
 >>> cache.get(2)
 Traceback (most recent call last):
 ...
 KeyError: '2 not found.'
 """
 if key not in self:
 raise KeyError(f"{key} not found.")
 val = self.pop(key) # Pop the key-value and re-insert to maintain the order
 self[key] = val
 return val

 def put(self, key: Hashable, value: Any) -> None:
 """
 This method puts the value associated with the key provided in the LRU cache.
 key : A hashable object that is mapped to a value in the LRU cache.
 value: Any object that is to be associated with the key in the LRU cache.
 >>> cache = LRUCache(2)
 >>> cache.put(3,3)
 >>> cache
 {3: 3}
 >>> cache.put(2,2)
 >>> cache
 {3: 3, 2: 2}
 """
 # To pop the last value inside of the LRU cache
 if key in self:
 self.pop(key)
 self[key] = value
 return

 if self.remaining > 0:
 self.remaining -= 1
 # To pop the least recently used item from the dictionary
 else:
 self.pop(next(iter(self)))
 self[key] = value


def main() -> None:
 """Example test case with LRU_Cache of size 2
 >>> main()
 1
 Key=2 not found in cache
 Key=1 not found in cache
 3
 4
 """
 cache = LRUCache(2) # Creates an LRU cache with size 2
 cache.put(1, 1) # cache = {1:1}
 cache.put(2, 2) # cache = {1:1, 2:2}
 try:
 print(cache.get(1)) # Prints 1
 except KeyError:
 print("Key not found in cache")
 cache.put(
 3, 3
 ) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
 try:
 print(cache.get(2))
 except KeyError:
 print("Key=2 not found in cache") # Prints key not found
 cache.put(
 4, 4
 ) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
 try:
 print(cache.get(1))
 except KeyError:
 print("Key=1 not found in cache") # Prints key not found
 try:
 print(cache.get(3)) # Prints value 3
 except KeyError:
 print("Key not found in cache")

 try:
 print(cache.get(4)) # Prints value 4
 except KeyError:
 print("Key not found in cache")


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Remove or un-stick sticky/fixed headers that block content
(function() {
function unstick() {
document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) {
if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {
el.style.position = 'static';
el.style.top = 'auto';
el.style.zIndex = 'auto';
}
});
}
unstick();
var observer = new MutationObserver(unstick);
observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });
})();
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
})();
Pythonic implementation of LRU Cache by yatharthmathur · Pull Request #4630 · TheAlgorithms/Python · GitHub
Skip to content
Pythonic implementation of LRU Cache#4630

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 10 commits into

from

Jul 30, 2023
 Merged


Pythonic implementation of LRU Cache
#4630
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
d23bcf5

Added a more pythonic implementation of LRU_Cache.[#4628]


yatharthmathur Aug 18, 2021
2c9d524

Added test cases and doctest


yatharthmathur Aug 19, 2021
e5b6af1

Fixed doc tests


yatharthmathur Aug 19, 2021
fc53f3b

Added more tests in doctests and fixed return types fixes [#4628]


yatharthmathur Aug 19, 2021
b237fb3

better doctests


yatharthmathur Aug 19, 2021
b931537

added doctests to main()


yatharthmathur Aug 19, 2021
59fec2a

Added dutch_national_flag.py in sorts. fixing [#4636]


yatharthmathur Aug 19, 2021
73e9c44

Delete dutch_national_flag.py


yatharthmathur Aug 19, 2021
34b70da

Update lru_cache_pythonic.py


cclauss Oct 23, 2021
4f7c0c0

Remove pontification


cclauss Nov 8, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


113 changes: 113 additions & 0 deletions
other/lru_cache_pythonic.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
"""
This implementation of LRU Cache uses the in-built Python dictionary (dict) which from
Python 3.6 onward maintain the insertion order of keys and ensures O(1) operations on
insert, delete and access. https://docs.python.org/3/library/stdtypes.html#typesmapping
"""
from typing import Any, Hashable


class LRUCache(dict):
 def __init__(self, capacity: int) -> None:
 """
 Initialize an LRU Cache with given capacity.
 capacity : int -> the capacity of the LRU Cache
 >>> cache = LRUCache(2)
 >>> cache
 {}
 """
 self.remaining: int = capacity

 def get(self, key: Hashable) -> Any:
 """
 This method returns the value associated with the key.
 key : A hashable object that is mapped to a value in the LRU cache.
 return -> Any object that has been stored as a value in the LRU cache.

 >>> cache = LRUCache(2)
 >>> cache.put(1,1)
 >>> cache.get(1)
 1
 >>> cache.get(2)
 Traceback (most recent call last):
 ...
 KeyError: '2 not found.'
 """
 if key not in self:
 raise KeyError(f"{key} not found.")
 val = self.pop(key) # Pop the key-value and re-insert to maintain the order
 self[key] = val
 return val

 def put(self, key: Hashable, value: Any) -> None:
 """
 This method puts the value associated with the key provided in the LRU cache.
 key : A hashable object that is mapped to a value in the LRU cache.
 value: Any object that is to be associated with the key in the LRU cache.
 >>> cache = LRUCache(2)
 >>> cache.put(3,3)
 >>> cache
 {3: 3}
 >>> cache.put(2,2)
 >>> cache
 {3: 3, 2: 2}
 """
 # To pop the last value inside of the LRU cache
 if key in self:
 self.pop(key)
 self[key] = value
 return

 if self.remaining > 0:
 self.remaining -= 1
 # To pop the least recently used item from the dictionary
 else:
 self.pop(next(iter(self)))
 self[key] = value


def main() -> None:
 """Example test case with LRU_Cache of size 2
 >>> main()
 1
 Key=2 not found in cache
 Key=1 not found in cache
 3
 4
 """
 cache = LRUCache(2) # Creates an LRU cache with size 2
 cache.put(1, 1) # cache = {1:1}
 cache.put(2, 2) # cache = {1:1, 2:2}
 try:
 print(cache.get(1)) # Prints 1
 except KeyError:
 print("Key not found in cache")
 cache.put(
 3, 3
 ) # cache = {1:1, 3:3} key=2 is evicted because it wasn't used recently
 try:
 print(cache.get(2))
 except KeyError:
 print("Key=2 not found in cache") # Prints key not found
 cache.put(
 4, 4
 ) # cache = {4:4, 3:3} key=1 is evicted because it wasn't used recently
 try:
 print(cache.get(1))
 except KeyError:
 print("Key=1 not found in cache") # Prints key not found
 try:
 print(cache.get(3)) # Prints value 3
 except KeyError:
 print("Key not found in cache")

 try:
 print(cache.get(4)) # Prints value 4
 except KeyError:
 print("Key not found in cache")


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()