Difference between revisions of "Peer-nodal.as"

From Organic Design wiki
m
(legacy)
 
(11 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 +
{{legacy}}
 +
<as>
 
// Liscenced under LGPL: www.gnu.org/copyleft/lesser.html
 
// Liscenced under LGPL: www.gnu.org/copyleft/lesser.html
 
//
 
//
// peer-nodal.as - ecma-script implimentation of the nodal core
+
// peer-nodal.as - ecma-script implementation of the nodal core
 
// Nad - 2006
 
// Nad - 2006
 
//
 
//
Line 15: Line 17:
 
// - ROOT.nodes is the current number of instantiated node objects
 
// - ROOT.nodes is the current number of instantiated node objects
 
ROOT = { idcount: 0, nodes: 0 };
 
ROOT = { idcount: 0, nodes: 0 };
NONE = ROOT;
+
VOID = ROOT;
 
INIT = new node( ROOT ); // Default method executed if quanta sent to empty/new association
 
INIT = new node( ROOT ); // Default method executed if quanta sent to empty/new association
 
NEXT = new node( ROOT );
 
NEXT = new node( ROOT );
Line 28: Line 30:
 
this.id = ROOT.idcount++;
 
this.id = ROOT.idcount++;
 
this.set( [FOCUS], key.get( [INIT] ) );
 
this.set( [FOCUS], key.get( [INIT] ) );
}
+
}
  
 
// NODAL METHODS
 
// NODAL METHODS
Line 38: Line 40:
 
// - but keep all hierarchy nodal
 
// - but keep all hierarchy nodal
  
node.prototype.set( path, value ) {
+
node.prototype.set = function( path, value ) {
 
var ptr = this._resolve( path );
 
var ptr = this._resolve( path );
 
ptr.value = value;
 
ptr.value = value;
};
+
};
  
node.prototype.get( path ) {
+
node.prototype.get = function( path ) {
 
var ptr = this._resolve( path );
 
var ptr = this._resolve( path );
 
// need to return class.value onNonExistent
 
// need to return class.value onNonExistent
 
return ptr.value;
 
return ptr.value;
};
+
};
  
 
// Resolve creates if non existent and returns reference to result
 
// Resolve creates if non existent and returns reference to result
Line 56: Line 58:
 
var key = path.shift();
 
var key = path.shift();
 
context = context[key.id] == null ? context[key.id] = new node( key ) : context[ key.id ];
 
context = context[key.id] == null ? context[key.id] = new node( key ) : context[ key.id ];
}
+
}
 
return context;
 
return context;
};
+
};
  
 
// Consume one quanta
 
// Consume one quanta
Line 73: Line 75:
  
 
// If there's a local function declaration, execute
 
// If there's a local function declaration, execute
if ( var ref = ptr.get( [FUNC] ) ) {
+
var ref = ptr.get( [FUNC] );
ref = ref.call;
+
if ( ref != VOID ) {
if ( ref == NONE ) {
+
ref = ref.call( ptr );
 +
if ( ref == VOID ) {
 
// Remove focus from loop
 
// Remove focus from loop
 
ptr.set( [NEXT,PREV], ptr.get( [PREV] ) ); // ptr.next.prev = ptr.prev
 
ptr.set( [NEXT,PREV], ptr.get( [PREV] ) ); // ptr.next.prev = ptr.prev
 
ptr.set( [PREV,NEXT], ptr.get( [NEXT] ) ); // ptr.prev.next = ptr.next
 
ptr.set( [PREV,NEXT], ptr.get( [NEXT] ) ); // ptr.prev.next = ptr.next
}
+
}
 
else if ( ref != ptr ) {
 
else if ( ref != ptr ) {
 
// Replace current ptr with result-ref
 
// Replace current ptr with result-ref
Line 86: Line 89:
 
ptr.set( [NEXT,PREV], ref ); // ptr.next.prev = ref
 
ptr.set( [NEXT,PREV], ref ); // ptr.next.prev = ref
 
ptr.set( [PREV,NEXT], ref ); // ptr.prev.next = ref
 
ptr.set( [PREV,NEXT], ref ); // ptr.prev.next = ref
}
 
 
}
 
}
  
// also call class.reduce
+
// also call class.reduce()
  
};
+
}
  
 
// if not, send the quanta downstairs if there's anything in its loop
 
