85 lines
2.1 KiB
JavaScript
85 lines
2.1 KiB
JavaScript
/*
|
|
Copyright (c) 2004-2006, The Dojo Foundation
|
|
All Rights Reserved.
|
|
|
|
Licensed under the Academic Free License version 2.1 or above OR the
|
|
modified BSD license. For more information on Dojo licensing, see:
|
|
|
|
http://dojotoolkit.org/community/licensing.shtml
|
|
*/
|
|
|
|
dojo.provide("dojo.collections.Stack");
|
|
dojo.require("dojo.collections.Collections");
|
|
|
|
dojo.collections.Stack=function(/* array? */arr){
|
|
// summary
|
|
// returns an object of type dojo.collections.Stack
|
|
var q=[];
|
|
if (arr) q=q.concat(arr);
|
|
this.count=q.length;
|
|
this.clear=function(){
|
|
// summary
|
|
// Clear the internal array and reset the count
|
|
q=[];
|
|
this.count=q.length;
|
|
};
|
|
this.clone=function(){
|
|
// summary
|
|
// Create and return a clone of this Stack
|
|
return new dojo.collections.Stack(q);
|
|
};
|
|
this.contains=function(/* object */o){
|
|
// summary
|
|
// check to see if the stack contains object o
|
|
for (var i=0; i<q.length; i++){
|
|
if (q[i] == o){
|
|
return true; // bool
|
|
}
|
|
}
|
|
return false; // bool
|
|
};
|
|
this.copyTo=function(/* array */ arr, /* int */ i){
|
|
// summary
|
|
// copy the stack into array arr at index i
|
|
arr.splice(i,0,q);
|
|
};
|
|
this.forEach=function(/* function */ fn, /* object? */ scope){
|
|
// summary
|
|
// functional iterator, following the mozilla spec.
|
|
var s=scope||dj_global;
|
|
if(Array.forEach){
|
|
Array.forEach(q, fn, s);
|
|
}else{
|
|
for(var i=0; i<q.length; i++){
|
|
fn.call(s, q[i], i, q);
|
|
}
|
|
}
|
|
};
|
|
this.getIterator=function(){
|
|
// summary
|
|
// get an iterator for this collection
|
|
return new dojo.collections.Iterator(q); // dojo.collections.Iterator
|
|
};
|
|
this.peek=function(){
|
|
// summary
|
|
// Return the next item without altering the stack itself.
|
|
return q[(q.length-1)]; // object
|
|
};
|
|
this.pop=function(){
|
|
// summary
|
|
// pop and return the next item on the stack
|
|
var r=q.pop();
|
|
this.count=q.length;
|
|
return r; // object
|
|
};
|
|
this.push=function(/* object */ o){
|
|
// summary
|
|
// Push object o onto the stack
|
|
this.count=q.push(o);
|
|
};
|
|
this.toArray=function(){
|
|
// summary
|
|
// create and return an array based on the internal collection
|
|
return [].concat(q); // array
|
|
};
|
|
}
|