0
@@ -1,3 +1 @@
0
-This is a Subversion working copy administrative directory.
0
-Visit http://subversion.tigris.org/ for more information.

0
@@ -1,6 +1 @@
0
-K 25
0
-svn:wc:ra_dav:version-url
0
-V 58
0
-/!svn/ver/443/stuff/javascript/sortable_tree/sortable_tree
0
-END

0
@@ -1,54 +1 @@
0
-<?xml version="1.0" encoding="utf-8"?>
0
-<wc-entries
0
-   xmlns="svn:">
0
-<entry
0
-   committed-rev="443"
0
-   name=""
0
-   committed-date="2008-04-01T21:07:50.927165Z"
0
-   url="http://svn.artweb-design.de/stuff/javascript/sortable_tree/sortable_tree"
0
-   kind="dir"
0
-   uuid="9e03e964-762d-0410-a424-824683d530f5"
0
-   repos="http://svn.artweb-design.de"
0
-   revision="448"/>
0
-<entry
0
-   committed-rev="443"
0
-   name="drag.png"
0
-   text-time="2008-05-11T11:06:55.000000Z"
0
-   committed-date="2008-04-01T21:07:50.927165Z"
0
-   checksum="5983537a1b0b80aee9d2a4dfbaf556eb"
0
-   kind="file"
0
-   prop-time="2008-05-11T11:06:55.000000Z"/>
0
-<entry
0
-   committed-rev="443"
0
-   name="sortable_tree_demo.html"
0
-   text-time="2008-05-11T11:06:55.000000Z"
0
-   committed-date="2008-04-01T21:07:50.927165Z"
0
-   checksum="58923acf49d02e957b5934b8ca9060bd"
0
-   kind="file"
0
-   prop-time="2008-05-11T11:06:55.000000Z"/>
0
-<entry
0
-   committed-rev="443"
0
-   name="sortable_tree_test.js"
0
-   text-time="2008-05-11T11:06:55.000000Z"
0
-   committed-date="2008-04-01T21:07:50.927165Z"
0
-   checksum="4e713c593aa953963d5e3100cbd3d440"
0
-   kind="file"
0
-   prop-time="2008-05-11T11:06:55.000000Z"/>
0
-<entry
0
-   committed-rev="443"
0
-   name="sortable_tree.js"
0
-   text-time="2008-05-11T11:06:55.000000Z"
0
-   committed-date="2008-04-01T21:07:50.927165Z"
0
-   checksum="7c6de7d735e8edda14f7b548c225fc52"
0
-   kind="file"
0
-   prop-time="2008-05-11T11:06:55.000000Z"/>
0
-<entry
0
-   committed-rev="443"
0
-   name="sortable_tree_test.html"
0
-   text-time="2008-05-11T11:06:55.000000Z"
0
-   committed-date="2008-04-01T21:07:50.927165Z"
0
-   checksum="02933a85d5f1f16ac945f48878f2d3b5"
0
-   kind="file"
0
-   prop-time="2008-05-11T11:06:55.000000Z"/>
0
-</wc-entries>

0
@@ -1,2 +1 @@
0
-4

