dojo-rails 0.11.0 → 0.14.0

data/vendor/assets/javascripts/dojo/DeferredList.js.uncompressed.js

@@ -1,84 +0,0 @@
-define("dojo/DeferredList", ["./_base/kernel", "./_base/Deferred", "./_base/array"], function(dojo, Deferred, darray){
-	// module:
-	//		dojo/DeferredList
-
-
-dojo.DeferredList = function(/*Array*/ list, /*Boolean?*/ fireOnOneCallback, /*Boolean?*/ fireOnOneErrback, /*Boolean?*/ consumeErrors, /*Function?*/ canceller){
-	// summary:
-	//		Deprecated, use dojo/promise/all instead.
-	//		Provides event handling for a group of Deferred objects.
-	// description:
-	//		DeferredList takes an array of existing deferreds and returns a new deferred of its own
-	//		this new deferred will typically have its callback fired when all of the deferreds in
-	//		the given list have fired their own deferreds.  The parameters `fireOnOneCallback` and
-	//		fireOnOneErrback, will fire before all the deferreds as appropriate
-	// list:
-	//		The list of deferreds to be synchronizied with this DeferredList
-	// fireOnOneCallback:
-	//		Will cause the DeferredLists callback to be fired as soon as any
-	//		of the deferreds in its list have been fired instead of waiting until
-	//		the entire list has finished
-	// fireonOneErrback:
-	//		Will cause the errback to fire upon any of the deferreds errback
-	// canceller:
-	//		A deferred canceller function, see dojo.Deferred
-	var resultList = [];
-	Deferred.call(this);
-	var self = this;
-	if(list.length === 0 && !fireOnOneCallback){
-		this.resolve([0, []]);
-	}
-	var finished = 0;
-	darray.forEach(list, function(item, i){
-		item.then(function(result){
-			if(fireOnOneCallback){
-				self.resolve([i, result]);
-			}else{
-				addResult(true, result);
-			}
-		},function(error){
-			if(fireOnOneErrback){
-				self.reject(error);
-			}else{
-				addResult(false, error);
-			}
-			if(consumeErrors){
-				return null;
-			}
-			throw error;
-		});
-		function addResult(succeeded, result){
-			resultList[i] = [succeeded, result];
-			finished++;
-			if(finished === list.length){
-				self.resolve(resultList);
-			}
-
-		}
-	});
-};
-dojo.DeferredList.prototype = new Deferred();
-
-dojo.DeferredList.prototype.gatherResults = function(deferredList){
-	// summary:
-	//		Gathers the results of the deferreds for packaging
-	//		as the parameters to the Deferred Lists' callback
-	// deferredList: dojo/DeferredList
-	//		The deferred list from which this function gathers results.
-	// returns: dojo/DeferredList
-	//		The newly created deferred list which packs results as
-	//		parameters to its callback.
-
-	var d = new dojo.DeferredList(deferredList, false, true, false);
-	d.addCallback(function(results){
-		var ret = [];
-		darray.forEach(results, function(result){
-			ret.push(result[1]);
-		});
-		return ret;
-	});
-	return d;
-};
-
-return dojo.DeferredList;
-});

data/vendor/assets/javascripts/dojo/Evented.js.uncompressed.js

@@ -1,35 +0,0 @@
-define("dojo/Evented", ["./aspect", "./on"], function(aspect, on){
-	// module:
-	//		dojo/Evented
-
- 	"use strict";
- 	var after = aspect.after;
-	function Evented(){
-		// summary:
-		//		A class that can be used as a mixin or base class,
-		//		to add on() and emit() methods to a class
-		//		for listening for events and emitting events:
-		//
-		//		|	define(["dojo/Evented"], function(Evented){
-		//		|		var EventedWidget = dojo.declare([Evented, dijit._Widget], {...});
-		//		|		widget = new EventedWidget();
-		//		|		widget.on("open", function(event){
-		//		|		... do something with event
-		//		|	 });
-		//		|
-		//		|	widget.emit("open", {name:"some event", ...});
-	}
-	Evented.prototype = {
-		on: function(type, listener){
-			return on.parse(this, type, listener, function(target, type){
-				return after(target, 'on' + type, listener, true);
-			});
-		},
-		emit: function(type, event){
-			var args = [this];
-			args.push.apply(args, arguments);
-			return on.emit.apply(on, args);
-		}
-	};
-	return Evented;
-});

