Perf/improve performance

[hfudev]

No description provided.

[Copilot]

Pull Request Overview

This PR aims to improve performance in the bool_parser module by adding caching and streamlining logical operations. Key changes include:

• Introducing the lru_cache decorator on various get_value methods to cache results.
• Replacing iterative for-loops with list comprehensions, built-in any(), and all() for concise logical evaluations.
• Refactoring code in BoolOr and BoolAnd classes to enhance clarity and efficiency.

Comments suppressed due to low confidence (1)

esp_bool_parser/bool_parser.py:70

• Ensure that caching via lru_cache on instance methods is appropriate; since the instance (self) is part of the cache key, any changes to instance state won't invalidate the cache. Verify that instances remain effectively immutable or update the caching strategy accordingly.

@lru_cache

[github-actions]

Coverage Report

File	Stmts	Miss	Cover	Missing
esp_bool_parser
bool_parser.py	119	18	85%	50, 76, 79, 82, 94–108, 170, 175, 183, 187
constants.py	41	13	68%	19–20, 45–57
soc_header.py	68	41	40%	54–64, 77–82, 86–93, 97–138
utils.py	24	2	92%	76–77
TOTAL	259	74	71%

Tests	Skipped	Failures	Errors	Time
52	1 💤	0 ❌	0 🔥	0.798s ⏱️

[Copilot]

Pull Request Overview

This PR aims to improve performance by leveraging caching and more concise iterations in boolean evaluation methods.

• Added lru_cache decorators to multiple get_value instance methods to cache computed results.
• Replaced explicit for-loops with Python built-ins (any and all) to improve clarity and performance.

[Copilot]

Using lru_cache on instance methods can lead to unexpected behavior if the instance (self) is mutable or not hashable. Consider ensuring that instances remain immutable or refactoring the caching mechanism to operate on a function that receives only hashable parameters.