0
@@ -1,211 +1 @@
0
-var SortableTree = Class.create({
0
-  initialize: function(element, options) {
0
-    this.element = $(element);
0
-    this.root = new SortableTree.Node(this, null, element, options);
0
-		this.isSortable = false;
0
-  },
0
-  
0
-  toggleSortable: function() {
0
-    this.isSortable ? this.setUnsortable() : this.setSortable();
0
-  },
0
-  
0
-  setSortable: function() {
0
-    Element.addClassName(this.root.element, 'sortable');
0
-		this.root.setSortable();
0
-		this.isSortable = true;
0
-  },
0
-
0
-	setUnsortable: function() {
0
-    Element.removeClassName(this.root.element, 'sortable');
0
-		this.root.setUnsortable();
0
-		this.isSortable = false;
0
-	},
0
-  
0
-  find: function(element) {
0
-    return this.root.find($(element));
0
-  },
0
-
0
-	unmark_all: function() {
0
-    this.root.unmark();
0
-	}
0
-});
0
-
0
-SortableTree.Node = Class.create({
0
-  initialize: function(tree, parent, element, options) {
0
-    this.tree = tree;
0
-    this.parent = parent;
0
-    this.element = $(element);
0
-
0
-    this.options = Object.extend({
0
-      tagName: 'LI',
0
-      containerTagName: 'UL',
0
-			droppable: {},
0
-			draggable: {}
0
-    }, options || {});
0
-
0
-    this.droppable_options = Object.extend({
0
-      onHover:      function(drag, drop, overlap){ this.onHover(drag, drop, overlap) }.bind(this),
0
-      onDrop:       function(drag, drop, event){ this.onDrop(drag, drop, event) }.bind(this), 
0
-      overlap:      'vertical',
0
-      hoverclass:   'drop_hover'
0
-    }, options.droppable);
0
-
0
-    this.draggable_options = Object.extend({
0
-      ghosting: true,
0
-      revert: true,
0
-      constraint:  'vertical',
0
-      reverteffect: function(element, top_offset, left_offset) {
0
-		    element.setStyle({left: '0px', top:  '0px'});
0
-				// would be so cool to be able to use this. but it leaves a backgroundColor
0
-				// style property on the element which overwrites the class' value
0
-				// (i.e. the drop marker) and apperently can't be removed anymore (?)
0
-				// new Effect.Highlight(element, { startcolor: '#FFFF99' })
0
-      },
0
-    }, options.draggable);
0
-
0
-    this.initChildren()
0
-  },
0
-  
0
-  id: function() {
0
-    if (!this._id) {
0
-      var match = this.element.id.match(/^[\w]+_([\d]*)$/);
0
-      this._id = encodeURIComponent(match ? match[1] : null);
0
-    }
0
-    return this._id;
0
-  },
0
-  
0
-  previousSibling: function() {
0
-    var pos = this.parent.children.indexOf(this);
0
-    return pos > 0 ? this.parent.children[pos - 1] : null;
0
-  },
0
-  
0
-  initChildren: function() {
0
-    this.children = [];  
0
-    var container = this.findContainer(this.element)
0
-    if(container){
0
-      $A(container.childNodes).each(function(child) {
0
-        if(this.acceptTagName(child)) {
0
-          this.children.push(new SortableTree.Node(this.tree, this, child, this.options));
0
-        }
0
-      }.bind(this));
0
-    }
0
-  },
0
-
0
-  acceptTagName: function(element) {
0
-    return element.tagName && element.tagName.toUpperCase() == this.options.tagName
0
-  },
0
-
0
-  setSortable: function() {
0
-    Droppables.add(this.element, this.droppable_options);
0
-    this.draggable = new Draggable(this.element, this.draggable_options);
0
-    this.children.each(function(child) { child.setSortable() });
0
-  },
0
-
0
-  setUnsortable: function() {
0
-		Droppables.remove(this.element)
0
-		this.draggable.destroy();
0
-    this.children.each(function(child) { child.setUnsortable() });
0
-  },
0
-  
0
-  find: function(element) {
0
-    if(element == this.element) return this;
0
-    for(var i = 0; i < this.children.length; i++) {
0
-      var node = this.children[i].find(element);
0
-      if(node) return node; 
0
-    }
0
-  },
0
-
0
-  findContainer: function(element) {
0
-    if(element.tagName != this.options.containerTagName) {
0
-      element = $A(element.childNodes).detect(function(node) { 
0
-        return node.tagName == this.options.containerTagName
0
-      }.bind(this));
0
-    }
0
-    return element;
0
-  },
0
-
0
-  findOrCreateContainer: function(element) {
0
-    var container = this.findContainer(element);
0
-    if(!container) {
0
-      container = document.createElement(this.options.containerTagName);
0
-      element.appendChild(container);
0
-    }
0
-    return container;
0
-  },
0
-
0
-  onHover: function(drag, drop, overlap) {		
0
-    this.dropPosition = overlap < 0.33 ? 'bottom' : overlap > 0.77 ? 'top' : 'insert';
0
-    this.mark(drop);
0
-		// $('log').update('hovering: ' + drop.tagName + ': ' + drop.id + "<br />" + 
0
-		//                 'classes: ' + drop.className + "<br />" + 
0
-		// 							  'dropPosition: ' + this.dropPosition)
0
-  },
0
-
0
-  onDrop: function(drag, drop, event) {
0
-    drag = this.tree.find(drag);
0
-    drop = this.tree.find(drop);
0
-
0
-		// i.e. don't do anything if it's a toplevel node and has been dropped on "itself"
0
-		// another way around this could be to change scriptaculous to affect() a node
0
-		// when it has been dropped on itself
0
-		if(drop.parent || this.dropPosition == 'insert') { 
0
-	    switch(this.dropPosition) {
0
-	      case 'top':    drop.parent.insertBefore(drag, drop); break;
0
-	      case 'bottom': drop.parent.insertBefore(drag, drop.nextSibling()); break;
0
-	      case 'insert': this.insertBefore(drag, this.firstChild()); break;
0
-	    }
0
-		}
0
-
0
-    if(this.options.onDrop) this.options.onDrop(drag, drop, event);
0
-  },
0
-
0
-  mark: function(element, position) {
0
-		this.tree.unmark_all();
0
-    Element.addClassName(element, 'drop_' + this.dropPosition);
0
-  },
0
-
0
-  unmark: function() {
0
-    ['drop_top', 'drop_bottom', 'drop_insert'].each(function(classname){
0
-      Element.removeClassName(this.element, classname);
0
-    }.bind(this));
0
-		this.children.each(function(child) { child.unmark(); }) 
0
-  },
0
-  
0
-  to_params: function(name) {
0
-		name = name || this.tree.element.id;
0
-    var leftNode = this.previousSibling();
0
-    return name + '[' + this.id() + '][parent_id]=' + this.parent.id() + '&' + 
0
-           name + '[' + this.id() + '][left_id]=' + (leftNode ? leftNode.id() : ''); // null
0
-  },
0
-  
0
-  firstChild: function() {
0
-    return this.children.length > 0 ? this.children[0] : null;
0
-  },
0
-  
0
-  previousSibling: function() {
0
-    var pos = this.parent.children.indexOf(this);
0
-    return pos > 0 ? this.parent.children[pos - 1] : null;
0
-  },
0
-  
0
-  nextSibling: function() {
0
-    var pos = this.parent.children.indexOf(this);
0
-    return pos + 1 < this.parent.children.length ? this.parent.children[pos + 1] : null;    
0
-  },
0
-  
0
-  removeChild: function(node) {
0
-    this.children.splice(this.children.indexOf(node), 1);
0
-    node.element.parentNode.removeChild(node.element)
0
-  },
0
-  
0
-  insertBefore: function(node, sibling) {
0
-		if(node == sibling) return;
0
-		
0
-		node.parent.removeChild(node);
0
-    node.parent = this;
0
-    var pos = sibling ? this.children.indexOf(sibling) : this.children.length;
0
-    this.children.splice(pos, 0, node);
0
-
0
-    this.findOrCreateContainer(this.element).insertBefore(node.element, sibling ? sibling.element : null)
0
-  }
0
-});