data/vendor/assets/javascripts/dojo/LICENSE

@@ -1,195 +0,0 @@
-Dojo is available under *either* the terms of the modified BSD license *or* the
-Academic Free License version 2.1. As a recipient of Dojo, you may choose which
-license to receive this code under (except as noted in per-module LICENSE
-files). Some modules may not be the copyright of the Dojo Foundation. These
-modules contain explicit declarations of copyright in both the LICENSE files in
-the directories in which they reside and in the code itself. No external
-contributions are allowed under licenses which are fundamentally incompatible
-with the AFL or BSD licenses that Dojo is distributed under.
-
-The text of the AFL and BSD licenses is reproduced below. 
-
--------------------------------------------------------------------------------
-The "New" BSD License:
-**********************
-
-Copyright (c) 2005-2012, The Dojo Foundation
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-  * Redistributions of source code must retain the above copyright notice, this
-    list of conditions and the following disclaimer.
-  * Redistributions in binary form must reproduce the above copyright notice,
-    this list of conditions and the following disclaimer in the documentation
-    and/or other materials provided with the distribution.
-  * Neither the name of the Dojo Foundation nor the names of its contributors
-    may be used to endorse or promote products derived from this software
-    without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
--------------------------------------------------------------------------------
-The Academic Free License, v. 2.1:
-**********************************
-
-This Academic Free License (the "License") applies to any original work of
-authorship (the "Original Work") whose owner (the "Licensor") has placed the
-following notice immediately following the copyright notice for the Original
-Work:
-
-Licensed under the Academic Free License version 2.1
-
-1) Grant of Copyright License. Licensor hereby grants You a world-wide,
-royalty-free, non-exclusive, perpetual, sublicenseable license to do the
-following:
-
-a) to reproduce the Original Work in copies;
-
-b) to prepare derivative works ("Derivative Works") based upon the Original
-Work;
-
-c) to distribute copies of the Original Work and Derivative Works to the
-public;
-
-d) to perform the Original Work publicly; and
-
-e) to display the Original Work publicly.
-
-2) Grant of Patent License. Licensor hereby grants You a world-wide,
-royalty-free, non-exclusive, perpetual, sublicenseable license, under patent
-claims owned or controlled by the Licensor that are embodied in the Original
-Work as furnished by the Licensor, to make, use, sell and offer for sale the
-Original Work and Derivative Works.
-
-3) Grant of Source Code License. The term "Source Code" means the preferred
-form of the Original Work for making modifications to it and all available
-documentation describing how to modify the Original Work. Licensor hereby
-agrees to provide a machine-readable copy of the Source Code of the Original
-Work along with each copy of the Original Work that Licensor distributes.
-Licensor reserves the right to satisfy this obligation by placing a
-machine-readable copy of the Source Code in an information repository
-reasonably calculated to permit inexpensive and convenient access by You for as
-long as Licensor continues to distribute the Original Work, and by publishing
-the address of that information repository in a notice immediately following
-the copyright notice that applies to the Original Work.
-
-4) Exclusions From License Grant. Neither the names of Licensor, nor the names
-of any contributors to the Original Work, nor any of their trademarks or
-service marks, may be used to endorse or promote products derived from this
-Original Work without express prior written permission of the Licensor. Nothing
-in this License shall be deemed to grant any rights to trademarks, copyrights,
-patents, trade secrets or any other intellectual property of Licensor except as
-expressly stated herein. No patent license is granted to make, use, sell or
-offer to sell embodiments of any patent claims other than the licensed claims
-defined in Section 2. No right is granted to the trademarks of Licensor even if
-such marks are included in the Original Work. Nothing in this License shall be
-interpreted to prohibit Licensor from licensing under different terms from this
-License any Original Work that Licensor otherwise would have a right to
-license.
-
-5) This section intentionally omitted.
-
-6) Attribution Rights. You must retain, in the Source Code of any Derivative
-Works that You create, all copyright, patent or trademark notices from the
-Source Code of the Original Work, as well as any notices of licensing and any
-descriptive text identified therein as an "Attribution Notice." You must cause
-the Source Code for any Derivative Works that You create to carry a prominent
-Attribution Notice reasonably calculated to inform recipients that You have
-modified the Original Work.
-
-7) Warranty of Provenance and Disclaimer of Warranty. Licensor warrants that
-the copyright in and to the Original Work and the patent rights granted herein
-by Licensor are owned by the Licensor or are sublicensed to You under the terms
-of this License with the permission of the contributor(s) of those copyrights
-and patent rights. Except as expressly stated in the immediately proceeding
-sentence, the Original Work is provided under this License on an "AS IS" BASIS
-and WITHOUT WARRANTY, either express or implied, including, without limitation,
-the warranties of NON-INFRINGEMENT, MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY OF THE ORIGINAL WORK IS WITH YOU.
-This DISCLAIMER OF WARRANTY constitutes an essential part of this License. No
-license to Original Work is granted hereunder except under this disclaimer.
-
-8) Limitation of Liability. Under no circumstances and under no legal theory,
-whether in tort (including negligence), contract, or otherwise, shall the
-Licensor be liable to any person for any direct, indirect, special, incidental,
-or consequential damages of any character arising as a result of this License
-or the use of the Original Work including, without limitation, damages for loss
-of goodwill, work stoppage, computer failure or malfunction, or any and all
-other commercial damages or losses. This limitation of liability shall not
-apply to liability for death or personal injury resulting from Licensor's
-negligence to the extent applicable law prohibits such limitation. Some
-jurisdictions do not allow the exclusion or limitation of incidental or
-consequential damages, so this exclusion and limitation may not apply to You.
-
-9) Acceptance and Termination. If You distribute copies of the Original Work or
-a Derivative Work, You must make a reasonable effort under the circumstances to
-obtain the express assent of recipients to the terms of this License. Nothing
-else but this License (or another written agreement between Licensor and You)
-grants You permission to create Derivative Works based upon the Original Work
-or to exercise any of the rights granted in Section 1 herein, and any attempt
-to do so except under the terms of this License (or another written agreement
-between Licensor and You) is expressly prohibited by U.S. copyright law, the
-equivalent laws of other countries, and by international treaty. Therefore, by
-exercising any of the rights granted to You in Section 1 herein, You indicate
-Your acceptance of this License and all of its terms and conditions.
-
-10) Termination for Patent Action. This License shall terminate automatically
-and You may no longer exercise any of the rights granted to You by this License
-as of the date You commence an action, including a cross-claim or counterclaim,
-against Licensor or any licensee alleging that the Original Work infringes a
-patent. This termination provision shall not apply for an action alleging
-patent infringement by combinations of the Original Work with other software or
-hardware.
-
-11) Jurisdiction, Venue and Governing Law. Any action or suit relating to this
-License may be brought only in the courts of a jurisdiction wherein the
-Licensor resides or in which Licensor conducts its primary business, and under
-the laws of that jurisdiction excluding its conflict-of-law provisions. The
-application of the United Nations Convention on Contracts for the International
-Sale of Goods is expressly excluded. Any use of the Original Work outside the
-scope of this License or after its termination shall be subject to the
-requirements and penalties of the U.S. Copyright Act, 17 U.S.C. § 101 et
-seq., the equivalent laws of other countries, and international treaty. This
-section shall survive the termination of this License.
-
-12) Attorneys Fees. In any action to enforce the terms of this License or
-seeking damages relating thereto, the prevailing party shall be entitled to
-recover its costs and expenses, including, without limitation, reasonable
-attorneys' fees and costs incurred in connection with such action, including
-any appeal of such action. This section shall survive the termination of this
-License.
-
-13) Miscellaneous. This License represents the complete agreement concerning
-the subject matter hereof. If any provision of this License is held to be
-unenforceable, such provision shall be reformed only to the extent necessary to
-make it enforceable.
-
-14) Definition of "You" in This License. "You" throughout this License, whether
-in upper or lower case, means an individual or a legal entity exercising rights
-under, and complying with all of the terms of, this License. For legal
-entities, "You" includes any entity that controls, is controlled by, or is
-under common control with you. For purposes of this definition, "control" means
-(i) the power, direct or indirect, to cause the direction or management of such
-entity, whether by contract or otherwise, or (ii) ownership of fifty percent
-(50%) or more of the outstanding shares, or (iii) beneficial ownership of such
-entity.
-
-15) Right to Use. You may use the Original Work in all ways not otherwise
-restricted or conditioned by this License or by law, and Licensor promises not
-to interfere with or be responsible for such uses by You.
-
-This license is Copyright (C) 2003-2004 Lawrence E. Rosen. All rights reserved.
-Permission is hereby granted to copy and distribute this license without
-modification. This license may not be modified without the express written
-permission of its copyright owner.

