dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html

Tue, 06 Jan 2015 21:39:09 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Tue, 06 Jan 2015 21:39:09 +0100
branch
TOR_BUG_9701
changeset 8
97036ab72558
permissions
-rw-r--r--

Conditionally force memory storage according to privacy.thirdparty.isolate;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.

     1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN""http://www.w3.org/TR/html4/strict.dtd">
     2 <html>
     3 <head>
     4 <META http-equiv="Content-Type" content="text/html; charset=UTF-8">
     5 <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
     6 <title>http://www.w3.org/2001/DOM-Test-Suite/level1/core/nodeinsertbeforenewchildexists</title>
     7 <link href="activity-home.css" rel="stylesheet" type="text/css">
     8 <link rel="stylesheet" type="text/css" href="/tests/SimpleTest/test.css">
     9 <script type="text/javascript" src="/tests/SimpleTest/SimpleTest.js"></script>
    10 <script type="text/javascript" src="DOMTestCase.js"></script>
    11 <script type="text/javascript" src="exclusions.js"></script>
    12 <script type="text/javascript">
    13 // expose test function names
    14 function exposeTestFunctionNames()
    15 {
    16 return ['nodeinsertbeforenewchildexists'];
    17 }
    19 var docsLoaded = -1000000;
    20 var builder = null;
    22 //
    23 //   This function is called by the testing framework before
    24 //      running the test suite.
    25 //
    26 //   If there are no configuration exceptions, asynchronous
    27 //        document loading is started.  Otherwise, the status
    28 //        is set to complete and the exception is immediately
    29 //        raised when entering the body of the test.
    30 //
    31 function setUpPage() {
    32    setUpPageStatus = 'running';
    33    try {
    34      //
    35      //   creates test document builder, may throw exception
    36      //
    37      builder = createConfiguredBuilder();
    39       docsLoaded = 0;
    41       var docRef = null;
    42       if (typeof(this.doc) != 'undefined') {
    43         docRef = this.doc;
    44       }
    45       docsLoaded += preload(docRef, "doc", "staff");
    47        if (docsLoaded == 1) {
    48           setUpPage = 'complete';
    49        }
    50     } catch(ex) {
    51     	catchInitializationError(builder, ex);
    52         setUpPage = 'complete';
    53     }
    54 }
    56 //
    57 //   This method is called on the completion of 
    58 //      each asychronous load started in setUpTests.
    59 //
    60 //   When every synchronous loaded document has completed,
    61 //      the page status is changed which allows the
    62 //      body of the test to be executed.
    63 function loadComplete() {
    64   if (++docsLoaded == 1) {
    65     setUpPageStatus = 'complete';
    66     runJSUnitTests();
    67     markTodos();
    68     SimpleTest.finish();
    69   }
    70 }
    72 var docName = 'nodeinsertbeforenewchildexists';
    76 window.doc = window;  
    77 SimpleTest.waitForExplicitFinish();
    78 addLoadEvent(setUpPage);
    81 /**
    82 * 
    83     If the "newChild" is already in the tree, the
    84     "insertBefore(newChild,refChild)" method must first
    85     remove it before the insertion takes place.
    87     Insert a node Element ("employeeId") that is already
    88     present in the tree.   The existing node should be 
    89     removed first and the new one inserted.   The node is
    90     inserted at a different position in the tree to assure
    91     that it was indeed inserted.
    93 * @author NIST
    94 * @author Mary Brady
    95 * @see http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-952280727
    96 */
    97 function nodeinsertbeforenewchildexists() {
    98    var success;
    99     if(checkInitialization(builder, "nodeinsertbeforenewchildexists") != null) return;
   100     var doc;
   101       var elementList;
   102       var employeeNode;
   103       var childList;
   104       var refChild;
   105       var newChild;
   106       var child;
   107       var length;
   108       var childName;
   109       var insertedNode;
   110       expectedWhitespace = new Array();
   111       expectedWhitespace[0] = "#text";
   112       expectedWhitespace[1] = "#text";
   113       expectedWhitespace[2] = "name";
   114       expectedWhitespace[3] = "#text";
   115       expectedWhitespace[4] = "position";
   116       expectedWhitespace[5] = "#text";
   117       expectedWhitespace[6] = "salary";
   118       expectedWhitespace[7] = "#text";
   119       expectedWhitespace[8] = "gender";
   120       expectedWhitespace[9] = "#text";
   121       expectedWhitespace[10] = "employeeId";
   122       expectedWhitespace[11] = "address";
   123       expectedWhitespace[12] = "#text";
   125       expectedNoWhitespace = new Array();
   126       expectedNoWhitespace[0] = "name";
   127       expectedNoWhitespace[1] = "position";
   128       expectedNoWhitespace[2] = "salary";
   129       expectedNoWhitespace[3] = "gender";
   130       expectedNoWhitespace[4] = "employeeId";
   131       expectedNoWhitespace[5] = "address";
   133       var expected = new Array();
   135       var result = new Array();
   138       var docRef = null;
   139       if (typeof(this.doc) != 'undefined') {
   140         docRef = this.doc;
   141       }
   142       doc = load(docRef, "doc", "staff");
   143       elementList = doc.getElementsByTagName("employee");
   144       employeeNode = elementList.item(1);
   145       childList = employeeNode.childNodes;
   147       length = childList.length;
   150 	if(
   151 	(6 == length)
   152 	) {
   153 	expected =  expectedNoWhitespace;
   154 refChild = childList.item(5);
   155       newChild = childList.item(0);
   157 	}
   159 		else {
   160 			expected =  expectedWhitespace;
   161 refChild = childList.item(11);
   162       newChild = childList.item(1);
   164 		}
   165 	insertedNode = employeeNode.insertBefore(newChild,refChild);
   166       for(var indexN65757 = 0;indexN65757 < childList.length; indexN65757++) {
   167       child = childList.item(indexN65757);
   168       childName = child.nodeName;
   170       result[result.length] = childName;
   172 	}
   173    assertEqualsList("childNames",expected,result);
   175 }
   177 </script>
   178 </head>
   179 <body>
   180 <h2>Test http://www.w3.org/2001/DOM-Test-Suite/level1/core/nodeinsertbeforenewchildexists</h2>
   181 <p></p>
   182 <p>
   183 Copyright (c) 2001-2004 World Wide Web Consortium, 
   184 (Massachusetts Institute of Technology, European Research Consortium 
   185 for Informatics and Mathematics, Keio University). All 
   186 Rights Reserved. This work is distributed under the <a href="http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231">W3C(r) Software License</a> in the 
   187 hope that it will be useful, but WITHOUT ANY WARRANTY; without even 
   188 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 
   189 </p>
   190 </body>
   191 </html>

mercurial