sproutcore 0.9.6 → 0.9.7

data/frameworks/sproutcore/foundation/sorted_set.js

@@ -1,590 +0,0 @@
-// ========================================================================
-// SproutCore
-// copyright 2006-2008 Sprout Systems, Inc.
-// ========================================================================
-
-require('Core') ;
-require('foundation/object') ;
-
-/**
-  @class
-
-  A sorted set stores objects in a sorted order based on a combination of 
-  sort keys.
-  
-  h2. Usage
-  
-  @extends SC.Object
-  @extends SC.Array
-  @since SproutCore 1.0
-*/
-SC.SortedSet = SC.Object.extend(
-/** @scope SC.SortedSet.prototype */ {
-
-  /**
-    An array of property keys to use when sorting objects.  This should be
-    set when the set is created and not change during the lifetime of the
-    object.
-  */
-  sortBy: [],
-  
-  compareObjects: function(v1, v2) {
-    return (v1 < v2) ? -1 : (v1 > v2) ? 1 : 0 ;
-  },
-  
-  init: function() {
-    arguments.callee.base.call(this) ;
-    this._root      = null;
-    this._cursor    = null;
-    this._ancestors = [];
-  },
-  
-  /** _findNode */
-  _findNode:  function(value, saveAncestors) {
-      if ( saveAncestors == null ) saveAncestors = false;
-
-      var result = this._root;
-
-      if ( saveAncestors ) {
-          this._ancestors = [];
-      }
-
-      while ( result != null ) {
-          var relation = this.compareObjects(value, result._value); 
-
-          if ( relation != 0 ) {
-              if ( saveAncestors ) {
-                  this._ancestors.push(result);
-              }
-              if ( relation < 0 ) {
-                  result = result._left;
-              } else {
-                  result = result._right;
-              }
-          } else {
-              break;
-          }
-      }
-
-      return result;
-  },
-
-  /** _maxNode */
-  _maxNode:  function(node, saveAncestors) {
-      if ( node == null ) node = this._root;
-      if ( saveAncestors == null ) saveAncestors = false;
-
-      if ( node != null ) {
-          while ( node._right != null ) {
-              if ( saveAncestors ) {
-                  this._ancestors.push(node);
-              }
-              node = node._right;
-          }
-      }
-
-      return node;
-  },
-
-  /** _minNode */
-  _minNode:  function(node, saveAncestors) {
-      if ( node == null ) node = this._root;
-      if ( saveAncestors == null ) saveAncestors = false;
-
-      if ( node != null ) {
-          while ( node._left != null ) {
-              if ( saveAncestors ) {
-                  this._ancestors.push(node);
-              }
-              node = node._left;
-          }
-      }
-
-      return node;
-  },
-
-  /** _nextNode */
-  _nextNode:  function(node) {
-      if ( node != null ) {
-          if ( node._right != null ) {
-              this._ancestors.push(node);
-              node = this._minNode(node._right, true);
-          } else {
-              var ancestors = this._ancestors;
-              parent = ancestors.pop();
-
-              while ( parent != null && parent._right === node ) {
-                  node = parent;
-                  parent = ancestors.pop();
-              }
-
-              node = parent;
-          }
-      } else {
-          this._ancestors = [];
-          node = this._minNode(this._root, true);
-      }
-
-      return node;
-  },
-
-  /**   _previousNode */
-  _previousNode:  function(node) {
-      if ( node != null ) {
-          if ( node._left != null ) {
-              this._ancestors.push(node);
-              node = this._maxNode(node._left, true);
-          } else {
-              var ancestors = this._ancestors;
-              parent = ancestors.pop();
-
-              while ( parent != null && parent._left === node ) {
-                  node = parent;
-                  parent = ancestors.pop();
-              }
-
-              node = parent;
-          }
-      } else {
-          this._ancestors = [];
-          node = this._maxNode(this._root, true);
-      }
-
-      return node;
-  },
-
-  /**
-    Adds a new object to the tree.  The object must respond to the 
-    compareMethod.
-  */
-  add:  function(value) {
-      var result;
-
-      if ( this._root == null ) {
-          result = this._root = new SC.RedBlackNode(value, this);
-      } else {
-          var addResult = this._root.add(value);
-
-          this._root = addResult[0];
-          result = addResult[1];
-      }
-
-      return result;
-  },
-
-  
-  find:  function(value) {
-      var node = this._findNode(value);
-
-      return ( node != null ) ? node._value : null;
-  },
-
-  findNext:  function(value) {
-      var current = this._findNode(value, true);
-
-      current = this._nextNode(current);
-
-      return (current != null ) ? current._value : null;
-  },
-
-  findPrevious:  function(value) {
-      var current = this._findNode(value, true);
-
-      current = this._previousNode(current);
-
-      return (current != null ) ? current._value : null;
-  },
-
-  max:  function() {
-      var result = this._maxNode();
-
-      return ( result != null ) ? result._value : null;
-  },
-
-  min:  function() {
-      var result = this._minNode();
-
-      return ( result != null ) ? result._value : null;
-  },
-
-  next:  function() {
-      this._cursor = this._nextNode(this._cursor);
-
-      return ( this._cursor ) ? this._cursor._value : null;
-  },
-
-  previous:  function() {
-      this._cursor = this._previousNode(this._cursor);
-
-      return ( this._cursor ) ? this._cursor._value : null;
-  },
-
-  remove:  function(value) {
-      var result;
-
-      if ( this._root != null ) {
-          var remResult = this._root.remove(value);
-
-          this._root = remResult[0];
-          result = remResult[1];
-      } else {
-          result = null;
-      }
-
-      return result;
-  },
-
-  traverse:  function(func) {
-      if ( this._root != null ) {
-          this._root.traverse(func);
-      }
-  },
-
-  toString:  function() {
-      var lines = [];
-
-      if ( this._root != null ) {
-          var indentText = "  ";
-          var stack = [[this._root, 0, "^"]];
-
-          while ( stack.length > 0 ) {
-              var current = stack.pop();
-              var node    = current[0];
-              var indent  = current[1];
-              var line    = "";
-
-              for ( var i = 0; i < indent; i++ ) {
-                  line += indentText;
-              }
-
-              line += current[2] + "(" + node.toString() + ")";
-              lines.push(line);
-
-              if ( node._right != null ) stack.push([node._right, indent+1, "R"]);
-              if ( node._left  != null ) stack.push([node._left,  indent+1, "L"]);
-          }
-      }
-
-      return lines.join("\n");
-  }
-  
-});
-
-/*****
-*
-*   SC.RedBlackNode.js
-*
-*   copyright 2004, Kevin Lindsey
-*   licensing info available at: http://www.kevlindev.com/license.txt
-*
-*****/
-
-/*****
-*
-*   constructor
-*
-*****/
-SC.RedBlackNode = function(value, owner) {
-    this._owner = owner ;
-    this._left   = null;
-    this._right  = null;
-    this._value  = value;
-    this._height = 1;
-    this._count = 1 ;
-} ;
-
-SC.RedBlackNode.prototype.count = function() {
-  if (!this._count) {
-    this._count = 1 ;
-    this._count += (this._left) ? this._left.count() : 0 ;
-    this._count += (this._right) ? this._right.count() : 0;
-  }
-  return this._count ;
-};
-
-/**
-  Returns the node at the specified index.  Uses counts.
-  
-  Remember: left branch is before the right branch.
-*/
-SC.RedBlackNode.prototype.nodeAt = function(idx) {  
-  var leftCount = (this._left) ? this._left.count() : 0 ;
-  if (idx === leftCount) return this; // its me!
-  
-  // look lower
-  if (idx < leftCount) {
-    return (this._left) ? this._left.nodeAt(idx) : null ;
-    
-  // look higher
-  } else {
-    return (this._right) ? this._right.nodeAt(idx - leftCount) : null;
-  }
-};
-
-/*****
-*
-*   add
-*
-*****/
-SC.RedBlackNode.prototype.add = function(value) {
-    var relation = this._owner.compareObjects(value, this._value);
-    var addResult;
-    var result;
-    var newNode;
-
-    if ( relation != 0 ) {
-        if ( relation < 0 ) {
-            if ( this._left != null ) {
-                addResult = this._left.add(value);
-                this._left = addResult[0];
-                newNode = addResult[1];
-            } else {
-                newNode = this._left = new SC.RedBlackNode(value, this._owner);
-            }
-        } else if ( relation > 0 ) {
-            if ( this._right != null ) {
-                addResult = this._right.add(value);
-                this._right = addResult[0];
-                newNode = addResult[1];
-            } else {
-                newNode = this._right = new SC.RedBlackNode(value, this._owner);
-            }
-        }
-        result = [this.balanceTree(), newNode];
-    } else {
-        result = [this, this];
-    }
-
-    // add to the return 
-    if (result[0]._count != null) result[0]._count = null ;
-    return result;
-};
-
-
-/*****
-*
-*   balanceTree
-*
-*****/
-SC.RedBlackNode.prototype.balanceTree = function() {
-    var leftHeight  = (this._left  != null) ? this._left._height  : 0;
-    var rightHeight = (this._right != null) ? this._right._height : 0;
-    var result;
-
-    if ( leftHeight > rightHeight + 1 ) {
-        result = this.swingRight();
-    } else if ( rightHeight > leftHeight + 1 ) {
-        result = this.swingLeft();
-    } else {
-        this.setHeight();
-        result = this;
-    }
-
-    return result;
-};
-
-
-/*****
-*
-*   join
-*
-*****/
-SC.RedBlackNode.prototype.join = function(that) {
-    var result;
-
-    if ( that == null ) {
-        result = this;
-    } else {
-        var top;
-
-        if ( this._height > that._height ) {
-            top = this;
-            top._right = that.join(top._right);
-        } else {
-            top = that;
-            top._left = this.join(top._left);
-        }
-
-        result = top.balanceTree();
-    }
-
-    return result;
-};
-
-
-/*****
-*
-*   moveLeft
-*
-*****/
-SC.RedBlackNode.prototype.moveLeft = function() {
-    var right = this._right;
-    var rightLeft = right._left;
-    
-    this._right = rightLeft;
-    right._left = this;
-    this.setHeight();
-    right.setHeight();
-
-    return right;
-};
-
-
-/*****
-*
-*   moveRight
-*
-*****/
-SC.RedBlackNode.prototype.moveRight = function() {
-    var left = this._left;
-    var leftRight = left._right;
-    
-    this._left = leftRight;
-    left._right = this;
-    this.setHeight();
-    left.setHeight();
-
-    return left;
-};
-
-
-/*****
-*
-*   remove
-*
-*****/
-SC.RedBlackNode.prototype.remove = function(value) {
-    var relation = this._owner.compareObjects(value, this._value);
-    var remResult;
-    var result;
-    var remNode;
-
-    if ( relation != 0 ) {
-        if ( relation < 0 ) {
-            if ( this._left != null ) {
-                remResult = this._left.remove(value);
-                this._left = remResult[0];
-                remNode = remResult[1];
-            } else {
-                remNode = null;
-            }
-        } else {
-            if ( this._right != null ) {
-                remResult = this._right.remove(value);
-                this._right = remResult[0];
-                remNode = remResult[1];
-            } else {
-                remNode = null;
-            }
-        }
-
-        result = this;
-    } else {
-        remNode = this;
-
-        if ( this._left == null ) {
-            result = this._right;
-        } else if ( this._right == null ) {
-            result = this._left;
-        } else {
-            result = this._left.join(this._right);
-            this._left = null;
-            this._right = null;
-        }
-    }
-
-    if ( remNode != null ) {
-        if ( result != null ) {
-            result = [result.balanceTree(), remNode];
-        } else {
-            result = [result, remNode];
-        }
-    } else {
-        result = [this, null];
-    }
-    
-    if (result[0]._count != null) result[0]._count = null ;
-    return result ;
-};
-
-
-/*****
-*
-*   setHeight
-*
-*****/
-SC.RedBlackNode.prototype.setHeight = function() {
-    var leftHeight  = (this._left  != null) ? this._left._height  : 0;
-    var rightHeight = (this._right != null) ? this._right._height : 0;
-    
-    this._height = (leftHeight < rightHeight) ? rightHeight + 1 : leftHeight + 1;
-};
-
-
-/*****
-*
-*   swingLeft
-*
-*****/
-SC.RedBlackNode.prototype.swingLeft = function() {
-    var right      = this._right;
-    var rightLeft  = right._left;
-    var rightRight = right._right;
-    var left       = this._left;
-
-    var leftHeight       = (left       != null ) ? left._height       : 0;
-    var rightLeftHeight  = (rightLeft  != null ) ? rightLeft._height  : 0;
-    var rightRightHeight = (rightRight != null ) ? rightRight._height : 0;
-
-    if ( rightLeftHeight > rightRightHeight ) {
-        this._right = right.moveRight();
-    }
-
-    return this.moveLeft();
-};
-
-
-/*****
-*
-*   swingRight
-*
-*****/
-SC.RedBlackNode.prototype.swingRight = function() {
-    var left      = this._left;
-    var leftRight = left._right;
-    var leftLeft  = left._left;
-    var right     = this._right;
-
-    var rightHeight     = (right     != null ) ? right._height     : 0;
-    var leftRightHeight = (leftRight != null ) ? leftRight._height : 0;
-    var leftLeftHeight  = (leftLeft  != null ) ? leftLeft._height  : 0;
-
-    if ( leftRightHeight > leftLeftHeight ) {
-        this._left = left.moveLeft();
-    }
-
-    return this.moveRight();
-};
-
-
-/*****
-*
-*   traverse
-*
-*****/
-SC.RedBlackNode.prototype.traverse = function(func) {
-    if ( this._left  != null ) this._left.traverse(func);
-    func(this);
-    if ( this._right != null ) this._right.traverse(func);
-};
-
-
-/*****
-*
-*   toString
-*
-*****/
-SC.RedBlackNode.prototype.toString = function() {
-    return this._value.toString();
-};
-