W3C home > Mailing lists > Public > public-html@w3.org > September 2010

[Bug 10878] New: Structured clone algorithm should be updated to support Directed Acyclic Graphs

From: <bugzilla@jessica.w3.org>
Date: Thu, 30 Sep 2010 17:28:12 +0000
To: public-html@w3.org
Message-ID: <bug-10878-2495@http.www.w3.org/Bugs/Public/>
http://www.w3.org/Bugs/Public/show_bug.cgi?id=10878

           Summary: Structured clone algorithm should be updated to
                    support Directed Acyclic Graphs
           Product: HTML WG
           Version: unspecified
          Platform: All
               URL: http://dev.w3.org/html5/spec/common-dom-interfaces.htm
                    l#safe-passing-of-structured-data
        OS/Version: All
            Status: NEW
          Severity: normal
          Priority: P3
         Component: HTML5 spec (editor: Ian Hickson)
        AssignedTo: ian@hixie.ch
        ReportedBy: adrianba@microsoft.com
         QAContact: public-html-bugzilla@w3.org
                CC: mike@w3.org, public-html-wg-issue-tracking@w3.org,
                    public-html@w3.org


See bug 10877 (http://www.w3.org/Bugs/Public/show_bug.cgi?id=10877)

The current algorithm converts DAGs into trees, which isn't the most
appropriate "clone" of object data. The algorithm should be modified to clone
DAGs correctly (e.g. Modifying the algorithm to re-use "memory" instead of
copying into "new memory" or to assign "new memory" back to "memory" as the
recursion unwinds).

If the purpose of the algorithm is not support DAGs then it should throw just
as it does for cyclic graphs.

-- 
Configure bugmail: http://www.w3.org/Bugs/Public/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are on the CC list for the bug.
Received on Thursday, 30 September 2010 17:28:13 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Wednesday, 9 May 2012 00:17:15 GMT