data/vendor/assets/javascripts/dojo/NodeList-data.js.uncompressed.js

@@ -1,192 +0,0 @@
-define("dojo/NodeList-data", [
-	"./_base/kernel", "./query", "./_base/lang", "./_base/array", "./dom-attr"
-], function(dojo, query, lang, array, attr){
-
-	// module:
-	//		dojo/NodeList-data
-
-	/*=====
-	return function(){
-		// summary:
-		//		Adds data() and removeData() methods to NodeList, and returns NodeList constructor.
-	};
-	=====*/
-
-	var NodeList = query.NodeList;
-
-	var dataCache = {}, x = 0, dataattr = "data-dojo-dataid",
-		dopid = function(node){
-			// summary:
-			//		Return a uniqueish ID for the passed node reference
-			var pid = attr.get(node, dataattr);
-			if(!pid){
-				pid = "pid" + (x++);
-				attr.set(node, dataattr, pid);
-			}
-			return pid;
-		}
-	;
-
-	
-	var dodata = dojo._nodeData = function(node, key, value){
-		// summary:
-		//		Private helper for dojo/NodeList.data for single node data access. Refer to NodeList.data
-		//		documentation for more information.
-		//
-		// node: String|DomNode
-		//		The node to associate data with
-		//
-		// key: Object|String?
-		//		If an object, act as a setter and iterate over said object setting data items as defined.
-		//		If a string, and `value` present, set the data for defined `key` to `value`
-		//		If a string, and `value` absent, act as a getter, returning the data associated with said `key`
-		//
-		// value: Anything?
-		//		The value to set for said `key`, provided `key` is a string (and not an object)
-		//
-		var pid = dopid(node), r;
-		if(!dataCache[pid]){ dataCache[pid] = {}; }
-
-		// API discrepency: calling with only a node returns the whole object. $.data throws
-		if(arguments.length == 1){ r = dataCache[pid]; }
-		if(typeof key == "string"){
-			// either getter or setter, based on `value` presence
-			if(arguments.length > 2){
-				dataCache[pid][key] = value;
-			}else{
-				r = dataCache[pid][key];
-			}
-		}else{
-			// must be a setter, mix `value` into data hash
-			// API discrepency: using object as setter works here
-			r = lang.mixin(dataCache[pid], key);
-		}
-
-		return r; // Object|Anything|Nothing
-	};
-
-	var removeData = dojo._removeNodeData = function(node, key){
-		// summary:
-		//		Remove some data from this node
-		// node: String|DomNode
-		//		The node reference to remove data from
-		// key: String?
-		//		If omitted, remove all data in this dataset.
-		//		If passed, remove only the passed `key` in the associated dataset
-		var pid = dopid(node);
-		if(dataCache[pid]){
-			if(key){
-				delete dataCache[pid][key];
-			}else{
-				delete dataCache[pid];
-			}
-		}
-	};
-
-	dojo._gcNodeData = function(){
-		// summary:
-		//		super expensive: GC all data in the data for nodes that no longer exist in the dom.
-		// description:
-		//		super expensive: GC all data in the data for nodes that no longer exist in the dom.
-		//		MUCH safer to do this yourself, manually, on a per-node basis (via `NodeList.removeData()`)
-		//		provided as a stop-gap for exceptionally large/complex applications with constantly changing
-		//		content regions (eg: a dijit/layout/ContentPane with replacing data)
-		//		There is NO automatic GC going on. If you dojo.destroy() a node, you should _removeNodeData
-		//		prior to destruction.
-		var livePids = query("[" + dataattr + "]").map(dopid);
-		for(var i in dataCache){
-			if(array.indexOf(livePids, i) < 0){ delete dataCache[i]; }
-		}
-	};
-
-	// make nodeData and removeNodeData public on dojo/NodeList:
-	lang.extend(NodeList, {
-		data: NodeList._adaptWithCondition(dodata, function(a){
-			return a.length === 0 || a.length == 1 && (typeof a[0] == "string");
-		}),
-		removeData: NodeList._adaptAsForEach(removeData)
-	});
-
-	/*=====
-	 lang.extend(NodeList, {
-		 data: function(key, value){
-			 // summary:
-			 //		stash or get some arbitrary data on/from these nodes.
-			 //
-			 // description:
-			 //		Stash or get some arbitrary data on/from these nodes. This private _data function is
-			 //		exposed publicly on `dojo/NodeList`, eg: as the result of a `dojo.query` call.
-			 //		DIFFERS from jQuery.data in that when used as a getter, the entire list is ALWAYS
-			 //		returned. EVEN WHEN THE LIST IS length == 1.
-			 //
-			 //		A single-node version of this function is provided as `dojo._nodeData`, which follows
-			 //		the same signature, though expects a String ID or DomNode reference in the first
-			 //		position, before key/value arguments.
-			 //
-			 // node: String|DomNode
-			 //		The node to associate data with
-			 //
-			 // key: Object|String?
-			 //		If an object, act as a setter and iterate over said object setting data items as defined.
-			 //		If a string, and `value` present, set the data for defined `key` to `value`
-			 //		If a string, and `value` absent, act as a getter, returning the data associated with said `key`
-			 //
-			 // value: Anything?
-			 //		The value to set for said `key`, provided `key` is a string (and not an object)
-			 //
-			 // example:
-			 //		Set a key `bar` to some data, then retrieve it.
-			 //	|	dojo.query(".foo").data("bar", "touched");
-			 //	|	var touched = dojo.query(".foo").data("bar");
-			 //	|	if(touched[0] == "touched"){ alert('win'); }
-			 //
-			 // example:
-			 //		Get all the data items for a given node.
-			 //	|	var list = dojo.query(".foo").data();
-			 //	|	var first = list[0];
-			 //
-			 // example:
-			 //		Set the data to a complex hash. Overwrites existing keys with new value
-			 //	|	dojo.query(".foo").data({ bar:"baz", foo:"bar" });
-			 //		Then get some random key:
-			 //	|	dojo.query(".foo").data("foo"); // returns [`bar`]
-			 //
-			 // returns: Object|Anything|Nothing
-			 //		When used as a setter via `dojo/NodeList`, a NodeList instance is returned
-			 //		for further chaining. When used as a getter via `dojo/NodeList` an ARRAY
-			 //		of items is returned. The items in the array correspond to the elements
-			 //		in the original list. This is true even when the list length is 1, eg:
-			 //		when looking up a node by ID (#foo)
-		 },
-
-		 removeData: function(key){
-			 // summary:
-			 //		Remove the data associated with these nodes.
-			 // key: String?
-			 //		If omitted, clean all data for this node.
-			 //		If passed, remove the data item found at `key`
-		 }
-	 });
-	 =====*/
-
-// TODO: this is the basic implementation of adaptWithCondtionAndWhenMappedConsiderLength, for lack of a better API name
-// it conflicts with the the `dojo/NodeList` way: always always return an arrayLike thinger. Consider for 2.0:
-//
-//	NodeList.prototype.data = function(key, value){
-//		var a = arguments, r;
-//		if(a.length === 0 || a.length == 1 && (typeof a[0] == "string")){
-//			r = this.map(function(node){
-//				return d._data(node, key);
-//			});
-//			if(r.length == 1){ r = r[0]; } // the offending line, and the diff on adaptWithCondition
-//		}else{
-//			r = this.forEach(function(node){
-//				d._data(node, key, value);
-//			});
-//		}
-//		return r; // NodeList|Array|SingleItem
-//	};
-
-	return NodeList;
-
-});