Optimization of expand in basic_modif.py

Making Expr immutable, and then optimize __hash__ with this
This commit is contained in:
Clément Barthélemy 2024-02-24 02:57:07 +01:00
parent c27d706a26
commit 948e4da10c
6 changed files with 92 additions and 37 deletions

View file

@ -1,20 +0,0 @@
from __future__ import annotations
from typing import *
def gcd(a, b):
"""
Greatest common divisor
work with any object that support modulo and comparison (contrary to math.gcd)
used in type : Fraction
"""
if b > a:
return gcd(b, a)
if b == 0:
return a
return gcd(b, a % b)