diff options
| author | Raphael Collet <rco@openerp.com> | 2016-05-27 16:00:01 +0200 |
|---|---|---|
| committer | Raphael Collet <rco@openerp.com> | 2016-06-16 16:50:47 +0200 |
| commit | 2c6f34d5685638534e7c1a53319253eaedb5583e (patch) | |
| tree | c526d18e87bfb4858bc43b4ae5190fbb831b81e5 /doc/reference/javascript.rst | |
| parent | 5161e25112f443401a11835798b0a2cf38ae2ef8 (diff) | |
[FIX] models: fix implementation of method `_check_m2m_recursion`
The former algorithm was incorrect: when checking two related nodes together,
it returned as if a cycle was found (even when no cycle was present.) The new
algorithm computes the transitive closure of the relation from the root nodes,
and stops as soon as a cycle is found.
Diffstat (limited to 'doc/reference/javascript.rst')
0 files changed, 0 insertions, 0 deletions