Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
T
todomvc
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Sven Franck
todomvc
Commits
6d3e6498
Commit
6d3e6498
authored
Dec 13, 2013
by
Pascal Hartig
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Backbone: upgrade to 1.1
parent
9addb398
Changes
5
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
with
4862 additions
and
5540 deletions
+4862
-5540
architecture-examples/backbone/bower.json
architecture-examples/backbone/bower.json
+3
-3
architecture-examples/backbone/bower_components/backbone.localStorage/backbone.localStorage.js
...components/backbone.localStorage/backbone.localStorage.js
+45
-15
architecture-examples/backbone/bower_components/backbone/backbone.js
...e-examples/backbone/bower_components/backbone/backbone.js
+140
-130
architecture-examples/backbone/bower_components/jquery/jquery.js
...cture-examples/backbone/bower_components/jquery/jquery.js
+4524
-5292
architecture-examples/backbone/bower_components/underscore/underscore.js
...amples/backbone/bower_components/underscore/underscore.js
+150
-100
No files found.
architecture-examples/backbone/bower.json
View file @
6d3e6498
...
@@ -2,9 +2,9 @@
...
@@ -2,9 +2,9 @@
"name"
:
"todomvc-backbone"
,
"name"
:
"todomvc-backbone"
,
"version"
:
"0.0.0"
,
"version"
:
"0.0.0"
,
"dependencies"
:
{
"dependencies"
:
{
"backbone"
:
"~1.
0
.0"
,
"backbone"
:
"~1.
1
.0"
,
"underscore"
:
"~1.
4.4
"
,
"underscore"
:
"~1.
5.0
"
,
"jquery"
:
"~
1.9.1
"
,
"jquery"
:
"~
2.0.0
"
,
"todomvc-common"
:
"~0.1.4"
,
"todomvc-common"
:
"~0.1.4"
,
"backbone.localStorage"
:
"~1.1.0"
"backbone.localStorage"
:
"~1.1.0"
}
}
...
...
architecture-examples/backbone/bower_components/backbone.localStorage/backbone.localStorage.js
View file @
6d3e6498
/**
/**
* Backbone localStorage Adapter
* Backbone localStorage Adapter
* Version 1.1.
0
* Version 1.1.
7
*
*
* https://github.com/jeromegn/Backbone.localStorage
* https://github.com/jeromegn/Backbone.localStorage
*/
*/
(
function
(
root
,
factory
)
{
(
function
(
root
,
factory
)
{
if
(
typeof
define
===
"
function
"
&&
define
.
amd
)
{
if
(
typeof
exports
===
'
object
'
&&
typeof
require
===
'
function
'
)
{
module
.
exports
=
factory
(
require
(
"
underscore
"
),
require
(
"
backbone
"
));
}
else
if
(
typeof
define
===
"
function
"
&&
define
.
amd
)
{
// AMD. Register as an anonymous module.
// AMD. Register as an anonymous module.
define
([
"
underscore
"
,
"
backbone
"
],
function
(
_
,
Backbone
)
{
define
([
"
underscore
"
,
"
backbone
"
],
function
(
_
,
Backbone
)
{
// Use global variables if the locals
is
undefined.
// Use global variables if the locals
are
undefined.
return
factory
(
_
||
root
.
_
,
Backbone
||
root
.
Backbone
);
return
factory
(
_
||
root
.
_
,
Backbone
||
root
.
Backbone
);
});
});
}
else
{
}
else
{
// RequireJS isn't being used. Assume underscore and backbone
is
loaded in <script> tags
// RequireJS isn't being used. Assume underscore and backbone
are
loaded in <script> tags
factory
(
_
,
Backbone
);
factory
(
_
,
Backbone
);
}
}
}(
this
,
function
(
_
,
Backbone
)
{
}(
this
,
function
(
_
,
Backbone
)
{
...
@@ -37,6 +39,9 @@ function guid() {
...
@@ -37,6 +39,9 @@ function guid() {
// with a meaningful name, like the name you'd give a table.
// with a meaningful name, like the name you'd give a table.
// window.Store is deprectated, use Backbone.LocalStorage instead
// window.Store is deprectated, use Backbone.LocalStorage instead
Backbone
.
LocalStorage
=
window
.
Store
=
function
(
name
)
{
Backbone
.
LocalStorage
=
window
.
Store
=
function
(
name
)
{
if
(
!
this
.
localStorage
)
{
throw
"
Backbone.localStorage: Environment does not support localStorage.
"
}
this
.
name
=
name
;
this
.
name
=
name
;
var
store
=
this
.
localStorage
().
getItem
(
this
.
name
);
var
store
=
this
.
localStorage
().
getItem
(
this
.
name
);
this
.
records
=
(
store
&&
store
.
split
(
"
,
"
))
||
[];
this
.
records
=
(
store
&&
store
.
split
(
"
,
"
))
||
[];
...
@@ -77,7 +82,8 @@ _.extend(Backbone.LocalStorage.prototype, {
...
@@ -77,7 +82,8 @@ _.extend(Backbone.LocalStorage.prototype, {
// Return the array of all models currently in storage.
// Return the array of all models currently in storage.
findAll
:
function
()
{
findAll
:
function
()
{
return
_
(
this
.
records
).
chain
()
// Lodash removed _#chain in v1.0.0-rc.1
return
(
_
.
chain
||
_
)(
this
.
records
)
.
map
(
function
(
id
){
.
map
(
function
(
id
){
return
this
.
jsonData
(
this
.
localStorage
().
getItem
(
this
.
name
+
"
-
"
+
id
));
return
this
.
jsonData
(
this
.
localStorage
().
getItem
(
this
.
name
+
"
-
"
+
id
));
},
this
)
},
this
)
...
@@ -100,21 +106,43 @@ _.extend(Backbone.LocalStorage.prototype, {
...
@@ -100,21 +106,43 @@ _.extend(Backbone.LocalStorage.prototype, {
localStorage
:
function
()
{
localStorage
:
function
()
{
return
localStorage
;
return
localStorage
;
},
},
// fix for "illegal access" error on Android when JSON.parse is passed null
// fix for "illegal access" error on Android when JSON.parse is passed null
jsonData
:
function
(
data
)
{
jsonData
:
function
(
data
)
{
return
data
&&
JSON
.
parse
(
data
);
return
data
&&
JSON
.
parse
(
data
);
},
// Clear localStorage for specific collection.
_clear
:
function
()
{
var
local
=
this
.
localStorage
(),
itemRe
=
new
RegExp
(
"
^
"
+
this
.
name
+
"
-
"
);
// Remove id-tracking item (e.g., "foo").
local
.
removeItem
(
this
.
name
);
// Lodash removed _#chain in v1.0.0-rc.1
// Match all data items (e.g., "foo-ID") and remove.
(
_
.
chain
||
_
)(
local
).
keys
()
.
filter
(
function
(
k
)
{
return
itemRe
.
test
(
k
);
})
.
each
(
function
(
k
)
{
local
.
removeItem
(
k
);
});
this
.
records
.
length
=
0
;
},
// Size of localStorage.
_storageSize
:
function
()
{
return
this
.
localStorage
().
length
;
}
}
});
});
// localSync delegate to the model or collection's
// localSync delegate to the model or collection's
// *localStorage* property, which should be an instance of `Store`.
// *localStorage* property, which should be an instance of `Store`.
// window.Store.sync and Backbone.localSync is deprec
t
ated, use Backbone.LocalStorage.sync instead
// window.Store.sync and Backbone.localSync is deprecated, use Backbone.LocalStorage.sync instead
Backbone
.
LocalStorage
.
sync
=
window
.
Store
.
sync
=
Backbone
.
localSync
=
function
(
method
,
model
,
options
)
{
Backbone
.
LocalStorage
.
sync
=
window
.
Store
.
sync
=
Backbone
.
localSync
=
function
(
method
,
model
,
options
)
{
var
store
=
model
.
localStorage
||
model
.
collection
.
localStorage
;
var
store
=
model
.
localStorage
||
model
.
collection
.
localStorage
;
var
resp
,
errorMessage
,
syncDfd
=
$
.
Deferred
&&
$
.
Deferred
();
//If $ is having Deferred - use it.
var
resp
,
errorMessage
,
syncDfd
=
Backbone
.
$
.
Deferred
&&
Backbone
.
$
.
Deferred
();
//If $ is having Deferred - use it.
try
{
try
{
...
@@ -134,37 +162,39 @@ Backbone.LocalStorage.sync = window.Store.sync = Backbone.localSync = function(m
...
@@ -134,37 +162,39 @@ Backbone.LocalStorage.sync = window.Store.sync = Backbone.localSync = function(m
}
}
}
catch
(
error
)
{
}
catch
(
error
)
{
if
(
error
.
code
===
DOMException
.
QUOTA_EXCEEDED_ERR
&&
window
.
localStorage
.
length
===
0
)
if
(
error
.
code
===
22
&&
store
.
_storageSize
()
===
0
)
errorMessage
=
"
Private browsing is unsupported
"
;
errorMessage
=
"
Private browsing is unsupported
"
;
else
else
errorMessage
=
error
.
message
;
errorMessage
=
error
.
message
;
}
}
if
(
resp
)
{
if
(
resp
)
{
if
(
options
&&
options
.
success
)
if
(
options
&&
options
.
success
)
{
if
(
Backbone
.
VERSION
===
"
0.9.10
"
)
{
if
(
Backbone
.
VERSION
===
"
0.9.10
"
)
{
options
.
success
(
model
,
resp
,
options
);
options
.
success
(
model
,
resp
,
options
);
}
else
{
}
else
{
options
.
success
(
resp
);
options
.
success
(
resp
);
}
}
if
(
syncDfd
)
}
if
(
syncDfd
)
{
syncDfd
.
resolve
(
resp
);
syncDfd
.
resolve
(
resp
);
}
}
else
{
}
else
{
errorMessage
=
errorMessage
?
errorMessage
errorMessage
=
errorMessage
?
errorMessage
:
"
Record Not Found
"
;
:
"
Record Not Found
"
;
if
(
options
&&
options
.
error
)
if
(
options
&&
options
.
error
)
if
(
Backbone
.
VERSION
===
"
0.9.10
"
)
{
if
(
Backbone
.
VERSION
===
"
0.9.10
"
)
{
options
.
error
(
model
,
errorMessage
,
options
);
options
.
error
(
model
,
errorMessage
,
options
);
}
else
{
}
else
{
options
.
error
(
errorMessage
);
options
.
error
(
errorMessage
);
}
}
if
(
syncDfd
)
if
(
syncDfd
)
syncDfd
.
reject
(
errorMessage
);
syncDfd
.
reject
(
errorMessage
);
}
}
// add compatibility with $.ajax
// add compatibility with $.ajax
// always execute callback for success and error
// always execute callback for success and error
if
(
options
&&
options
.
complete
)
options
.
complete
(
resp
);
if
(
options
&&
options
.
complete
)
options
.
complete
(
resp
);
...
@@ -189,4 +219,4 @@ Backbone.sync = function(method, model, options) {
...
@@ -189,4 +219,4 @@ Backbone.sync = function(method, model, options) {
};
};
return
Backbone
.
LocalStorage
;
return
Backbone
.
LocalStorage
;
}));
}));
\ No newline at end of file
architecture-examples/backbone/bower_components/backbone/backbone.js
View file @
6d3e6498
// Backbone.js 1.
0
.0
// Backbone.js 1.
1
.0
// (c) 2010-2013 Jeremy Ashkenas, DocumentCloud Inc.
// (c) 2010-2011 Jeremy Ashkenas, DocumentCloud Inc.
// (c) 2011-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
// Backbone may be freely distributed under the MIT license.
// Backbone may be freely distributed under the MIT license.
// For all details and documentation:
// For all details and documentation:
// http://backbonejs.org
// http://backbonejs.org
...
@@ -34,7 +35,7 @@
...
@@ -34,7 +35,7 @@
}
}
// Current version of the library. Keep in sync with `package.json`.
// Current version of the library. Keep in sync with `package.json`.
Backbone
.
VERSION
=
'
1.
0
.0
'
;
Backbone
.
VERSION
=
'
1.
1
.0
'
;
// Require Underscore, if we're on the server, and it's not already present.
// Require Underscore, if we're on the server, and it's not already present.
var
_
=
root
.
_
;
var
_
=
root
.
_
;
...
@@ -52,7 +53,7 @@
...
@@ -52,7 +53,7 @@
};
};
// Turn on `emulateHTTP` to support legacy HTTP servers. Setting this option
// Turn on `emulateHTTP` to support legacy HTTP servers. Setting this option
// will fake `"PUT"` and `"DELETE"` requests via the `_method` parameter and
// will fake `"P
ATCH"`, `"P
UT"` and `"DELETE"` requests via the `_method` parameter and
// set a `X-Http-Method-Override` header.
// set a `X-Http-Method-Override` header.
Backbone
.
emulateHTTP
=
false
;
Backbone
.
emulateHTTP
=
false
;
...
@@ -111,7 +112,6 @@
...
@@ -111,7 +112,6 @@
this
.
_events
=
{};
this
.
_events
=
{};
return
this
;
return
this
;
}
}
names
=
name
?
[
name
]
:
_
.
keys
(
this
.
_events
);
names
=
name
?
[
name
]
:
_
.
keys
(
this
.
_events
);
for
(
i
=
0
,
l
=
names
.
length
;
i
<
l
;
i
++
)
{
for
(
i
=
0
,
l
=
names
.
length
;
i
<
l
;
i
++
)
{
name
=
names
[
i
];
name
=
names
[
i
];
...
@@ -151,14 +151,15 @@
...
@@ -151,14 +151,15 @@
// Tell this object to stop listening to either specific events ... or
// Tell this object to stop listening to either specific events ... or
// to every object it's currently listening to.
// to every object it's currently listening to.
stopListening
:
function
(
obj
,
name
,
callback
)
{
stopListening
:
function
(
obj
,
name
,
callback
)
{
var
listeners
=
this
.
_listeners
;
var
listeningTo
=
this
.
_listeningTo
;
if
(
!
listeners
)
return
this
;
if
(
!
listeningTo
)
return
this
;
var
deleteListener
=
!
name
&&
!
callback
;
var
remove
=
!
name
&&
!
callback
;
if
(
typeof
name
===
'
object
'
)
callback
=
this
;
if
(
!
callback
&&
typeof
name
===
'
object
'
)
callback
=
this
;
if
(
obj
)
(
listeners
=
{})[
obj
.
_listenerId
]
=
obj
;
if
(
obj
)
(
listeningTo
=
{})[
obj
.
_listenId
]
=
obj
;
for
(
var
id
in
listeners
)
{
for
(
var
id
in
listeningTo
)
{
listeners
[
id
].
off
(
name
,
callback
,
this
);
obj
=
listeningTo
[
id
];
if
(
deleteListener
)
delete
this
.
_listeners
[
id
];
obj
.
off
(
name
,
callback
,
this
);
if
(
remove
||
_
.
isEmpty
(
obj
.
_events
))
delete
this
.
_listeningTo
[
id
];
}
}
return
this
;
return
this
;
}
}
...
@@ -215,10 +216,10 @@
...
@@ -215,10 +216,10 @@
// listening to.
// listening to.
_
.
each
(
listenMethods
,
function
(
implementation
,
method
)
{
_
.
each
(
listenMethods
,
function
(
implementation
,
method
)
{
Events
[
method
]
=
function
(
obj
,
name
,
callback
)
{
Events
[
method
]
=
function
(
obj
,
name
,
callback
)
{
var
listen
ers
=
this
.
_listeners
||
(
this
.
_listeners
=
{});
var
listen
ingTo
=
this
.
_listeningTo
||
(
this
.
_listeningTo
=
{});
var
id
=
obj
.
_listen
erId
||
(
obj
.
_listener
Id
=
_
.
uniqueId
(
'
l
'
));
var
id
=
obj
.
_listen
Id
||
(
obj
.
_listen
Id
=
_
.
uniqueId
(
'
l
'
));
listen
ers
[
id
]
=
obj
;
listen
ingTo
[
id
]
=
obj
;
if
(
typeof
name
===
'
object
'
)
callback
=
this
;
if
(
!
callback
&&
typeof
name
===
'
object
'
)
callback
=
this
;
obj
[
implementation
](
name
,
callback
,
this
);
obj
[
implementation
](
name
,
callback
,
this
);
return
this
;
return
this
;
};
};
...
@@ -243,24 +244,18 @@
...
@@ -243,24 +244,18 @@
// Create a new model with the specified attributes. A client id (`cid`)
// Create a new model with the specified attributes. A client id (`cid`)
// is automatically generated and assigned for you.
// is automatically generated and assigned for you.
var
Model
=
Backbone
.
Model
=
function
(
attributes
,
options
)
{
var
Model
=
Backbone
.
Model
=
function
(
attributes
,
options
)
{
var
defaults
;
var
attrs
=
attributes
||
{};
var
attrs
=
attributes
||
{};
options
||
(
options
=
{});
options
||
(
options
=
{});
this
.
cid
=
_
.
uniqueId
(
'
c
'
);
this
.
cid
=
_
.
uniqueId
(
'
c
'
);
this
.
attributes
=
{};
this
.
attributes
=
{};
_
.
extend
(
this
,
_
.
pick
(
options
,
modelOptions
))
;
if
(
options
.
collection
)
this
.
collection
=
options
.
collection
;
if
(
options
.
parse
)
attrs
=
this
.
parse
(
attrs
,
options
)
||
{};
if
(
options
.
parse
)
attrs
=
this
.
parse
(
attrs
,
options
)
||
{};
if
(
defaults
=
_
.
result
(
this
,
'
defaults
'
))
{
attrs
=
_
.
defaults
({},
attrs
,
_
.
result
(
this
,
'
defaults
'
));
attrs
=
_
.
defaults
({},
attrs
,
defaults
);
}
this
.
set
(
attrs
,
options
);
this
.
set
(
attrs
,
options
);
this
.
changed
=
{};
this
.
changed
=
{};
this
.
initialize
.
apply
(
this
,
arguments
);
this
.
initialize
.
apply
(
this
,
arguments
);
};
};
// A list of options to be attached directly to the model, if provided.
var
modelOptions
=
[
'
url
'
,
'
urlRoot
'
,
'
collection
'
];
// Attach all inheritable methods to the Model prototype.
// Attach all inheritable methods to the Model prototype.
_
.
extend
(
Model
.
prototype
,
Events
,
{
_
.
extend
(
Model
.
prototype
,
Events
,
{
...
@@ -456,13 +451,16 @@
...
@@ -456,13 +451,16 @@
(
attrs
=
{})[
key
]
=
val
;
(
attrs
=
{})[
key
]
=
val
;
}
}
// If we're not waiting and attributes exist, save acts as `set(attr).save(null, opts)`.
if
(
attrs
&&
(
!
options
||
!
options
.
wait
)
&&
!
this
.
set
(
attrs
,
options
))
return
false
;
options
=
_
.
extend
({
validate
:
true
},
options
);
options
=
_
.
extend
({
validate
:
true
},
options
);
// Do not persist invalid models.
// If we're not waiting and attributes exist, save acts as
if
(
!
this
.
_validate
(
attrs
,
options
))
return
false
;
// `set(attr).save(null, opts)` with validation. Otherwise, check if
// the model will be valid when the attributes, if any, are set.
if
(
attrs
&&
!
options
.
wait
)
{
if
(
!
this
.
set
(
attrs
,
options
))
return
false
;
}
else
{
if
(
!
this
.
_validate
(
attrs
,
options
))
return
false
;
}
// Set temporary attributes if `{wait: true}`.
// Set temporary attributes if `{wait: true}`.
if
(
attrs
&&
options
.
wait
)
{
if
(
attrs
&&
options
.
wait
)
{
...
@@ -563,7 +561,7 @@
...
@@ -563,7 +561,7 @@
attrs
=
_
.
extend
({},
this
.
attributes
,
attrs
);
attrs
=
_
.
extend
({},
this
.
attributes
,
attrs
);
var
error
=
this
.
validationError
=
this
.
validate
(
attrs
,
options
)
||
null
;
var
error
=
this
.
validationError
=
this
.
validate
(
attrs
,
options
)
||
null
;
if
(
!
error
)
return
true
;
if
(
!
error
)
return
true
;
this
.
trigger
(
'
invalid
'
,
this
,
error
,
_
.
extend
(
options
||
{}
,
{
validationError
:
error
}));
this
.
trigger
(
'
invalid
'
,
this
,
error
,
_
.
extend
(
options
,
{
validationError
:
error
}));
return
false
;
return
false
;
}
}
...
@@ -596,7 +594,6 @@
...
@@ -596,7 +594,6 @@
// its models in sort order, as they're added and removed.
// its models in sort order, as they're added and removed.
var
Collection
=
Backbone
.
Collection
=
function
(
models
,
options
)
{
var
Collection
=
Backbone
.
Collection
=
function
(
models
,
options
)
{
options
||
(
options
=
{});
options
||
(
options
=
{});
if
(
options
.
url
)
this
.
url
=
options
.
url
;
if
(
options
.
model
)
this
.
model
=
options
.
model
;
if
(
options
.
model
)
this
.
model
=
options
.
model
;
if
(
options
.
comparator
!==
void
0
)
this
.
comparator
=
options
.
comparator
;
if
(
options
.
comparator
!==
void
0
)
this
.
comparator
=
options
.
comparator
;
this
.
_reset
();
this
.
_reset
();
...
@@ -606,7 +603,7 @@
...
@@ -606,7 +603,7 @@
// Default options for `Collection#set`.
// Default options for `Collection#set`.
var
setOptions
=
{
add
:
true
,
remove
:
true
,
merge
:
true
};
var
setOptions
=
{
add
:
true
,
remove
:
true
,
merge
:
true
};
var
addOptions
=
{
add
:
true
,
merge
:
false
,
remove
:
false
};
var
addOptions
=
{
add
:
true
,
remove
:
false
};
// Define the Collection's inheritable methods.
// Define the Collection's inheritable methods.
_
.
extend
(
Collection
.
prototype
,
Events
,
{
_
.
extend
(
Collection
.
prototype
,
Events
,
{
...
@@ -632,16 +629,17 @@
...
@@ -632,16 +629,17 @@
// Add a model, or list of models to the set.
// Add a model, or list of models to the set.
add
:
function
(
models
,
options
)
{
add
:
function
(
models
,
options
)
{
return
this
.
set
(
models
,
_
.
defaults
(
options
||
{}
,
addOptions
));
return
this
.
set
(
models
,
_
.
extend
({
merge
:
false
},
options
,
addOptions
));
},
},
// Remove a model, or a list of models from the set.
// Remove a model, or a list of models from the set.
remove
:
function
(
models
,
options
)
{
remove
:
function
(
models
,
options
)
{
models
=
_
.
isArray
(
models
)
?
models
.
slice
()
:
[
models
];
var
singular
=
!
_
.
isArray
(
models
);
models
=
singular
?
[
models
]
:
_
.
clone
(
models
);
options
||
(
options
=
{});
options
||
(
options
=
{});
var
i
,
l
,
index
,
model
;
var
i
,
l
,
index
,
model
;
for
(
i
=
0
,
l
=
models
.
length
;
i
<
l
;
i
++
)
{
for
(
i
=
0
,
l
=
models
.
length
;
i
<
l
;
i
++
)
{
model
=
this
.
get
(
models
[
i
]);
model
=
models
[
i
]
=
this
.
get
(
models
[
i
]);
if
(
!
model
)
continue
;
if
(
!
model
)
continue
;
delete
this
.
_byId
[
model
.
id
];
delete
this
.
_byId
[
model
.
id
];
delete
this
.
_byId
[
model
.
cid
];
delete
this
.
_byId
[
model
.
cid
];
...
@@ -654,7 +652,7 @@
...
@@ -654,7 +652,7 @@
}
}
this
.
_removeReference
(
model
);
this
.
_removeReference
(
model
);
}
}
return
thi
s
;
return
singular
?
models
[
0
]
:
model
s
;
},
},
// Update a collection by `set`-ing a new list of models, adding new ones,
// Update a collection by `set`-ing a new list of models, adding new ones,
...
@@ -662,31 +660,45 @@
...
@@ -662,31 +660,45 @@
// already exist in the collection, as necessary. Similar to **Model#set**,
// already exist in the collection, as necessary. Similar to **Model#set**,
// the core operation for updating the data contained by the collection.
// the core operation for updating the data contained by the collection.
set
:
function
(
models
,
options
)
{
set
:
function
(
models
,
options
)
{
options
=
_
.
defaults
(
options
||
{}
,
setOptions
);
options
=
_
.
defaults
(
{},
options
,
setOptions
);
if
(
options
.
parse
)
models
=
this
.
parse
(
models
,
options
);
if
(
options
.
parse
)
models
=
this
.
parse
(
models
,
options
);
if
(
!
_
.
isArray
(
models
))
models
=
models
?
[
models
]
:
[];
var
singular
=
!
_
.
isArray
(
models
);
var
i
,
l
,
model
,
attrs
,
existing
,
sort
;
models
=
singular
?
(
models
?
[
models
]
:
[])
:
_
.
clone
(
models
);
var
i
,
l
,
id
,
model
,
attrs
,
existing
,
sort
;
var
at
=
options
.
at
;
var
at
=
options
.
at
;
var
targetModel
=
this
.
model
;
var
sortable
=
this
.
comparator
&&
(
at
==
null
)
&&
options
.
sort
!==
false
;
var
sortable
=
this
.
comparator
&&
(
at
==
null
)
&&
options
.
sort
!==
false
;
var
sortAttr
=
_
.
isString
(
this
.
comparator
)
?
this
.
comparator
:
null
;
var
sortAttr
=
_
.
isString
(
this
.
comparator
)
?
this
.
comparator
:
null
;
var
toAdd
=
[],
toRemove
=
[],
modelMap
=
{};
var
toAdd
=
[],
toRemove
=
[],
modelMap
=
{};
var
add
=
options
.
add
,
merge
=
options
.
merge
,
remove
=
options
.
remove
;
var
order
=
!
sortable
&&
add
&&
remove
?
[]
:
false
;
// Turn bare objects into model references, and prevent invalid models
// Turn bare objects into model references, and prevent invalid models
// from being added.
// from being added.
for
(
i
=
0
,
l
=
models
.
length
;
i
<
l
;
i
++
)
{
for
(
i
=
0
,
l
=
models
.
length
;
i
<
l
;
i
++
)
{
if
(
!
(
model
=
this
.
_prepareModel
(
models
[
i
],
options
)))
continue
;
attrs
=
models
[
i
];
if
(
attrs
instanceof
Model
)
{
id
=
model
=
attrs
;
}
else
{
id
=
attrs
[
targetModel
.
prototype
.
idAttribute
];
}
// If a duplicate is found, prevent it from being added and
// If a duplicate is found, prevent it from being added and
// optionally merge it into the existing model.
// optionally merge it into the existing model.
if
(
existing
=
this
.
get
(
model
))
{
if
(
existing
=
this
.
get
(
id
))
{
if
(
options
.
remove
)
modelMap
[
existing
.
cid
]
=
true
;
if
(
remove
)
modelMap
[
existing
.
cid
]
=
true
;
if
(
options
.
merge
)
{
if
(
merge
)
{
existing
.
set
(
model
.
attributes
,
options
);
attrs
=
attrs
===
model
?
model
.
attributes
:
attrs
;
if
(
options
.
parse
)
attrs
=
existing
.
parse
(
attrs
,
options
);
existing
.
set
(
attrs
,
options
);
if
(
sortable
&&
!
sort
&&
existing
.
hasChanged
(
sortAttr
))
sort
=
true
;
if
(
sortable
&&
!
sort
&&
existing
.
hasChanged
(
sortAttr
))
sort
=
true
;
}
}
models
[
i
]
=
existing
;
// This is a new model, push it to the `toAdd` list.
// If this is a new, valid model, push it to the `toAdd` list.
}
else
if
(
options
.
add
)
{
}
else
if
(
add
)
{
model
=
models
[
i
]
=
this
.
_prepareModel
(
attrs
,
options
);
if
(
!
model
)
continue
;
toAdd
.
push
(
model
);
toAdd
.
push
(
model
);
// Listen to added models' events, and index models for lookup by
// Listen to added models' events, and index models for lookup by
...
@@ -695,10 +707,11 @@
...
@@ -695,10 +707,11 @@
this
.
_byId
[
model
.
cid
]
=
model
;
this
.
_byId
[
model
.
cid
]
=
model
;
if
(
model
.
id
!=
null
)
this
.
_byId
[
model
.
id
]
=
model
;
if
(
model
.
id
!=
null
)
this
.
_byId
[
model
.
id
]
=
model
;
}
}
if
(
order
)
order
.
push
(
existing
||
model
);
}
}
// Remove nonexistent models if appropriate.
// Remove nonexistent models if appropriate.
if
(
options
.
remove
)
{
if
(
remove
)
{
for
(
i
=
0
,
l
=
this
.
length
;
i
<
l
;
++
i
)
{
for
(
i
=
0
,
l
=
this
.
length
;
i
<
l
;
++
i
)
{
if
(
!
modelMap
[(
model
=
this
.
models
[
i
]).
cid
])
toRemove
.
push
(
model
);
if
(
!
modelMap
[(
model
=
this
.
models
[
i
]).
cid
])
toRemove
.
push
(
model
);
}
}
...
@@ -706,29 +719,35 @@
...
@@ -706,29 +719,35 @@
}
}
// See if sorting is needed, update `length` and splice in new models.
// See if sorting is needed, update `length` and splice in new models.
if
(
toAdd
.
length
)
{
if
(
toAdd
.
length
||
(
order
&&
order
.
length
)
)
{
if
(
sortable
)
sort
=
true
;
if
(
sortable
)
sort
=
true
;
this
.
length
+=
toAdd
.
length
;
this
.
length
+=
toAdd
.
length
;
if
(
at
!=
null
)
{
if
(
at
!=
null
)
{
splice
.
apply
(
this
.
models
,
[
at
,
0
].
concat
(
toAdd
));
for
(
i
=
0
,
l
=
toAdd
.
length
;
i
<
l
;
i
++
)
{
this
.
models
.
splice
(
at
+
i
,
0
,
toAdd
[
i
]);
}
}
else
{
}
else
{
push
.
apply
(
this
.
models
,
toAdd
);
if
(
order
)
this
.
models
.
length
=
0
;
var
orderedModels
=
order
||
toAdd
;
for
(
i
=
0
,
l
=
orderedModels
.
length
;
i
<
l
;
i
++
)
{
this
.
models
.
push
(
orderedModels
[
i
]);
}
}
}
}
}
// Silently sort the collection if appropriate.
// Silently sort the collection if appropriate.
if
(
sort
)
this
.
sort
({
silent
:
true
});
if
(
sort
)
this
.
sort
({
silent
:
true
});
if
(
options
.
silent
)
return
this
;
// Unless silenced, it's time to fire all appropriate add/sort events.
if
(
!
options
.
silent
)
{
// Trigger `add` events.
for
(
i
=
0
,
l
=
toAdd
.
length
;
i
<
l
;
i
++
)
{
for
(
i
=
0
,
l
=
toAdd
.
length
;
i
<
l
;
i
++
)
{
(
model
=
toAdd
[
i
]).
trigger
(
'
add
'
,
model
,
this
,
options
);
(
model
=
toAdd
[
i
]).
trigger
(
'
add
'
,
model
,
this
,
options
);
}
if
(
sort
||
(
order
&&
order
.
length
))
this
.
trigger
(
'
sort
'
,
this
,
options
);
}
}
// Trigger `sort` if the collection was sorted.
// Return the added (or merged) model (or models).
if
(
sort
)
this
.
trigger
(
'
sort
'
,
this
,
options
);
return
singular
?
models
[
0
]
:
models
;
return
this
;
},
},
// When you have more items than you want to add or remove individually,
// When you have more items than you want to add or remove individually,
...
@@ -742,16 +761,14 @@
...
@@ -742,16 +761,14 @@
}
}
options
.
previousModels
=
this
.
models
;
options
.
previousModels
=
this
.
models
;
this
.
_reset
();
this
.
_reset
();
this
.
add
(
models
,
_
.
extend
({
silent
:
true
},
options
));
models
=
this
.
add
(
models
,
_
.
extend
({
silent
:
true
},
options
));
if
(
!
options
.
silent
)
this
.
trigger
(
'
reset
'
,
this
,
options
);
if
(
!
options
.
silent
)
this
.
trigger
(
'
reset
'
,
this
,
options
);
return
thi
s
;
return
model
s
;
},
},
// Add a model to the end of the collection.
// Add a model to the end of the collection.
push
:
function
(
model
,
options
)
{
push
:
function
(
model
,
options
)
{
model
=
this
.
_prepareModel
(
model
,
options
);
return
this
.
add
(
model
,
_
.
extend
({
at
:
this
.
length
},
options
));
this
.
add
(
model
,
_
.
extend
({
at
:
this
.
length
},
options
));
return
model
;
},
},
// Remove a model from the end of the collection.
// Remove a model from the end of the collection.
...
@@ -763,9 +780,7 @@
...
@@ -763,9 +780,7 @@
// Add a model to the beginning of the collection.
// Add a model to the beginning of the collection.
unshift
:
function
(
model
,
options
)
{
unshift
:
function
(
model
,
options
)
{
model
=
this
.
_prepareModel
(
model
,
options
);
return
this
.
add
(
model
,
_
.
extend
({
at
:
0
},
options
));
this
.
add
(
model
,
_
.
extend
({
at
:
0
},
options
));
return
model
;
},
},
// Remove a model from the beginning of the collection.
// Remove a model from the beginning of the collection.
...
@@ -776,14 +791,14 @@
...
@@ -776,14 +791,14 @@
},
},
// Slice out a sub-array of models from the collection.
// Slice out a sub-array of models from the collection.
slice
:
function
(
begin
,
end
)
{
slice
:
function
()
{
return
this
.
models
.
slice
(
begin
,
end
);
return
slice
.
apply
(
this
.
models
,
arguments
);
},
},
// Get a model from the set by id.
// Get a model from the set by id.
get
:
function
(
obj
)
{
get
:
function
(
obj
)
{
if
(
obj
==
null
)
return
void
0
;
if
(
obj
==
null
)
return
void
0
;
return
this
.
_byId
[
obj
.
id
!=
null
?
obj
.
id
:
obj
.
cid
||
obj
];
return
this
.
_byId
[
obj
.
id
]
||
this
.
_byId
[
obj
.
cid
]
||
this
.
_byId
[
obj
];
},
},
// Get the model at the given index.
// Get the model at the given index.
...
@@ -827,16 +842,6 @@
...
@@ -827,16 +842,6 @@
return
this
;
return
this
;
},
},
// Figure out the smallest index at which a model should be inserted so as
// to maintain order.
sortedIndex
:
function
(
model
,
value
,
context
)
{
value
||
(
value
=
this
.
comparator
);
var
iterator
=
_
.
isFunction
(
value
)
?
value
:
function
(
model
)
{
return
model
.
get
(
value
);
};
return
_
.
sortedIndex
(
this
.
models
,
model
,
iterator
,
context
);
},
// Pluck an attribute from each model in the collection.
// Pluck an attribute from each model in the collection.
pluck
:
function
(
attr
)
{
pluck
:
function
(
attr
)
{
return
_
.
invoke
(
this
.
models
,
'
get
'
,
attr
);
return
_
.
invoke
(
this
.
models
,
'
get
'
,
attr
);
...
@@ -869,7 +874,7 @@
...
@@ -869,7 +874,7 @@
if
(
!
options
.
wait
)
this
.
add
(
model
,
options
);
if
(
!
options
.
wait
)
this
.
add
(
model
,
options
);
var
collection
=
this
;
var
collection
=
this
;
var
success
=
options
.
success
;
var
success
=
options
.
success
;
options
.
success
=
function
(
resp
)
{
options
.
success
=
function
(
model
,
resp
,
options
)
{
if
(
options
.
wait
)
collection
.
add
(
model
,
options
);
if
(
options
.
wait
)
collection
.
add
(
model
,
options
);
if
(
success
)
success
(
model
,
resp
,
options
);
if
(
success
)
success
(
model
,
resp
,
options
);
};
};
...
@@ -903,14 +908,12 @@
...
@@ -903,14 +908,12 @@
if
(
!
attrs
.
collection
)
attrs
.
collection
=
this
;
if
(
!
attrs
.
collection
)
attrs
.
collection
=
this
;
return
attrs
;
return
attrs
;
}
}
options
||
(
options
=
{})
;
options
=
options
?
_
.
clone
(
options
)
:
{}
;
options
.
collection
=
this
;
options
.
collection
=
this
;
var
model
=
new
this
.
model
(
attrs
,
options
);
var
model
=
new
this
.
model
(
attrs
,
options
);
if
(
!
model
.
_validate
(
attrs
,
options
))
{
if
(
!
model
.
validationError
)
return
model
;
this
.
trigger
(
'
invalid
'
,
this
,
attrs
,
options
);
this
.
trigger
(
'
invalid
'
,
this
,
model
.
validationError
,
options
);
return
false
;
return
false
;
}
return
model
;
},
},
// Internal method to sever a model's ties to a collection.
// Internal method to sever a model's ties to a collection.
...
@@ -942,8 +945,8 @@
...
@@ -942,8 +945,8 @@
'
inject
'
,
'
reduceRight
'
,
'
foldr
'
,
'
find
'
,
'
detect
'
,
'
filter
'
,
'
select
'
,
'
inject
'
,
'
reduceRight
'
,
'
foldr
'
,
'
find
'
,
'
detect
'
,
'
filter
'
,
'
select
'
,
'
reject
'
,
'
every
'
,
'
all
'
,
'
some
'
,
'
any
'
,
'
include
'
,
'
contains
'
,
'
invoke
'
,
'
reject
'
,
'
every
'
,
'
all
'
,
'
some
'
,
'
any
'
,
'
include
'
,
'
contains
'
,
'
invoke
'
,
'
max
'
,
'
min
'
,
'
toArray
'
,
'
size
'
,
'
first
'
,
'
head
'
,
'
take
'
,
'
initial
'
,
'
rest
'
,
'
max
'
,
'
min
'
,
'
toArray
'
,
'
size
'
,
'
first
'
,
'
head
'
,
'
take
'
,
'
initial
'
,
'
rest
'
,
'
tail
'
,
'
drop
'
,
'
last
'
,
'
without
'
,
'
indexOf
'
,
'
shuffle
'
,
'
lastIndexOf
'
,
'
tail
'
,
'
drop
'
,
'
last
'
,
'
without
'
,
'
difference
'
,
'
indexOf
'
,
'
shuffle
'
,
'
isEmpty
'
,
'
chain
'
];
'
lastIndexOf
'
,
'
isEmpty
'
,
'
chain
'
];
// Mix in each Underscore method as a proxy to `Collection#models`.
// Mix in each Underscore method as a proxy to `Collection#models`.
_
.
each
(
methods
,
function
(
method
)
{
_
.
each
(
methods
,
function
(
method
)
{
...
@@ -982,7 +985,8 @@
...
@@ -982,7 +985,8 @@
// if an existing element is not provided...
// if an existing element is not provided...
var
View
=
Backbone
.
View
=
function
(
options
)
{
var
View
=
Backbone
.
View
=
function
(
options
)
{
this
.
cid
=
_
.
uniqueId
(
'
view
'
);
this
.
cid
=
_
.
uniqueId
(
'
view
'
);
this
.
_configure
(
options
||
{});
options
||
(
options
=
{});
_
.
extend
(
this
,
_
.
pick
(
options
,
viewOptions
));
this
.
_ensureElement
();
this
.
_ensureElement
();
this
.
initialize
.
apply
(
this
,
arguments
);
this
.
initialize
.
apply
(
this
,
arguments
);
this
.
delegateEvents
();
this
.
delegateEvents
();
...
@@ -1001,7 +1005,7 @@
...
@@ -1001,7 +1005,7 @@
tagName
:
'
div
'
,
tagName
:
'
div
'
,
// jQuery delegate for element lookup, scoped to DOM elements within the
// jQuery delegate for element lookup, scoped to DOM elements within the
// current view. This should be prefered to global lookups where possible.
// current view. This should be prefer
r
ed to global lookups where possible.
$
:
function
(
selector
)
{
$
:
function
(
selector
)
{
return
this
.
$el
.
find
(
selector
);
return
this
.
$el
.
find
(
selector
);
},
},
...
@@ -1041,7 +1045,7 @@
...
@@ -1041,7 +1045,7 @@
//
//
// {
// {
// 'mousedown .title': 'edit',
// 'mousedown .title': 'edit',
// 'click .button': 'save'
// 'click .button': 'save'
,
// 'click .open': function(e) { ... }
// 'click .open': function(e) { ... }
// }
// }
//
//
...
@@ -1079,16 +1083,6 @@
...
@@ -1079,16 +1083,6 @@
return
this
;
return
this
;
},
},
// Performs the initial configuration of a View with a set of options.
// Keys with special meaning *(e.g. model, collection, id, className)* are
// attached directly to the view. See `viewOptions` for an exhaustive
// list.
_configure
:
function
(
options
)
{
if
(
this
.
options
)
options
=
_
.
extend
({},
_
.
result
(
this
,
'
options
'
),
options
);
_
.
extend
(
this
,
_
.
pick
(
options
,
viewOptions
));
this
.
options
=
options
;
},
// Ensure that the View has a DOM element to render into.
// Ensure that the View has a DOM element to render into.
// If `this.el` is a string, pass it through `$()`, take the first
// If `this.el` is a string, pass it through `$()`, take the first
// matching element, and re-assign it to `el`. Otherwise, create
// matching element, and re-assign it to `el`. Otherwise, create
...
@@ -1174,8 +1168,7 @@
...
@@ -1174,8 +1168,7 @@
// If we're sending a `PATCH` request, and we're in an old Internet Explorer
// If we're sending a `PATCH` request, and we're in an old Internet Explorer
// that still has ActiveX enabled by default, override jQuery to use that
// that still has ActiveX enabled by default, override jQuery to use that
// for XHR instead. Remove this line when jQuery supports `PATCH` on IE8.
// for XHR instead. Remove this line when jQuery supports `PATCH` on IE8.
if
(
params
.
type
===
'
PATCH
'
&&
window
.
ActiveXObject
&&
if
(
params
.
type
===
'
PATCH
'
&&
noXhrPatch
)
{
!
(
window
.
external
&&
window
.
external
.
msActiveXFilteringEnabled
))
{
params
.
xhr
=
function
()
{
params
.
xhr
=
function
()
{
return
new
ActiveXObject
(
"
Microsoft.XMLHTTP
"
);
return
new
ActiveXObject
(
"
Microsoft.XMLHTTP
"
);
};
};
...
@@ -1187,6 +1180,8 @@
...
@@ -1187,6 +1180,8 @@
return
xhr
;
return
xhr
;
};
};
var
noXhrPatch
=
typeof
window
!==
'
undefined
'
&&
!!
window
.
ActiveXObject
&&
!
(
window
.
XMLHttpRequest
&&
(
new
XMLHttpRequest
).
dispatchEvent
);
// Map from CRUD to HTTP for our default `Backbone.sync` implementation.
// Map from CRUD to HTTP for our default `Backbone.sync` implementation.
var
methodMap
=
{
var
methodMap
=
{
'
create
'
:
'
POST
'
,
'
create
'
:
'
POST
'
,
...
@@ -1275,7 +1270,7 @@
...
@@ -1275,7 +1270,7 @@
_routeToRegExp
:
function
(
route
)
{
_routeToRegExp
:
function
(
route
)
{
route
=
route
.
replace
(
escapeRegExp
,
'
\\
$&
'
)
route
=
route
.
replace
(
escapeRegExp
,
'
\\
$&
'
)
.
replace
(
optionalParam
,
'
(?:$1)?
'
)
.
replace
(
optionalParam
,
'
(?:$1)?
'
)
.
replace
(
namedParam
,
function
(
match
,
optional
){
.
replace
(
namedParam
,
function
(
match
,
optional
)
{
return
optional
?
match
:
'
([^
\
/]+)
'
;
return
optional
?
match
:
'
([^
\
/]+)
'
;
})
})
.
replace
(
splatParam
,
'
(.*?)
'
);
.
replace
(
splatParam
,
'
(.*?)
'
);
...
@@ -1325,6 +1320,9 @@
...
@@ -1325,6 +1320,9 @@
// Cached regex for removing a trailing slash.
// Cached regex for removing a trailing slash.
var
trailingSlash
=
/
\/
$/
;
var
trailingSlash
=
/
\/
$/
;
// Cached regex for stripping urls of hash and query.
var
pathStripper
=
/
[
?#
]
.*$/
;
// Has the history handling already been started?
// Has the history handling already been started?
History
.
started
=
false
;
History
.
started
=
false
;
...
@@ -1349,7 +1347,7 @@
...
@@ -1349,7 +1347,7 @@
if
(
this
.
_hasPushState
||
!
this
.
_wantsHashChange
||
forcePushState
)
{
if
(
this
.
_hasPushState
||
!
this
.
_wantsHashChange
||
forcePushState
)
{
fragment
=
this
.
location
.
pathname
;
fragment
=
this
.
location
.
pathname
;
var
root
=
this
.
root
.
replace
(
trailingSlash
,
''
);
var
root
=
this
.
root
.
replace
(
trailingSlash
,
''
);
if
(
!
fragment
.
indexOf
(
root
))
fragment
=
fragment
.
s
ubstr
(
root
.
length
);
if
(
!
fragment
.
indexOf
(
root
))
fragment
=
fragment
.
s
lice
(
root
.
length
);
}
else
{
}
else
{
fragment
=
this
.
getHash
();
fragment
=
this
.
getHash
();
}
}
...
@@ -1365,7 +1363,7 @@
...
@@ -1365,7 +1363,7 @@
// Figure out the initial configuration. Do we need an iframe?
// Figure out the initial configuration. Do we need an iframe?
// Is pushState desired ... is it available?
// Is pushState desired ... is it available?
this
.
options
=
_
.
extend
({
},
{
root
:
'
/
'
},
this
.
options
,
options
);
this
.
options
=
_
.
extend
({
root
:
'
/
'
},
this
.
options
,
options
);
this
.
root
=
this
.
options
.
root
;
this
.
root
=
this
.
options
.
root
;
this
.
_wantsHashChange
=
this
.
options
.
hashChange
!==
false
;
this
.
_wantsHashChange
=
this
.
options
.
hashChange
!==
false
;
this
.
_wantsPushState
=
!!
this
.
options
.
pushState
;
this
.
_wantsPushState
=
!!
this
.
options
.
pushState
;
...
@@ -1398,19 +1396,25 @@
...
@@ -1398,19 +1396,25 @@
var
loc
=
this
.
location
;
var
loc
=
this
.
location
;
var
atRoot
=
loc
.
pathname
.
replace
(
/
[^\/]
$/
,
'
$&/
'
)
===
this
.
root
;
var
atRoot
=
loc
.
pathname
.
replace
(
/
[^\/]
$/
,
'
$&/
'
)
===
this
.
root
;
// If we've started off with a route from a `pushState`-enabled browser,
// Transition from hashChange to pushState or vice versa if both are
// but we're currently in a browser that doesn't support it...
// requested.
if
(
this
.
_wantsHashChange
&&
this
.
_wantsPushState
&&
!
this
.
_hasPushState
&&
!
atRoot
)
{
if
(
this
.
_wantsHashChange
&&
this
.
_wantsPushState
)
{
this
.
fragment
=
this
.
getFragment
(
null
,
true
);
this
.
location
.
replace
(
this
.
root
+
this
.
location
.
search
+
'
#
'
+
this
.
fragment
);
// If we've started off with a route from a `pushState`-enabled
// Return immediately as browser will do redirect to new url
// browser, but we're currently in a browser that doesn't support it...
return
true
;
if
(
!
this
.
_hasPushState
&&
!
atRoot
)
{
this
.
fragment
=
this
.
getFragment
(
null
,
true
);
this
.
location
.
replace
(
this
.
root
+
this
.
location
.
search
+
'
#
'
+
this
.
fragment
);
// Return immediately as browser will do redirect to new url
return
true
;
// Or if we've started out with a hash-based route, but we're currently
// in a browser where it could be `pushState`-based instead...
}
else
if
(
this
.
_hasPushState
&&
atRoot
&&
loc
.
hash
)
{
this
.
fragment
=
this
.
getHash
().
replace
(
routeStripper
,
''
);
this
.
history
.
replaceState
({},
document
.
title
,
this
.
root
+
this
.
fragment
+
loc
.
search
);
}
// Or if we've started out with a hash-based route, but we're currently
// in a browser where it could be `pushState`-based instead...
}
else
if
(
this
.
_wantsPushState
&&
this
.
_hasPushState
&&
atRoot
&&
loc
.
hash
)
{
this
.
fragment
=
this
.
getHash
().
replace
(
routeStripper
,
''
);
this
.
history
.
replaceState
({},
document
.
title
,
this
.
root
+
this
.
fragment
+
loc
.
search
);
}
}
if
(
!
this
.
options
.
silent
)
return
this
.
loadUrl
();
if
(
!
this
.
options
.
silent
)
return
this
.
loadUrl
();
...
@@ -1439,21 +1443,20 @@
...
@@ -1439,21 +1443,20 @@
}
}
if
(
current
===
this
.
fragment
)
return
false
;
if
(
current
===
this
.
fragment
)
return
false
;
if
(
this
.
iframe
)
this
.
navigate
(
current
);
if
(
this
.
iframe
)
this
.
navigate
(
current
);
this
.
loadUrl
()
||
this
.
loadUrl
(
this
.
getHash
())
;
this
.
loadUrl
();
},
},
// Attempt to load the current URL fragment. If a route succeeds with a
// Attempt to load the current URL fragment. If a route succeeds with a
// match, returns `true`. If no defined routes matches the fragment,
// match, returns `true`. If no defined routes matches the fragment,
// returns `false`.
// returns `false`.
loadUrl
:
function
(
fragment
Override
)
{
loadUrl
:
function
(
fragment
)
{
var
fragment
=
this
.
fragment
=
this
.
getFragment
(
fragmentOverride
);
fragment
=
this
.
fragment
=
this
.
getFragment
(
fragment
);
var
matched
=
_
.
any
(
this
.
handlers
,
function
(
handler
)
{
return
_
.
any
(
this
.
handlers
,
function
(
handler
)
{
if
(
handler
.
route
.
test
(
fragment
))
{
if
(
handler
.
route
.
test
(
fragment
))
{
handler
.
callback
(
fragment
);
handler
.
callback
(
fragment
);
return
true
;
return
true
;
}
}
});
});
return
matched
;
},
},
// Save a fragment into the hash history, or replace the URL state if the
// Save a fragment into the hash history, or replace the URL state if the
...
@@ -1465,11 +1468,18 @@
...
@@ -1465,11 +1468,18 @@
// you wish to modify the current URL without adding an entry to the history.
// you wish to modify the current URL without adding an entry to the history.
navigate
:
function
(
fragment
,
options
)
{
navigate
:
function
(
fragment
,
options
)
{
if
(
!
History
.
started
)
return
false
;
if
(
!
History
.
started
)
return
false
;
if
(
!
options
||
options
===
true
)
options
=
{
trigger
:
options
};
if
(
!
options
||
options
===
true
)
options
=
{
trigger
:
!!
options
};
fragment
=
this
.
getFragment
(
fragment
||
''
);
var
url
=
this
.
root
+
(
fragment
=
this
.
getFragment
(
fragment
||
''
));
// Strip the fragment of the query and hash for matching.
fragment
=
fragment
.
replace
(
pathStripper
,
''
);
if
(
this
.
fragment
===
fragment
)
return
;
if
(
this
.
fragment
===
fragment
)
return
;
this
.
fragment
=
fragment
;
this
.
fragment
=
fragment
;
var
url
=
this
.
root
+
fragment
;
// Don't include a trailing slash on the root.
if
(
fragment
===
''
&&
url
!==
'
/
'
)
url
=
url
.
slice
(
0
,
-
1
);
// If pushState is available, we use it to set the fragment as a real URL.
// If pushState is available, we use it to set the fragment as a real URL.
if
(
this
.
_hasPushState
)
{
if
(
this
.
_hasPushState
)
{
...
@@ -1492,7 +1502,7 @@
...
@@ -1492,7 +1502,7 @@
}
else
{
}
else
{
return
this
.
location
.
assign
(
url
);
return
this
.
location
.
assign
(
url
);
}
}
if
(
options
.
trigger
)
this
.
loadUrl
(
fragment
);
if
(
options
.
trigger
)
return
this
.
loadUrl
(
fragment
);
},
},
// Update the hash location, either replacing the current entry, or adding
// Update the hash location, either replacing the current entry, or adding
...
@@ -1560,7 +1570,7 @@
...
@@ -1560,7 +1570,7 @@
};
};
// Wrap an optional error callback with a fallback error event.
// Wrap an optional error callback with a fallback error event.
var
wrapError
=
function
(
model
,
options
)
{
var
wrapError
=
function
(
model
,
options
)
{
var
error
=
options
.
error
;
var
error
=
options
.
error
;
options
.
error
=
function
(
resp
)
{
options
.
error
=
function
(
resp
)
{
if
(
error
)
error
(
model
,
resp
,
options
);
if
(
error
)
error
(
model
,
resp
,
options
);
...
...
architecture-examples/backbone/bower_components/jquery/jquery.js
View file @
6d3e6498
This source diff could not be displayed because it is too large. You can
view the blob
instead.
architecture-examples/backbone/bower_components/underscore/underscore.js
View file @
6d3e6498
// Underscore.js 1.
4.4
// Underscore.js 1.
5.2
// http://underscorejs.org
// http://underscorejs.org
// (c) 2009-2013 Jeremy Ashkenas, DocumentCloud
Inc.
// (c) 2009-2013 Jeremy Ashkenas, DocumentCloud
and Investigative Reporters & Editors
// Underscore may be freely distributed under the MIT license.
// Underscore may be freely distributed under the MIT license.
(
function
()
{
(
function
()
{
...
@@ -8,7 +8,7 @@
...
@@ -8,7 +8,7 @@
// Baseline setup
// Baseline setup
// --------------
// --------------
// Establish the root object, `window` in the browser, or `
global
` on the server.
// Establish the root object, `window` in the browser, or `
exports
` on the server.
var
root
=
this
;
var
root
=
this
;
// Save the previous value of the `_` variable.
// Save the previous value of the `_` variable.
...
@@ -21,11 +21,12 @@
...
@@ -21,11 +21,12 @@
var
ArrayProto
=
Array
.
prototype
,
ObjProto
=
Object
.
prototype
,
FuncProto
=
Function
.
prototype
;
var
ArrayProto
=
Array
.
prototype
,
ObjProto
=
Object
.
prototype
,
FuncProto
=
Function
.
prototype
;
// Create quick reference variables for speed access to core prototypes.
// Create quick reference variables for speed access to core prototypes.
var
push
=
ArrayProto
.
push
,
var
slice
=
ArrayProto
.
slice
,
push
=
ArrayProto
.
push
,
concat
=
ArrayProto
.
concat
,
slice
=
ArrayProto
.
slice
,
toString
=
ObjProto
.
toString
,
concat
=
ArrayProto
.
concat
,
hasOwnProperty
=
ObjProto
.
hasOwnProperty
;
toString
=
ObjProto
.
toString
,
hasOwnProperty
=
ObjProto
.
hasOwnProperty
;
// All **ECMAScript 5** native function implementations that we hope to use
// All **ECMAScript 5** native function implementations that we hope to use
// are declared here.
// are declared here.
...
@@ -64,7 +65,7 @@
...
@@ -64,7 +65,7 @@
}
}
// Current version.
// Current version.
_
.
VERSION
=
'
1.
4.4
'
;
_
.
VERSION
=
'
1.
5.2
'
;
// Collection Functions
// Collection Functions
// --------------------
// --------------------
...
@@ -77,14 +78,13 @@
...
@@ -77,14 +78,13 @@
if
(
nativeForEach
&&
obj
.
forEach
===
nativeForEach
)
{
if
(
nativeForEach
&&
obj
.
forEach
===
nativeForEach
)
{
obj
.
forEach
(
iterator
,
context
);
obj
.
forEach
(
iterator
,
context
);
}
else
if
(
obj
.
length
===
+
obj
.
length
)
{
}
else
if
(
obj
.
length
===
+
obj
.
length
)
{
for
(
var
i
=
0
,
l
=
obj
.
length
;
i
<
l
;
i
++
)
{
for
(
var
i
=
0
,
l
ength
=
obj
.
length
;
i
<
length
;
i
++
)
{
if
(
iterator
.
call
(
context
,
obj
[
i
],
i
,
obj
)
===
breaker
)
return
;
if
(
iterator
.
call
(
context
,
obj
[
i
],
i
,
obj
)
===
breaker
)
return
;
}
}
}
else
{
}
else
{
for
(
var
key
in
obj
)
{
var
keys
=
_
.
keys
(
obj
);
if
(
_
.
has
(
obj
,
key
))
{
for
(
var
i
=
0
,
length
=
keys
.
length
;
i
<
length
;
i
++
)
{
if
(
iterator
.
call
(
context
,
obj
[
key
],
key
,
obj
)
===
breaker
)
return
;
if
(
iterator
.
call
(
context
,
obj
[
keys
[
i
]],
keys
[
i
],
obj
)
===
breaker
)
return
;
}
}
}
}
}
};
};
...
@@ -96,7 +96,7 @@
...
@@ -96,7 +96,7 @@
if
(
obj
==
null
)
return
results
;
if
(
obj
==
null
)
return
results
;
if
(
nativeMap
&&
obj
.
map
===
nativeMap
)
return
obj
.
map
(
iterator
,
context
);
if
(
nativeMap
&&
obj
.
map
===
nativeMap
)
return
obj
.
map
(
iterator
,
context
);
each
(
obj
,
function
(
value
,
index
,
list
)
{
each
(
obj
,
function
(
value
,
index
,
list
)
{
results
[
results
.
length
]
=
iterator
.
call
(
context
,
value
,
index
,
list
);
results
.
push
(
iterator
.
call
(
context
,
value
,
index
,
list
)
);
});
});
return
results
;
return
results
;
};
};
...
@@ -171,7 +171,7 @@
...
@@ -171,7 +171,7 @@
if
(
obj
==
null
)
return
results
;
if
(
obj
==
null
)
return
results
;
if
(
nativeFilter
&&
obj
.
filter
===
nativeFilter
)
return
obj
.
filter
(
iterator
,
context
);
if
(
nativeFilter
&&
obj
.
filter
===
nativeFilter
)
return
obj
.
filter
(
iterator
,
context
);
each
(
obj
,
function
(
value
,
index
,
list
)
{
each
(
obj
,
function
(
value
,
index
,
list
)
{
if
(
iterator
.
call
(
context
,
value
,
index
,
list
))
results
[
results
.
length
]
=
value
;
if
(
iterator
.
call
(
context
,
value
,
index
,
list
))
results
.
push
(
value
)
;
});
});
return
results
;
return
results
;
};
};
...
@@ -238,7 +238,7 @@
...
@@ -238,7 +238,7 @@
// Convenience version of a common use case of `filter`: selecting only objects
// Convenience version of a common use case of `filter`: selecting only objects
// containing specific `key:value` pairs.
// containing specific `key:value` pairs.
_
.
where
=
function
(
obj
,
attrs
,
first
)
{
_
.
where
=
function
(
obj
,
attrs
,
first
)
{
if
(
_
.
isEmpty
(
attrs
))
return
first
?
null
:
[];
if
(
_
.
isEmpty
(
attrs
))
return
first
?
void
0
:
[];
return
_
[
first
?
'
find
'
:
'
filter
'
](
obj
,
function
(
value
)
{
return
_
[
first
?
'
find
'
:
'
filter
'
](
obj
,
function
(
value
)
{
for
(
var
key
in
attrs
)
{
for
(
var
key
in
attrs
)
{
if
(
attrs
[
key
]
!==
value
[
key
])
return
false
;
if
(
attrs
[
key
]
!==
value
[
key
])
return
false
;
...
@@ -255,7 +255,7 @@
...
@@ -255,7 +255,7 @@
// Return the maximum element or (element-based computation).
// Return the maximum element or (element-based computation).
// Can't optimize arrays of integers longer than 65,535 elements.
// Can't optimize arrays of integers longer than 65,535 elements.
// See
: https://bugs.webkit.org/show_bug.cgi?id=80797
// See
[WebKit Bug 80797](https://bugs.webkit.org/show_bug.cgi?id=80797)
_
.
max
=
function
(
obj
,
iterator
,
context
)
{
_
.
max
=
function
(
obj
,
iterator
,
context
)
{
if
(
!
iterator
&&
_
.
isArray
(
obj
)
&&
obj
[
0
]
===
+
obj
[
0
]
&&
obj
.
length
<
65535
)
{
if
(
!
iterator
&&
_
.
isArray
(
obj
)
&&
obj
[
0
]
===
+
obj
[
0
]
&&
obj
.
length
<
65535
)
{
return
Math
.
max
.
apply
(
Math
,
obj
);
return
Math
.
max
.
apply
(
Math
,
obj
);
...
@@ -264,7 +264,7 @@
...
@@ -264,7 +264,7 @@
var
result
=
{
computed
:
-
Infinity
,
value
:
-
Infinity
};
var
result
=
{
computed
:
-
Infinity
,
value
:
-
Infinity
};
each
(
obj
,
function
(
value
,
index
,
list
)
{
each
(
obj
,
function
(
value
,
index
,
list
)
{
var
computed
=
iterator
?
iterator
.
call
(
context
,
value
,
index
,
list
)
:
value
;
var
computed
=
iterator
?
iterator
.
call
(
context
,
value
,
index
,
list
)
:
value
;
computed
>
=
result
.
computed
&&
(
result
=
{
value
:
value
,
computed
:
computed
});
computed
>
result
.
computed
&&
(
result
=
{
value
:
value
,
computed
:
computed
});
});
});
return
result
.
value
;
return
result
.
value
;
};
};
...
@@ -283,7 +283,8 @@
...
@@ -283,7 +283,8 @@
return
result
.
value
;
return
result
.
value
;
};
};
// Shuffle an array.
// Shuffle an array, using the modern version of the
// [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
_
.
shuffle
=
function
(
obj
)
{
_
.
shuffle
=
function
(
obj
)
{
var
rand
;
var
rand
;
var
index
=
0
;
var
index
=
0
;
...
@@ -296,6 +297,16 @@
...
@@ -296,6 +297,16 @@
return
shuffled
;
return
shuffled
;
};
};
// Sample **n** random values from an array.
// If **n** is not specified, returns a single random element from the array.
// The internal `guard` argument allows it to work with `map`.
_
.
sample
=
function
(
obj
,
n
,
guard
)
{
if
(
arguments
.
length
<
2
||
guard
)
{
return
obj
[
_
.
random
(
obj
.
length
-
1
)];
}
return
_
.
shuffle
(
obj
).
slice
(
0
,
Math
.
max
(
0
,
n
));
};
// An internal function to generate lookup iterators.
// An internal function to generate lookup iterators.
var
lookupIterator
=
function
(
value
)
{
var
lookupIterator
=
function
(
value
)
{
return
_
.
isFunction
(
value
)
?
value
:
function
(
obj
){
return
obj
[
value
];
};
return
_
.
isFunction
(
value
)
?
value
:
function
(
obj
){
return
obj
[
value
];
};
...
@@ -306,9 +317,9 @@
...
@@ -306,9 +317,9 @@
var
iterator
=
lookupIterator
(
value
);
var
iterator
=
lookupIterator
(
value
);
return
_
.
pluck
(
_
.
map
(
obj
,
function
(
value
,
index
,
list
)
{
return
_
.
pluck
(
_
.
map
(
obj
,
function
(
value
,
index
,
list
)
{
return
{
return
{
value
:
value
,
value
:
value
,
index
:
index
,
index
:
index
,
criteria
:
iterator
.
call
(
context
,
value
,
index
,
list
)
criteria
:
iterator
.
call
(
context
,
value
,
index
,
list
)
};
};
}).
sort
(
function
(
left
,
right
)
{
}).
sort
(
function
(
left
,
right
)
{
var
a
=
left
.
criteria
;
var
a
=
left
.
criteria
;
...
@@ -317,38 +328,41 @@
...
@@ -317,38 +328,41 @@
if
(
a
>
b
||
a
===
void
0
)
return
1
;
if
(
a
>
b
||
a
===
void
0
)
return
1
;
if
(
a
<
b
||
b
===
void
0
)
return
-
1
;
if
(
a
<
b
||
b
===
void
0
)
return
-
1
;
}
}
return
left
.
index
<
right
.
index
?
-
1
:
1
;
return
left
.
index
-
right
.
index
;
}),
'
value
'
);
}),
'
value
'
);
};
};
// An internal function used for aggregate "group by" operations.
// An internal function used for aggregate "group by" operations.
var
group
=
function
(
obj
,
value
,
context
,
behavior
)
{
var
group
=
function
(
behavior
)
{
var
result
=
{};
return
function
(
obj
,
value
,
context
)
{
var
iterator
=
lookupIterator
(
value
||
_
.
identity
);
var
result
=
{};
each
(
obj
,
function
(
value
,
index
)
{
var
iterator
=
value
==
null
?
_
.
identity
:
lookupIterator
(
value
);
var
key
=
iterator
.
call
(
context
,
value
,
index
,
obj
);
each
(
obj
,
function
(
value
,
index
)
{
behavior
(
result
,
key
,
value
);
var
key
=
iterator
.
call
(
context
,
value
,
index
,
obj
);
});
behavior
(
result
,
key
,
value
);
return
result
;
});
return
result
;
};
};
};
// Groups the object's values by a criterion. Pass either a string attribute
// Groups the object's values by a criterion. Pass either a string attribute
// to group by, or a function that returns the criterion.
// to group by, or a function that returns the criterion.
_
.
groupBy
=
function
(
obj
,
value
,
context
)
{
_
.
groupBy
=
group
(
function
(
result
,
key
,
value
)
{
return
group
(
obj
,
value
,
context
,
function
(
result
,
key
,
value
)
{
(
_
.
has
(
result
,
key
)
?
result
[
key
]
:
(
result
[
key
]
=
[])).
push
(
value
);
(
_
.
has
(
result
,
key
)
?
result
[
key
]
:
(
result
[
key
]
=
[])).
push
(
value
);
});
});
};
// Indexes the object's values by a criterion, similar to `groupBy`, but for
// when you know that your index values will be unique.
_
.
indexBy
=
group
(
function
(
result
,
key
,
value
)
{
result
[
key
]
=
value
;
});
// Counts instances of an object that group by a certain criterion. Pass
// Counts instances of an object that group by a certain criterion. Pass
// either a string attribute to count by, or a function that returns the
// either a string attribute to count by, or a function that returns the
// criterion.
// criterion.
_
.
countBy
=
function
(
obj
,
value
,
context
)
{
_
.
countBy
=
group
(
function
(
result
,
key
)
{
return
group
(
obj
,
value
,
context
,
function
(
result
,
key
)
{
_
.
has
(
result
,
key
)
?
result
[
key
]
++
:
result
[
key
]
=
1
;
if
(
!
_
.
has
(
result
,
key
))
result
[
key
]
=
0
;
});
result
[
key
]
++
;
});
};
// Use a comparator function to figure out the smallest index at which
// Use a comparator function to figure out the smallest index at which
// an object should be inserted so as to maintain order. Uses binary search.
// an object should be inserted so as to maintain order. Uses binary search.
...
@@ -363,7 +377,7 @@
...
@@ -363,7 +377,7 @@
return
low
;
return
low
;
};
};
// Safely c
onvert anything iterable into a real, live array
.
// Safely c
reate a real, live array from anything iterable
.
_
.
toArray
=
function
(
obj
)
{
_
.
toArray
=
function
(
obj
)
{
if
(
!
obj
)
return
[];
if
(
!
obj
)
return
[];
if
(
_
.
isArray
(
obj
))
return
slice
.
call
(
obj
);
if
(
_
.
isArray
(
obj
))
return
slice
.
call
(
obj
);
...
@@ -385,7 +399,7 @@
...
@@ -385,7 +399,7 @@
// allows it to work with `_.map`.
// allows it to work with `_.map`.
_
.
first
=
_
.
head
=
_
.
take
=
function
(
array
,
n
,
guard
)
{
_
.
first
=
_
.
head
=
_
.
take
=
function
(
array
,
n
,
guard
)
{
if
(
array
==
null
)
return
void
0
;
if
(
array
==
null
)
return
void
0
;
return
(
n
!=
null
)
&&
!
guard
?
slice
.
call
(
array
,
0
,
n
)
:
array
[
0
]
;
return
(
n
==
null
)
||
guard
?
array
[
0
]
:
slice
.
call
(
array
,
0
,
n
)
;
};
};
// Returns everything but the last entry of the array. Especially useful on
// Returns everything but the last entry of the array. Especially useful on
...
@@ -400,10 +414,10 @@
...
@@ -400,10 +414,10 @@
// values in the array. The **guard** check allows it to work with `_.map`.
// values in the array. The **guard** check allows it to work with `_.map`.
_
.
last
=
function
(
array
,
n
,
guard
)
{
_
.
last
=
function
(
array
,
n
,
guard
)
{
if
(
array
==
null
)
return
void
0
;
if
(
array
==
null
)
return
void
0
;
if
((
n
!=
null
)
&&
!
guard
)
{
if
((
n
==
null
)
||
guard
)
{
return
slice
.
call
(
array
,
Math
.
max
(
array
.
length
-
n
,
0
));
}
else
{
return
array
[
array
.
length
-
1
];
return
array
[
array
.
length
-
1
];
}
else
{
return
slice
.
call
(
array
,
Math
.
max
(
array
.
length
-
n
,
0
));
}
}
};
};
...
@@ -422,8 +436,11 @@
...
@@ -422,8 +436,11 @@
// Internal implementation of a recursive `flatten` function.
// Internal implementation of a recursive `flatten` function.
var
flatten
=
function
(
input
,
shallow
,
output
)
{
var
flatten
=
function
(
input
,
shallow
,
output
)
{
if
(
shallow
&&
_
.
every
(
input
,
_
.
isArray
))
{
return
concat
.
apply
(
output
,
input
);
}
each
(
input
,
function
(
value
)
{
each
(
input
,
function
(
value
)
{
if
(
_
.
isArray
(
value
))
{
if
(
_
.
isArray
(
value
)
||
_
.
isArguments
(
value
)
)
{
shallow
?
push
.
apply
(
output
,
value
)
:
flatten
(
value
,
shallow
,
output
);
shallow
?
push
.
apply
(
output
,
value
)
:
flatten
(
value
,
shallow
,
output
);
}
else
{
}
else
{
output
.
push
(
value
);
output
.
push
(
value
);
...
@@ -432,7 +449,7 @@
...
@@ -432,7 +449,7 @@
return
output
;
return
output
;
};
};
//
Return a completely flattened version of an array
.
//
Flatten out an array, either recursively (by default), or just one level
.
_
.
flatten
=
function
(
array
,
shallow
)
{
_
.
flatten
=
function
(
array
,
shallow
)
{
return
flatten
(
array
,
shallow
,
[]);
return
flatten
(
array
,
shallow
,
[]);
};
};
...
@@ -466,7 +483,7 @@
...
@@ -466,7 +483,7 @@
// Produce an array that contains the union: each distinct element from all of
// Produce an array that contains the union: each distinct element from all of
// the passed-in arrays.
// the passed-in arrays.
_
.
union
=
function
()
{
_
.
union
=
function
()
{
return
_
.
uniq
(
concat
.
apply
(
ArrayProto
,
arguments
));
return
_
.
uniq
(
_
.
flatten
(
arguments
,
true
));
};
};
// Produce an array that contains every item shared between all the
// Produce an array that contains every item shared between all the
...
@@ -490,11 +507,10 @@
...
@@ -490,11 +507,10 @@
// Zip together multiple lists into a single array -- elements that share
// Zip together multiple lists into a single array -- elements that share
// an index go together.
// an index go together.
_
.
zip
=
function
()
{
_
.
zip
=
function
()
{
var
args
=
slice
.
call
(
arguments
);
var
length
=
_
.
max
(
_
.
pluck
(
arguments
,
"
length
"
).
concat
(
0
));
var
length
=
_
.
max
(
_
.
pluck
(
args
,
'
length
'
));
var
results
=
new
Array
(
length
);
var
results
=
new
Array
(
length
);
for
(
var
i
=
0
;
i
<
length
;
i
++
)
{
for
(
var
i
=
0
;
i
<
length
;
i
++
)
{
results
[
i
]
=
_
.
pluck
(
arg
s
,
""
+
i
);
results
[
i
]
=
_
.
pluck
(
arg
uments
,
''
+
i
);
}
}
return
results
;
return
results
;
};
};
...
@@ -505,7 +521,7 @@
...
@@ -505,7 +521,7 @@
_
.
object
=
function
(
list
,
values
)
{
_
.
object
=
function
(
list
,
values
)
{
if
(
list
==
null
)
return
{};
if
(
list
==
null
)
return
{};
var
result
=
{};
var
result
=
{};
for
(
var
i
=
0
,
l
=
list
.
length
;
i
<
l
;
i
++
)
{
for
(
var
i
=
0
,
l
ength
=
list
.
length
;
i
<
length
;
i
++
)
{
if
(
values
)
{
if
(
values
)
{
result
[
list
[
i
]]
=
values
[
i
];
result
[
list
[
i
]]
=
values
[
i
];
}
else
{
}
else
{
...
@@ -523,17 +539,17 @@
...
@@ -523,17 +539,17 @@
// for **isSorted** to use binary search.
// for **isSorted** to use binary search.
_
.
indexOf
=
function
(
array
,
item
,
isSorted
)
{
_
.
indexOf
=
function
(
array
,
item
,
isSorted
)
{
if
(
array
==
null
)
return
-
1
;
if
(
array
==
null
)
return
-
1
;
var
i
=
0
,
l
=
array
.
length
;
var
i
=
0
,
l
ength
=
array
.
length
;
if
(
isSorted
)
{
if
(
isSorted
)
{
if
(
typeof
isSorted
==
'
number
'
)
{
if
(
typeof
isSorted
==
'
number
'
)
{
i
=
(
isSorted
<
0
?
Math
.
max
(
0
,
l
+
isSorted
)
:
isSorted
);
i
=
(
isSorted
<
0
?
Math
.
max
(
0
,
l
ength
+
isSorted
)
:
isSorted
);
}
else
{
}
else
{
i
=
_
.
sortedIndex
(
array
,
item
);
i
=
_
.
sortedIndex
(
array
,
item
);
return
array
[
i
]
===
item
?
i
:
-
1
;
return
array
[
i
]
===
item
?
i
:
-
1
;
}
}
}
}
if
(
nativeIndexOf
&&
array
.
indexOf
===
nativeIndexOf
)
return
array
.
indexOf
(
item
,
isSorted
);
if
(
nativeIndexOf
&&
array
.
indexOf
===
nativeIndexOf
)
return
array
.
indexOf
(
item
,
isSorted
);
for
(;
i
<
l
;
i
++
)
if
(
array
[
i
]
===
item
)
return
i
;
for
(;
i
<
l
ength
;
i
++
)
if
(
array
[
i
]
===
item
)
return
i
;
return
-
1
;
return
-
1
;
};
};
...
@@ -559,11 +575,11 @@
...
@@ -559,11 +575,11 @@
}
}
step
=
arguments
[
2
]
||
1
;
step
=
arguments
[
2
]
||
1
;
var
len
=
Math
.
max
(
Math
.
ceil
((
stop
-
start
)
/
step
),
0
);
var
len
gth
=
Math
.
max
(
Math
.
ceil
((
stop
-
start
)
/
step
),
0
);
var
idx
=
0
;
var
idx
=
0
;
var
range
=
new
Array
(
len
);
var
range
=
new
Array
(
len
gth
);
while
(
idx
<
len
)
{
while
(
idx
<
len
gth
)
{
range
[
idx
++
]
=
start
;
range
[
idx
++
]
=
start
;
start
+=
step
;
start
+=
step
;
}
}
...
@@ -574,14 +590,25 @@
...
@@ -574,14 +590,25 @@
// Function (ahem) Functions
// Function (ahem) Functions
// ------------------
// ------------------
// Reusable constructor function for prototype setting.
var
ctor
=
function
(){};
// Create a function bound to a given object (assigning `this`, and arguments,
// Create a function bound to a given object (assigning `this`, and arguments,
// optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
// optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
// available.
// available.
_
.
bind
=
function
(
func
,
context
)
{
_
.
bind
=
function
(
func
,
context
)
{
if
(
func
.
bind
===
nativeBind
&&
nativeBind
)
return
nativeBind
.
apply
(
func
,
slice
.
call
(
arguments
,
1
));
var
args
,
bound
;
var
args
=
slice
.
call
(
arguments
,
2
);
if
(
nativeBind
&&
func
.
bind
===
nativeBind
)
return
nativeBind
.
apply
(
func
,
slice
.
call
(
arguments
,
1
));
return
function
()
{
if
(
!
_
.
isFunction
(
func
))
throw
new
TypeError
;
return
func
.
apply
(
context
,
args
.
concat
(
slice
.
call
(
arguments
)));
args
=
slice
.
call
(
arguments
,
2
);
return
bound
=
function
()
{
if
(
!
(
this
instanceof
bound
))
return
func
.
apply
(
context
,
args
.
concat
(
slice
.
call
(
arguments
)));
ctor
.
prototype
=
func
.
prototype
;
var
self
=
new
ctor
;
ctor
.
prototype
=
null
;
var
result
=
func
.
apply
(
self
,
args
.
concat
(
slice
.
call
(
arguments
)));
if
(
Object
(
result
)
===
result
)
return
result
;
return
self
;
};
};
};
};
...
@@ -598,7 +625,7 @@
...
@@ -598,7 +625,7 @@
// all callbacks defined on an object belong to it.
// all callbacks defined on an object belong to it.
_
.
bindAll
=
function
(
obj
)
{
_
.
bindAll
=
function
(
obj
)
{
var
funcs
=
slice
.
call
(
arguments
,
1
);
var
funcs
=
slice
.
call
(
arguments
,
1
);
if
(
funcs
.
length
===
0
)
funcs
=
_
.
functions
(
obj
);
if
(
funcs
.
length
===
0
)
throw
new
Error
(
"
bindAll must be passed function names
"
);
each
(
funcs
,
function
(
f
)
{
obj
[
f
]
=
_
.
bind
(
obj
[
f
],
obj
);
});
each
(
funcs
,
function
(
f
)
{
obj
[
f
]
=
_
.
bind
(
obj
[
f
],
obj
);
});
return
obj
;
return
obj
;
};
};
...
@@ -627,17 +654,23 @@
...
@@ -627,17 +654,23 @@
};
};
// Returns a function, that, when invoked, will only be triggered at most once
// Returns a function, that, when invoked, will only be triggered at most once
// during a given window of time.
// during a given window of time. Normally, the throttled function will run
_
.
throttle
=
function
(
func
,
wait
)
{
// as much as it can, without ever going more than once per `wait` duration;
var
context
,
args
,
timeout
,
result
;
// but if you'd like to disable the execution on the leading edge, pass
// `{leading: false}`. To disable execution on the trailing edge, ditto.
_
.
throttle
=
function
(
func
,
wait
,
options
)
{
var
context
,
args
,
result
;
var
timeout
=
null
;
var
previous
=
0
;
var
previous
=
0
;
options
||
(
options
=
{});
var
later
=
function
()
{
var
later
=
function
()
{
previous
=
new
Date
;
previous
=
options
.
leading
===
false
?
0
:
new
Date
;
timeout
=
null
;
timeout
=
null
;
result
=
func
.
apply
(
context
,
args
);
result
=
func
.
apply
(
context
,
args
);
};
};
return
function
()
{
return
function
()
{
var
now
=
new
Date
;
var
now
=
new
Date
;
if
(
!
previous
&&
options
.
leading
===
false
)
previous
=
now
;
var
remaining
=
wait
-
(
now
-
previous
);
var
remaining
=
wait
-
(
now
-
previous
);
context
=
this
;
context
=
this
;
args
=
arguments
;
args
=
arguments
;
...
@@ -646,7 +679,7 @@
...
@@ -646,7 +679,7 @@
timeout
=
null
;
timeout
=
null
;
previous
=
now
;
previous
=
now
;
result
=
func
.
apply
(
context
,
args
);
result
=
func
.
apply
(
context
,
args
);
}
else
if
(
!
timeout
)
{
}
else
if
(
!
timeout
&&
options
.
trailing
!==
false
)
{
timeout
=
setTimeout
(
later
,
remaining
);
timeout
=
setTimeout
(
later
,
remaining
);
}
}
return
result
;
return
result
;
...
@@ -658,16 +691,24 @@
...
@@ -658,16 +691,24 @@
// N milliseconds. If `immediate` is passed, trigger the function on the
// N milliseconds. If `immediate` is passed, trigger the function on the
// leading edge, instead of the trailing.
// leading edge, instead of the trailing.
_
.
debounce
=
function
(
func
,
wait
,
immediate
)
{
_
.
debounce
=
function
(
func
,
wait
,
immediate
)
{
var
timeout
,
result
;
var
timeout
,
args
,
context
,
timestamp
,
result
;
return
function
()
{
return
function
()
{
var
context
=
this
,
args
=
arguments
;
context
=
this
;
args
=
arguments
;
timestamp
=
new
Date
();
var
later
=
function
()
{
var
later
=
function
()
{
timeout
=
null
;
var
last
=
(
new
Date
())
-
timestamp
;
if
(
!
immediate
)
result
=
func
.
apply
(
context
,
args
);
if
(
last
<
wait
)
{
timeout
=
setTimeout
(
later
,
wait
-
last
);
}
else
{
timeout
=
null
;
if
(
!
immediate
)
result
=
func
.
apply
(
context
,
args
);
}
};
};
var
callNow
=
immediate
&&
!
timeout
;
var
callNow
=
immediate
&&
!
timeout
;
clearTimeout
(
timeout
);
if
(
!
timeout
)
{
timeout
=
setTimeout
(
later
,
wait
);
timeout
=
setTimeout
(
later
,
wait
);
}
if
(
callNow
)
result
=
func
.
apply
(
context
,
args
);
if
(
callNow
)
result
=
func
.
apply
(
context
,
args
);
return
result
;
return
result
;
};
};
...
@@ -712,7 +753,6 @@
...
@@ -712,7 +753,6 @@
// Returns a function that will only be executed after being called N times.
// Returns a function that will only be executed after being called N times.
_
.
after
=
function
(
times
,
func
)
{
_
.
after
=
function
(
times
,
func
)
{
if
(
times
<=
0
)
return
func
();
return
function
()
{
return
function
()
{
if
(
--
times
<
1
)
{
if
(
--
times
<
1
)
{
return
func
.
apply
(
this
,
arguments
);
return
func
.
apply
(
this
,
arguments
);
...
@@ -728,28 +768,39 @@
...
@@ -728,28 +768,39 @@
_
.
keys
=
nativeKeys
||
function
(
obj
)
{
_
.
keys
=
nativeKeys
||
function
(
obj
)
{
if
(
obj
!==
Object
(
obj
))
throw
new
TypeError
(
'
Invalid object
'
);
if
(
obj
!==
Object
(
obj
))
throw
new
TypeError
(
'
Invalid object
'
);
var
keys
=
[];
var
keys
=
[];
for
(
var
key
in
obj
)
if
(
_
.
has
(
obj
,
key
))
keys
[
keys
.
length
]
=
key
;
for
(
var
key
in
obj
)
if
(
_
.
has
(
obj
,
key
))
keys
.
push
(
key
)
;
return
keys
;
return
keys
;
};
};
// Retrieve the values of an object's properties.
// Retrieve the values of an object's properties.
_
.
values
=
function
(
obj
)
{
_
.
values
=
function
(
obj
)
{
var
values
=
[];
var
keys
=
_
.
keys
(
obj
);
for
(
var
key
in
obj
)
if
(
_
.
has
(
obj
,
key
))
values
.
push
(
obj
[
key
]);
var
length
=
keys
.
length
;
var
values
=
new
Array
(
length
);
for
(
var
i
=
0
;
i
<
length
;
i
++
)
{
values
[
i
]
=
obj
[
keys
[
i
]];
}
return
values
;
return
values
;
};
};
// Convert an object into a list of `[key, value]` pairs.
// Convert an object into a list of `[key, value]` pairs.
_
.
pairs
=
function
(
obj
)
{
_
.
pairs
=
function
(
obj
)
{
var
pairs
=
[];
var
keys
=
_
.
keys
(
obj
);
for
(
var
key
in
obj
)
if
(
_
.
has
(
obj
,
key
))
pairs
.
push
([
key
,
obj
[
key
]]);
var
length
=
keys
.
length
;
var
pairs
=
new
Array
(
length
);
for
(
var
i
=
0
;
i
<
length
;
i
++
)
{
pairs
[
i
]
=
[
keys
[
i
],
obj
[
keys
[
i
]]];
}
return
pairs
;
return
pairs
;
};
};
// Invert the keys and values of an object. The values must be serializable.
// Invert the keys and values of an object. The values must be serializable.
_
.
invert
=
function
(
obj
)
{
_
.
invert
=
function
(
obj
)
{
var
result
=
{};
var
result
=
{};
for
(
var
key
in
obj
)
if
(
_
.
has
(
obj
,
key
))
result
[
obj
[
key
]]
=
key
;
var
keys
=
_
.
keys
(
obj
);
for
(
var
i
=
0
,
length
=
keys
.
length
;
i
<
length
;
i
++
)
{
result
[
obj
[
keys
[
i
]]]
=
keys
[
i
];
}
return
result
;
return
result
;
};
};
...
@@ -800,7 +851,7 @@
...
@@ -800,7 +851,7 @@
each
(
slice
.
call
(
arguments
,
1
),
function
(
source
)
{
each
(
slice
.
call
(
arguments
,
1
),
function
(
source
)
{
if
(
source
)
{
if
(
source
)
{
for
(
var
prop
in
source
)
{
for
(
var
prop
in
source
)
{
if
(
obj
[
prop
]
==
null
)
obj
[
prop
]
=
source
[
prop
];
if
(
obj
[
prop
]
==
=
void
0
)
obj
[
prop
]
=
source
[
prop
];
}
}
}
}
});
});
...
@@ -824,7 +875,7 @@
...
@@ -824,7 +875,7 @@
// Internal recursive comparison function for `isEqual`.
// Internal recursive comparison function for `isEqual`.
var
eq
=
function
(
a
,
b
,
aStack
,
bStack
)
{
var
eq
=
function
(
a
,
b
,
aStack
,
bStack
)
{
// Identical objects are equal. `0 === -0`, but they aren't identical.
// Identical objects are equal. `0 === -0`, but they aren't identical.
// See the
Harmony `egal` proposal: http://wiki.ecmascript.org/doku.php?id=harmony:egal
.
// See the
[Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal)
.
if
(
a
===
b
)
return
a
!==
0
||
1
/
a
==
1
/
b
;
if
(
a
===
b
)
return
a
!==
0
||
1
/
a
==
1
/
b
;
// A strict comparison is necessary because `null == undefined`.
// A strict comparison is necessary because `null == undefined`.
if
(
a
==
null
||
b
==
null
)
return
a
===
b
;
if
(
a
==
null
||
b
==
null
)
return
a
===
b
;
...
@@ -866,6 +917,13 @@
...
@@ -866,6 +917,13 @@
// unique nested structures.
// unique nested structures.
if
(
aStack
[
length
]
==
a
)
return
bStack
[
length
]
==
b
;
if
(
aStack
[
length
]
==
a
)
return
bStack
[
length
]
==
b
;
}
}
// Objects with different constructors are not equivalent, but `Object`s
// from different frames are.
var
aCtor
=
a
.
constructor
,
bCtor
=
b
.
constructor
;
if
(
aCtor
!==
bCtor
&&
!
(
_
.
isFunction
(
aCtor
)
&&
(
aCtor
instanceof
aCtor
)
&&
_
.
isFunction
(
bCtor
)
&&
(
bCtor
instanceof
bCtor
)))
{
return
false
;
}
// Add the first object to the stack of traversed objects.
// Add the first object to the stack of traversed objects.
aStack
.
push
(
a
);
aStack
.
push
(
a
);
bStack
.
push
(
b
);
bStack
.
push
(
b
);
...
@@ -882,13 +940,6 @@
...
@@ -882,13 +940,6 @@
}
}
}
}
}
else
{
}
else
{
// Objects with different constructors are not equivalent, but `Object`s
// from different frames are.
var
aCtor
=
a
.
constructor
,
bCtor
=
b
.
constructor
;
if
(
aCtor
!==
bCtor
&&
!
(
_
.
isFunction
(
aCtor
)
&&
(
aCtor
instanceof
aCtor
)
&&
_
.
isFunction
(
bCtor
)
&&
(
bCtor
instanceof
bCtor
)))
{
return
false
;
}
// Deep compare objects.
// Deep compare objects.
for
(
var
key
in
a
)
{
for
(
var
key
in
a
)
{
if
(
_
.
has
(
a
,
key
))
{
if
(
_
.
has
(
a
,
key
))
{
...
@@ -1012,7 +1063,7 @@
...
@@ -1012,7 +1063,7 @@
// Run a function **n** times.
// Run a function **n** times.
_
.
times
=
function
(
n
,
iterator
,
context
)
{
_
.
times
=
function
(
n
,
iterator
,
context
)
{
var
accum
=
Array
(
n
);
var
accum
=
Array
(
Math
.
max
(
0
,
n
)
);
for
(
var
i
=
0
;
i
<
n
;
i
++
)
accum
[
i
]
=
iterator
.
call
(
context
,
i
);
for
(
var
i
=
0
;
i
<
n
;
i
++
)
accum
[
i
]
=
iterator
.
call
(
context
,
i
);
return
accum
;
return
accum
;
};
};
...
@@ -1033,8 +1084,7 @@
...
@@ -1033,8 +1084,7 @@
'
<
'
:
'
<
'
,
'
<
'
:
'
<
'
,
'
>
'
:
'
>
'
,
'
>
'
:
'
>
'
,
'
"
'
:
'
"
'
,
'
"
'
:
'
"
'
,
"
'
"
:
'
'
'
,
"
'
"
:
'
'
'
'
/
'
:
'
/
'
}
}
};
};
entityMap
.
unescape
=
_
.
invert
(
entityMap
.
escape
);
entityMap
.
unescape
=
_
.
invert
(
entityMap
.
escape
);
...
@@ -1055,17 +1105,17 @@
...
@@ -1055,17 +1105,17 @@
};
};
});
});
// If the value of the named
property is a function then invoke it;
// If the value of the named
`property` is a function then invoke it with the
// otherwise, return it.
//
`object` as context;
otherwise, return it.
_
.
result
=
function
(
object
,
property
)
{
_
.
result
=
function
(
object
,
property
)
{
if
(
object
==
null
)
return
null
;
if
(
object
==
null
)
return
void
0
;
var
value
=
object
[
property
];
var
value
=
object
[
property
];
return
_
.
isFunction
(
value
)
?
value
.
call
(
object
)
:
value
;
return
_
.
isFunction
(
value
)
?
value
.
call
(
object
)
:
value
;
};
};
// Add your own custom functions to the Underscore object.
// Add your own custom functions to the Underscore object.
_
.
mixin
=
function
(
obj
)
{
_
.
mixin
=
function
(
obj
)
{
each
(
_
.
functions
(
obj
),
function
(
name
){
each
(
_
.
functions
(
obj
),
function
(
name
)
{
var
func
=
_
[
name
]
=
obj
[
name
];
var
func
=
_
[
name
]
=
obj
[
name
];
_
.
prototype
[
name
]
=
function
()
{
_
.
prototype
[
name
]
=
function
()
{
var
args
=
[
this
.
_wrapped
];
var
args
=
[
this
.
_wrapped
];
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment