Mike Bayer a9b62055bf Try to measure new style caching in the ORM, take two ...

Supercedes: If78fbb557c6f2cae637799c3fec2cbc5ac248aaf

Trying to see if by making the cache key memoized, we
still can have the older "identity" form of caching
which is the cheapest of all, at the same time as the
newer "cache key each time" version that is not nearly
as cheap; but still much cheaper than no caching at all.

Also needed is a per-execution update of _keymap when
we invoke from a cached select, so that Column objects
that are anonymous or otherwise adapted will match up.
this is analogous to the adaption of bound parameters
from the cache key.

Adds test coverage for the keymap / construct_params()
 changes related to caching.  Also hones performance
to a large extent for statement construction and
cache key generation.

Also includes a new memoized attribute
approach that vastly simplifies the previous approach
of "group_expirable_memoized_property" and finally
integrates cleanly with _clone(), _generate(), etc.
no more hardcoding of attributes is needed, as well
as that most _reset_memoization() calls are no longer
needed as the reset is inherent in a _generate() call;
this also has dramatic performance improvements.

Change-Id: I95c560ffcbfa30b26644999412fb6a385125f663

2020-04-01 16:12:23 -04:00

..

__init__.py

Enable F841

2019-06-20 13:50:41 -04:00

__main__.py

Post black reformatting

2019-01-06 18:23:11 -05:00

bulk_inserts.py

Post black reformatting

2019-01-06 18:23:11 -05:00

bulk_updates.py

Post black reformatting

2019-01-06 18:23:11 -05:00

large_resultsets.py

Enable F841

2019-06-20 13:50:41 -04:00

short_selects.py

Try to measure new style caching in the ORM, take two

2020-04-01 16:12:23 -04:00

single_inserts.py

Enable F841

2019-06-20 13:50:41 -04:00