Since changeset 3a17f8e704a7, there is no more context leak so the context when
saving is exactly the one at the instantiation. So _check_access must be
removed when the translations are instantiated.
review26401002
The method set_context does not replace the context but just update it.
So we could have leak of the surrounding into the read context.
issue5614
review25161002
In Python3, str has no more a decode method but it is the bytes type which has it.
Bytes is a synonym for str in Python2, so we can use it for this test.
issue5593
review25121002
It adds new configuration option to define the list of login methods.
It defines a new Exception to use to request user data during the login
process.
It separates the generic login attempt protection from the actual
authentication method.
It replace the API of the login methods to use a dictionary of parameters
instead of a single password.
issue5521
review16191003
Cache.resets create a new transaction but SQLite keeps a lock from the previous
transaction is it was not committed.
This commit was removed by changeset 9b2e0aac2d9c
issue5388
review16211002
The colspan attribute is important to keep the layout of the view intact.
So we must keep it after clearing all other attributes.
issue5444
review21901002
It adds keywords argument to _update_definition to limit the update as most of
the time only one kind of property is modified.
issue5416
review22891002
It allows plain, XML, HTML and XHTML as template extension.
It changes the translation type 'odt' into the more generic keyword 'report'.
Translation for text based template are extracted using the Genshi tools.
issue5185
review24951002
When the backend did not exist and pkg_resources was present, the exception
raise was a ValueError without meaningful information. Indeed it is better to
raise the import exception.
issue5418
review20101002
Indeed we should count the number of nodes updated instead of the number of
queries.
rebuild: 1 write and 1 select on each node
update: (1 write + 3 select + 2 write on average ½ all nodes + 1 write on child
of id) on each ids
So the threshold is:
2 * count < (4 + 2 * count / 2 + 1 * x) * len(ids)
2 * count < (4 + count + x) * len(ids)
which can be approximated to
2 * count < count * len(ids)
2 < len(ids)
issue5399
review20861002