Willekeurige naam selector

├── readme.md ├── css ├── fontello │ ├── fontello.eot │ ├── fontello.ttf │ ├── fontello.woff │ └── fontello.svg └── main.css ├── index.html └── js ├── lib ├── backbone-localstorage.js ├── underscore-v1.5.2.js └── backbone-v0.9.2.js └── main.js /readme.md: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /css/fontello/fontello.eot: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bo/RandomNamePicker/master/css/fontello/fontello.eot -------------------------------------------------------------------------------- /css/fontello/fontello.ttf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bo/RandomNamePicker/master/css/fontello/fontello.ttf -------------------------------------------------------------------------------- /css/fontello/fontello.woff: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bo/RandomNamePicker/master/css/fontello/fontello.woff -------------------------------------------------------------------------------- /css/fontello/fontello.svg: -------------------------------------------------------------------------------- 1 | 2 | 3 | 38 | -------------------------------------------------------------------------------- /index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Willekeurige naam selector 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |

17 | 18 |

19 |

Bedenk een titel

20 | 21 | 22 | 23 |

Klik hier om een file up te loaden.

24 |

25 |

26 | 27 |

28 | 29 |

30 | 31 |

Klik hier!

32 | 33 |

reset namen

34 | 35 |

36 | 37 |

38 | 39 |

40 | 41 |

42 | 43 | 47 |

48 | 49 | 50 | 56 | 57 | 61 | 62 | -------------------------------------------------------------------------------- /js/lib/backbone-localstorage.js: -------------------------------------------------------------------------------- 1 | // A simple module to replace `Backbone.sync` with *localStorage*-based 2 | // persistence. Models are given GUIDS, and saved into a JSON object. Simple 3 | // as that. 4 | 5 | // Generate four random hex digits. 6 | function S4() { 7 | return (((1+Math.random())*0x10000)|0).toString(16).substring(1); 8 | }; 9 | 10 | // Generate a pseudo-GUID by concatenating random hexadecimal. 11 | function guid() { 12 | return (S4()+S4()+"-"+S4()+"-"+S4()+"-"+S4()+"-"+S4()+S4()+S4()); 13 | }; 14 | 15 | // Our Store is represented by a single JS object in *localStorage*. Create it 16 | // with a meaningful name, like the name you'd give a table. 17 | var Store = function(name) { 18 | this.name = name; 19 | var store = localStorage.getItem(this.name); 20 | this.data = (store && JSON.parse(store)) || {}; 21 | }; 22 | 23 | _.extend(Store.prototype, { 24 | 25 | // Save the current state of the **Store** to *localStorage*. 26 | save: function() { 27 | localStorage.setItem(this.name, JSON.stringify(this.data)); 28 | }, 29 | 30 | // Add a model, giving it a (hopefully)-unique GUID, if it doesn't already 31 | // have an id of it's own. 32 | create: function(model) { 33 | if (!model.id) model.id = model.attributes.id = guid(); 34 | this.data[model.id] = model; 35 | this.save(); 36 | return model; 37 | }, 38 | 39 | // Update a model by replacing its copy in `this.data`. 40 | update: function(model) { 41 | this.data[model.id] = model; 42 | this.save(); 43 | return model; 44 | }, 45 | 46 | // Retrieve a model from `this.data` by id. 47 | find: function(model) { 48 | return this.data[model.id]; 49 | }, 50 | 51 | // Return the array of all models currently in storage. 52 | findAll: function() { 53 | return _.values(this.data); 54 | }, 55 | 56 | // Delete a model from `this.data`, returning it. 57 | destroy: function(model) { 58 | delete this.data[model.id]; 59 | this.save(); 60 | return model; 61 | } 62 | 63 | }); 64 | 65 | // Override `Backbone.sync` to use delegate to the model or collection's 66 | // *localStorage* property, which should be an instance of `Store`. 67 | Backbone.sync = function(method, model, options) { 68 | 69 | var resp; 70 | var store = model.localStorage || model.collection.localStorage; 71 | 72 | switch (method) { 73 | case "read": resp = model.id ? store.find(model) : store.findAll(); break; 74 | case "create": resp = store.create(model); break; 75 | case "update": resp = store.update(model); break; 76 | case "delete": resp = store.destroy(model); break; 77 | } 78 | 79 | if (resp) { 80 | options.success(resp); 81 | } else { 82 | options.error("Record not found"); 83 | } 84 | }; -------------------------------------------------------------------------------- /css/main.css: -------------------------------------------------------------------------------- 1 | @import url(http://fonts.googleapis.com/css?family=Slabo+27px); 2 | body { 3 | font-family: helvetica, arial; 4 | font-size: 14px; 5 | color: #333; 6 | background: #34495e; 7 | overflow: hidden; 8 | } 9 | 10 | #outer-container { 11 | padding: 20px; 12 | margin: 50px auto; 13 | width: 630px; 14 | background: #ecf0f1; 15 | border: 1px solid #888; 16 | border-radius: 5px; 17 | height: 650px; 18 | } 19 | 20 | .sub-title { 21 | font-size: 2em; 22 | text-align: center; 23 | margin: 10px 20px; 24 | margin-left: 60px; 25 | font-family: 'Slabo 27px', serif; 26 | } 27 | .return { 28 | margin-top: 30px; 29 | font-size: 50px; 30 | color: #f1f1f1; 31 | line-height: 30px; 32 | border: 2px solid #e74c3c; 33 | padding: 20px; 34 | border-radius: 3px; 35 | background-color: #e74c3c; 36 | color: #fff; 37 | } 38 | .return a { 39 | text-decoration: none; 40 | color: #fff; 41 | } 42 | .return:hover{ 43 | opacity: 0.8; 44 | } 45 | .hidden { 46 | display: none; 47 | } 48 | 49 | /* Pick winner/clear-all actions*/ 50 | .hidden-trigger { 51 | /* Use opacity: 0 if you want it to be invisible until hover */ 52 | /*opacity: 0;*/ 53 | opacity: 0.9; 54 | } 55 | 56 | .hidden-trigger:hover{ 57 | opacity: 0.8; 58 | } 59 | 60 | /* Place the pick winner/clear all in a relatively hidden spot 61 | bottom left, and bottom right respectively */ 62 | #pick-winner { 63 | text-align: center; 64 | background-color:#2ecc71; 65 | padding: 10px; 66 | margin-top: 10px; 67 | color: #fff; 68 | border-radius: 7px; 69 | } 70 | 71 | #clear-all-safety { 72 | text-align: center; 73 | background-color: #e74c3c; 74 | margin-top: 15px; 75 | padding: 10px; 76 | color: #fff; 77 | border-radius: 7px; 78 | } 79 | 80 | #clear-all { 81 | text-align: center; 82 | padding: 5px; 83 | margin-top: 5px; 84 | border-radius: 7px; 85 | color: #fff; 86 | background-color: #e74c3c; 87 | font-weight: bold; 88 | } 89 | /* File area */ 90 | #file-trigger { 91 | padding-top: 5px; 92 | } 93 | 94 | #file-area { 95 | display: none; 96 | text-align: center; 97 | padding-top: 5px; 98 | } 99 | 100 | #file-submit { 101 | font-size: 14px; 102 | padding: 4px; 103 | border: 1px solid #2ecc71; 104 | margin-top: 10px; 105 | border-radius: 3px; 106 | color: #fff; 107 | background-color: #2ecc71; 108 | } 109 | 110 | #file-submit:hover { 111 | cursor: pointer; 112 | } 113 | 114 | #file-submit:disabled { 115 | cursor: not-allowed; 116 | border: 1px solid #999; 117 | background: #ccc; 118 | color: #aaa; 119 | } 120 | 121 | /* Input area */ 122 | #name-input { 123 | font-size: 30px; 124 | font-family: helvetica; 125 | width: 620px; 126 | padding: 5px; 127 | border-radius: 3px; 128 | background-color: #ecf0f1; 129 | outline: none; 130 | border: 2px solid #ccc; 131 | } 132 | 133 | #name-input::-webkit-input-placeholder { 134 | color: #aaa; 135 | text-align: center; 136 | } 137 | 138 | .num-entries { 139 | float: right; 140 | color: #ccc; 141 | } 142 | 143 | /* List of names */ 144 | #name-list-container { 145 | overflow-y: auto; 146 | height: 375px; 147 | margin-top: 10px; 148 | margin-right: -20px; 149 | padding-right: 20px; 150 | } 151 | 152 | 153 | ul { 154 | list-style: none; 155 | padding: 0; 156 | } 157 | 158 | .name-list li { 159 | display: table; 160 | table-layout: fixed; 161 | width: 300px; 162 | font-size: 22px; 163 | margin: 10px 0; 164 | } 165 | 166 | .name-list.left { 167 | float: left; 168 | } 169 | 170 | .name-list.right { 171 | float: right; 172 | } 173 | 174 | .row { 175 | display: table-row; 176 | } 177 | 178 | .row:hover { 179 | background-color: #dedede; 180 | } 181 | 182 | .name { 183 | display: table-cell; 184 | padding: 5px; 185 | background-color: #1abc9c; 186 | border-top-right-radius: 7px; 187 | color: #fff; 188 | border-bottom-right-radius: 7px; 189 | } 190 | 191 | .remove{ 192 | display: table-cell; 193 | padding: 5px; 194 | background-color: #1abc9c; 195 | border-top-left-radius: 7px; 196 | border-bottom-left-radius: 7px; 197 | } 198 | 199 | /* Selecting name */ 200 | #selecting-name { 201 | font-size: 120px; 202 | font-weight: bold; 203 | text-align: center; 204 | padding: 60px 0; 205 | color: #888; 206 | } 207 | 208 | /* Winner */ 209 | .winner { 210 | position: relative; 211 | display: table; 212 | width: 100%; 213 | } 214 | 215 | .winner .name { 216 | padding: 0; 217 | background-color: transparent; 218 | color: #666; 219 | } 220 | 221 | #selecting-name { 222 | -moz-transition: all 1s ease-out; 223 | -webkit-transition: all 1s ease-out; 224 | z-index: 5000; 225 | position: relative; 226 | } 227 | 228 | #selecting-name.final-winner { 229 | color: #333; 230 | -moz-transform: scale(2); 231 | -webkit-transform: scale(2); 232 | } 233 | 234 | .winner .icon-font.remove { 235 | position: absolute; 236 | top: 0; 237 | left: 0; 238 | font-size: 50px; 239 | background-color: transparent; 240 | } 241 | 242 | #kies-ander { 243 | font-size: 50px; 244 | color: #f1f1f1; 245 | line-height: 30px; 246 | border: 2px solid #2ecc71; 247 | padding: 10px; 248 | border-radius: 3px; 249 | background-color: #2ecc71; 250 | } 251 | 252 | #kies-ander:hover { 253 | opacity: 0.8; 254 | cursor: pointer; 255 | } 256 | 257 | #blanket { 258 | position: fixed; 259 | top: 0; 260 | left: 0; 261 | width: 100%; 262 | height: 100%; 263 | background: #fff; 264 | opacity: 0.65; 265 | z-index: 1; 266 | } 267 | 268 | /* Icon fonts thanks to fontello - http://fontello.com/ */ 269 | @font-face { 270 | font-family: 'fontello'; 271 | src: url("fontello/fontello.eot"); 272 | src: url("fontello/fontello.eot?#iefix") format('embedded-opentype'), url("fontello/fontello.woff") format('woff'), url("fontello/fontello.ttf") format('truetype'), url("fontello/fontello.svg#fontello") format('svg'); 273 | font-weight: normal; 274 | font-style: normal; 275 | } 276 | 277 | .icon-font { 278 | font-family: 'fontello'; 279 | font-style: normal; 280 | font-weight: normal; 281 | speak: none; 282 | text-decoration: inherit; 283 | width: 1em; 284 | margin-right: 0.2em; 285 | text-align: center; 286 | line-height: 1em; 287 | } 288 | 289 | .remove::before { 290 | content: 'a'; 291 | color: #fff; 292 | } 293 | 294 | .remove:hover::before { 295 | content: 'b'; 296 | color: #e74c3c; 297 | opacity: 1; 298 | } 299 | 300 | -------------------------------------------------------------------------------- /js/main.js: -------------------------------------------------------------------------------- 1 | $(function() { 2 | var FADE_DELAY_MS = 300, 3 | EXTRA_DELAY = 100, 4 | SHOW_NAME_DELAY = 90, 5 | MIN_LIST_LENGTH = 60, 6 | MAX_LIST_LENGTH = 300; 7 | 8 | // Super simple model - really just need it for the collection 9 | var NameEntryModel = Backbone.Model.extend({ 10 | defaults: { 11 | name: '' 12 | }, 13 | 14 | remove: function() { 15 | this.destroy(); 16 | } 17 | }); 18 | 19 | // Basic tempalte to allow removing of names if needed 20 | var NameEntryView = Backbone.View.extend({ 21 | tagName: 'li', 22 | template: _.template($('#name-entry-template').html()), 23 | 24 | events: { 25 | 'click .remove' : 'remove' 26 | }, 27 | 28 | render: function() { 29 | this.$el.html(this.template(this.model.toJSON())); 30 | return this; 31 | }, 32 | 33 | remove: function(){ 34 | this.model.remove(); 35 | this.$el.remove(); 36 | } 37 | }); 38 | 39 | // Basic template for the winner's name 40 | var NameWinnerView = Backbone.View.extend({ 41 | className: 'winner', 42 | template: _.template($('#name-winner-template').html()), 43 | 44 | events: { 45 | 'click .remove' : 'remove' 46 | }, 47 | 48 | render: function(){ 49 | this.$el.html(this.template(this.model.toJSON())); 50 | return this; 51 | }, 52 | 53 | remove: function(){ 54 | this.model.remove(); 55 | this.$el.remove(); 56 | // total hack, but meah 57 | $("#blanket").remove(); 58 | $("#selecting-name").removeClass("final-winner") 59 | .html("

