lru_cache is a decorator used in Python to cache function results. It avoids repeated calculations through memory, greatly improving performance. 1. It is based on the "latest least used" strategy, and uses function parameters as key cache return value, and the same parameters directly returns the result; 2. It is often used for recursive optimization, such as Fibonacci sequence, which reduces the time complexity from exponential to linear; 3. It can be set to limit the number of caches to prevent memory waste; 4. It provides cache_info() to view hit statistics, and cache_clear() to clear the cache; 5. It requires that the parameters can be hashed and is suitable for pure functions without side effects; 6. Typical scenarios include recursion, dynamic programming and mathematical calculations, which significantly reduce redundant operations, and is a practical tool for efficient programming.
functools.lru_cache
is a very practical decorator in Python that caches the return value of a function and avoids repeated calculations. It is especially suitable for optimizing recursive functions or time-consuming calculation tasks. The following is a classic example to illustrate its usage.

What is lru_cache
?
lru_cache
implements the "Least Recently Used" caching policy. It will store the input parameters of the function as keys and the return value as values in the cache. If the function is called by the same parameter, the cached result will be returned directly and the actual calculation will be skipped.
Example: Fibonacci Sequence (Recursive Optimization)
The Fibonacci sequence is a typical recursive problem:

from functools import lru_cache @lru_cache(maxsize=128) def fib(n): if n < 2: Return n return fib(n - 1) fib(n - 2) # Test call print(fib(50)) # Output: 12586269025
illustrate:
-
@lru_cache(maxsize=128)
: means that up to 128 different call results are cached. - If
maxsize
is not added, the cache is unlimited (may cause memory waste). - After adding
lru_cache
, repeated calls such asfib(3)
will not be repeated, and the performance will drop from exponential level to linear.
What happens if you don't use lru_cache
?
No cached version:
def fib_bad(n): if n < 2: Return n return fib_bad(n - 1) fib_bad(n - 2) # fib_bad(35) may be significantly slower
You will find fib_bad(35)
is already very slow, and fib(50)
is done almost instantly.

Other practical functions
Check cache hits
print(fib.cache_info()) # The output is similar: CacheInfo(hits=48, misses=51, maxsize=128, currsize=51)
-
hits
: cache hits -
misses
: the number of times the function is missed, the number of times it actually executes - Can be used to evaluate cache efficiency
Clear cache
fib.cache_clear() # Clear cache
Things to note
- Function parameters must be hashable (such as
int
,str
,tuple
) and cannot belist
ordict
. - The cache will take up memory, and setting
maxsize
too large will lead to memory waste. - Suitable for pure functions (same input always the same output, no side effects).
More usage scenarios
@lru_cache(maxsize=None) def factorial(n): print(f"Computing factorial({n})...") if n <= 1: return 1 return n * factorial(n - 1) factorial(5) factorial(3) # will hit the cache and will not print it repeatedly
Output:
Computing factorial(5)... Computing factorial(4)... Computing factorial(3)... Computing factorial(2)... Computing factorial(1)...
The second call to factorial(3)
directly retrieves the result from the cache without printing intermediate information.
Basically that's it. lru_cache
is a "lazy artifact" to improve function performance, especially in dynamic programming and mathematical calculations.
The above is the detailed content of Python Functools Lru_cache Example. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

Polymorphism is a core concept in Python object-oriented programming, referring to "one interface, multiple implementations", allowing for unified processing of different types of objects. 1. Polymorphism is implemented through method rewriting. Subclasses can redefine parent class methods. For example, the spoke() method of Animal class has different implementations in Dog and Cat subclasses. 2. The practical uses of polymorphism include simplifying the code structure and enhancing scalability, such as calling the draw() method uniformly in the graphical drawing program, or handling the common behavior of different characters in game development. 3. Python implementation polymorphism needs to satisfy: the parent class defines a method, and the child class overrides the method, but does not require inheritance of the same parent class. As long as the object implements the same method, this is called the "duck type". 4. Things to note include the maintenance

Parameters are placeholders when defining a function, while arguments are specific values ??passed in when calling. 1. Position parameters need to be passed in order, and incorrect order will lead to errors in the result; 2. Keyword parameters are specified by parameter names, which can change the order and improve readability; 3. Default parameter values ??are assigned when defined to avoid duplicate code, but variable objects should be avoided as default values; 4. args and *kwargs can handle uncertain number of parameters and are suitable for general interfaces or decorators, but should be used with caution to maintain readability.

Iterators are objects that implement __iter__() and __next__() methods. The generator is a simplified version of iterators, which automatically implement these methods through the yield keyword. 1. The iterator returns an element every time he calls next() and throws a StopIteration exception when there are no more elements. 2. The generator uses function definition to generate data on demand, saving memory and supporting infinite sequences. 3. Use iterators when processing existing sets, use a generator when dynamically generating big data or lazy evaluation, such as loading line by line when reading large files. Note: Iterable objects such as lists are not iterators. They need to be recreated after the iterator reaches its end, and the generator can only traverse it once.

A class method is a method defined in Python through the @classmethod decorator. Its first parameter is the class itself (cls), which is used to access or modify the class state. It can be called through a class or instance, which affects the entire class rather than a specific instance; for example, in the Person class, the show_count() method counts the number of objects created; when defining a class method, you need to use the @classmethod decorator and name the first parameter cls, such as the change_var(new_value) method to modify class variables; the class method is different from the instance method (self parameter) and static method (no automatic parameters), and is suitable for factory methods, alternative constructors, and management of class variables. Common uses include:

The key to dealing with API authentication is to understand and use the authentication method correctly. 1. APIKey is the simplest authentication method, usually placed in the request header or URL parameters; 2. BasicAuth uses username and password for Base64 encoding transmission, which is suitable for internal systems; 3. OAuth2 needs to obtain the token first through client_id and client_secret, and then bring the BearerToken in the request header; 4. In order to deal with the token expiration, the token management class can be encapsulated and automatically refreshed the token; in short, selecting the appropriate method according to the document and safely storing the key information is the key.

Python's magicmethods (or dunder methods) are special methods used to define the behavior of objects, which start and end with a double underscore. 1. They enable objects to respond to built-in operations, such as addition, comparison, string representation, etc.; 2. Common use cases include object initialization and representation (__init__, __repr__, __str__), arithmetic operations (__add__, __sub__, __mul__) and comparison operations (__eq__, ___lt__); 3. When using it, make sure that their behavior meets expectations. For example, __repr__ should return expressions of refactorable objects, and arithmetic methods should return new instances; 4. Overuse or confusing things should be avoided.

Python's garbage collection mechanism automatically manages memory through reference counting and periodic garbage collection. Its core method is reference counting, which immediately releases memory when the number of references of an object is zero; but it cannot handle circular references, so a garbage collection module (gc) is introduced to detect and clean the loop. Garbage collection is usually triggered when the reference count decreases during program operation, the allocation and release difference exceeds the threshold, or when gc.collect() is called manually. Users can turn off automatic recycling through gc.disable(), manually execute gc.collect(), and adjust thresholds to achieve control through gc.set_threshold(). Not all objects participate in loop recycling. If objects that do not contain references are processed by reference counting, it is built-in

Pythonmanagesmemoryautomaticallyusingreferencecountingandagarbagecollector.Referencecountingtrackshowmanyvariablesrefertoanobject,andwhenthecountreacheszero,thememoryisfreed.However,itcannothandlecircularreferences,wheretwoobjectsrefertoeachotherbuta
