- From: Boris Zbarsky <bzbarsky@MIT.EDU>
- Date: Tue, 05 Jul 2011 17:27:33 -0400
- To: Rafael Weinstein <rafaelw@google.com>
- CC: Ojan Vafai <ojan@chromium.org>, public-webapps@w3.org
On 7/5/11 5:21 PM, Rafael Weinstein wrote: > For ChildlistChanged, the potential data to be included: > -Target node* > -Removed nodes* > -Added nodes > -one of nextSibling or previousSibling* > > My belief is that including the starred (*) data above would be > sufficient to meet David's test of mirroring a tree *without* a ton of > processing or O(N) memory. How is that not O(N) memory? -Boris
Received on Tuesday, 5 July 2011 21:28:12 UTC