0
@@ -1,81 +1 @@
0
-<html>
0
-<head>
0
-  <script src="../prototype.js" type="text/javascript"></script>
0
-  <script src="../effects.js" type="text/javascript"></script>
0
-  <script src="../dragdrop.js" type="text/javascript"></script>    
0
-  <script src="sortable_tree.js" type="text/javascript"></script>    
0
-  <style>
0
-    html, body {
0
-     	font: bold 24px Helvetica,Arial,Verdana,sans-serif;
0
-    	line-height: 200%;
0
-    	color: lime;
0
-	    text-shadow: #ccc 2px 2px;    	
0
-    }
0
-    #tree, #tree ul { 
0
-    	padding-left: 20px; 
0
-    	list-style-type: none;
0
-    	cursor: move;
0
-    }
0
-    #tree {
0
-	    padding: 20px 0px 0px 20px;
0
-    	width: 200px;
0
-    }
0
-    #tree li {
0
-    	margin-top: -6px;
0
-    }
0
-    #tree .drop_hover {
0
-    	background: url(drag.png) no-repeat bottom left;
0
-    }
0
-    #tree .drop_top {
0
-    	background-position: top left;
0
-    }
0
-    #tree .drop_bottom {
0
-    	background-position: bottom left;
0
-    }
0
-    #tree .drop_insert {
0
-    	background-position: 20px 100%;
0
-    }
0
-  </style>
0
-</head>
0
-<body>
0
-
0
-<ul id="tree">
0
-  <li id="node_1">
0
-    <a>node 1</a>
0
-    <ul>
0
-      <li id="node_11">
0
-        <a>node 11</a>
0
-        <ul>
0
-          <li id="node_111"><a>node 111</a></li>
0
-          <li id="node_112"><a>node 112</a></li>
0
-          <li id="node_113"><a>node 113</a></li>
0
-        </ul>            
0
-      </li>
0
-      <li id="node_12"><a>node 12</a></li>
0
-      <li id="node_13"><a>node 13</a></li>
0
-    </ul>
0
-  </li>
0
-  <li id="node_2">
0
-    <a>node 2</a>
0
-    <ul>
0
-      <li id="node_21"><a>node 21</a></li>
0
-      <li id="node_22"><a>node 22</a></li>
0
-      <li id="node_23"><a>node 23</a></li>
0
-    </ul>
0
-  </li>
0
-</ul>
0
-
0
-<div id="log"></div>
0
-
0
-<script>
0
-  var tree = new SortableTree('tree', {
0
-    onDrop: function(drag, drop, event){
0
-      // $('log').update($('log').innerHTML + "<p>" + drag.to_params() + "</p>")
0
-    }
0
-  });
0
-  tree.setSortable();
0
-</script>
0
- 
0
-</body>
0
-</html>

