Hi,
On Wed, Apr 4, 2012 at 6:24 PM, Stefan Guggisberg
wrote:
> i just realized (sorry, a bit late, i know) that this commit
> breaks some of the optimizations for large child node lists.
Good point, I didn't consider that case.
I'll refactor the code to restore the ability of the underlying lay
Efficient diffing of large child node lists
---
Key: OAK-46
URL: https://issues.apache.org/jira/browse/OAK-46
Project: Jackrabbit Oak
Issue Type: Improvement
Components: mk
Affects Versio
i just realized (sorry, a bit late, i know) that this commit
breaks some of the optimizations for large child node lists.
comparison of nodes had previously been delegated
to the Node/ChildNodeEntries implementation by calling
Node.diff(Node other). this allowed for specialized handling of
large c
Hi,
As a follow up to the recent discussion about how to implement transient
modifications [1] I started implementing a NodeStateEditor and a
TransientNodeState (see my commits on OAK-9). The idea is, to acquire a
NodeStateEditor from the current connection, do modifications on it and
commit