// if not, send the quanta downstairs if there's anything in its loop
else if ( ptr = ptr.get( [FOCUS] ) != NONE ) ptr.reduce;
+
else if ( ptr = ptr.get( [FOCUS] ) != VOID ) ptr.reduce();
  
};
+
};
 +
</as>
 +
[[Category:ActionScript]]

Latest revision as of 23:43, 24 September 2013

Legacy.svg Legacy: This article describes a concept that has been superseded in the course of ongoing development on the Organic Design wiki. Please do not develop this any further or base work on this concept, this is only useful for a historic record of work done. You may find a link to the currently used concept or function in this article, if not you can contact the author to find out what has taken the place of this legacy item.

<as> // Liscenced under LGPL: www.gnu.org/copyleft/lesser.html // // peer-nodal.as - ecma-script implementation of the nodal core // Nad - 2006 //

// ISSUES // - associations (maintained class:instance relationships) // - get should use class content as default - resolve() doesn't // so either add get/set which use resolve, or remove object-freedom and have only .data

// NODAL PROPERTIES & CORE NODAL CONCEPTS // - all-capital-identifiers are node-references // - ROOT.idcount is a accumulating-only counter for locally-unique-id number // - ROOT.nodes is the current number of instantiated node objects ROOT = { idcount: 0, nodes: 0 }; VOID = ROOT; INIT = new node( ROOT ); // Default method executed if quanta sent to empty/new association NEXT = new node( ROOT ); PREV = new node( ROOT ); FUNC = new node( ROOT ); FOCUS = new node( ROOT );

// NODE OBJECT // - note: only a node's parent can adjust a nodes prev/next function node( key ) { ROOT.nodes++; this.id = ROOT.idcount++; this.set( [FOCUS], key.get( [INIT] ) ); }

// NODAL METHODS // - the delete-list is only needed for limited list-space env // - Actionscript failed ref-as-hashkey test, // so we use a id (locally unique identifier) as a lookup-key // - no delete currently // - just get/set properties with normal object-accessor way // - but keep all hierarchy nodal

node.prototype.set = function( path, value ) { var ptr = this._resolve( path ); ptr.value = value; };

node.prototype.get = function( path ) { var ptr = this._resolve( path ); // need to return class.value onNonExistent return ptr.value; };

// Resolve creates if non existent and returns reference to result // - this is private, used by get/set node.prototype._resolve = function( path ) { var context = this; while( path.length ) { var key = path.shift(); context = context[key.id] == null ? context[key.id] = new node( key ) : context[ key.id ]; } return context; };

// Consume one quanta // - each quantum is actually two, one for local instance, one for global class // - all instance-loops work by going cd this.current then assigning this.current.next to it // when a function executes, it can update the loop at that location (equiv to array.push) // - a functions parameters (and even further methods and tools) are child associations // the structures necessary to build the fucntion are child assocs too node.prototype.reduce = function() {

// Rotate this level's queue var ptr = this.get( [FOCUS] ); this.set( [FOCUS], this.get( [FOCUS,NEXT] ) );

// If there's a local function declaration, execute var ref = ptr.get( [FUNC] ); if ( ref != VOID ) { ref = ref.call( ptr ); if ( ref == VOID ) { // Remove focus from loop ptr.set( [NEXT,PREV], ptr.get( [PREV] ) ); // ptr.next.prev = ptr.prev ptr.set( [PREV,NEXT], ptr.get( [NEXT] ) ); // ptr.prev.next = ptr.next } else if ( ref != ptr ) { // Replace current ptr with result-ref ref.set( [NEXT], ptr.get( [NEXT] ) ); // ref.next = ptr.next ref.set( [PREV], ptr.get( [PREV] ) ); // ref.prev = ptr.prev ptr.set( [NEXT,PREV], ref ); // ptr.next.prev = ref ptr.set( [PREV,NEXT], ref ); // ptr.prev.next = ref }

// also call class.reduce()

}

// if not, send the quanta downstairs if there's anything in its loop else if ( ptr = ptr.get( [FOCUS] ) != VOID ) ptr.reduce();

}; </as>