0
@@ -1,77 +1 @@
0
-<html>
0
-<head>
0
-  <script src="../prototype.js" type="text/javascript"></script>
0
-  <script src="../effects.js" type="text/javascript"></script>
0
-  <script src="../dragdrop.js" type="text/javascript"></script>    
0
-  <script src="sortable_tree.js" type="text/javascript"></script>    
0
-  <style>
0
-    html, body {
0
-     	font: 14px Helvetica,Arial,Verdana,sans-serif;
0
-    }
0
-    #tree, #tree ul { 
0
-    	padding-left: 20px; 
0
-    	list-style-type: none;
0
-    	line-height: 30px;
0
-    	cursor: move;
0
-    }
0
-    #tree .drop-hover {
0
-    	background: url(/images/sortable_tree/drag.png) no-repeat bottom left;
0
-    }
0
-    #tree .drop-top {
0
-    	background-position: top left;
0
-    }
0
-    #tree .drop-bottom {
0
-    	background-position: bottom left;
0
-    }
0
-    #tree .drop-insert {
0
-    	background-position: 40px 100%;
0
-    }
0
-    #tree a {
0
-      padding-left: 25px;
0
-    }
0
-  </style>
0
-</head>
0
-<body>
0
-
0
-<ul id="tree">
0
-  <li id="node_1">
0
-    <a href="#">node 1</a>
0
-    <ul>
0
-      <li id="node_11">
0
-        <a href="#">node 11</a>
0
-        <ul>
0
-          <li id="node_111"><a href="#">node 111</a></li>
0
-          <li id="node_112"><a href="#">node 112</a></li>
0
-          <li id="node_113"><a href="#">node 113</a></li>
0
-        </ul>            
0
-      </li>
0
-      <li id="node_12"><a href="#">node 12</a></li>
0
-      <li id="node_13"><a href="#">node 13</a></li>
0
-    </ul>
0
-  </li>
0
-  <li id="node_2">
0
-    <a href="#">node 2</a>
0
-    <ul>
0
-      <li id="node_21"><a href="#">node 21</a></li>
0
-      <li id="node_22"><a href="#">node 22</a></li>
0
-      <li id="node_23"><a href="#">node 23</a></li>
0
-    </ul>
0
-  </li>
0
-</ul>
0
-
0
-<div id="log"></div>
0
-
0
-<script>
0
-  var tree = new SortableTree('tree', {
0
-    onDrop: function(drag, drop, event){
0
-      log(drag.to_params());
0
-    }
0
-  });
0
-  tree.setSortable();
0
-</script>
0
-
0
-<script src="sortable_tree_test.js" type="text/javascript"></script>   
0
- 
0
-</body>
0
-</html>