Kies een andere winnaar

terug

") 60 | } 61 | }); 62 | 63 | // Collection to hold the name models 64 | var NameEntryCollection = Backbone.Collection.extend({ 65 | model: NameEntryModel, 66 | localStorage: new Store('name-entry-list'), 67 | all: function() { 68 | return this.filter(function(){ 69 | return true; /* Need to clone the collection */ 70 | }) 71 | } 72 | }); 73 | 74 | var Entries = new NameEntryCollection; 75 | 76 | var App = Backbone.View.extend({ 77 | el: $('#outer-container'), 78 | 79 | events: { 80 | 'keypress #name-input' : 'createEntry', 81 | 'click #file-trigger' : 'showHideFileUpload', 82 | 'change #file-input' : 'showFileSample', 83 | 'click #file-submit' : 'createEntriesFromFile', 84 | 'click #pick-winner' : 'pickWinner', 85 | 'click #kies-ander' : 'pickWinner', 86 | 'click #clear-all-safety' : 'clearAllSafety', 87 | 'click #clear-all' : 'clearAll' 88 | }, 89 | 90 | initialize: function(){ 91 | this.input = this.$('#name-input'); 92 | 93 | Entries.bind('add', this.addEntry, this); 94 | Entries.bind('reset', this.addAll, this); 95 | Entries.bind('all', this.render, this); 96 | 97 | Entries.fetch(); 98 | }, 99 | 100 | showHideFileUpload: function(){ 101 | $("#file-area").toggle("visible"); 102 | }, 103 | 104 | showFileSample: function(e) { 105 | if (window.File && window.FileReader) { 106 | var file = e.target.files[0]; //only one file 107 | $("#file-sample").text("type: " + file.type); 108 | var reader = new FileReader(); 109 | reader.onload = (function(file){ 110 | return function(e) { 111 | var contents = e.target.result || ""; 112 | // assumed separators: newline comma pipe 113 | var result = contents.split(/,|\||\r\n|\r|\n/g); 114 | // remove any empty cases 115 | result = _.reject(result, function(val){return val === ""}); 116 | $("#file-sample").data("contents", result.join(",")); 117 | $("#file-sample").text(""); 118 | $("#file-sample").append("Lijst met namen:
"); 119 | _.each(_.first(result, 10), function(val) { 120 | $("#file-sample").append(_.escape(val) + "
"); 121 | }); 122 | $("#file-sample").append("...etc..."); 123 | return result; 124 | } 125 | })(file); 126 | reader.readAsText(file); 127 | } else { 128 | $("#file-sample").text("Your browser doesn't support file reading. Try using Chrome?") 129 | $("#file-submitd").attr("disabled", true); 130 | } 131 | }, 132 | 133 | createEntriesFromFile: function() { 134 | var values = $("#file-sample").data("contents") || ""; 135 | _.each(values.split(","), function(val) { 136 | Entries.create({name: val}); 137 | }); 138 | $("#file-input").val(""); 139 | $("#file-sample").text(""); 140 | }, 141 | 142 | createEntry: function(e){ 143 | if (e.which !== 13) return; 144 | var inputValue = this.input.val().trim(); 145 | 146 | if (!inputValue) return; 147 | 148 | Entries.create({name: inputValue}); 149 | this.input.val(''); 150 | }, 151 | 152 | addEntry: function(nameEntry){ 153 | var view = new NameEntryView({model: nameEntry}), 154 | entryListLength = Entries.length, 155 | nameListClass; 156 | 157 | // Add to the left/right side of the name list 158 | if (entryListLength !== 0) { 159 | var indexOfEntry = _.indexOf(Entries.models, nameEntry); 160 | nameListClass = (indexOfEntry % 2 === 0) ? '.name-list.left' : '.name-list.right'; 161 | } else { 162 | nameListClass = (Entries.length % 2 === 0) ? '.name-list.right' : '.name-list.left'; 163 | } 164 | this.$(nameListClass).prepend(view.render().el); 165 | }, 166 | 167 | addAll: function(){ 168 | Entries.each(this.addEntry); 169 | }, 170 | 171 | render: function() { 172 | $('.num-entries').text(Entries.length + ' namen'); 173 | }, 174 | 175 | getEntries: function() { 176 | return Entries.all(); 177 | }, 178 | 179 | getShuffled: function(){ 180 | // underscore's shuffle uses the Fisher-Yates shuffle 181 | // should be equiv of picking a name out of a hat 182 | return _.shuffle(Entries.all()); 183 | }, 184 | 185 | getShuffledNames: function(){ 186 | return this.getShuffled().map(function(model){ 187 | // console.log("Name: " + model.get('name')); 188 | return model.get('name'); 189 | }); 190 | }, 191 | 192 | buildDecentShuffledList: function(){ 193 | console.log("Shuffle and build list of names"); 194 | var list = this.getShuffledNames(); 195 | // Cap at MAX_LIST_LENGTH so the shuffle doesn't take too long 196 | if (list.length > MAX_LIST_LENGTH - 30) { 197 | list = _.sample(list, MAX_LIST_LENGTH); 198 | } 199 | // Keep appending shuffled list until we reach a minimum length 200 | // min length is only there so the shuffle looks impressive 201 | while (list.length < MIN_LIST_LENGTH) { 202 | list = list.concat(this.getShuffledNames()); 203 | } 204 | console.log("Total list length:" + list.length); 205 | return list; 206 | }, 207 | 208 | pickWinner: function() { 209 | var that = this, 210 | shuffledNames = this.buildDecentShuffledList(); 211 | 212 | console.log("Picking winner..."); 213 | // Clean-up existing space 214 | if ($("#entry-container").length > 0) { 215 | $("#entry-container").slideUp(FADE_DELAY_MS, function(){ 216 | $(this).remove(); 217 | $("#winner-container").slideDown(FADE_DELAY_MS, function(){ 218 | $(this).removeClass("hidden"); 219 | that.easingTimeout(that.showNames, shuffledNames, SHOW_NAME_DELAY); 220 | }); 221 | }); 222 | } else { 223 | $("#kies-ander").fadeOut(FADE_DELAY_MS, function(){ 224 | $(this).remove(); 225 | that.easingTimeout(that.showNames, shuffledNames, SHOW_NAME_DELAY); 226 | }); 227 | } 228 | 229 | }, 230 | 231 | showNames: function(names) { 232 | $("#selecting-name").text(names[0]); 233 | // console.log("Showed: " + names[0]); 234 | return names.slice(1); 235 | }, 236 | 237 | easingTimeout: function(callback, names, delay){ 238 | var that = this; 239 | var internalCallback = function(names, delay){ 240 | return function(){ 241 | if (names && names.length !== 0) { 242 | if (names.length === 5) { 243 | delay += EXTRA_DELAY; // Increase overall delay slightly 244 | } 245 | if (names.length < 2) { 246 | delay += 50; // Keep adding to delay, to get the 'slow-down' effect 247 | } 248 | names = callback(names); 249 | setTimeout(internalCallback, delay); 250 | } else { 251 | var selectedWinner = $("#selecting-name").text().trim(), 252 | winner = Entries.where({name: selectedWinner})[0], 253 | winnerView = new NameWinnerView({model: winner}); 254 | //console.log("Winner is: " + selectedWinner); 255 | $("#selecting-name").html(winnerView.render().el); 256 | setTimeout(function(){ 257 | $("#selecting-name").addClass("final-winner"); 258 | $("body").append("

"); 259 | }, 100); 260 | } 261 | } 262 | }(names, delay); 263 | 264 | setTimeout(internalCallback, 0); 265 | }, 266 | 267 | clearAllSafety: function() { 268 | this.$el.append("

Ja, ik weet zeker dat ik de namen wil verwijderen

