sproutcore 1.4.5-java → 1.5.0-java

data/lib/frameworks/sproutcore/frameworks/runtime/tests/system/sparse_array.js

@@ -1,194 +0,0 @@
-// ========================================================================
-// SC.SparseArray Tests
-// ========================================================================
-/*globals module test ok isObj equals expects */
-var objectA = 23, objectB = 12, objectC = 31, numbers, new_numbers;
-module("SC.SparseArray") ;
-
-test("new SparseArray has expected length", function() {
-  var ary = SC.SparseArray.array(10000) ;
-  equals(10000, ary.get('length'), "length") ;
-});
-
-test("fetching the object at index", function() {
-	var ary = SC.SparseArray.create(10);
-	var arr = ["I'll","be","there","4u"];
-	ary = arr;
-	equals(2 ,ary.indexOf('there'), "Index of 'there' is");
-});
-
-test("Update the sparse array using provideObjectAtIndex", function() {
-	var ary = SC.SparseArray.create(2);
-	var obj = "not";
-	ary.provideObjectAtIndex(0, obj);
-	equals(obj, ary._sa_content[0],"Content at 0th index");
-	obj = "now";
-	ary.provideObjectAtIndex(1, obj);
-	equals(obj, ary._sa_content[1],"Content at 1st index");
-});
-
-test("objectAt() should get the object at the specified index",function() {
-	var spArray = SC.SparseArray.create(4) ;
-	var arr = [SC.Object.create({ dummy: YES }),"Sproutcore",2,true];
-	spArray = arr;
-	equals(4,spArray.length,'the length');
-	equals(arr[0],spArray.objectAt(0),'first object');
-	equals(arr[1],spArray.objectAt(1),'second object');
-	equals(arr[2],spArray.objectAt(2),'third object');
-	equals(arr[3],spArray.objectAt(3),'fourth object');
-});
-
-module("SC.replace",{
-	setup: function() {
-		// create objects...
-		numbers= [1,2,3] ;
-		new_numbers = [4,5,6];
-	}
-});
-
-test("element to be added is at idx > length of array ", function() {
-	var ary = SC.SparseArray.array(5) ;
-	equals(5, ary.get('length'), "length") ;
-	ary = numbers;
-	ary.replace(7,3,new_numbers,"put the new number at idx>len ");
-	equals(6, ary.get('length'), "length") ;
-});
-
-test("element to be added is such that amt + idx > length of array ", function() {
-	var ary = SC.SparseArray.array(5) ;
-	equals(5, ary.get('length'), "length") ;
-	ary = numbers;
-	ary.replace(4,3,new_numbers,"put the new number at idx < len ");
-	equals(6, ary.get('length'), "length") ;
-});
-
-test("element to be added is at idx > length of array ", function() {
-	var ary = SC.SparseArray.array(5) ;
-	equals(5, ary.get('length'), "length") ;
-	ary = numbers;
-	ary.replace(2,3,new_numbers,"put the new number overlapping existing numbers ");
-	equals(5, ary.get('length'), "length") ;
-});
-
-
-test("modifying a range should not require the rest of the array to refetch", function() {
-  var del = {
-    cnt: 0,
-    
-    sparseArrayDidRequestIndex: function(sparseArray, idx) {
-      this.cnt++;
-      sparseArray.provideObjectAtIndex(idx, "foo");
-    },
-    
-    sparseArrayDidRequestLength: function(sparseArray) {
-      sparseArray.provideLength(100);
-    },
-    
-    // make editable
-    sparseArrayShouldReplace: function() { return YES; }
-    
-  };
-  
-  var ary = SC.SparseArray.create({
-    delegate: del
-  });
-  
-  equals(ary.objectAt(10), 'foo', 'precond - should provide foo');
-  equals(del.cnt, 1, 'precond - should invoke sparseArrayDidRequestIndex() one time');
-  
-  del.cnt = 0;
-  
-  ary.removeAt(5); // delete an item before 10
-  equals(ary.objectAt(9), 'foo', 'should provide foo at index after delete');
-  equals(del.cnt, 0, 'should NOT invoke sparseArrayRequestIndex() since it was provided already');
-});
-
-test("Check that requestIndex works with a rangeWindowSize larger than 1", function() {
-	var ary = SC.SparseArray.array(10) ;
-	var didRequestRange=NO;
-	
-	var DummyDelegate = SC.Object.extend({
-    content: [], // source array
-
-    sparseArrayDidRequestLength: function(sparseArray) {
-      sparseArray.provideLength(this.content.length);
-    },
-
-    sparseArrayDidRequestIndex: function(sparseArray, index) {
-      sparseArray.provideObjectAtIndex(index, this.content[index]);
-    },
-
-    sparseArrayDidRequestIndexOf: function(sparseArray, object) {
-      return this.content.indexOf(object);    
-    },
-
-    sparseArrayShouldReplace: function(sparseArray, idx, amt, objects) {
-      this.content.replace(idx, amt, objects) ; // keep internal up-to-date
-      return YES ; // allow anything
-    },
-    sparseArrayDidRequestRange: function(sparseArray, range) {
-       didRequestRange=YES;
-     }
-
-  });
-  ary.set('delegate', DummyDelegate.create());
-	ary.set('rangeWindowSize', 4);
-	equals(10, ary.get('length'), "length") ;
-	ary.objectAt(7);
-	equals(didRequestRange, YES, "The range was requested") ;
-});
-
-
-// ..........................................................
-// definedIndexes
-// 
-
-test("definedIndexes", function() {
-  var ary = SC.SparseArray.array(10);
-  ary.provideObjectAtIndex(5, "foo");
-  
-  var expected = SC.IndexSet.create().add(5);
-  same(ary.definedIndexes(), expected, 'definedIndexes() should return all defined indexes');
-  
-  same(ary.definedIndexes(SC.IndexSet.create().add(2, 10)), expected, 'definedIndexes([2..11]) should return indexes within');
-  
-  same(ary.definedIndexes(SC.IndexSet.create().add(2)), SC.IndexSet.EMPTY, 'definedIndexes([2]) should return empty set (since does not overlap with defined index)');
-  
-});
-
-// ..........................................................
-// TEST SC.ARRAY COMPLIANCE
-// 
-
-var DummyDelegate = SC.Object.extend({
-  content: [], // source array
-
-  sparseArrayDidRequestLength: function(sparseArray) {
-    sparseArray.provideLength(this.content.length);
-  },
-  
-  sparseArrayDidRequestIndex: function(sparseArray, index) {
-    sparseArray.provideObjectAtIndex(index, this.content[index]);
-  },
-  
-  sparseArrayDidRequestIndexOf: function(sparseArray, object) {
-    return this.content.indexOf(object);    
-  },
-  
-  sparseArrayShouldReplace: function(sparseArray, idx, amt, objects) {
-    this.content.replace(idx, amt, objects) ; // keep internal up-to-date
-    return YES ; // allow anything
-  }
-  
-});
-
-SC.ArraySuite.generate("SC.SparseArray", {
-  newObject: function(amt) {
-    if (amt === undefined || typeof amt === SC.T_NUMBER) {
-      amt = this.expected(amt);
-    }
-
-    var del = DummyDelegate.create({ content: amt });
-    return SC.SparseArray.create({ delegate: del });
-  }
-});

