summaryrefslogtreecommitdiff
path: root/includes/js/dojox/lang/functional/array.js
diff options
context:
space:
mode:
Diffstat (limited to 'includes/js/dojox/lang/functional/array.js')
-rw-r--r--includes/js/dojox/lang/functional/array.js113
1 files changed, 113 insertions, 0 deletions
diff --git a/includes/js/dojox/lang/functional/array.js b/includes/js/dojox/lang/functional/array.js
new file mode 100644
index 0000000..45c2613
--- /dev/null
+++ b/includes/js/dojox/lang/functional/array.js
@@ -0,0 +1,113 @@
+if(!dojo._hasResource["dojox.lang.functional.array"]){ //_hasResource checks added by build. Do not use _hasResource directly in your code.
+dojo._hasResource["dojox.lang.functional.array"] = true;
+dojo.provide("dojox.lang.functional.array");
+
+dojo.require("dojox.lang.functional.lambda");
+
+// This module adds high-level functions and related constructs:
+// - array-processing functions similar to standard JS functions
+
+// Notes:
+// - this module provides JS standard methods similar to high-level functions in dojo/_base/array.js:
+// forEach, map, filter, every, some
+
+// Defined methods:
+// - take any valid lambda argument as the functional argument
+// - operate on dense arrays
+// - take a string as the array argument
+// - take an iterator objects as the array argument
+
+(function(){
+ var d = dojo, df = dojox.lang.functional;
+
+ d.mixin(df, {
+ // JS 1.6 standard array functions, which can take a lambda as a parameter.
+ // Consider using dojo._base.array functions, if you don't need the lambda support.
+ filter: function(/*Array|String|Object*/ a, /*Function|String|Array*/ f, /*Object?*/ o){
+ // summary: creates a new array with all elements that pass the test
+ // implemented by the provided function.
+ if(typeof a == "string"){ a = a.split(""); }
+ o = o || d.global; f = df.lambda(f);
+ var t = [], v;
+ if(d.isArray(a)){
+ for(var i = 0, n = a.length; i < n; ++i){
+ v = a[i];
+ if(f.call(o, v, i, a)){ t.push(v); }
+ }
+ }else{
+ for(var i = 0; a.hasNext();){
+ v = a.next();
+ if(f.call(o, v, i++)){ t.push(v); }
+ }
+ }
+ return t; // Array
+ },
+ forEach: function(/*Array|String|Object*/ a, /*Function|String|Array*/ f, /*Object?*/ o){
+ // summary: executes a provided function once per array element.
+ if(typeof a == "string"){ a = a.split(""); }
+ o = o || d.global; f = df.lambda(f);
+ if(d.isArray(a)){
+ for(var i = 0, n = a.length; i < n; f.call(o, a[i], i, a), ++i);
+ }else{
+ for(var i = 0; a.hasNext(); f.call(o, a.next(), i++));
+ }
+ },
+ map: function(/*Array|String|Object*/ a, /*Function|String|Array*/ f, /*Object?*/ o){
+ // summary: creates a new array with the results of calling
+ // a provided function on every element in this array.
+ if(typeof a == "string"){ a = a.split(""); }
+ o = o || d.global; f = df.lambda(f);
+ var t, n;
+ if(d.isArray(a)){
+ t = new Array(n = a.length);
+ for(var i = 0; i < n; t[i] = f.call(o, a[i], i, a), ++i);
+ }else{
+ t = [];
+ for(var i = 0; a.hasNext(); t.push(f.call(o, a.next(), i++)));
+ }
+ return t; // Array
+ },
+ every: function(/*Array|String|Object*/ a, /*Function|String|Array*/ f, /*Object?*/ o){
+ // summary: tests whether all elements in the array pass the test
+ // implemented by the provided function.
+ if(typeof a == "string"){ a = a.split(""); }
+ o = o || d.global; f = df.lambda(f);
+ if(d.isArray(a)){
+ for(var i = 0, n = a.length; i < n; ++i){
+ if(!f.call(o, a[i], i, a)){
+ return false; // Boolean
+ }
+ }
+ }else{
+ for(var i = 0; a.hasNext();){
+ if(!f.call(o, a.next(), i++)){
+ return false; // Boolean
+ }
+ }
+ }
+ return true; // Boolean
+ },
+ some: function(/*Array|String|Object*/ a, /*Function|String|Array*/ f, /*Object?*/ o){
+ // summary: tests whether some element in the array passes the test
+ // implemented by the provided function.
+ if(typeof a == "string"){ a = a.split(""); }
+ o = o || d.global; f = df.lambda(f);
+ if(d.isArray(a)){
+ for(var i = 0, n = a.length; i < n; ++i){
+ if(f.call(o, a[i], i, a)){
+ return true; // Boolean
+ }
+ }
+ }else{
+ for(var i = 0; a.hasNext();){
+ if(f.call(o, a.next(), i++)){
+ return true; // Boolean
+ }
+ }
+ }
+ return false; // Boolean
+ }
+ });
+})();
+
+}