0
@@ -1,201 +1 @@
0
-function log(line) {
0
-  $('log').update($('log').innerHTML + "<p>" + line + "</p>")
0
-}
0
-
0
-var tests = {
0
-  testfind: function() {
0
-    if($("tree") != tree.find('tree').element) 
0
-      log("find('tree') doesn't seem to find the root node");
0
-
0
-    if($("node_1") != tree.find('node_1').element) 
0
-      log("find('node_1') doesn't seem to find the correct node");
0
-      
0
-    if($("node_112") != tree.find('node_112').element) 
0
-      log("find('node_112') doesn't seem to find the correct node");
0
-  },
0
-  testChildren: function() {
0
-    if(tree.find('node_1').children.length != 3) 
0
-      log('node 1 children.length != 3, but is: ' + tree.find('node_1').children.length);
0
-  
0
-    if(tree.find('node_11').children.length != 3) 
0
-      log('node 11 children.length != 3, but is: ' + tree.find('node_11').children.length);
0
-  
0
-    if(tree.find('node_111').children.length != 0) 
0
-      log('node 111 children.length != 0, but is: ' + tree.find('node_111').children.length);
0
-  },
0
-  testFirstChild: function() {
0
-    if(tree.find('node_11').firstChild().element != $('node_111')) 
0
-      log('firstChild() does not return 111');
0
-      
0
-    if(tree.find('node_111').firstChild() != null) 
0
-      log('firstChild() does not return null');
0
-  },
0
-  testNextSibling: function() {
0
-    if(tree.find('node_112').nextSibling().element != $('node_113')) 
0
-      log('nextSibling() does not return 113');
0
-      
0
-    if(tree.find('node_113').nextSibling() != null) 
0
-      log('nextSibling() does not return null');
0
-  },
0
-  testPreviousSibling: function() {
0
-    if(tree.find('node_111').previousSibling() != null) 
0
-      log('previousSibling() does not return null');
0
-      
0
-    if(tree.find('node_112').previousSibling().element != $('node_111')) 
0
-      log('previousSibling() does not return 111');
0
-  },
0
-  testRemoveChild: function() {
0
-    var node = tree.find('node_23');
0
-    tree.find('node_2').removeChild(node);
0
-    
0
-    if(tree.find('node_23') != null) 
0
-      log('removeChild("23") did not remove the node from the tree');
0
-    
0
-    if(node.element.parent != null) 
0
-      log('after removeChild() node.element is still part of the DOM');
0
-  },
0
-  testInsertBeforeSibling: function() {
0
-    var node = tree.find('node_22');
0
-    var sibling = tree.find('node_13');
0
-    var parent = tree.find('node_1');
0
-  
0
-    parent.insertBefore(node, sibling);
0
-    
0
-    if(parent.children.length != 4) 
0
-      log('after insertBefore parent.children.length != 4, but is: ' + parent.children.length);
0
-    
0
-    if(node.parent != parent) 
0
-      log('after insertBefore node.parent != parent, but has the id: ' + node.parent.element.id);
0
-    
0
-    if(node.parent.element.id != 'node_1') 
0
-      log("after insertBefore node.parent.element.id != 'node_1', but is: " + node.parent.element.id);
0
-    
0
-    if(node.previousSibling() != tree.find('node_12')) 
0
-      log("after insertBefore node.previousSibling() != tree.find('node_12'), instead it is: " + node.previousSibling().element.id);
0
-    
0
-    if(node.nextSibling() != tree.find('node_13')) 
0
-      log("after insertBefore node.nextSibling() != tree.find('node_13'), instead it is: " + node.nextSibling().element.id);
0
-      
0
-    if(node.element.parentNode.parentNode != parent.element)
0
-      log("after insertBefore node.element.parentNode.parentNode != parent.element, instead it is: " + node.element.parentNode.parentNode.id)
0
-  
0
-    if(node.element.previousSibling.previousSibling != tree.find('node_12').element)
0
-      log("after insertBefore node.element.previousSibling.previousSibling != tree.find('node_12').element, instead it is: " + node.element.previousSibling.previousSibling.id)
0
-  },
0
-  testInsertBeforeNull: function() {
0
-    var node = tree.find('node_21');
0
-    var parent = tree.find('node_1');
0
-  
0
-    parent.insertBefore(node);
0
-    
0
-    if(parent.children.length != 5) 
0
-      log('after insertBefore parent.children.length != 5, but is: ' + parent.children.length);
0
-    
0
-    if(node.parent != parent) 
0
-      log('after insertBefore node.parent != parent, but has the id: ' + node.parent.element.id);
0
-    
0
-    if(node.parent.element.id != 'node_1') 
0
-      log("after insertBefore node.parent.element.id != 'node_1', but is: " + node.parent.element.id);
0
-    
0
-    if(node.previousSibling() != tree.find('node_13')) 
0
-      log("after insertBefore node.previousSibling() != tree.find('node_13'), instead it is: " + node.previousSibling().element.id);
0
-    
0
-    if(node.nextSibling() != null) 
0
-      log("after insertBefore node.nextSibling() != null, instead it is: " + node.nextSibling().element.id);
0
-      
0
-    if(node.element.parentNode.parentNode != parent.element)
0
-      log("after insertBefore node.element.parentNode.parentNode != parent.element, instead it is: " + node.element.parentNode.parentNode.id)
0
-    
0
-    if(node.element.previousSibling.previousSibling != tree.find('node_13').element)
0
-      log("after insertBefore node.element.previousSibling.previousSibling != tree.find('node_13').element, instead it is: " + node.element.previousSibling.previousSibling.id)
0
-  },
0
-  testInsertBeforeFirstSibling: function() {
0
-    var node = tree.find('node_21');
0
-    var sibling = tree.find('node_11');
0
-    var parent = tree.find('node_1');
0
-  
0
-    parent.insertBefore(node, sibling);
0
-    
0
-    if(parent.children.length != 5)
0
-      log('after insertBefore parent.children.length != 5, but is: ' + parent.children.length);
0
-    
0
-    if(node.parent != parent) 
0
-      log('after insertBefore node.parent != parent, but has the id: ' + node.parent.element.id);
0
-    
0
-    if(node.parent.element.id != 'node_1') 
0
-      log("after insertBefore node.parent.element.id != 'node_1', but is: " + node.parent.element.id);
0
-    
0
-    if(node.previousSibling() != null) 
0
-      log("after insertBefore node.previousSibling() != null, instead it is: " + node.previousSibling().element.id);
0
-    
0
-    if(node.nextSibling() != tree.find('node_11')) 
0
-      log("after insertBefore node.nextSibling() != tree.find('node_11'), instead it is: " + node.nextSibling().element.id);
0
-      
0
-    if(node.element.parentNode.parentNode != parent.element)
0
-      log("after insertBefore node.element.parentNode.parentNode != parent.element, instead it is: " + node.element.parentNode.parentNode.id)
0
-  
0
-    if(node.element.nextSibling != tree.find('node_11').element)
0
-      log("after insertBefore node.element.nextSibling != tree.find('node_11').element, instead it is: " + node.element.nextSibling.id)
0
-  },
0
-  testInsertBeforeSelf: function() {
0
-    var node = tree.find('node_13');
0
-    var sibling = node;
0
-    var parent = tree.find('node_1');
0
-  
0
-    parent.insertBefore(node, sibling);
0
-    
0
-    if(parent.children.length != 5)
0
-      log('after insertBefore parent.children.length != 5, but is: ' + parent.children.length);
0
-    
0
-    if(node.parent != parent) 
0
-      log('after insertBefore node.parent != parent, but has the id: ' + node.parent.element.id);
0
-    
0
-    if(node.parent.element.id != 'node_1') 
0
-      log("after insertBefore node.parent.element.id != 'node_1', but is: " + node.parent.element.id);
0
-    
0
-    if(node.previousSibling() != tree.find('node_22')) 
0
-      log("after insertBefore node.previousSibling() != tree.find('node_22'), instead it is: " + node.previousSibling().element.id);
0
-    
0
-    if(node.nextSibling() != null) 
0
-      log("after insertBefore node.nextSibling() != null, instead it is: " + node.nextSibling().element.id);
0
-      
0
-    if(node.element.parentNode.parentNode != parent.element)
0
-      log("after insertBefore node.element.parentNode.parentNode != parent.element, instead it is: " + node.element.parentNode.parentNode.id)
0
-  
0
-    if(node.element.previousSibling != tree.find('node_22').element)
0
-      log("after insertBefore node.element.previousSibling != tree.find('node_22').element, instead it is: " + node.element.nextSibling.id)
0
-  },
0
-  testSelfInsertBeforeFirstSiblingTopLevel: function() {
0
-    var node = tree.find('node_1');
0
-    var sibling = tree.find('node_1');
0
-    var parent = tree.root;
0
-
0
-    parent.insertBefore(node, sibling);
0
-
0
-    if(parent.children.length != 2)
0
-      log('after insertBefore parent.children.length != 2, but is: ' + parent.children.length);
0
-    
0
-    if(node.parent != parent) 
0
-      log('after insertBefore node.parent != parent, but has the id: ' + node.parent.element.id);
0
-    
0
-    if(node.parent.element.id != 'tree') 
0
-      log("after insertBefore node.parent.element.id != 'tree', but is: " + node.parent.element.id);
0
-    
0
-    if(node.previousSibling() != null) 
0
-      log("after insertBefore node.previousSibling() != null, instead it is: " + node.previousSibling().element.id);
0
-    
0
-    if(node.nextSibling() != tree.find('node_2')) 
0
-      log("after insertBefore node.nextSibling() != tree.find('node_2'), instead it is: " + node.nextSibling().element.id);
0
-      
0
-    if(node.element.parentNode != parent.element)
0
-      log("after insertBefore node.element.parentNode != parent.element, instead it is: " + node.element.parentNode.id)
0
-  
0
-    if(node.element.nextSibling.nextSibling != tree.find('node_2').element)
0
-      log("after insertBefore node.element.nextSibling.nextSibling != tree.find('node_2').element, instead it is: " + node.element.nextSibling.nextSibling.id)
0
-  }
0
-}
0
-
0
-log('starting sortable tree tests ...')
0
-for(i in tests) { tests[i](); }
0
-log('finished sortable tree tests.')

0
@@ -1,6 +1 @@
0
-K 25
0
-svn:wc:ra_dav:version-url
0
-V 75
0
-/!svn/ver/443/stuff/javascript/sortable_tree/sortable_tree/sortable_tree.js
0
-END

0
@@ -1,6 +1 @@
0
-K 25
0
-svn:wc:ra_dav:version-url
0
-V 82
0
-/!svn/ver/443/stuff/javascript/sortable_tree/sortable_tree/sortable_tree_demo.html
0
-END