data/lib/frameworks/sproutcore/frameworks/statechart/mixins/statechart.js

@@ -1,336 +0,0 @@
-// ==========================================================================
-// SC.Statechart
-// ==========================================================================
-require('system/state');
-/**
-  @namespace
-  
-  A most excellent statechart implementation
-  
-  @author: Mike Ball
-  @author: Michael Cohen
-  @author: Evin Grano
-  @version: 0.1
-  @since: 0.1
-*/
-
-SC.Statechart = {
-    
-  isStatechart: true,
-  
-  log: NO,
-  
-  initMixin: function(){
-    //setup data
-    this._all_states = {};
-    this._all_states[SC.DEFAULT_TREE] = {};
-    this._current_state = {};
-    this._current_state[SC.DEFAULT_TREE] = null;
-    this._goStateLocked = NO;
-    this._pendingStateTransitions = [];
-    //alias sendAction
-    this.sendAction = this.sendEvent;
-    if(this.get('startOnInit')) this.startupStatechart();
-  },
-  
-  startOnInit: YES,
-  
-  
-  startupStatechart: function(){
-    //add all unregistered states
-    if(!this._started){
-      var key, tree, state, trees, startStates, startState, currTree;
-      for(key in this){
-        if(this.hasOwnProperty(key) && SC.kindOf(this[key], SC.State) && this[key].get && !this[key].get('beenAddedToStatechart')){
-          state = this[key];
-          this._addState(key, state);
-        }
-      }
-      trees = this._all_states;
-      //init the statechart
-      for(key in trees){  
-        if(trees.hasOwnProperty(key)){
-          tree = trees[key];
-          //for all the states in this tree
-          for(state in tree){
-            if(tree.hasOwnProperty(state)){
-              tree[state].initState();
-            }
-          }
-        }
-      }
-      //enter the startstates
-      startStates = this.get('startStates');
-      if(!startStates) throw 'Please add startStates to your statechart!';
-      
-      for(key in trees){  
-        if(trees.hasOwnProperty(key)){
-          startState = startStates[key];
-          currTree = trees[key];
-          if(!startState) console.error('The parallel statechart %@ must have a start state!'.fmt(key));
-          if(!currTree) throw 'The parallel statechart %@ does not exist!'.fmt(key);
-          if(!currTree[startState]) throw 'The parallel statechart %@ doesn\'t have a start state [%@]!'.fmt(key, startState);
-          this.goState(startState, key);
-        }
-      }
-    }
-    this._started = YES;
-  },
-  
-  
-  /**
-    Adds a state to a state manager
-    
-    if the stateManager and stateName objects are blank it is assumed
-    that this state will be picked up by the StateManger's init
-    
-    @param {Object} the state definition
-    @param {SC.Object} Optional: Any SC.Object that mixes in SC.Statechart 
-    @param {String} Optional: the state name
-    @returns {SC.State} the state object
-  */
-  registerState: function(stateDefinition, stateManager, stateName){
-    
-    var state, tree;
-    //create the state object
-    state = SC.State.create(stateDefinition);
-    
-    //passed in optional arguments
-    if(stateManager && stateName){
-      if(stateManager.isStatechart){
-
-        stateManager._addState(stateName, state);
-        state.initState();
-      }
-      else{
-        throw 'Cannot add state: %@ because state manager does not mixin SC.Statechart'.fmt(state.get('name'));
-      }
-    }
-    else{
-      state.set('beenAddedToStatechart', NO);
-    }
-    //push state onto list of states
-    
-    return state;
-  },
-  
-  goHistoryState: function(requestedState, tree, isRecursive){
-    var allStateForTree = this._all_states[tree],
-        pState, realHistoryState;
-    if(!tree || !allStateForTree) throw 'State requesting go history does not have a valid parallel tree';
-    pState = allStateForTree[requestedState];
-    if (pState) realHistoryState = pState.get('history') || pState.get('initialSubState');
-
-    if (!realHistoryState) {
-      if (!isRecursive) console.warn('Requesting History State for [%@] and it is not a parent state'.fmt(requestedState));
-      realHistoryState = requestedState;
-      this.goState(realHistoryState, tree);
-    }
-    else if (isRecursive) {
-      this.goHistoryState(realHistoryState, tree, isRecursive);
-    }
-    else {
-      this.goState(realHistoryState, tree);
-    }
-  },
-  
-  goState: function(requestedState, tree) {
-    var currentState = this._current_state[tree],
-        enterStates = [],
-        exitStates = [],
-        enterMatchIndex,
-        exitMatchIndex,
-        pivotState, pState, cState, 
-        i, hasLogging = this.get('log'), loggingStr;
-             
-    if (!tree) throw '#goState: State requesting go does not have a valid parallel tree';
-    
-    requestedState = this._all_states[tree][requestedState];
-    
-    if (!requestedState) throw '#goState: Could not find the requested state!';
-
-    if (this._goStateLocked) {
-      // There is a state transition currently happening. Add this requested state
-      // transition to the queue of pending state transitions. The request will
-      // be invoked after the current state transition is finished.
-      this._pendingStateTransitions.push({
-        requestedState: requestedState,
-        tree: tree
-      });
-      return;
-    }
-    
-    // Lock the current state transition so that no other requested state transition 
-    // interferes. 
-    this._goStateLocked = YES;
-
-    // Get the parent states for the current state and the registered state. We will
-    // use them to find a common parent state. 
-    enterStates = this._parentStates_with_root(requestedState);
-    exitStates = currentState ? this._parentStates_with_root(currentState) : [];
-  
-    // Continue by finding the common parent state for the current and requested states
-    //
-    // At most, this takes O(m^2) time, where m is the maximum depth from the
-    // root of the tree to either the requested state or the current state. 
-    // Will always be less than or equal to O(n^2), where n is the number of 
-    // states in the tree.
-    pivotState = exitStates.find(function(item,index){
-      exitMatchIndex = index;
-      enterMatchIndex = enterStates.indexOf(item);
-      if (enterMatchIndex >= 0) return YES;
-    });
-      
-    // Looks like we were unable to find a common parent state. This means that we
-    // must enter from the root state in the tree
-    if (!enterMatchIndex) enterMatchIndex = enterStates.length - 1;
-    
-    // Now, from the current state, exit up the parent states to the common parent state, 
-    // but don't exit the common parent itself since you are technically still in it.
-    loggingStr = "";
-    for (i = 0; i < exitMatchIndex; i += 1) {
-      if (hasLogging) loggingStr += 'Exiting State: [%@] in [%@]\n'.fmt(exitStates[i], tree);
-      exitStates[i].exitState();
-    }
-    
-    if (hasLogging) console.info(loggingStr);
-    
-    // Finally, from the the common parent state, but not including the parent state, enter the 
-    // sub states down to the requested state. If the requested state has an initial sub state
-    // then we must enter it too.
-    loggingStr = "";
-    for (i = enterMatchIndex-1; i >= 0; i -= 1) {
-      //TODO call initState?
-      cState = enterStates[i];
-      if (hasLogging) loggingStr += 'Entering State: [%@] in [%@]\n'.fmt(cState, tree);
-      pState = enterStates[i+1];
-      if (pState && SC.typeOf(pState) === SC.T_OBJECT) pState.set('history', cState.name);
-      cState.enterState();
-
-      if (cState === requestedState) {
-        // Make sure to enter the requested state's initial sub state!
-        cState.enterInitialSubState(this._all_states[tree || SC.DEFAULT_TREE]);
-      }
-    }
-    if (hasLogging) console.info(loggingStr);
-    
-    // Set the current state for this state transition
-    this._current_state[tree] = requestedState;
-            
-    // Okay. We're done with the current state transition. Make sure to unlock the
-    // goState and let other pending state transitions execute.
-    this._goStateLocked = NO;
-    this._flushPendingStateTransition();
-  },
-  
-  /** @private
-  
-    Called by goState to flush a pending state transition and the front of the 
-    pending queue.
-  */
-  _flushPendingStateTransition: function() {
-    var pending = this._pendingStateTransitions.shift();
-    if (!pending) return;
-    this.goState(pending.requestedState, pending.tree);
-  },
-  
-  currentState: function(tree){
-    tree = tree || SC.DEFAULT_TREE;
-    return this._current_state[tree];
-  },
-  
-  //Walk like a duck
-  isResponderContext: YES,
-  
-  
-  /**
-    Sends the event to all the parallel state's current state
-    and walks up the graph looking if current does not respond
-    
-    @param {String} action name of action
-    @param {Object} sender object sending the action
-    @param {Object} context optional additonal context info
-    @returns {SC.Responder} the responder that handled it or null
-  */
-  sendEvent: function(action, sender, context) {
-    var trace = this.get('log'),
-        handled = NO,
-        currentStates = this._current_state,
-        responder;
-    
-    this._locked = YES;
-    if (trace) {
-      console.log("%@: begin action '%@' (%@, %@)".fmt(this, action, sender, context));
-    }
-    
-    for(var tree in currentStates){
-      if(currentStates.hasOwnProperty(tree)){
-        handled = NO;
-        
-        responder = currentStates[tree];
-       
-        while(!handled && responder){
-          if(responder.tryToPerform){
-            handled = responder.tryToPerform(action, sender, context);
-          }
-          
-          if(!handled) responder = responder.get('parentState') ? this._all_states[tree][responder.get('parentState')] : null;
-        }
-        
-        if (trace) {
-          if (!handled) console.log("%@:  action '%@' NOT HANDLED in tree %@".fmt(this,action, tree));
-          else console.log("%@: action '%@' handled by %@ in tree %@".fmt(this, action, responder.get('name'), tree));
-        }
-      }
-    }
-    
-    this._locked = NO ;
-    
-    return responder ;
-  },
-  
-  
-  
-  _addState: function(name, state){
-    state.set('stateManager', this);
-    state.set('name', name);
-    var tree = state.get('parallelStatechart') || SC.DEFAULT_TREE;
-    state.setIfChanged('parallelStatechart', tree);
-    
-    if(!this._all_states[tree]) this._all_states[tree] = {};
-    if(this._all_states[tree][name]) throw 'Trying to add state %@ to state tree %@ and it already exists'.fmt(name, tree);
-    this._all_states[tree][name] = state;
-    
-    state.set('beenAddedToStatechart', YES);
-  },
-  
-  
-  _parentStates: function(state){
-    var ret = [], curr = state;
-    
-    //always add the first state
-    ret.push(curr);
-    curr = curr.get('parentStateObject');
-    
-    while(curr){
-      ret.push(curr);
-      curr = curr.get('parentStateObject');
-    }
-    return ret;
-  },
-  
-  _parentStates_with_root: function(state){
-    var ret = this._parentStates(state);
-    //always push the root
-    ret.push('root');
-    return ret;
-  },
-  
-  parentStateObject: function(name, tree){
-    if(name && tree && this._all_states[tree] && this._all_states[tree][name]){
-      return this._all_states[tree][name];
-    }
-    return null;
-  }
- };
-