"); 269 | // Give a 3 second delay before removing clear-all switch 270 | setTimeout(function(){ 271 | $("#clear-all").remove(); 272 | }, 10000); 273 | }, 274 | 275 | clearAll: function() { 276 | _.each(Entries.all(), function(entry){ 277 | entry.remove(); 278 | }) 279 | $(".name-list").empty(); 280 | $("#clear-all").remove(); 281 | return false; 282 | } 283 | }); 284 | 285 | MyApp = new App; 286 | }); 287 | 288 | -------------------------------------------------------------------------------- /js/lib/underscore-v1.5.2.js: -------------------------------------------------------------------------------- 1 | // Underscore.js 1.5.2 2 | // http://underscorejs.org 3 | // (c) 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors 4 | // Underscore may be freely distributed under the MIT license. 5 | 6 | (function() { 7 | 8 | // Baseline setup 9 | // -------------- 10 | 11 | // Establish the root object, `window` in the browser, or `exports` on the server. 12 | var root = this; 13 | 14 | // Save the previous value of the `_` variable. 15 | var previousUnderscore = root._; 16 | 17 | // Establish the object that gets returned to break out of a loop iteration. 18 | var breaker = {}; 19 | 20 | // Save bytes in the minified (but not gzipped) version: 21 | var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype; 22 | 23 | // Create quick reference variables for speed access to core prototypes. 24 | var 25 | push = ArrayProto.push, 26 | slice = ArrayProto.slice, 27 | concat = ArrayProto.concat, 28 | toString = ObjProto.toString, 29 | hasOwnProperty = ObjProto.hasOwnProperty; 30 | 31 | // All **ECMAScript 5** native function implementations that we hope to use 32 | // are declared here. 33 | var 34 | nativeForEach = ArrayProto.forEach, 35 | nativeMap = ArrayProto.map, 36 | nativeReduce = ArrayProto.reduce, 37 | nativeReduceRight = ArrayProto.reduceRight, 38 | nativeFilter = ArrayProto.filter, 39 | nativeEvery = ArrayProto.every, 40 | nativeSome = ArrayProto.some, 41 | nativeIndexOf = ArrayProto.indexOf, 42 | nativeLastIndexOf = ArrayProto.lastIndexOf, 43 | nativeIsArray = Array.isArray, 44 | nativeKeys = Object.keys, 45 | nativeBind = FuncProto.bind; 46 | 47 | // Create a safe reference to the Underscore object for use below. 48 | var _ = function(obj) { 49 | if (obj instanceof _) return obj; 50 | if (!(this instanceof _)) return new _(obj); 51 | this._wrapped = obj; 52 | }; 53 | 54 | // Export the Underscore object for **Node.js**, with 55 | // backwards-compatibility for the old `require()` API. If we're in 56 | // the browser, add `_` as a global object via a string identifier, 57 | // for Closure Compiler "advanced" mode. 58 | if (typeof exports !== 'undefined') { 59 | if (typeof module !== 'undefined' && module.exports) { 60 | exports = module.exports = _; 61 | } 62 | exports._ = _; 63 | } else { 64 | root._ = _; 65 | } 66 | 67 | // Current version. 68 | _.VERSION = '1.5.2'; 69 | 70 | // Collection Functions 71 | // -------------------- 72 | 73 | // The cornerstone, an `each` implementation, aka `forEach`. 74 | // Handles objects with the built-in `forEach`, arrays, and raw objects. 75 | // Delegates to **ECMAScript 5**'s native `forEach` if available. 76 | var each = _.each = _.forEach = function(obj, iterator, context) { 77 | if (obj == null) return; 78 | if (nativeForEach && obj.forEach === nativeForEach) { 79 | obj.forEach(iterator, context); 80 | } else if (obj.length === +obj.length) { 81 | for (var i = 0, length = obj.length; i < length; i++) { 82 | if (iterator.call(context, obj[i], i, obj) === breaker) return; 83 | } 84 | } else { 85 | var keys = _.keys(obj); 86 | for (var i = 0, length = keys.length; i < length; i++) { 87 | if (iterator.call(context, obj[keys[i]], keys[i], obj) === breaker) return; 88 | } 89 | } 90 | }; 91 | 92 | // Return the results of applying the iterator to each element. 93 | // Delegates to **ECMAScript 5**'s native `map` if available. 94 | _.map = _.collect = function(obj, iterator, context) { 95 | var results = []; 96 | if (obj == null) return results; 97 | if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context); 98 | each(obj, function(value, index, list) { 99 | results.push(iterator.call(context, value, index, list)); 100 | }); 101 | return results; 102 | }; 103 | 104 | var reduceError = 'Reduce of empty array with no initial value'; 105 | 106 | // **Reduce** builds up a single result from a list of values, aka `inject`, 107 | // or `foldl`. Delegates to **ECMAScript 5**'s native `reduce` if available. 108 | _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) { 109 | var initial = arguments.length > 2; 110 | if (obj == null) obj = []; 111 | if (nativeReduce && obj.reduce === nativeReduce) { 112 | if (context) iterator = _.bind(iterator, context); 113 | return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator); 114 | } 115 | each(obj, function(value, index, list) { 116 | if (!initial) { 117 | memo = value; 118 | initial = true; 119 | } else { 120 | memo = iterator.call(context, memo, value, index, list); 121 | } 122 | }); 123 | if (!initial) throw new TypeError(reduceError); 124 | return memo; 125 | }; 126 | 127 | // The right-associative version of reduce, also known as `foldr`. 128 | // Delegates to **ECMAScript 5**'s native `reduceRight` if available. 129 | _.reduceRight = _.foldr = function(obj, iterator, memo, context) { 130 | var initial = arguments.length > 2; 131 | if (obj == null) obj = []; 132 | if (nativeReduceRight && obj.reduceRight === nativeReduceRight) { 133 | if (context) iterator = _.bind(iterator, context); 134 | return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator); 135 | } 136 | var length = obj.length; 137 | if (length !== +length) { 138 | var keys = _.keys(obj); 139 | length = keys.length; 140 | } 141 | each(obj, function(value, index, list) { 142 | index = keys ? keys[--length] : --length; 143 | if (!initial) { 144 | memo = obj[index]; 145 | initial = true; 146 | } else { 147 | memo = iterator.call(context, memo, obj[index], index, list); 148 | } 149 | }); 150 | if (!initial) throw new TypeError(reduceError); 151 | return memo; 152 | }; 153 | 154 | // Return the first value which passes a truth test. Aliased as `detect`. 155 | _.find = _.detect = function(obj, iterator, context) { 156 | var result; 157 | any(obj, function(value, index, list) { 158 | if (iterator.call(context, value, index, list)) { 159 | result = value; 160 | return true; 161 | } 162 | }); 163 | return result; 164 | }; 165 | 166 | // Return all the elements that pass a truth test. 167 | // Delegates to **ECMAScript 5**'s native `filter` if available. 168 | // Aliased as `select`. 169 | _.filter = _.select = function(obj, iterator, context) { 170 | var results = []; 171 | if (obj == null) return results; 172 | if (nativeFilter && obj.filter === nativeFilter) return obj.filter(iterator, context); 173 | each(obj, function(value, index, list) { 174 | if (iterator.call(context, value, index, list)) results.push(value); 175 | }); 176 | return results; 177 | }; 178 | 179 | // Return all the elements for which a truth test fails. 180 | _.reject = function(obj, iterator, context) { 181 | return _.filter(obj, function(value, index, list) { 182 | return !iterator.call(context, value, index, list); 183 | }, context); 184 | }; 185 | 186 | // Determine whether all of the elements match a truth test. 187 | // Delegates to **ECMAScript 5**'s native `every` if available. 188 | // Aliased as `all`. 189 | _.every = _.all = function(obj, iterator, context) { 190 | iterator || (iterator = _.identity); 191 | var result = true; 192 | if (obj == null) return result; 193 | if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context); 194 | each(obj, function(value, index, list) { 195 | if (!(result = result && iterator.call(context, value, index, list))) return breaker; 196 | }); 197 | return !!result; 198 | }; 199 | 200 | // Determine if at least one element in the object matches a truth test. 201 | // Delegates to **ECMAScript 5**'s native `some` if available. 202 | // Aliased as `any`. 203 | var any = _.some = _.any = function(obj, iterator, context) { 204 | iterator || (iterator = _.identity); 205 | var result = false; 206 | if (obj == null) return result; 207 | if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context); 208 | each(obj, function(value, index, list) { 209 | if (result || (result = iterator.call(context, value, index, list))) return breaker; 210 | }); 211 | return !!result; 212 | }; 213 | 214 | // Determine if the array or object contains a given value (using `===`). 215 | // Aliased as `include`. 216 | _.contains = _.include = function(obj, target) { 217 | if (obj == null) return false; 218 | if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1; 219 | return any(obj, function(value) { 220 | return value === target; 221 | }); 222 | }; 223 | 224 | // Invoke a method (with arguments) on every item in a collection. 225 | _.invoke = function(obj, method) { 226 | var args = slice.call(arguments, 2); 227 | var isFunc = _.isFunction(method); 228 | return _.map(obj, function(value) { 229 | return (isFunc ? method : value[method]).apply(value, args); 230 | }); 231 | }; 232 | 233 | // Convenience version of a common use case of `map`: fetching a property. 234 | _.pluck = function(obj, key) { 235 | return _.map(obj, function(value){ return value[key]; }); 236 | }; 237 | 238 | // Convenience version of a common use case of `filter`: selecting only objects 239 | // containing specific `key:value` pairs. 240 | _.where = function(obj, attrs, first) { 241 | if (_.isEmpty(attrs)) return first ? void 0 : []; 242 | return _[first ? 'find' : 'filter'](obj, function(value) { 243 | for (var key in attrs) { 244 | if (attrs[key] !== value[key]) return false; 245 | } 246 | return true; 247 | }); 248 | }; 249 | 250 | // Convenience version of a common use case of `find`: getting the first object 251 | // containing specific `key:value` pairs. 252 | _.findWhere = function(obj, attrs) { 253 | return _.where(obj, attrs, true); 254 | }; 255 | 256 | // Return the maximum element or (element-based computation). 257 | // Can't optimize arrays of integers longer than 65,535 elements. 258 | // See [WebKit Bug 80797](https://bugs.webkit.org/show_bug.cgi?id=80797) 259 | _.max = function(obj, iterator, context) { 260 | if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) { 261 | return Math.max.apply(Math, obj); 262 | } 263 | if (!iterator && _.isEmpty(obj)) return -Infinity; 264 | var result = {computed : -Infinity, value: -Infinity}; 265 | each(obj, function(value, index, list) { 266 | var computed = iterator ? iterator.call(context, value, index, list) : value; 267 | computed > result.computed && (result = {value : value, computed : computed}); 268 | }); 269 | return result.value; 270 | }; 271 | 272 | // Return the minimum element (or element-based computation). 273 | _.min = function(obj, iterator, context) { 274 | if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) { 275 | return Math.min.apply(Math, obj); 276 | } 277 | if (!iterator && _.isEmpty(obj)) return Infinity; 278 | var result = {computed : Infinity, value: Infinity}; 279 | each(obj, function(value, index, list) { 280 | var computed = iterator ? iterator.call(context, value, index, list) : value; 281 | computed < result.computed && (result = {value : value, computed : computed}); 282 | }); 283 | return result.value; 284 | }; 285 | 286 | // Shuffle an array, using the modern version of the 287 | // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher�ates_shuffle). 288 | _.shuffle = function(obj) { 289 | var rand; 290 | var index = 0; 291 | var shuffled = []; 292 | each(obj, function(value) { 293 | rand = _.random(index++); 294 | shuffled[index - 1] = shuffled[rand]; 295 | shuffled[rand] = value; 296 | }); 297 | return shuffled; 298 | }; 299 | 300 | // Sample **n** random values from an array. 301 | // If **n** is not specified, returns a single random element from the array. 302 | // The internal `guard` argument allows it to work with `map`. 303 | _.sample = function(obj, n, guard) { 304 | if (arguments.length < 2 || guard) { 305 | return obj[_.random(obj.length - 1)]; 306 | } 307 | return _.shuffle(obj).slice(0, Math.max(0, n)); 308 | }; 309 | 310 | // An internal function to generate lookup iterators. 311 | var lookupIterator = function(value) { 312 | return _.isFunction(value) ? value : function(obj){ return obj[value]; }; 313 | }; 314 | 315 | // Sort the object's values by a criterion produced by an iterator. 316 | _.sortBy = function(obj, value, context) { 317 | var iterator = lookupIterator(value); 318 | return _.pluck(_.map(obj, function(value, index, list) { 319 | return { 320 | value: value, 321 | index: index, 322 | criteria: iterator.call(context, value, index, list) 323 | }; 324 | }).sort(function(left, right) { 325 | var a = left.criteria; 326 | var b = right.criteria; 327 | if (a !== b) { 328 | if (a > b || a === void 0) return 1; 329 | if (a < b || b === void 0) return -1; 330 | } 331 | return left.index - right.index; 332 | }), 'value'); 333 | }; 334 | 335 | // An internal function used for aggregate "group by" operations. 336 | var group = function(behavior) { 337 | return function(obj, value, context) { 338 | var result = {}; 339 | var iterator = value == null ? _.identity : lookupIterator(value); 340 | each(obj, function(value, index) { 341 | var key = iterator.call(context, value, index, obj); 342 | behavior(result, key, value); 343 | }); 344 | return result; 345 | }; 346 | }; 347 | 348 | // Groups the object's values by a criterion. Pass either a string attribute 349 | // to group by, or a function that returns the criterion. 350 | _.groupBy = group(function(result, key, value) { 351 | (_.has(result, key) ? result[key] : (result[key] = [])).push(value); 352 | }); 353 | 354 | // Indexes the object's values by a criterion, similar to `groupBy`, but for 355 | // when you know that your index values will be unique. 356 | _.indexBy = group(function(result, key, value) { 357 | result[key] = value; 358 | }); 359 | 360 | // Counts instances of an object that group by a certain criterion. Pass 361 | // either a string attribute to count by, or a function that returns the 362 | // criterion. 363 | _.countBy = group(function(result, key) { 364 | _.has(result, key) ? result[key]++ : result[key] = 1; 365 | }); 366 | 367 | // Use a comparator function to figure out the smallest index at which 368 | // an object should be inserted so as to maintain order. Uses binary search. 369 | _.sortedIndex = function(array, obj, iterator, context) { 370 | iterator = iterator == null ? _.identity : lookupIterator(iterator); 371 | var value = iterator.call(context, obj); 372 | var low = 0, high = array.length; 373 | while (low < high) { 374 | var mid = (low + high) >>> 1; 375 | iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid; 376 | } 377 | return low; 378 | }; 379 | 380 | // Safely create a real, live array from anything iterable. 381 | _.toArray = function(obj) { 382 | if (!obj) return []; 383 | if (_.isArray(obj)) return slice.call(obj); 384 | if (obj.length === +obj.length) return _.map(obj, _.identity); 385 | return _.values(obj); 386 | }; 387 | 388 | // Return the number of elements in an object. 389 | _.size = function(obj) { 390 | if (obj == null) return 0; 391 | return (obj.length === +obj.length) ? obj.length : _.keys(obj).length; 392 | }; 393 | 394 | // Array Functions 395 | // --------------- 396 | 397 | // Get the first element of an array. Passing **n** will return the first N 398 | // values in the array. Aliased as `head` and `take`. The **guard** check 399 | // allows it to work with `_.map`. 400 | _.first = _.head = _.take = function(array, n, guard) { 401 | if (array == null) return void 0; 402 | return (n == null) || guard ? array[0] : slice.call(array, 0, n); 403 | }; 404 | 405 | // Returns everything but the last entry of the array. Especially useful on 406 | // the arguments object. Passing **n** will return all the values in 407 | // the array, excluding the last N. The **guard** check allows it to work with 408 | // `_.map`. 409 | _.initial = function(array, n, guard) { 410 | return slice.call(array, 0, array.length - ((n == null) || guard ? 1 : n)); 411 | }; 412 | 413 | // Get the last element of an array. Passing **n** will return the last N 414 | // values in the array. The **guard** check allows it to work with `_.map`. 415 | _.last = function(array, n, guard) { 416 | if (array == null) return void 0; 417 | if ((n == null) || guard) { 418 | return array[array.length - 1]; 419 | } else { 420 | return slice.call(array, Math.max(array.length - n, 0)); 421 | } 422 | }; 423 | 424 | // Returns everything but the first entry of the array. Aliased as `tail` and `drop`. 425 | // Especially useful on the arguments object. Passing an **n** will return 426 | // the rest N values in the array. The **guard** 427 | // check allows it to work with `_.map`. 428 | _.rest = _.tail = _.drop = function(array, n, guard) { 429 | return slice.call(array, (n == null) || guard ? 1 : n); 430 | }; 431 | 432 | // Trim out all falsy values from an array. 433 | _.compact = function(array) { 434 | return _.filter(array, _.identity); 435 | }; 436 | 437 | // Internal implementation of a recursive `flatten` function. 438 | var flatten = function(input, shallow, output) { 439 | if (shallow && _.every(input, _.isArray)) { 440 | return concat.apply(output, input); 441 | } 442 | each(input, function(value) { 443 | if (_.isArray(value) || _.isArguments(value)) { 444 | shallow ? push.apply(output, value) : flatten(value, shallow, output); 445 | } else { 446 | output.push(value); 447 | } 448 | }); 449 | return output; 450 | }; 451 | 452 | // Flatten out an array, either recursively (by default), or just one level. 453 | _.flatten = function(array, shallow) { 454 | return flatten(array, shallow, []); 455 | }; 456 | 457 | // Return a version of the array that does not contain the specified value(s). 458 | _.without = function(array) { 459 | return _.difference(array, slice.call(arguments, 1)); 460 | }; 461 | 462 | // Produce a duplicate-free version of the array. If the array has already 463 | // been sorted, you have the option of using a faster algorithm. 464 | // Aliased as `unique`. 465 | _.uniq = _.unique = function(array, isSorted, iterator, context) { 466 | if (_.isFunction(isSorted)) { 467 | context = iterator; 468 | iterator = isSorted; 469 | isSorted = false; 470 | } 471 | var initial = iterator ? _.map(array, iterator, context) : array; 472 | var results = []; 473 | var seen = []; 474 | each(initial, function(value, index) { 475 | if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) { 476 | seen.push(value); 477 | results.push(array[index]); 478 | } 479 | }); 480 | return results; 481 | }; 482 | 483 | // Produce an array that contains the union: each distinct element from all of 484 | // the passed-in arrays. 485 | _.union = function() { 486 | return _.uniq(_.flatten(arguments, true)); 487 | }; 488 | 489 | // Produce an array that contains every item shared between all the 490 | // passed-in arrays. 491 | _.intersection = function(array) { 492 | var rest = slice.call(arguments, 1); 493 | return _.filter(_.uniq(array), function(item) { 494 | return _.every(rest, function(other) { 495 | return _.indexOf(other, item) >= 0; 496 | }); 497 | }); 498 | }; 499 | 500 | // Take the difference between one array and a number of other arrays. 501 | // Only the elements present in just the first array will remain. 502 | _.difference = function(array) { 503 | var rest = concat.apply(ArrayProto, slice.call(arguments, 1)); 504 | return _.filter(array, function(value){ return !_.contains(rest, value); }); 505 | }; 506 | 507 | // Zip together multiple lists into a single array -- elements that share 508 | // an index go together. 509 | _.zip = function() { 510 | var length = _.max(_.pluck(arguments, "length").concat(0)); 511 | var results = new Array(length); 512 | for (var i = 0; i < length; i++) { 513 | results[i] = _.pluck(arguments, '' + i); 514 | } 515 | return results; 516 | }; 517 | 518 | // Converts lists into objects. Pass either a single array of `[key, value]` 519 | // pairs, or two parallel arrays of the same length -- one of keys, and one of 520 | // the corresponding values. 521 | _.object = function(list, values) { 522 | if (list == null) return {}; 523 | var result = {}; 524 | for (var i = 0, length = list.length; i < length; i++) { 525 | if (values) { 526 | result[list[i]] = values[i]; 527 | } else { 528 | result[list[i][0]] = list[i][1]; 529 | } 530 | } 531 | return result; 532 | }; 533 | 534 | // If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**), 535 | // we need this function. Return the position of the first occurrence of an 536 | // item in an array, or -1 if the item is not included in the array. 537 | // Delegates to **ECMAScript 5**'s native `indexOf` if available. 538 | // If the array is large and already in sort order, pass `true` 539 | // for **isSorted** to use binary search. 540 | _.indexOf = function(array, item, isSorted) { 541 | if (array == null) return -1; 542 | var i = 0, length = array.length; 543 | if (isSorted) { 544 | if (typeof isSorted == 'number') { 545 | i = (isSorted < 0 ? Math.max(0, length + isSorted) : isSorted); 546 | } else { 547 | i = _.sortedIndex(array, item); 548 | return array[i] === item ? i : -1; 549 | } 550 | } 551 | if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted); 552 | for (; i < length; i++) if (array[i] === item) return i; 553 | return -1; 554 | }; 555 | 556 | // Delegates to **ECMAScript 5**'s native `lastIndexOf` if available. 557 | _.lastIndexOf = function(array, item, from) { 558 | if (array == null) return -1; 559 | var hasIndex = from != null; 560 | if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) { 561 | return hasIndex ? array.lastIndexOf(item, from) : array.lastIndexOf(item); 562 | } 563 | var i = (hasIndex ? from : array.length); 564 | while (i--) if (array[i] === item) return i; 565 | return -1; 566 | }; 567 | 568 | // Generate an integer Array containing an arithmetic progression. A port of 569 | // the native Python `range()` function. See 570 | // [the Python documentation](http://docs.python.org/library/functions.html#range). 571 | _.range = function(start, stop, step) { 572 | if (arguments.length <= 1) { 573 | stop = start || 0; 574 | start = 0; 575 | } 576 | step = arguments[2] || 1; 577 | 578 | var length = Math.max(Math.ceil((stop - start) / step), 0); 579 | var idx = 0; 580 | var range = new Array(length); 581 | 582 | while(idx < length) { 583 | range[idx++] = start; 584 | start += step; 585 | } 586 | 587 | return range; 588 | }; 589 | 590 | // Function (ahem) Functions 591 | // ------------------ 592 | 593 | // Reusable constructor function for prototype setting. 594 | var ctor = function(){}; 595 | 596 | // Create a function bound to a given object (assigning `this`, and arguments, 597 | // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if 598 | // available. 599 | _.bind = function(func, context) { 600 | var args, bound; 601 | if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1)); 602 | if (!_.isFunction(func)) throw new TypeError; 603 | args = slice.call(arguments, 2); 604 | return bound = function() { 605 | if (!(this instanceof bound)) return func.apply(context, args.concat(slice.call(arguments))); 606 | ctor.prototype = func.prototype; 607 | var self = new ctor; 608 | ctor.prototype = null; 609 | var result = func.apply(self, args.concat(slice.call(arguments))); 610 | if (Object(result) === result) return result; 611 | return self; 612 | }; 613 | }; 614 | 615 | // Partially apply a function by creating a version that has had some of its 616 | // arguments pre-filled, without changing its dynamic `this` context. 617 | _.partial = function(func) { 618 | var args = slice.call(arguments, 1); 619 | return function() { 620 | return func.apply(this, args.concat(slice.call(arguments))); 621 | }; 622 | }; 623 | 624 | // Bind all of an object's methods to that object. Useful for ensuring that 625 | // all callbacks defined on an object belong to it. 626 | _.bindAll = function(obj) { 627 | var funcs = slice.call(arguments, 1); 628 | if (funcs.length === 0) throw new Error("bindAll must be passed function names"); 629 | each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); }); 630 | return obj; 631 | }; 632 | 633 | // Memoize an expensive function by storing its results. 634 | _.memoize = function(func, hasher) { 635 | var memo = {}; 636 | hasher || (hasher = _.identity); 637 | return function() { 638 | var key = hasher.apply(this, arguments); 639 | return _.has(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments)); 640 | }; 641 | }; 642 | 643 | // Delays a function for the given number of milliseconds, and then calls 644 | // it with the arguments supplied. 645 | _.delay = function(func, wait) { 646 | var args = slice.call(arguments, 2); 647 | return setTimeout(function(){ return func.apply(null, args); }, wait); 648 | }; 649 | 650 | // Defers a function, scheduling it to run after the current call stack has 651 | // cleared. 652 | _.defer = function(func) { 653 | return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1))); 654 | }; 655 | 656 | // Returns a function, that, when invoked, will only be triggered at most once 657 | // during a given window of time. Normally, the throttled function will run 658 | // as much as it can, without ever going more than once per `wait` duration; 659 | // but if you'd like to disable the execution on the leading edge, pass 660 | // `{leading: false}`. To disable execution on the trailing edge, ditto. 661 | _.throttle = function(func, wait, options) { 662 | var context, args, result; 663 | var timeout = null; 664 | var previous = 0; 665 | options || (options = {}); 666 | var later = function() { 667 | previous = options.leading === false ? 0 : new Date; 668 | timeout = null; 669 | result = func.apply(context, args); 670 | }; 671 | return function() { 672 | var now = new Date; 673 | if (!previous && options.leading === false) previous = now; 674 | var remaining = wait - (now - previous); 675 | context = this; 676 | args = arguments; 677 | if (remaining <= 0) { 678 | clearTimeout(timeout); 679 | timeout = null; 680 | previous = now; 681 | result = func.apply(context, args); 682 | } else if (!timeout && options.trailing !== false) { 683 | timeout = setTimeout(later, remaining); 684 | } 685 | return result; 686 | }; 687 | }; 688 | 689 | // Returns a function, that, as long as it continues to be invoked, will not 690 | // be triggered. The function will be called after it stops being called for 691 | // N milliseconds. If `immediate` is passed, trigger the function on the 692 | // leading edge, instead of the trailing. 693 | _.debounce = function(func, wait, immediate) { 694 | var timeout, args, context, timestamp, result; 695 | return function() { 696 | context = this; 697 | args = arguments; 698 | timestamp = new Date(); 699 | var later = function() { 700 | var last = (new Date()) - timestamp; 701 | if (last < wait) { 702 | timeout = setTimeout(later, wait - last); 703 | } else { 704 | timeout = null; 705 | if (!immediate) result = func.apply(context, args); 706 | } 707 | }; 708 | var callNow = immediate && !timeout; 709 | if (!timeout) { 710 | timeout = setTimeout(later, wait); 711 | } 712 | if (callNow) result = func.apply(context, args); 713 | return result; 714 | }; 715 | }; 716 | 717 | // Returns a function that will be executed at most one time, no matter how 718 | // often you call it. Useful for lazy initialization. 719 | _.once = function(func) { 720 | var ran = false, memo; 721 | return function() { 722 | if (ran) return memo; 723 | ran = true; 724 | memo = func.apply(this, arguments); 725 | func = null; 726 | return memo; 727 | }; 728 | }; 729 | 730 | // Returns the first function passed as an argument to the second, 731 | // allowing you to adjust arguments, run code before and after, and 732 | // conditionally execute the original function. 733 | _.wrap = function(func, wrapper) { 734 | return function() { 735 | var args = [func]; 736 | push.apply(args, arguments); 737 | return wrapper.apply(this, args); 738 | }; 739 | }; 740 | 741 | // Returns a function that is the composition of a list of functions, each 742 | // consuming the return value of the function that follows. 743 | _.compose = function() { 744 | var funcs = arguments; 745 | return function() { 746 | var args = arguments; 747 | for (var i = funcs.length - 1; i >= 0; i--) { 748 | args = [funcs[i].apply(this, args)]; 749 | } 750 | return args[0]; 751 | }; 752 | }; 753 | 754 | // Returns a function that will only be executed after being called N times. 755 | _.after = function(times, func) { 756 | return function() { 757 | if (--times < 1) { 758 | return func.apply(this, arguments); 759 | } 760 | }; 761 | }; 762 | 763 | // Object Functions 764 | // ---------------- 765 | 766 | // Retrieve the names of an object's properties. 767 | // Delegates to **ECMAScript 5**'s native `Object.keys` 768 | _.keys = nativeKeys || function(obj) { 769 | if (obj !== Object(obj)) throw new TypeError('Invalid object'); 770 | var keys = []; 771 | for (var key in obj) if (_.has(obj, key)) keys.push(key); 772 | return keys; 773 | }; 774 | 775 | // Retrieve the values of an object's properties. 776 | _.values = function(obj) { 777 | var keys = _.keys(obj); 778 | var length = keys.length; 779 | var values = new Array(length); 780 | for (var i = 0; i < length; i++) { 781 | values[i] = obj[keys[i]]; 782 | } 783 | return values; 784 | }; 785 | 786 | // Convert an object into a list of `[key, value]` pairs. 787 | _.pairs = function(obj) { 788 | var keys = _.keys(obj); 789 | var length = keys.length; 790 | var pairs = new Array(length); 791 | for (var i = 0; i < length; i++) { 792 | pairs[i] = [keys[i], obj[keys[i]]]; 793 | } 794 | return pairs; 795 | }; 796 | 797 | // Invert the keys and values of an object. The values must be serializable. 798 | _.invert = function(obj) { 799 | var result = {}; 800 | var keys = _.keys(obj); 801 | for (var i = 0, length = keys.length; i < length; i++) { 802 | result[obj[keys[i]]] = keys[i]; 803 | } 804 | return result; 805 | }; 806 | 807 | // Return a sorted list of the function names available on the object. 808 | // Aliased as `methods` 809 | _.functions = _.methods = function(obj) { 810 | var names = []; 811 | for (var key in obj) { 812 | if (_.isFunction(obj[key])) names.push(key); 813 | } 814 | return names.sort(); 815 | }; 816 | 817 | // Extend a given object with all the properties in passed-in object(s). 818 | _.extend = function(obj) { 819 | each(slice.call(arguments, 1), function(source) { 820 | if (source) { 821 | for (var prop in source) { 822 | obj[prop] = source[prop]; 823 | } 824 | } 825 | }); 826 | return obj; 827 | }; 828 | 829 | // Return a copy of the object only containing the whitelisted properties. 830 | _.pick = function(obj) { 831 | var copy = {}; 832 | var keys = concat.apply(ArrayProto, slice.call(arguments, 1)); 833 | each(keys, function(key) { 834 | if (key in obj) copy[key] = obj[key]; 835 | }); 836 | return copy; 837 | }; 838 | 839 | // Return a copy of the object without the blacklisted properties. 840 | _.omit = function(obj) { 841 | var copy = {}; 842 | var keys = concat.apply(ArrayProto, slice.call(arguments, 1)); 843 | for (var key in obj) { 844 | if (!_.contains(keys, key)) copy[key] = obj[key]; 845 | } 846 | return copy; 847 | }; 848 | 849 | // Fill in a given object with default properties. 850 | _.defaults = function(obj) { 851 | each(slice.call(arguments, 1), function(source) { 852 | if (source) { 853 | for (var prop in source) { 854 | if (obj[prop] === void 0) obj[prop] = source[prop]; 855 | } 856 | } 857 | }); 858 | return obj; 859 | }; 860 | 861 | // Create a (shallow-cloned) duplicate of an object. 862 | _.clone = function(obj) { 863 | if (!_.isObject(obj)) return obj; 864 | return _.isArray(obj) ? obj.slice() : _.extend({}, obj); 865 | }; 866 | 867 | // Invokes interceptor with the obj, and then returns obj. 868 | // The primary purpose of this method is to "tap into" a method chain, in 869 | // order to perform operations on intermediate results within the chain. 870 | _.tap = function(obj, interceptor) { 871 | interceptor(obj); 872 | return obj; 873 | }; 874 | 875 | // Internal recursive comparison function for `isEqual`. 876 | var eq = function(a, b, aStack, bStack) { 877 | // Identical objects are equal. `0 === -0`, but they aren't identical. 878 | // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal). 879 | if (a === b) return a !== 0 || 1 / a == 1 / b; 880 | // A strict comparison is necessary because `null == undefined`. 881 | if (a == null || b == null) return a === b; 882 | // Unwrap any wrapped objects. 883 | if (a instanceof _) a = a._wrapped; 884 | if (b instanceof _) b = b._wrapped; 885 | // Compare `[[Class]]` names. 886 | var className = toString.call(a); 887 | if (className != toString.call(b)) return false; 888 | switch (className) { 889 | // Strings, numbers, dates, and booleans are compared by value. 890 | case '[object String]': 891 | // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is 892 | // equivalent to `new String("5")`. 893 | return a == String(b); 894 | case '[object Number]': 895 | // `NaN`s are equivalent, but non-reflexive. An `egal` comparison is performed for 896 | // other numeric values. 897 | return a != +a ? b != +b : (a == 0 ? 1 / a == 1 / b : a == +b); 898 | case '[object Date]': 899 | case '[object Boolean]': 900 | // Coerce dates and booleans to numeric primitive values. Dates are compared by their 901 | // millisecond representations. Note that invalid dates with millisecond representations 902 | // of `NaN` are not equivalent. 903 | return +a == +b; 904 | // RegExps are compared by their source patterns and flags. 905 | case '[object RegExp]': 906 | return a.source == b.source && 907 | a.global == b.global && 908 | a.multiline == b.multiline && 909 | a.ignoreCase == b.ignoreCase; 910 | } 911 | if (typeof a != 'object' || typeof b != 'object') return false; 912 | // Assume equality for cyclic structures. The algorithm for detecting cyclic 913 | // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`. 914 | var length = aStack.length; 915 | while (length--) { 916 | // Linear search. Performance is inversely proportional to the number of 917 | // unique nested structures. 918 | if (aStack[length] == a) return bStack[length] == b; 919 | } 920 | // Objects with different constructors are not equivalent, but `Object`s 921 | // from different frames are. 922 | var aCtor = a.constructor, bCtor = b.constructor; 923 | if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) && 924 | _.isFunction(bCtor) && (bCtor instanceof bCtor))) { 925 | return false; 926 | } 927 | // Add the first object to the stack of traversed objects. 928 | aStack.push(a); 929 | bStack.push(b); 930 | var size = 0, result = true; 931 | // Recursively compare objects and arrays. 932 | if (className == '[object Array]') { 933 | // Compare array lengths to determine if a deep comparison is necessary. 934 | size = a.length; 935 | result = size == b.length; 936 | if (result) { 937 | // Deep compare the contents, ignoring non-numeric properties. 938 | while (size--) { 939 | if (!(result = eq(a[size], b[size], aStack, bStack))) break; 940 | } 941 | } 942 | } else { 943 | // Deep compare objects. 944 | for (var key in a) { 945 | if (_.has(a, key)) { 946 | // Count the expected number of properties. 947 | size++; 948 | // Deep compare each member. 949 | if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break; 950 | } 951 | } 952 | // Ensure that both objects contain the same number of properties. 953 | if (result) { 954 | for (key in b) { 955 | if (_.has(b, key) && !(size--)) break; 956 | } 957 | result = !size; 958 | } 959 | } 960 | // Remove the first object from the stack of traversed objects. 961 | aStack.pop(); 962 | bStack.pop(); 963 | return result; 964 | }; 965 | 966 | // Perform a deep comparison to check if two objects are equal. 967 | _.isEqual = function(a, b) { 968 | return eq(a, b, [], []); 969 | }; 970 | 971 | // Is a given array, string, or object empty? 972 | // An "empty" object has no enumerable own-properties. 973 | _.isEmpty = function(obj) { 974 | if (obj == null) return true; 975 | if (_.isArray(obj) || _.isString(obj)) return obj.length === 0; 976 | for (var key in obj) if (_.has(obj, key)) return false; 977 | return true; 978 | }; 979 | 980 | // Is a given value a DOM element? 981 | _.isElement = function(obj) { 982 | return !!(obj && obj.nodeType === 1); 983 | }; 984 | 985 | // Is a given value an array? 986 | // Delegates to ECMA5's native Array.isArray 987 | _.isArray = nativeIsArray || function(obj) { 988 | return toString.call(obj) == '[object Array]'; 989 | }; 990 | 991 | // Is a given variable an object? 992 | _.isObject = function(obj) { 993 | return obj === Object(obj); 994 | }; 995 | 996 | // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp. 997 | each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) { 998 | _['is' + name] = function(obj) { 999 | return toString.call(obj) == '[object ' + name + ']'; 1000 | }; 1001 | }); 1002 | 1003 | // Define a fallback version of the method in browsers (ahem, IE), where 1004 | // there isn't any inspectable "Arguments" type. 1005 | if (!_.isArguments(arguments)) { 1006 | _.isArguments = function(obj) { 1007 | return !!(obj && _.has(obj, 'callee')); 1008 | }; 1009 | } 1010 | 1011 | // Optimize `isFunction` if appropriate. 1012 | if (typeof (/./) !== 'function') { 1013 | _.isFunction = function(obj) { 1014 | return typeof obj === 'function'; 1015 | }; 1016 | } 1017 | 1018 | // Is a given object a finite number? 1019 | _.isFinite = function(obj) { 1020 | return isFinite(obj) && !isNaN(parseFloat(obj)); 1021 | }; 1022 | 1023 | // Is the given value `NaN`? (NaN is the only number which does not equal itself). 1024 | _.isNaN = function(obj) { 1025 | return _.isNumber(obj) && obj != +obj; 1026 | }; 1027 | 1028 | // Is a given value a boolean? 1029 | _.isBoolean = function(obj) { 1030 | return obj === true || obj === false || toString.call(obj) == '[object Boolean]'; 1031 | }; 1032 | 1033 | // Is a given value equal to null? 1034 | _.isNull = function(obj) { 1035 | return obj === null; 1036 | }; 1037 | 1038 | // Is a given variable undefined? 1039 | _.isUndefined = function(obj) { 1040 | return obj === void 0; 1041 | }; 1042 | 1043 | // Shortcut function for checking if an object has a given property directly 1044 | // on itself (in other words, not on a prototype). 1045 | _.has = function(obj, key) { 1046 | return hasOwnProperty.call(obj, key); 1047 | }; 1048 | 1049 | // Utility Functions 1050 | // ----------------- 1051 | 1052 | // Run Underscore.js in *noConflict* mode, returning the `_` variable to its 1053 | // previous owner. Returns a reference to the Underscore object. 1054 | _.noConflict = function() { 1055 | root._ = previousUnderscore; 1056 | return this; 1057 | }; 1058 | 1059 | // Keep the identity function around for default iterators. 1060 | _.identity = function(value) { 1061 | return value; 1062 | }; 1063 | 1064 | // Run a function **n** times. 1065 | _.times = function(n, iterator, context) { 1066 | var accum = Array(Math.max(0, n)); 1067 | for (var i = 0; i < n; i++) accum[i] = iterator.call(context, i); 1068 | return accum; 1069 | }; 1070 | 1071 | // Return a random integer between min and max (inclusive). 1072 | _.random = function(min, max) { 1073 | if (max == null) { 1074 | max = min; 1075 | min = 0; 1076 | } 1077 | return min + Math.floor(Math.random() * (max - min + 1)); 1078 | }; 1079 | 1080 | // List of HTML entities for escaping. 1081 | var entityMap = { 1082 | escape: { 1083 | '&': '&', 1084 | '<': '<', 1085 | '>': '>', 1086 | '"': '"', 1087 | "'": ''' 1088 | } 1089 | }; 1090 | entityMap.unescape = _.invert(entityMap.escape); 1091 | 1092 | // Regexes containing the keys and values listed immediately above. 1093 | var entityRegexes = { 1094 | escape: new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'), 1095 | unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g') 1096 | }; 1097 | 1098 | // Functions for escaping and unescaping strings to/from HTML interpolation. 1099 | _.each(['escape', 'unescape'], function(method) { 1100 | _[method] = function(string) { 1101 | if (string == null) return ''; 1102 | return ('' + string).replace(entityRegexes[method], function(match) { 1103 | return entityMap[method][match]; 1104 | }); 1105 | }; 1106 | }); 1107 | 1108 | // If the value of the named `property` is a function then invoke it with the 1109 | // `object` as context; otherwise, return it. 1110 | _.result = function(object, property) { 1111 | if (object == null) return void 0; 1112 | var value = object[property]; 1113 | return _.isFunction(value) ? value.call(object) : value; 1114 | }; 1115 | 1116 | // Add your own custom functions to the Underscore object. 1117 | _.mixin = function(obj) { 1118 | each(_.functions(obj), function(name) { 1119 | var func = _[name] = obj[name]; 1120 | _.prototype[name] = function() { 1121 | var args = [this._wrapped]; 1122 | push.apply(args, arguments); 1123 | return result.call(this, func.apply(_, args)); 1124 | }; 1125 | }); 1126 | }; 1127 | 1128 | // Generate a unique integer id (unique within the entire client session). 1129 | // Useful for temporary DOM ids. 1130 | var idCounter = 0; 1131 | _.uniqueId = function(prefix) { 1132 | var id = ++idCounter + ''; 1133 | return prefix ? prefix + id : id; 1134 | }; 1135 | 1136 | // By default, Underscore uses ERB-style template delimiters, change the 1137 | // following template settings to use alternative delimiters. 1138 | _.templateSettings = { 1139 | evaluate : /<%([\s\S]+?)%>/g, 1140 | interpolate : /<%=([\s\S]+?)%>/g, 1141 | escape : /<%-([\s\S]+?)%>/g 1142 | }; 1143 | 1144 | // When customizing `templateSettings`, if you don't want to define an 1145 | // interpolation, evaluation or escaping regex, we need one that is 1146 | // guaranteed not to match. 1147 | var noMatch = /(.)^/; 1148 | 1149 | // Certain characters need to be escaped so that they can be put into a 1150 | // string literal. 1151 | var escapes = { 1152 | "'": "'", 1153 | '\\': '\\', 1154 | '\r': 'r', 1155 | '\n': 'n', 1156 | '\t': 't', 1157 | '\u2028': 'u2028', 1158 | '\u2029': 'u2029' 1159 | }; 1160 | 1161 | var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g; 1162 | 1163 | // JavaScript micro-templating, similar to John Resig's implementation. 1164 | // Underscore templating handles arbitrary delimiters, preserves whitespace, 1165 | // and correctly escapes quotes within interpolated code. 1166 | _.template = function(text, data, settings) { 1167 | var render; 1168 | settings = _.defaults({}, settings, _.templateSettings); 1169 | 1170 | // Combine delimiters into one regular expression via alternation. 1171 | var matcher = new RegExp([ 1172 | (settings.escape || noMatch).source, 1173 | (settings.interpolate || noMatch).source, 1174 | (settings.evaluate || noMatch).source 1175 | ].join('|') + '|$', 'g'); 1176 | 1177 | // Compile the template source, escaping string literals appropriately. 1178 | var index = 0; 1179 | var source = "__p+='"; 1180 | text.replace(matcher, function(match, escape, interpolate, evaluate, offset) { 1181 | source += text.slice(index, offset) 1182 | .replace(escaper, function(match) { return '\\' + escapes[match]; }); 1183 | 1184 | if (escape) { 1185 | source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'"; 1186 | } 1187 | if (interpolate) { 1188 | source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'"; 1189 | } 1190 | if (evaluate) { 1191 | source += "';\n" + evaluate + "\n__p+='"; 1192 | } 1193 | index = offset + match.length; 1194 | return match; 1195 | }); 1196 | source += "';\n"; 1197 | 1198 | // If a variable is not specified, place data values in local scope. 1199 | if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n'; 1200 | 1201 | source = "var __t,__p='',__j=Array.prototype.join," + 1202 | "print=function(){__p+=__j.call(arguments,'');};\n" + 1203 | source + "return __p;\n"; 1204 | 1205 | try { 1206 | render = new Function(settings.variable || 'obj', '_', source); 1207 | } catch (e) { 1208 | e.source = source; 1209 | throw e; 1210 | } 1211 | 1212 | if (data) return render(data, _); 1213 | var template = function(data) { 1214 | return render.call(this, data, _); 1215 | }; 1216 | 1217 | // Provide the compiled function source as a convenience for precompilation. 1218 | template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}'; 1219 | 1220 | return template; 1221 | }; 1222 | 1223 | // Add a "chain" function, which will delegate to the wrapper. 1224 | _.chain = function(obj) { 1225 | return _(obj).chain(); 1226 | }; 1227 | 1228 | // OOP 1229 | // --------------- 1230 | // If Underscore is called as a function, it returns a wrapped object that 1231 | // can be used OO-style. This wrapper holds altered versions of all the 1232 | // underscore functions. Wrapped objects may be chained. 1233 | 1234 | // Helper function to continue chaining intermediate results. 1235 | var result = function(obj) { 1236 | return this._chain ? _(obj).chain() : obj; 1237 | }; 1238 | 1239 | // Add all of the Underscore functions to the wrapper object. 1240 | _.mixin(_); 1241 | 1242 | // Add all mutator Array functions to the wrapper. 1243 | each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) { 1244 | var method = ArrayProto[name]; 1245 | _.prototype[name] = function() { 1246 | var obj = this._wrapped; 1247 | method.apply(obj, arguments); 1248 | if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0]; 1249 | return result.call(this, obj); 1250 | }; 1251 | }); 1252 | 1253 | // Add all accessor Array functions to the wrapper. 1254 | each(['concat', 'join', 'slice'], function(name) { 1255 | var method = ArrayProto[name]; 1256 | _.prototype[name] = function() { 1257 | return result.call(this, method.apply(this._wrapped, arguments)); 1258 | }; 1259 | }); 1260 | 1261 | _.extend(_.prototype, { 1262 | 1263 | // Start chaining a wrapped Underscore object. 1264 | chain: function() { 1265 | this._chain = true; 1266 | return this; 1267 | }, 1268 | 1269 | // Extracts the result from a wrapped and chained object. 1270 | value: function() { 1271 | return this._wrapped; 1272 | } 1273 | 1274 | }); 1275 | 1276 | }).call(this); -------------------------------------------------------------------------------- /js/lib/backbone-v0.9.2.js: -------------------------------------------------------------------------------- 1 | // Backbone.js 0.9.2 2 | 3 | // (c) 2010-2012 Jeremy Ashkenas, DocumentCloud Inc. 4 | // Backbone may be freely distributed under the MIT license. 5 | // For all details and documentation: 6 | // http://backbonejs.org 7 | 8 | (function(){ 9 | 10 | // Initial Setup 11 | // ------------- 12 | 13 | // Save a reference to the global object (`window` in the browser, `global` 14 | // on the server). 15 | var root = this; 16 | 17 | // Save the previous value of the `Backbone` variable, so that it can be 18 | // restored later on, if `noConflict` is used. 19 | var previousBackbone = root.Backbone; 20 | 21 | // Create a local reference to slice/splice. 22 | var slice = Array.prototype.slice; 23 | var splice = Array.prototype.splice; 24 | 25 | // The top-level namespace. All public Backbone classes and modules will 26 | // be attached to this. Exported for both CommonJS and the browser. 27 | var Backbone; 28 | if (typeof exports !== 'undefined') { 29 | Backbone = exports; 30 | } else { 31 | Backbone = root.Backbone = {}; 32 | } 33 | 34 | // Current version of the library. Keep in sync with `package.json`. 35 | Backbone.VERSION = '0.9.2'; 36 | 37 | // Require Underscore, if we're on the server, and it's not already present. 38 | var _ = root._; 39 | if (!_ && (typeof require !== 'undefined')) _ = require('underscore'); 40 | 41 | // For Backbone's purposes, jQuery, Zepto, or Ender owns the `$` variable. 42 | var $ = root.jQuery || root.Zepto || root.ender; 43 | 44 | // Set the JavaScript library that will be used for DOM manipulation and 45 | // Ajax calls (a.k.a. the `$` variable). By default Backbone will use: jQuery, 46 | // Zepto, or Ender; but the `setDomLibrary()` method lets you inject an 47 | // alternate JavaScript library (or a mock library for testing your views 48 | // outside of a browser). 49 | Backbone.setDomLibrary = function(lib) { 50 | $ = lib; 51 | }; 52 | 53 | // Runs Backbone.js in *noConflict* mode, returning the `Backbone` variable 54 | // to its previous owner. Returns a reference to this Backbone object. 55 | Backbone.noConflict = function() { 56 | root.Backbone = previousBackbone; 57 | return this; 58 | }; 59 | 60 | // Turn on `emulateHTTP` to support legacy HTTP servers. Setting this option 61 | // will fake `"PUT"` and `"DELETE"` requests via the `_method` parameter and 62 | // set a `X-Http-Method-Override` header. 63 | Backbone.emulateHTTP = false; 64 | 65 | // Turn on `emulateJSON` to support legacy servers that can't deal with direct 66 | // `application/json` requests ... will encode the body as 67 | // `application/x-www-form-urlencoded` instead and will send the model in a 68 | // form param named `model`. 69 | Backbone.emulateJSON = false; 70 | 71 | // Backbone.Events 72 | // ----------------- 73 | 74 | // Regular expression used to split event strings 75 | var eventSplitter = /\s+/; 76 | 77 | // A module that can be mixed in to *any object* in order to provide it with 78 | // custom events. You may bind with `on` or remove with `off` callback functions 79 | // to an event; trigger`-ing an event fires all callbacks in succession. 80 | // 81 | // var object = {}; 82 | // _.extend(object, Backbone.Events); 83 | // object.on('expand', function(){ alert('expanded'); }); 84 | // object.trigger('expand'); 85 | // 86 | var Events = Backbone.Events = { 87 | 88 | // Bind one or more space separated events, `events`, to a `callback` 89 | // function. Passing `"all"` will bind the callback to all events fired. 90 | on: function(events, callback, context) { 91 | 92 | var calls, event, node, tail, list; 93 | if (!callback) return this; 94 | events = events.split(eventSplitter); 95 | calls = this._callbacks || (this._callbacks = {}); 96 | 97 | // Create an immutable callback list, allowing traversal during 98 | // modification. The tail is an empty object that will always be used 99 | // as the next node. 100 | while (event = events.shift()) { 101 | list = calls[event]; 102 | node = list ? list.tail : {}; 103 | node.next = tail = {}; 104 | node.context = context; 105 | node.callback = callback; 106 | calls[event] = {tail: tail, next: list ? list.next : node}; 107 | } 108 | 109 | return this; 110 | }, 111 | 112 | // Remove one or many callbacks. If `context` is null, removes all callbacks 113 | // with that function. If `callback` is null, removes all callbacks for the 114 | // event. If `events` is null, removes all bound callbacks for all events. 115 | off: function(events, callback, context) { 116 | var event, calls, node, tail, cb, ctx; 117 | 118 | // No events, or removing *all* events. 119 | if (!(calls = this._callbacks)) return; 120 | if (!(events || callback || context)) { 121 | delete this._callbacks; 122 | return this; 123 | } 124 | 125 | // Loop through the listed events and contexts, splicing them out of the 126 | // linked list of callbacks if appropriate. 127 | events = events ? events.split(eventSplitter) : _.keys(calls); 128 | while (event = events.shift()) { 129 | node = calls[event]; 130 | delete calls[event]; 131 | if (!node || !(callback || context)) continue; 132 | // Create a new list, omitting the indicated callbacks. 133 | tail = node.tail; 134 | while ((node = node.next) !== tail) { 135 | cb = node.callback; 136 | ctx = node.context; 137 | if ((callback && cb !== callback) || (context && ctx !== context)) { 138 | this.on(event, cb, ctx); 139 | } 140 | } 141 | } 142 | 143 | return this; 144 | }, 145 | 146 | // Trigger one or many events, firing all bound callbacks. Callbacks are 147 | // passed the same arguments as `trigger` is, apart from the event name 148 | // (unless you're listening on `"all"`, which will cause your callback to 149 | // receive the true name of the event as the first argument). 150 | trigger: function(events) { 151 | var event, node, calls, tail, args, all, rest; 152 | if (!(calls = this._callbacks)) return this; 153 | all = calls.all; 154 | events = events.split(eventSplitter); 155 | rest = slice.call(arguments, 1); 156 | 157 | // For each event, walk through the linked list of callbacks twice, 158 | // first to trigger the event, then to trigger any `"all"` callbacks. 159 | while (event = events.shift()) { 160 | if (node = calls[event]) { 161 | tail = node.tail; 162 | while ((node = node.next) !== tail) { 163 | node.callback.apply(node.context || this, rest); 164 | } 165 | } 166 | if (node = all) { 167 | tail = node.tail; 168 | args = [event].concat(rest); 169 | while ((node = node.next) !== tail) { 170 | node.callback.apply(node.context || this, args); 171 | } 172 | } 173 | } 174 | 175 | return this; 176 | } 177 | 178 | }; 179 | 180 | // Aliases for backwards compatibility. 181 | Events.bind = Events.on; 182 | Events.unbind = Events.off; 183 | 184 | // Backbone.Model 185 | // -------------- 186 | 187 | // Create a new model, with defined attributes. A client id (`cid`) 188 | // is automatically generated and assigned for you. 189 | var Model = Backbone.Model = function(attributes, options) { 190 | var defaults; 191 | attributes || (attributes = {}); 192 | if (options && options.parse) attributes = this.parse(attributes); 193 | if (defaults = getValue(this, 'defaults')) { 194 | attributes = _.extend({}, defaults, attributes); 195 | } 196 | if (options && options.collection) this.collection = options.collection; 197 | this.attributes = {}; 198 | this._escapedAttributes = {}; 199 | this.cid = _.uniqueId('c'); 200 | this.changed = {}; 201 | this._silent = {}; 202 | this._pending = {}; 203 | this.set(attributes, {silent: true}); 204 | // Reset change tracking. 205 | this.changed = {}; 206 | this._silent = {}; 207 | this._pending = {}; 208 | this._previousAttributes = _.clone(this.attributes); 209 | this.initialize.apply(this, arguments); 210 | }; 211 | 212 | // Attach all inheritable methods to the Model prototype. 213 | _.extend(Model.prototype, Events, { 214 | 215 | // A hash of attributes whose current and previous value differ. 216 | changed: null, 217 | 218 | // A hash of attributes that have silently changed since the last time 219 | // `change` was called. Will become pending attributes on the next call. 220 | _silent: null, 221 | 222 | // A hash of attributes that have changed since the last `'change'` event 223 | // began. 224 | _pending: null, 225 | 226 | // The default name for the JSON `id` attribute is `"id"`. MongoDB and 227 | // CouchDB users may want to set this to `"_id"`. 228 | idAttribute: 'id', 229 | 230 | // Initialize is an empty function by default. Override it with your own 231 | // initialization logic. 232 | initialize: function(){}, 233 | 234 | // Return a copy of the model's `attributes` object. 235 | toJSON: function(options) { 236 | return _.clone(this.attributes); 237 | }, 238 | 239 | // Get the value of an attribute. 240 | get: function(attr) { 241 | return this.attributes[attr]; 242 | }, 243 | 244 | // Get the HTML-escaped value of an attribute. 245 | escape: function(attr) { 246 | var html; 247 | if (html = this._escapedAttributes[attr]) return html; 248 | var val = this.get(attr); 249 | return this._escapedAttributes[attr] = _.escape(val == null ? '' : '' + val); 250 | }, 251 | 252 | // Returns `true` if the attribute contains a value that is not null 253 | // or undefined. 254 | has: function(attr) { 255 | return this.get(attr) != null; 256 | }, 257 | 258 | // Set a hash of model attributes on the object, firing `"change"` unless 259 | // you choose to silence it. 260 | set: function(key, value, options) { 261 | var attrs, attr, val; 262 | 263 | // Handle both `"key", value` and `{key: value}` -style arguments. 264 | if (_.isObject(key) || key == null) { 265 | attrs = key; 266 | options = value; 267 | } else { 268 | attrs = {}; 269 | attrs[key] = value; 270 | } 271 | 272 | // Extract attributes and options. 273 | options || (options = {}); 274 | if (!attrs) return this; 275 | if (attrs instanceof Model) attrs = attrs.attributes; 276 | if (options.unset) for (attr in attrs) attrs[attr] = void 0; 277 | 278 | // Run validation. 279 | if (!this._validate(attrs, options)) return false; 280 | 281 | // Check for changes of `id`. 282 | if (this.idAttribute in attrs) this.id = attrs[this.idAttribute]; 283 | 284 | var changes = options.changes = {}; 285 | var now = this.attributes; 286 | var escaped = this._escapedAttributes; 287 | var prev = this._previousAttributes || {}; 288 | 289 | // For each `set` attribute... 290 | for (attr in attrs) { 291 | val = attrs[attr]; 292 | 293 | // If the new and current value differ, record the change. 294 | if (!_.isEqual(now[attr], val) || (options.unset && _.has(now, attr))) { 295 | delete escaped[attr]; 296 | (options.silent ? this._silent : changes)[attr] = true; 297 | } 298 | 299 | // Update or delete the current value. 300 | options.unset ? delete now[attr] : now[attr] = val; 301 | 302 | // If the new and previous value differ, record the change. If not, 303 | // then remove changes for this attribute. 304 | if (!_.isEqual(prev[attr], val) || (_.has(now, attr) != _.has(prev, attr))) { 305 | this.changed[attr] = val; 306 | if (!options.silent) this._pending[attr] = true; 307 | } else { 308 | delete this.changed[attr]; 309 | delete this._pending[attr]; 310 | } 311 | } 312 | 313 | // Fire the `"change"` events. 314 | if (!options.silent) this.change(options); 315 | return this; 316 | }, 317 | 318 | // Remove an attribute from the model, firing `"change"` unless you choose 319 | // to silence it. `unset` is a noop if the attribute doesn't exist. 320 | unset: function(attr, options) { 321 | (options || (options = {})).unset = true; 322 | return this.set(attr, null, options); 323 | }, 324 | 325 | // Clear all attributes on the model, firing `"change"` unless you choose 326 | // to silence it. 327 | clear: function(options) { 328 | (options || (options = {})).unset = true; 329 | return this.set(_.clone(this.attributes), options); 330 | }, 331 | 332 | // Fetch the model from the server. If the server's representation of the 333 | // model differs from its current attributes, they will be overriden, 334 | // triggering a `"change"` event. 335 | fetch: function(options) { 336 | options = options ? _.clone(options) : {}; 337 | var model = this; 338 | var success = options.success; 339 | options.success = function(resp, status, xhr) { 340 | if (!model.set(model.parse(resp, xhr), options)) return false; 341 | if (success) success(model, resp); 342 | }; 343 | options.error = Backbone.wrapError(options.error, model, options); 344 | return (this.sync || Backbone.sync).call(this, 'read', this, options); 345 | }, 346 | 347 | // Set a hash of model attributes, and sync the model to the server. 348 | // If the server returns an attributes hash that differs, the model's 349 | // state will be `set` again. 350 | save: function(key, value, options) { 351 | var attrs, current; 352 | 353 | // Handle both `("key", value)` and `({key: value})` -style calls. 354 | if (_.isObject(key) || key == null) { 355 | attrs = key; 356 | options = value; 357 | } else { 358 | attrs = {}; 359 | attrs[key] = value; 360 | } 361 | options = options ? _.clone(options) : {}; 362 | 363 | // If we're "wait"-ing to set changed attributes, validate early. 364 | if (options.wait) { 365 | if (!this._validate(attrs, options)) return false; 366 | current = _.clone(this.attributes); 367 | } 368 | 369 | // Regular saves `set` attributes before persisting to the server. 370 | var silentOptions = _.extend({}, options, {silent: true}); 371 | if (attrs && !this.set(attrs, options.wait ? silentOptions : options)) { 372 | return false; 373 | } 374 | 375 | // After a successful server-side save, the client is (optionally) 376 | // updated with the server-side state. 377 | var model = this; 378 | var success = options.success; 379 | options.success = function(resp, status, xhr) { 380 | var serverAttrs = model.parse(resp, xhr); 381 | if (options.wait) { 382 | delete options.wait; 383 | serverAttrs = _.extend(attrs || {}, serverAttrs); 384 | } 385 | if (!model.set(serverAttrs, options)) return false; 386 | if (success) { 387 | success(model, resp); 388 | } else { 389 | model.trigger('sync', model, resp, options); 390 | } 391 | }; 392 | 393 | // Finish configuring and sending the Ajax request. 394 | options.error = Backbone.wrapError(options.error, model, options); 395 | var method = this.isNew() ? 'create' : 'update'; 396 | var xhr = (this.sync || Backbone.sync).call(this, method, this, options); 397 | if (options.wait) this.set(current, silentOptions); 398 | return xhr; 399 | }, 400 | 401 | // Destroy this model on the server if it was already persisted. 402 | // Optimistically removes the model from its collection, if it has one. 403 | // If `wait: true` is passed, waits for the server to respond before removal. 404 | destroy: function(options) { 405 | options = options ? _.clone(options) : {}; 406 | var model = this; 407 | var success = options.success; 408 | 409 | var triggerDestroy = function() { 410 | model.trigger('destroy', model, model.collection, options); 411 | }; 412 | 413 | if (this.isNew()) { 414 | triggerDestroy(); 415 | return false; 416 | } 417 | 418 | options.success = function(resp) { 419 | if (options.wait) triggerDestroy(); 420 | if (success) { 421 | success(model, resp); 422 | } else { 423 | model.trigger('sync', model, resp, options); 424 | } 425 | }; 426 | 427 | options.error = Backbone.wrapError(options.error, model, options); 428 | var xhr = (this.sync || Backbone.sync).call(this, 'delete', this, options); 429 | if (!options.wait) triggerDestroy(); 430 | return xhr; 431 | }, 432 | 433 | // Default URL for the model's representation on the server -- if you're 434 | // using Backbone's restful methods, override this to change the endpoint 435 | // that will be called. 436 | url: function() { 437 | var base = getValue(this, 'urlRoot') || getValue(this.collection, 'url') || urlError(); 438 | if (this.isNew()) return base; 439 | return base + (base.charAt(base.length - 1) == '/' ? '' : '/') + encodeURIComponent(this.id); 440 | }, 441 | 442 | // **parse** converts a response into the hash of attributes to be `set` on 443 | // the model. The default implementation is just to pass the response along. 444 | parse: function(resp, xhr) { 445 | return resp; 446 | }, 447 | 448 | // Create a new model with identical attributes to this one. 449 | clone: function() { 450 | return new this.constructor(this.attributes); 451 | }, 452 | 453 | // A model is new if it has never been saved to the server, and lacks an id. 454 | isNew: function() { 455 | return this.id == null; 456 | }, 457 | 458 | // Call this method to manually fire a `"change"` event for this model and 459 | // a `"change:attribute"` event for each changed attribute. 460 | // Calling this will cause all objects observing the model to update. 461 | change: function(options) { 462 | options || (options = {}); 463 | var changing = this._changing; 464 | this._changing = true; 465 | 466 | // Silent changes become pending changes. 467 | for (var attr in this._silent) this._pending[attr] = true; 468 | 469 | // Silent changes are triggered. 470 | var changes = _.extend({}, options.changes, this._silent); 471 | this._silent = {}; 472 | for (var attr in changes) { 473 | this.trigger('change:' + attr, this, this.get(attr), options); 474 | } 475 | if (changing) return this; 476 | 477 | // Continue firing `"change"` events while there are pending changes. 478 | while (!_.isEmpty(this._pending)) { 479 | this._pending = {}; 480 | this.trigger('change', this, options); 481 | // Pending and silent changes still remain. 482 | for (var attr in this.changed) { 483 | if (this._pending[attr] || this._silent[attr]) continue; 484 | delete this.changed[attr]; 485 | } 486 | this._previousAttributes = _.clone(this.attributes); 487 | } 488 | 489 | this._changing = false; 490 | return this; 491 | }, 492 | 493 | // Determine if the model has changed since the last `"change"` event. 494 | // If you specify an attribute name, determine if that attribute has changed. 495 | hasChanged: function(attr) { 496 | if (!arguments.length) return !_.isEmpty(this.changed); 497 | return _.has(this.changed, attr); 498 | }, 499 | 500 | // Return an object containing all the attributes that have changed, or 501 | // false if there are no changed attributes. Useful for determining what 502 | // parts of a view need to be updated and/or what attributes need to be 503 | // persisted to the server. Unset attributes will be set to undefined. 504 | // You can also pass an attributes object to diff against the model, 505 | // determining if there *would be* a change. 506 | changedAttributes: function(diff) { 507 | if (!diff) return this.hasChanged() ? _.clone(this.changed) : false; 508 | var val, changed = false, old = this._previousAttributes; 509 | for (var attr in diff) { 510 | if (_.isEqual(old[attr], (val = diff[attr]))) continue; 511 | (changed || (changed = {}))[attr] = val; 512 | } 513 | return changed; 514 | }, 515 | 516 | // Get the previous value of an attribute, recorded at the time the last 517 | // `"change"` event was fired. 518 | previous: function(attr) { 519 | if (!arguments.length || !this._previousAttributes) return null; 520 | return this._previousAttributes[attr]; 521 | }, 522 | 523 | // Get all of the attributes of the model at the time of the previous 524 | // `"change"` event. 525 | previousAttributes: function() { 526 | return _.clone(this._previousAttributes); 527 | }, 528 | 529 | // Check if the model is currently in a valid state. It's only possible to 530 | // get into an *invalid* state if you're using silent changes. 531 | isValid: function() { 532 | return !this.validate(this.attributes); 533 | }, 534 | 535 | // Run validation against the next complete set of model attributes, 536 | // returning `true` if all is well. If a specific `error` callback has 537 | // been passed, call that instead of firing the general `"error"` event. 538 | _validate: function(attrs, options) { 539 | if (options.silent || !this.validate) return true; 540 | attrs = _.extend({}, this.attributes, attrs); 541 | var error = this.validate(attrs, options); 542 | if (!error) return true; 543 | if (options && options.error) { 544 | options.error(this, error, options); 545 | } else { 546 | this.trigger('error', this, error, options); 547 | } 548 | return false; 549 | } 550 | 551 | }); 552 | 553 | // Backbone.Collection 554 | // ------------------- 555 | 556 | // Provides a standard collection class for our sets of models, ordered 557 | // or unordered. If a `comparator` is specified, the Collection will maintain 558 | // its models in sort order, as they're added and removed. 559 | var Collection = Backbone.Collection = function(models, options) { 560 | options || (options = {}); 561 | if (options.model) this.model = options.model; 562 | if (options.comparator) this.comparator = options.comparator; 563 | this._reset(); 564 | this.initialize.apply(this, arguments); 565 | if (models) this.reset(models, {silent: true, parse: options.parse}); 566 | }; 567 | 568 | // Define the Collection's inheritable methods. 569 | _.extend(Collection.prototype, Events, { 570 | 571 | // The default model for a collection is just a **Backbone.Model**. 572 | // This should be overridden in most cases. 573 | model: Model, 574 | 575 | // Initialize is an empty function by default. Override it with your own 576 | // initialization logic. 577 | initialize: function(){}, 578 | 579 | // The JSON representation of a Collection is an array of the 580 | // models' attributes. 581 | toJSON: function(options) { 582 | return this.map(function(model){ return model.toJSON(options); }); 583 | }, 584 | 585 | // Add a model, or list of models to the set. Pass **silent** to avoid 586 | // firing the `add` event for every new model. 587 | add: function(models, options) { 588 | var i, index, length, model, cid, id, cids = {}, ids = {}, dups = []; 589 | options || (options = {}); 590 | models = _.isArray(models) ? models.slice() : [models]; 591 | 592 | // Begin by turning bare objects into model references, and preventing 593 | // invalid models or duplicate models from being added. 594 | for (i = 0, length = models.length; i < length; i++) { 595 | if (!(model = models[i] = this._prepareModel(models[i], options))) { 596 | throw new Error("Can't add an invalid model to a collection"); 597 | } 598 | cid = model.cid; 599 | id = model.id; 600 | if (cids[cid] || this._byCid[cid] || ((id != null) && (ids[id] || this._byId[id]))) { 601 | dups.push(i); 602 | continue; 603 | } 604 | cids[cid] = ids[id] = model; 605 | } 606 | 607 | // Remove duplicates. 608 | i = dups.length; 609 | while (i--) { 610 | models.splice(dups[i], 1); 611 | } 612 | 613 | // Listen to added models' events, and index models for lookup by 614 | // `id` and by `cid`. 615 | for (i = 0, length = models.length; i < length; i++) { 616 | (model = models[i]).on('all', this._onModelEvent, this); 617 | this._byCid[model.cid] = model; 618 | if (model.id != null) this._byId[model.id] = model; 619 | } 620 | 621 | // Insert models into the collection, re-sorting if needed, and triggering 622 | // `add` events unless silenced. 623 | this.length += length; 624 | index = options.at != null ? options.at : this.models.length; 625 | splice.apply(this.models, [index, 0].concat(models)); 626 | if (this.comparator) this.sort({silent: true}); 627 | if (options.silent) return this; 628 | for (i = 0, length = this.models.length; i < length; i++) { 629 | if (!cids[(model = this.models[i]).cid]) continue; 630 | options.index = i; 631 | model.trigger('add', model, this, options); 632 | } 633 | return this; 634 | }, 635 | 636 | // Remove a model, or a list of models from the set. Pass silent to avoid 637 | // firing the `remove` event for every model removed. 638 | remove: function(models, options) { 639 | var i, l, index, model; 640 | options || (options = {}); 641 | models = _.isArray(models) ? models.slice() : [models]; 642 | for (i = 0, l = models.length; i < l; i++) { 643 | model = this.getByCid(models[i]) || this.get(models[i]); 644 | if (!model) continue; 645 | delete this._byId[model.id]; 646 | delete this._byCid[model.cid]; 647 | index = this.indexOf(model); 648 | this.models.splice(index, 1); 649 | this.length--; 650 | if (!options.silent) { 651 | options.index = index; 652 | model.trigger('remove', model, this, options); 653 | } 654 | this._removeReference(model); 655 | } 656 | return this; 657 | }, 658 | 659 | // Add a model to the end of the collection. 660 | push: function(model, options) { 661 | model = this._prepareModel(model, options); 662 | this.add(model, options); 663 | return model; 664 | }, 665 | 666 | // Remove a model from the end of the collection. 667 | pop: function(options) { 668 | var model = this.at(this.length - 1); 669 | this.remove(model, options); 670 | return model; 671 | }, 672 | 673 | // Add a model to the beginning of the collection. 674 | unshift: function(model, options) { 675 | model = this._prepareModel(model, options); 676 | this.add(model, _.extend({at: 0}, options)); 677 | return model; 678 | }, 679 | 680 | // Remove a model from the beginning of the collection. 681 | shift: function(options) { 682 | var model = this.at(0); 683 | this.remove(model, options); 684 | return model; 685 | }, 686 | 687 | // Get a model from the set by id. 688 | get: function(id) { 689 | if (id == null) return void 0; 690 | return this._byId[id.id != null ? id.id : id]; 691 | }, 692 | 693 | // Get a model from the set by client id. 694 | getByCid: function(cid) { 695 | return cid && this._byCid[cid.cid || cid]; 696 | }, 697 | 698 | // Get the model at the given index. 699 | at: function(index) { 700 | return this.models[index]; 701 | }, 702 | 703 | // Return models with matching attributes. Useful for simple cases of `filter`. 704 | where: function(attrs) { 705 | if (_.isEmpty(attrs)) return []; 706 | return this.filter(function(model) { 707 | for (var key in attrs) { 708 | if (attrs[key] !== model.get(key)) return false; 709 | } 710 | return true; 711 | }); 712 | }, 713 | 714 | // Force the collection to re-sort itself. You don't need to call this under 715 | // normal circumstances, as the set will maintain sort order as each item 716 | // is added. 717 | sort: function(options) { 718 | options || (options = {}); 719 | if (!this.comparator) throw new Error('Cannot sort a set without a comparator'); 720 | var boundComparator = _.bind(this.comparator, this); 721 | if (this.comparator.length == 1) { 722 | this.models = this.sortBy(boundComparator); 723 | } else { 724 | this.models.sort(boundComparator); 725 | } 726 | if (!options.silent) this.trigger('reset', this, options); 727 | return this; 728 | }, 729 | 730 | // Pluck an attribute from each model in the collection. 731 | pluck: function(attr) { 732 | return _.map(this.models, function(model){ return model.get(attr); }); 733 | }, 734 | 735 | // When you have more items than you want to add or remove individually, 736 | // you can reset the entire set with a new list of models, without firing 737 | // any `add` or `remove` events. Fires `reset` when finished. 738 | reset: function(models, options) { 739 | models || (models = []); 740 | options || (options = {}); 741 | for (var i = 0, l = this.models.length; i < l; i++) { 742 | this._removeReference(this.models[i]); 743 | } 744 | this._reset(); 745 | this.add(models, _.extend({silent: true}, options)); 746 | if (!options.silent) this.trigger('reset', this, options); 747 | return this; 748 | }, 749 | 750 | // Fetch the default set of models for this collection, resetting the 751 | // collection when they arrive. If `add: true` is passed, appends the 752 | // models to the collection instead of resetting. 753 | fetch: function(options) { 754 | options = options ? _.clone(options) : {}; 755 | if (options.parse === undefined) options.parse = true; 756 | var collection = this; 757 | var success = options.success; 758 | options.success = function(resp, status, xhr) { 759 | collection[options.add ? 'add' : 'reset'](collection.parse(resp, xhr), options); 760 | if (success) success(collection, resp); 761 | }; 762 | options.error = Backbone.wrapError(options.error, collection, options); 763 | return (this.sync || Backbone.sync).call(this, 'read', this, options); 764 | }, 765 | 766 | // Create a new instance of a model in this collection. Add the model to the 767 | // collection immediately, unless `wait: true` is passed, in which case we 768 | // wait for the server to agree. 769 | create: function(model, options) { 770 | var coll = this; 771 | options = options ? _.clone(options) : {}; 772 | model = this._prepareModel(model, options); 773 | if (!model) return false; 774 | if (!options.wait) coll.add(model, options); 775 | var success = options.success; 776 | options.success = function(nextModel, resp, xhr) { 777 | if (options.wait) coll.add(nextModel, options); 778 | if (success) { 779 | success(nextModel, resp); 780 | } else { 781 | nextModel.trigger('sync', model, resp, options); 782 | } 783 | }; 784 | model.save(null, options); 785 | return model; 786 | }, 787 | 788 | // **parse** converts a response into a list of models to be added to the 789 | // collection. The default implementation is just to pass it through. 790 | parse: function(resp, xhr) { 791 | return resp; 792 | }, 793 | 794 | // Proxy to _'s chain. Can't be proxied the same way the rest of the 795 | // underscore methods are proxied because it relies on the underscore 796 | // constructor. 797 | chain: function () { 798 | return _(this.models).chain(); 799 | }, 800 | 801 | // Reset all internal state. Called when the collection is reset. 802 | _reset: function(options) { 803 | this.length = 0; 804 | this.models = []; 805 | this._byId = {}; 806 | this._byCid = {}; 807 | }, 808 | 809 | // Prepare a model or hash of attributes to be added to this collection. 810 | _prepareModel: function(model, options) { 811 | options || (options = {}); 812 | if (!(model instanceof Model)) { 813 | var attrs = model; 814 | options.collection = this; 815 | model = new this.model(attrs, options); 816 | if (!model._validate(model.attributes, options)) model = false; 817 | } else if (!model.collection) { 818 | model.collection = this; 819 | } 820 | return model; 821 | }, 822 | 823 | // Internal method to remove a model's ties to a collection. 824 | _removeReference: function(model) { 825 | if (this == model.collection) { 826 | delete model.collection; 827 | } 828 | model.off('all', this._onModelEvent, this); 829 | }, 830 | 831 | // Internal method called every time a model in the set fires an event. 832 | // Sets need to update their indexes when models change ids. All other 833 | // events simply proxy through. "add" and "remove" events that originate 834 | // in other collections are ignored. 835 | _onModelEvent: function(event, model, collection, options) { 836 | if ((event == 'add' || event == 'remove') && collection != this) return; 837 | if (event == 'destroy') { 838 | this.remove(model, options); 839 | } 840 | if (model && event === 'change:' + model.idAttribute) { 841 | delete this._byId[model.previous(model.idAttribute)]; 842 | this._byId[model.id] = model; 843 | } 844 | this.trigger.apply(this, arguments); 845 | } 846 | 847 | }); 848 | 849 | // Underscore methods that we want to implement on the Collection. 850 | var methods = ['forEach', 'each', 'map', 'reduce', 'reduceRight', 'find', 851 | 'detect', 'filter', 'select', 'reject', 'every', 'all', 'some', 'any', 852 | 'include', 'contains', 'invoke', 'max', 'min', 'sortBy', 'sortedIndex', 853 | 'toArray', 'size', 'first', 'initial', 'rest', 'last', 'without', 'indexOf', 854 | 'shuffle', 'lastIndexOf', 'isEmpty', 'groupBy']; 855 | 856 | // Mix in each Underscore method as a proxy to `Collection#models`. 857 | _.each(methods, function(method) { 858 | Collection.prototype[method] = function() { 859 | return _[method].apply(_, [this.models].concat(_.toArray(arguments))); 860 | }; 861 | }); 862 | 863 | // Backbone.Router 864 | // ------------------- 865 | 866 | // Routers map faux-URLs to actions, and fire events when routes are 867 | // matched. Creating a new one sets its `routes` hash, if not set statically. 868 | var Router = Backbone.Router = function(options) { 869 | options || (options = {}); 870 | if (options.routes) this.routes = options.routes; 871 | this._bindRoutes(); 872 | this.initialize.apply(this, arguments); 873 | }; 874 | 875 | // Cached regular expressions for matching named param parts and splatted 876 | // parts of route strings. 877 | var namedParam = /:\w+/g; 878 | var splatParam = /\*\w+/g; 879 | var escapeRegExp = /[-[\]{}()+?.,\\^$|#\s]/g; 880 | 881 | // Set up all inheritable **Backbone.Router** properties and methods. 882 | _.extend(Router.prototype, Events, { 883 | 884 | // Initialize is an empty function by default. Override it with your own 885 | // initialization logic. 886 | initialize: function(){}, 887 | 888 | // Manually bind a single named route to a callback. For example: 889 | // 890 | // this.route('search/:query/p:num', 'search', function(query, num) { 891 | // ... 892 | // }); 893 | // 894 | route: function(route, name, callback) { 895 | Backbone.history || (Backbone.history = new History); 896 | if (!_.isRegExp(route)) route = this._routeToRegExp(route); 897 | if (!callback) callback = this[name]; 898 | Backbone.history.route(route, _.bind(function(fragment) { 899 | var args = this._extractParameters(route, fragment); 900 | callback && callback.apply(this, args); 901 | this.trigger.apply(this, ['route:' + name].concat(args)); 902 | Backbone.history.trigger('route', this, name, args); 903 | }, this)); 904 | return this; 905 | }, 906 | 907 | // Simple proxy to `Backbone.history` to save a fragment into the history. 908 | navigate: function(fragment, options) { 909 | Backbone.history.navigate(fragment, options); 910 | }, 911 | 912 | // Bind all defined routes to `Backbone.history`. We have to reverse the 913 | // order of the routes here to support behavior where the most general 914 | // routes can be defined at the bottom of the route map. 915 | _bindRoutes: function() { 916 | if (!this.routes) return; 917 | var routes = []; 918 | for (var route in this.routes) { 919 | routes.unshift([route, this.routes[route]]); 920 | } 921 | for (var i = 0, l = routes.length; i < l; i++) { 922 | this.route(routes[i][0], routes[i][1], this[routes[i][1]]); 923 | } 924 | }, 925 | 926 | // Convert a route string into a regular expression, suitable for matching 927 | // against the current location hash. 928 | _routeToRegExp: function(route) { 929 | route = route.replace(escapeRegExp, '\\$&') 930 | .replace(namedParam, '([^\/]+)') 931 | .replace(splatParam, '(.*?)'); 932 | return new RegExp('^' + route + '$'); 933 | }, 934 | 935 | // Given a route, and a URL fragment that it matches, return the array of 936 | // extracted parameters. 937 | _extractParameters: function(route, fragment) { 938 | return route.exec(fragment).slice(1); 939 | } 940 | 941 | }); 942 | 943 | // Backbone.History 944 | // ---------------- 945 | 946 | // Handles cross-browser history management, based on URL fragments. If the 947 | // browser does not support `onhashchange`, falls back to polling. 948 | var History = Backbone.History = function() { 949 | this.handlers = []; 950 | _.bindAll(this, 'checkUrl'); 951 | }; 952 | 953 | // Cached regex for cleaning leading hashes and slashes . 954 | var routeStripper = /^[#\/]/; 955 | 956 | // Cached regex for detecting MSIE. 957 | var isExplorer = /msie [\w.]+/; 958 | 959 | // Has the history handling already been started? 960 | History.started = false; 961 | 962 | // Set up all inheritable **Backbone.History** properties and methods. 963 | _.extend(History.prototype, Events, { 964 | 965 | // The default interval to poll for hash changes, if necessary, is 966 | // twenty times a second. 967 | interval: 50, 968 | 969 | // Gets the true hash value. Cannot use location.hash directly due to bug 970 | // in Firefox where location.hash will always be decoded. 971 | getHash: function(windowOverride) { 972 | var loc = windowOverride ? windowOverride.location : window.location; 973 | var match = loc.href.match(/#(.*)$/); 974 | return match ? match[1] : ''; 975 | }, 976 | 977 | // Get the cross-browser normalized URL fragment, either from the URL, 978 | // the hash, or the override. 979 | getFragment: function(fragment, forcePushState) { 980 | if (fragment == null) { 981 | if (this._hasPushState || forcePushState) { 982 | fragment = window.location.pathname; 983 | var search = window.location.search; 984 | if (search) fragment += search; 985 | } else { 986 | fragment = this.getHash(); 987 | } 988 | } 989 | if (!fragment.indexOf(this.options.root)) fragment = fragment.substr(this.options.root.length); 990 | return fragment.replace(routeStripper, ''); 991 | }, 992 | 993 | // Start the hash change handling, returning `true` if the current URL matches 994 | // an existing route, and `false` otherwise. 995 | start: function(options) { 996 | if (History.started) throw new Error("Backbone.history has already been started"); 997 | History.started = true; 998 | 999 | // Figure out the initial configuration. Do we need an iframe? 1000 | // Is pushState desired ... is it available? 1001 | this.options = _.extend({}, {root: '/'}, this.options, options); 1002 | this._wantsHashChange = this.options.hashChange !== false; 1003 | this._wantsPushState = !!this.options.pushState; 1004 | this._hasPushState = !!(this.options.pushState && window.history && window.history.pushState); 1005 | var fragment = this.getFragment(); 1006 | var docMode = document.documentMode; 1007 | var oldIE = (isExplorer.exec(navigator.userAgent.toLowerCase()) && (!docMode || docMode <= 7)); 1008 | 1009 | if (oldIE) { 1010 | this.iframe = $('