├── .gitignore
├── .idea
├── vcs.xml
├── jsLibraryMappings.xml
├── modules.xml
├── underscore-analysis.iml
├── misc.xml
└── workspace.xml
├── underscore-1.8.3.js
├── test.html
├── untitled.js
└── src
│ ├── utility.js
│ ├── functions.js
│ ├── base.js
│ ├── arrays.js
│ ├── collections.js
│ ├── objects.js
│ ├── underscore-1.8.3.min.js
│ └── underscore-1.8.3.js
├── LICENSE
└── README.md
/.gitignore:
--------------------------------------------------------------------------------
1 | .tags
--------------------------------------------------------------------------------
/.idea/vcs.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
--------------------------------------------------------------------------------
/.idea/jsLibraryMappings.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
--------------------------------------------------------------------------------
/.idea/modules.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
--------------------------------------------------------------------------------
/.idea/underscore-analysis.iml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
--------------------------------------------------------------------------------
/.idea/misc.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
--------------------------------------------------------------------------------
/underscore-1.8.3.js/test.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 | underscore
6 |
7 |
8 |
9 |
10 |
29 |
30 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | The MIT License (MIT)
2 |
3 | Copyright (c) 2016 韩子迟
4 |
5 | Permission is hereby granted, free of charge, to any person obtaining a copy
6 | of this software and associated documentation files (the "Software"), to deal
7 | in the Software without restriction, including without limitation the rights
8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 | copies of the Software, and to permit persons to whom the Software is
10 | furnished to do so, subject to the following conditions:
11 |
12 | The above copyright notice and this permission notice shall be included in all
13 | copies or substantial portions of the Software.
14 |
15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21 | SOFTWARE.
22 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | 感谢原作者提供了优质的源码解读，现在我在原作的基础上勤奋耕耘，继续整理一些underscore的精髓。
2 |
3 | ____
4 |
5 | # underscore-1.8.3.js 源码解读
6 |
7 | ### Notice
8 |
9 | - 如果您觉得该 Repo 让您有所收获，请点击右上角的「**Star** 」支持楼主
10 | - 如果您想持续关注楼主的最新系列解读文章，请点击右上角的「**Watch**」订阅
11 |
12 |
13 | ### Main
14 |
15 | - [underscore-1.8.3.js 源码](https://github.com/hanzichi/underscore-analysis/blob/master/underscore-1.8.3.js/src/underscore-1.8.3.js)
16 | - [underscore-1.8.3.js 源码解读全文注释版](https://github.com/hanzichi/underscore-analysis/blob/master/underscore-1.8.3.js/underscore-1.8.3-analysis.js)
17 |
18 |
19 | ### Articles（源码分析过程中的产物）
20 |
21 | - [为什么用「void 0」代替「undefined」(2016-05-16)](https://github.com/hanzichi/underscore-analysis/issues/1)
22 | - [常用类型判断以及一些有用的工具方法 (2016-05-21)](https://github.com/hanzichi/underscore-analysis/issues/2)
23 | - [for ... in 存在的浏览器兼容问题你造吗 (2016-05-22)](https://github.com/hanzichi/underscore-analysis/issues/3)
24 | - [内部方法 createAssigner 详解 (2016-05-24)](https://github.com/hanzichi/underscore-analysis/issues/4)
25 | - [JavaScript 中是如何比较两个元素是否 "相同" 的 (2016-05-25)](https://github.com/hanzichi/underscore-analysis/issues/5)
26 | - [Object Functions 相关源码拾遗 & 小结 (2016-05-26)](https://github.com/hanzichi/underscore-analysis/issues/6)
27 | - [如何优雅地写一个「在数组中寻找指定元素」的方法 (2016-06-02)](https://github.com/hanzichi/underscore-analysis/issues/8)
28 | - [JavaScript 数组去重 (2016-06-05)](https://github.com/hanzichi/underscore-analysis/issues/9)
29 | - [JavaScript 数组展开以及 underscore 重要的内部方法 flatten 详解 (2016-06-11)](https://github.com/hanzichi/underscore-analysis/issues/10)
30 | - [Array Functions 相关源码拾遗 & 小结 (2016-06-13)](https://github.com/hanzichi/underscore-analysis/issues/12)
31 | - [你可能不知道的 NaN 以及 underscore 1.8.3 _.isNaN 的一个 BUG (2016-06-21)](https://github.com/hanzichi/underscore-analysis/issues/13)
32 | - [JavaScript 特殊对象 Array-Like Objects 详解 (2016-06-25)](https://github.com/hanzichi/underscore-analysis/issues/14)
33 | - [JavaScript 数组乱序 (2016-07-04)](https://github.com/hanzichi/underscore-analysis/issues/15)
34 | - [浅谈 underscore 内部方法 group 的设计原理 (2016-07-18)](https://github.com/hanzichi/underscore-analysis/issues/16)
35 | - [关于 bind 你可能需要了解的知识点以及使用场景 (2016-08-17)](https://github.com/hanzichi/underscore-analysis/issues/18)
36 | - [bind 方法的兼容实现 (2016-09-05)](https://github.com/hanzichi/underscore-analysis/issues/19)
37 | - [JavaScript 函数节流和函数去抖应用场景辨析 (2016-10-06)](https://github.com/hanzichi/underscore-analysis/issues/20)
38 | - [underscore 函数去抖的实现 (2016-10-08)](https://github.com/hanzichi/underscore-analysis/issues/21)
39 | - [underscore 函数节流的实现 (2016-10-11)](https://github.com/hanzichi/underscore-analysis/issues/22)
40 | - [从斐波那契数列求值优化谈 _.memoize 方法 (2016-10-14)](https://github.com/hanzichi/underscore-analysis/issues/23)
41 | - [Function Functions 相关源码拾遗 (2016-10-14)](https://github.com/hanzichi/underscore-analysis/issues/24)
42 | - [浅谈 Web 中前后端模板引擎的使用 (2016-10-30)](https://github.com/hanzichi/underscore-analysis/issues/25)
43 | - [Underscore _.template 方法使用详解 (2016-10-31)](https://github.com/hanzichi/underscore-analysis/issues/26)
44 | - [Underscore 整体架构浅析 (2016-11-01)](https://github.com/hanzichi/underscore-analysis/issues/27)
45 | - [源码解读这半年(2016-11-02)](https://github.com/hanzichi/underscore-analysis/issues/28)
46 |
47 |
48 |
49 | ### Big Events
50 |
51 | - 2016-04-10 该 Repo 建立
52 | - 2016-05-16 「underscore-1.8.3.js 系列解读」第一篇 [「为什么用 void 0 代替 undefined」](https://github.com/hanzichi/underscore-analysis/issues/1) 发表
53 | - 2016-05-26 Star 100
54 | - 2016-06-06 Star 200
55 | - 2016-06-13 Star 300
56 | - 2016-07-07 Star 400
57 | - 2016-08-18 Star 500
58 | - 2016-09-28 Star 600
59 | - 2016-10-24 Star 700
60 | - ...
61 | - 2016-11-05 Star 1000
62 | - ...
63 |
--------------------------------------------------------------------------------
/underscore-1.8.3.js/untitled.js:
--------------------------------------------------------------------------------
1 | var property = function(key) {
2 | return function(obj) {
3 | return obj == null ? void 0 : obj[key];
4 | };
5 | };
6 |
7 | //返回一个函数 这个函数只有一个参数 是一个对象
8 |
9 |
10 | // Returns a predicate for checking whether an object has a given set of
11 | // `key:value` pairs.
12 | // 判断一个给定的对象是否有某些键值对
13 | _.matcher = _.matches = function(attrs) {
14 | attrs = _.extendOwn({}, attrs);
15 | return function(obj) {
16 | return _.isMatch(obj, attrs);
17 | };
18 | };
19 |
20 | _.isMatch = function(object, attrs) {
21 | // 提取 attrs 对象的所有 keys
22 | var keys = _.keys(attrs), length = keys.length;
23 |
24 | // 如果 object 为空
25 | // 根据 attrs 的键值对数量返回布尔值
26 | if (object == null) return !length;
27 |
28 | // 这一步有必要？
29 | var obj = Object(object);
30 |
31 | // 遍历 attrs 对象键值对
32 | for (var i = 0; i < length; i++) {
33 | var key = keys[i];
34 |
35 | // 如果 obj 对象没有 attrs 对象的某个 key
36 | // 或者对于某个 key，它们的 value 值不同
37 | // 则证明 object 并不拥有 attrs 的所有键值对
38 | // 则返回 false
39 | if (attrs[key] !== obj[key] || !(key in obj)) return false;
40 | }
41 |
42 | return true;
43 | };
44 |
45 | _.extendOwn = _.assign = createAssigner(_.keys);
46 |
47 | // An internal function for creating assigner functions.
48 | // 有三个方法用到了这个内部函数
49 | // _.extend & _.extendOwn & _.defaults
50 | // _.extend = createAssigner(_.allKeys);
51 | // _.extendOwn = _.assign = createAssigner(_.keys);
52 | // _.defaults = createAssigner(_.allKeys, true);
53 | var createAssigner = function(keysFunc, undefinedOnly) {
54 | // 返回函数
55 | // 经典闭包（undefinedOnly 参数在返回的函数中被引用）
56 | // 返回的函数参数个数 >= 1
57 | // 将第二个开始的对象参数的键值对 "继承" 给第一个参数
58 | return function(obj) {
59 | var length = arguments.length;
60 | // 只传入了一个参数（或者 0 个？）
61 | // 或者传入的第一个参数是 null
62 | if (length < 2 || obj == null) return obj;
63 |
64 | // 枚举第一个参数除外的对象参数
65 | // 即 arguments[1], arguments[2] ...
66 | for (var index = 1; index < length; index++) {
67 | // source 即为对象参数
68 | var source = arguments[index],
69 | // 提取对象参数的 keys 值
70 | // keysFunc 参数表示 _.keys
71 | // 或者 _.allKeys
72 | keys = keysFunc(source),
73 | l = keys.length;
74 |
75 | // 遍历该对象的键值对
76 | for (var i = 0; i < l; i++) {
77 | var key = keys[i];
78 | // _.extend 和 _.extendOwn 方法
79 | // 没有传入 undefinedOnly 参数，即 !undefinedOnly 为 true
80 | // 即肯定会执行 obj[key] = source[key]
81 | // 后面对象的键值对直接覆盖 obj
82 | // ==========================================
83 | // _.defaults 方法，undefinedOnly 参数为 true
84 | // 即 !undefinedOnly 为 false
85 | // 那么当且仅当 obj[key] 为 undefined 时才覆盖
86 | // 即如果有相同的 key 值，取最早出现的 value 值
87 | // *defaults 中有相同 key 的也是一样取首次出现的
88 | if (!undefinedOnly || obj[key] === void 0)
89 | obj[key] = source[key];
90 | }
91 | }
92 |
93 | // 返回已经继承后面对象参数属性的第一个参数对象
94 | return obj;
95 | };
96 | };
97 |
98 | // Retrieve the names of an object's own properties.
99 | // Delegates to **ECMAScript 5**'s native `Object.keys`
100 | // ===== //
101 | // _.keys({one: 1, two: 2, three: 3});
102 | // => ["one", "two", "three"]
103 | // ===== //
104 | // 返回一个对象的 keys 组成的数组
105 | // 仅返回 own enumerable properties 组成的数组
106 | _.keys = function(obj) {
107 | // 容错
108 | // 如果传入的参数不是对象，则返回空数组
109 | if (!_.isObject(obj)) return [];
110 |
111 | // 如果浏览器支持 ES5 Object.key() 方法
112 | // 则优先使用该方法
113 | if (nativeKeys) return nativeKeys(obj);
114 |
115 | var keys = [];
116 |
117 | // own enumerable properties
118 | for (var key in obj)
119 | // hasOwnProperty
120 | if (_.has(obj, key)) keys.push(key);
121 |
122 | // Ahem, IE < 9.
123 | // IE < 9 下不能用 for in 来枚举某些 key 值
124 | // 传入 keys 数组为参数
125 | // 因为 JavaScript 下函数参数按值传递
126 | // 所以 keys 当做参数传入后会在 `collectNonEnumProps` 方法中改变值
127 | if (hasEnumBug) collectNonEnumProps(obj, keys);
128 |
129 | return keys;
130 | };
131 |
132 | // Retrieve all the property names of an object.
133 | // 返回一个对象的 keys 数组
134 | // 不仅仅是 own enumerable properties
135 | // 还包括原型链上继承的属性
136 | _.allKeys = function(obj) {
137 | // 容错
138 | // 不是对象，则返回空数组
139 | if (!_.isObject(obj)) return [];
140 |
141 | var keys = [];
142 | for (var key in obj) keys.push(key);
143 |
144 | // Ahem, IE < 9.
145 | // IE < 9 下的 bug，同 _.keys 方法
146 | if (hasEnumBug) collectNonEnumProps(obj, keys);
147 |
148 | return keys;
149 | };
150 |
151 |
152 | //cb return的是这个函数 传入 value (暂时不知道value 和 cb 是啥 )
153 |
154 |
155 | _.iteratee = function(value, context) {
156 | return cb(value, context, Infinity);
157 | };
158 |
159 | //这个是默认的迭代器？
160 |
161 |
162 | var cb = function(value, context, argCount) {
163 | if (value == null) return _.identity;
164 | if (_.isFunction(value)) return optimizeCb(value, context, argCount);
165 | if (_.isObject(value)) return _.matcher(value);
166 | return _.property(value);
167 | };
168 |
169 |
170 |
171 |
172 |
173 |
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/utility.js:
--------------------------------------------------------------------------------
1 | // Utility Functions
2 | // -----------------
3 |
4 | // Run Underscore.js in *noConflict* mode, returning the `_` variable to its
5 | // previous owner. Returns a reference to the Underscore object.
6 | _.noConflict = function() {
7 | root._ = previousUnderscore;
8 | return this;
9 | };
10 |
11 | // Keep the identity function around for default iteratees.
12 | _.identity = function(value) {
13 | return value;
14 | };
15 |
16 | // Predicate-generating functions. Often useful outside of Underscore.
17 | _.constant = function(value) {
18 | return function() {
19 | return value;
20 | };
21 | };
22 |
23 | _.noop = function(){};
24 |
25 | _.property = property;
26 |
27 | // Generates a function for a given object that returns a given property.
28 | _.propertyOf = function(obj) {
29 | return obj == null ? function(){} : function(key) {
30 | return obj[key];
31 | };
32 | };
33 |
34 | // Returns a predicate for checking whether an object has a given set of
35 | // `key:value` pairs.
36 | _.matcher = _.matches = function(attrs) {
37 | attrs = _.extendOwn({}, attrs);
38 | return function(obj) {
39 | return _.isMatch(obj, attrs);
40 | };
41 | };
42 |
43 | // Run a function **n** times.
44 | _.times = function(n, iteratee, context) {
45 | var accum = Array(Math.max(0, n));
46 | iteratee = optimizeCb(iteratee, context, 1);
47 | for (var i = 0; i < n; i++) accum[i] = iteratee(i);
48 | return accum;
49 | };
50 |
51 | // Return a random integer between min and max (inclusive).
52 | _.random = function(min, max) {
53 | if (max == null) {
54 | max = min;
55 | min = 0;
56 | }
57 | return min + Math.floor(Math.random() * (max - min + 1));
58 | };
59 |
60 | // A (possibly faster) way to get the current timestamp as an integer.
61 | _.now = Date.now || function() {
62 | return new Date().getTime();
63 | };
64 |
65 | // List of HTML entities for escaping.
66 | var escapeMap = {
67 | '&': '&',
68 | '<': '<',
69 | '>': '>',
70 | '"': '"',
71 | "'": ''',
72 | '`': '`'
73 | };
74 | var unescapeMap = _.invert(escapeMap);
75 |
76 | // Functions for escaping and unescaping strings to/from HTML interpolation.
77 | var createEscaper = function(map) {
78 | var escaper = function(match) {
79 | return map[match];
80 | };
81 | // Regexes for identifying a key that needs to be escaped
82 | var source = '(?:' + _.keys(map).join('|') + ')';
83 | var testRegexp = RegExp(source);
84 | var replaceRegexp = RegExp(source, 'g');
85 | return function(string) {
86 | string = string == null ? '' : '' + string;
87 | return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
88 | };
89 | };
90 | _.escape = createEscaper(escapeMap);
91 | _.unescape = createEscaper(unescapeMap);
92 |
93 | // If the value of the named `property` is a function then invoke it with the
94 | // `object` as context; otherwise, return it.
95 | _.result = function(object, property, fallback) {
96 | var value = object == null ? void 0 : object[property];
97 | if (value === void 0) {
98 | value = fallback;
99 | }
100 | return _.isFunction(value) ? value.call(object) : value;
101 | };
102 |
103 | // Generate a unique integer id (unique within the entire client session).
104 | // Useful for temporary DOM ids.
105 | var idCounter = 0;
106 | _.uniqueId = function(prefix) {
107 | var id = ++idCounter + '';
108 | return prefix ? prefix + id : id;
109 | };
110 |
111 | // By default, Underscore uses ERB-style template delimiters, change the
112 | // following template settings to use alternative delimiters.
113 | _.templateSettings = {
114 | evaluate : /<%([\s\S]+?)%>/g,
115 | interpolate : /<%=([\s\S]+?)%>/g,
116 | escape : /<%-([\s\S]+?)%>/g
117 | };
118 |
119 | // When customizing `templateSettings`, if you don't want to define an
120 | // interpolation, evaluation or escaping regex, we need one that is
121 | // guaranteed not to match.
122 | var noMatch = /(.)^/;
123 |
124 | // Certain characters need to be escaped so that they can be put into a
125 | // string literal.
126 | var escapes = {
127 | "'": "'",
128 | '\\': '\\',
129 | '\r': 'r',
130 | '\n': 'n',
131 | '\u2028': 'u2028',
132 | '\u2029': 'u2029'
133 | };
134 |
135 | var escaper = /\\|'|\r|\n|\u2028|\u2029/g;
136 |
137 | var escapeChar = function(match) {
138 | return '\\' + escapes[match];
139 | };
140 |
141 | // JavaScript micro-templating, similar to John Resig's implementation.
142 | // Underscore templating handles arbitrary delimiters, preserves whitespace,
143 | // and correctly escapes quotes within interpolated code.
144 | // NB: `oldSettings` only exists for backwards compatibility.
145 | _.template = function(text, settings, oldSettings) {
146 | if (!settings && oldSettings) settings = oldSettings;
147 | settings = _.defaults({}, settings, _.templateSettings);
148 |
149 | // Combine delimiters into one regular expression via alternation.
150 | var matcher = RegExp([
151 | (settings.escape || noMatch).source,
152 | (settings.interpolate || noMatch).source,
153 | (settings.evaluate || noMatch).source
154 | ].join('|') + '|$', 'g');
155 |
156 | // Compile the template source, escaping string literals appropriately.
157 | var index = 0;
158 | var source = "__p+='";
159 | text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
160 | source += text.slice(index, offset).replace(escaper, escapeChar);
161 | index = offset + match.length;
162 |
163 | if (escape) {
164 | source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
165 | } else if (interpolate) {
166 | source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
167 | } else if (evaluate) {
168 | source += "';\n" + evaluate + "\n__p+='";
169 | }
170 |
171 | // Adobe VMs need the match returned to produce the correct offest.
172 | return match;
173 | });
174 | source += "';\n";
175 |
176 | // If a variable is not specified, place data values in local scope.
177 | if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
178 |
179 | source = "var __t,__p='',__j=Array.prototype.join," +
180 | "print=function(){__p+=__j.call(arguments,'');};\n" +
181 | source + 'return __p;\n';
182 |
183 | try {
184 | var render = new Function(settings.variable || 'obj', '_', source);
185 | } catch (e) {
186 | e.source = source;
187 | throw e;
188 | }
189 |
190 | var template = function(data) {
191 | return render.call(this, data, _);
192 | };
193 |
194 | // Provide the compiled source as a convenience for precompilation.
195 | var argument = settings.variable || 'obj';
196 | template.source = 'function(' + argument + '){\n' + source + '}';
197 |
198 | return template;
199 | };
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/functions.js:
--------------------------------------------------------------------------------
1 | // Function (ahem) Functions
2 | // ------------------
3 |
4 | // Determines whether to execute a function as a constructor
5 | // or a normal function with the provided arguments
6 | var executeBound = function(sourceFunc, boundFunc, context, callingContext, args) {
7 | if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
8 | var self = baseCreate(sourceFunc.prototype);
9 | var result = sourceFunc.apply(self, args);
10 | if (_.isObject(result)) return result;
11 | return self;
12 | };
13 |
14 | // Create a function bound to a given object (assigning `this`, and arguments,
15 | // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
16 | // available.
17 | _.bind = function(func, context) {
18 | if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
19 | if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function');
20 | var args = slice.call(arguments, 2);
21 | var bound = function() {
22 | return executeBound(func, bound, context, this, args.concat(slice.call(arguments)));
23 | };
24 | return bound;
25 | };
26 |
27 | // Partially apply a function by creating a version that has had some of its
28 | // arguments pre-filled, without changing its dynamic `this` context. _ acts
29 | // as a placeholder, allowing any combination of arguments to be pre-filled.
30 | _.partial = function(func) {
31 | var boundArgs = slice.call(arguments, 1);
32 | var bound = function() {
33 | var position = 0, length = boundArgs.length;
34 | var args = Array(length);
35 | for (var i = 0; i < length; i++) {
36 | args[i] = boundArgs[i] === _ ? arguments[position++] : boundArgs[i];
37 | }
38 | while (position < arguments.length) args.push(arguments[position++]);
39 | return executeBound(func, bound, this, this, args);
40 | };
41 | return bound;
42 | };
43 |
44 | // Bind a number of an object's methods to that object. Remaining arguments
45 | // are the method names to be bound. Useful for ensuring that all callbacks
46 | // defined on an object belong to it.
47 | _.bindAll = function(obj) {
48 | var i, length = arguments.length, key;
49 | if (length <= 1) throw new Error('bindAll must be passed function names');
50 | for (i = 1; i < length; i++) {
51 | key = arguments[i];
52 | obj[key] = _.bind(obj[key], obj);
53 | }
54 | return obj;
55 | };
56 |
57 | // Memoize an expensive function by storing its results.
58 | _.memoize = function(func, hasher) {
59 | var memoize = function(key) {
60 | var cache = memoize.cache;
61 | var address = '' + (hasher ? hasher.apply(this, arguments) : key);
62 | if (!_.has(cache, address)) cache[address] = func.apply(this, arguments);
63 | return cache[address];
64 | };
65 | memoize.cache = {};
66 | return memoize;
67 | };
68 |
69 | // Delays a function for the given number of milliseconds, and then calls
70 | // it with the arguments supplied.
71 | _.delay = function(func, wait) {
72 | var args = slice.call(arguments, 2);
73 | return setTimeout(function(){
74 | return func.apply(null, args);
75 | }, wait);
76 | };
77 |
78 | // Defers a function, scheduling it to run after the current call stack has
79 | // cleared.
80 | _.defer = _.partial(_.delay, _, 1);
81 |
82 | // Returns a function, that, when invoked, will only be triggered at most once
83 | // during a given window of time. Normally, the throttled function will run
84 | // as much as it can, without ever going more than once per `wait` duration;
85 | // but if you'd like to disable the execution on the leading edge, pass
86 | // `{leading: false}`. To disable execution on the trailing edge, ditto.
87 | _.throttle = function(func, wait, options) {
88 | var context, args, result;
89 | var timeout = null;
90 | var previous = 0;
91 | if (!options) options = {};
92 | var later = function() {
93 | previous = options.leading === false ? 0 : _.now();
94 | timeout = null;
95 | result = func.apply(context, args);
96 | if (!timeout) context = args = null;
97 | };
98 | return function() {
99 | var now = _.now();
100 | if (!previous && options.leading === false) previous = now;
101 | var remaining = wait - (now - previous);
102 | context = this;
103 | args = arguments;
104 | if (remaining <= 0 || remaining > wait) {
105 | if (timeout) {
106 | clearTimeout(timeout);
107 | timeout = null;
108 | }
109 | previous = now;
110 | result = func.apply(context, args);
111 | if (!timeout) context = args = null;
112 | } else if (!timeout && options.trailing !== false) {
113 | timeout = setTimeout(later, remaining);
114 | }
115 | return result;
116 | };
117 | };
118 |
119 | // Returns a function, that, as long as it continues to be invoked, will not
120 | // be triggered. The function will be called after it stops being called for
121 | // N milliseconds. If `immediate` is passed, trigger the function on the
122 | // leading edge, instead of the trailing.
123 | _.debounce = function(func, wait, immediate) {
124 | var timeout, args, context, timestamp, result;
125 |
126 | var later = function() {
127 | var last = _.now() - timestamp;
128 |
129 | if (last < wait && last >= 0) {
130 | timeout = setTimeout(later, wait - last);
131 | } else {
132 | timeout = null;
133 | if (!immediate) {
134 | result = func.apply(context, args);
135 | if (!timeout) context = args = null;
136 | }
137 | }
138 | };
139 |
140 | return function() {
141 | context = this;
142 | args = arguments;
143 | timestamp = _.now();
144 | var callNow = immediate && !timeout;
145 | if (!timeout) timeout = setTimeout(later, wait);
146 | if (callNow) {
147 | result = func.apply(context, args);
148 | context = args = null;
149 | }
150 |
151 | return result;
152 | };
153 | };
154 |
155 | // Returns the first function passed as an argument to the second,
156 | // allowing you to adjust arguments, run code before and after, and
157 | // conditionally execute the original function.
158 | _.wrap = function(func, wrapper) {
159 | return _.partial(wrapper, func);
160 | };
161 |
162 | // Returns a negated version of the passed-in predicate.
163 | _.negate = function(predicate) {
164 | return function() {
165 | return !predicate.apply(this, arguments);
166 | };
167 | };
168 |
169 | // Returns a function that is the composition of a list of functions, each
170 | // consuming the return value of the function that follows.
171 | _.compose = function() {
172 | var args = arguments;
173 | var start = args.length - 1;
174 | return function() {
175 | var i = start;
176 | var result = args[start].apply(this, arguments);
177 | while (i--) result = args[i].call(this, result);
178 | return result;
179 | };
180 | };
181 |
182 | // Returns a function that will only be executed on and after the Nth call.
183 | _.after = function(times, func) {
184 | return function() {
185 | if (--times < 1) {
186 | return func.apply(this, arguments);
187 | }
188 | };
189 | };
190 |
191 | // Returns a function that will only be executed up to (but not including) the Nth call.
192 | _.before = function(times, func) {
193 | var memo;
194 | return function() {
195 | if (--times > 0) {
196 | memo = func.apply(this, arguments);
197 | }
198 | if (times <= 1) func = null;
199 | return memo;
200 | };
201 | };
202 |
203 | // Returns a function that will be executed at most one time, no matter how
204 | // often you call it. Useful for lazy initialization.
205 | _.once = _.partial(_.before, 2);
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/base.js:
--------------------------------------------------------------------------------
1 | // Underscore.js 1.8.3
2 | // http://underscorejs.org
3 | // (c) 2009-2015 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 | // Save bytes in the minified (but not gzipped) version:
18 | var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
19 |
20 | // Create quick reference variables for speed access to core prototypes.
21 | var
22 | push = ArrayProto.push,
23 | slice = ArrayProto.slice,
24 | toString = ObjProto.toString,
25 | hasOwnProperty = ObjProto.hasOwnProperty;
26 |
27 | // All **ECMAScript 5** native function implementations that we hope to use
28 | // are declared here.
29 | var
30 | nativeIsArray = Array.isArray,
31 | nativeKeys = Object.keys,
32 | nativeBind = FuncProto.bind,
33 | nativeCreate = Object.create;
34 |
35 | // Naked function reference for surrogate-prototype-swapping.
36 | var Ctor = function(){};
37 |
38 | // Create a safe reference to the Underscore object for use below.
39 | var _ = function(obj) {
40 | if (obj instanceof _) return obj;
41 | if (!(this instanceof _)) return new _(obj);
42 | this._wrapped = obj;
43 | };
44 |
45 | // Export the Underscore object for **Node.js**, with
46 | // backwards-compatibility for the old `require()` API. If we're in
47 | // the browser, add `_` as a global object.
48 | if (typeof exports !== 'undefined') {
49 | if (typeof module !== 'undefined' && module.exports) {
50 | exports = module.exports = _;
51 | }
52 | exports._ = _;
53 | } else {
54 | root._ = _;
55 | }
56 |
57 | // Current version.
58 | _.VERSION = '1.8.3';
59 |
60 | // Internal function that returns an efficient (for current engines) version
61 | // of the passed-in callback, to be repeatedly applied in other Underscore
62 | // functions.
63 | var optimizeCb = function(func, context, argCount) {
64 | if (context === void 0) return func;
65 | switch (argCount == null ? 3 : argCount) {
66 | case 1: return function(value) {
67 | return func.call(context, value);
68 | };
69 | case 2: return function(value, other) {
70 | return func.call(context, value, other);
71 | };
72 | case 3: return function(value, index, collection) {
73 | return func.call(context, value, index, collection);
74 | };
75 | case 4: return function(accumulator, value, index, collection) {
76 | return func.call(context, accumulator, value, index, collection);
77 | };
78 | }
79 | return function() {
80 | return func.apply(context, arguments);
81 | };
82 | };
83 |
84 | // A mostly-internal function to generate callbacks that can be applied
85 | // to each element in a collection, returning the desired result — either
86 | // identity, an arbitrary callback, a property matcher, or a property accessor.
87 | var cb = function(value, context, argCount) {
88 | if (value == null) return _.identity;
89 | if (_.isFunction(value)) return optimizeCb(value, context, argCount);
90 | if (_.isObject(value)) return _.matcher(value);
91 | return _.property(value);
92 | };
93 | _.iteratee = function(value, context) {
94 | return cb(value, context, Infinity);
95 | };
96 |
97 | // An internal function for creating assigner functions.
98 | var createAssigner = function(keysFunc, undefinedOnly) {
99 | return function(obj) {
100 | var length = arguments.length;
101 | if (length < 2 || obj == null) return obj;
102 | for (var index = 1; index < length; index++) {
103 | var source = arguments[index],
104 | keys = keysFunc(source),
105 | l = keys.length;
106 | for (var i = 0; i < l; i++) {
107 | var key = keys[i];
108 | if (!undefinedOnly || obj[key] === void 0) obj[key] = source[key];
109 | }
110 | }
111 | return obj;
112 | };
113 | };
114 |
115 | // An internal function for creating a new object that inherits from another.
116 | var baseCreate = function(prototype) {
117 | if (!_.isObject(prototype)) return {};
118 | if (nativeCreate) return nativeCreate(prototype);
119 | Ctor.prototype = prototype;
120 | var result = new Ctor;
121 | Ctor.prototype = null;
122 | return result;
123 | };
124 |
125 | var property = function(key) {
126 | return function(obj) {
127 | return obj == null ? void 0 : obj[key];
128 | };
129 | };
130 |
131 | // Helper for collection methods to determine whether a collection
132 | // should be iterated as an array or as an object
133 | // Related: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
134 | // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
135 | var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;
136 | var getLength = property('length');
137 | var isArrayLike = function(collection) {
138 | var length = getLength(collection);
139 | return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX;
140 | };
141 |
142 |
143 | // Collection Functions
144 | // Array Functions
145 | // Function (ahem) Functions
146 | // Object Functions
147 | // Utility Functions
148 |
149 | // Add a "chain" function. Start chaining a wrapped Underscore object.
150 | _.chain = function(obj) {
151 | var instance = _(obj);
152 | instance._chain = true;
153 | return instance;
154 | };
155 |
156 | // OOP
157 | // ---------------
158 | // If Underscore is called as a function, it returns a wrapped object that
159 | // can be used OO-style. This wrapper holds altered versions of all the
160 | // underscore functions. Wrapped objects may be chained.
161 |
162 | // Helper function to continue chaining intermediate results.
163 | var result = function(instance, obj) {
164 | return instance._chain ? _(obj).chain() : obj;
165 | };
166 |
167 | // Add your own custom functions to the Underscore object.
168 | _.mixin = function(obj) {
169 | _.each(_.functions(obj), function(name) {
170 | var func = _[name] = obj[name];
171 | _.prototype[name] = function() {
172 | var args = [this._wrapped];
173 | push.apply(args, arguments);
174 | return result(this, func.apply(_, args));
175 | };
176 | });
177 | };
178 |
179 | // Add all of the Underscore functions to the wrapper object.
180 | _.mixin(_);
181 |
182 | // Add all mutator Array functions to the wrapper.
183 | _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
184 | var method = ArrayProto[name];
185 | _.prototype[name] = function() {
186 | var obj = this._wrapped;
187 | method.apply(obj, arguments);
188 | if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];
189 | return result(this, obj);
190 | };
191 | });
192 |
193 | // Add all accessor Array functions to the wrapper.
194 | _.each(['concat', 'join', 'slice'], function(name) {
195 | var method = ArrayProto[name];
196 | _.prototype[name] = function() {
197 | return result(this, method.apply(this._wrapped, arguments));
198 | };
199 | });
200 |
201 | // Extracts the result from a wrapped and chained object.
202 | _.prototype.value = function() {
203 | return this._wrapped;
204 | };
205 |
206 | // Provide unwrapping proxy for some methods used in engine operations
207 | // such as arithmetic and JSON stringification.
208 | _.prototype.valueOf = _.prototype.toJSON = _.prototype.value;
209 |
210 | _.prototype.toString = function() {
211 | return '' + this._wrapped;
212 | };
213 |
214 | // AMD registration happens at the end for compatibility with AMD loaders
215 | // that may not enforce next-turn semantics on modules. Even though general
216 | // practice for AMD registration is to be anonymous, underscore registers
217 | // as a named module because, like jQuery, it is a base library that is
218 | // popular enough to be bundled in a third party lib, but not be part of
219 | // an AMD load request. Those cases could generate an error when an
220 | // anonymous define() is called outside of a loader request.
221 | if (typeof define === 'function' && define.amd) {
222 | define('underscore', [], function() {
223 | return _;
224 | });
225 | }
226 | }.call(this));
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/arrays.js:
--------------------------------------------------------------------------------
1 | // Array Functions
2 | // ---------------
3 |
4 | // Get the first element of an array. Passing **n** will return the first N
5 | // values in the array. Aliased as `head` and `take`. The **guard** check
6 | // allows it to work with `_.map`.
7 | _.first = _.head = _.take = function(array, n, guard) {
8 | if (array == null) return void 0;
9 | if (n == null || guard) return array[0];
10 | return _.initial(array, array.length - n);
11 | };
12 |
13 | // Returns everything but the last entry of the array. Especially useful on
14 | // the arguments object. Passing **n** will return all the values in
15 | // the array, excluding the last N.
16 | _.initial = function(array, n, guard) {
17 | return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));
18 | };
19 |
20 | // Get the last element of an array. Passing **n** will return the last N
21 | // values in the array.
22 | _.last = function(array, n, guard) {
23 | if (array == null) return void 0;
24 | if (n == null || guard) return array[array.length - 1];
25 | return _.rest(array, Math.max(0, array.length - n));
26 | };
27 |
28 | // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
29 | // Especially useful on the arguments object. Passing an **n** will return
30 | // the rest N values in the array.
31 | _.rest = _.tail = _.drop = function(array, n, guard) {
32 | return slice.call(array, n == null || guard ? 1 : n);
33 | };
34 |
35 | // Trim out all falsy values from an array.
36 | _.compact = function(array) {
37 | return _.filter(array, _.identity);
38 | };
39 |
40 | // Internal implementation of a recursive `flatten` function.
41 | var flatten = function(input, shallow, strict, startIndex) {
42 | var output = [], idx = 0;
43 | for (var i = startIndex || 0, length = getLength(input); i < length; i++) {
44 | var value = input[i];
45 | if (isArrayLike(value) && (_.isArray(value) || _.isArguments(value))) {
46 | //flatten current level of array or arguments object
47 | if (!shallow) value = flatten(value, shallow, strict);
48 | var j = 0, len = value.length;
49 | output.length += len;
50 | while (j < len) {
51 | output[idx++] = value[j++];
52 | }
53 | } else if (!strict) {
54 | output[idx++] = value;
55 | }
56 | }
57 | return output;
58 | };
59 |
60 | // Flatten out an array, either recursively (by default), or just one level.
61 | _.flatten = function(array, shallow) {
62 | return flatten(array, shallow, false);
63 | };
64 |
65 | // Return a version of the array that does not contain the specified value(s).
66 | _.without = function(array) {
67 | return _.difference(array, slice.call(arguments, 1));
68 | };
69 |
70 | // Produce a duplicate-free version of the array. If the array has already
71 | // been sorted, you have the option of using a faster algorithm.
72 | // Aliased as `unique`.
73 | _.uniq = _.unique = function(array, isSorted, iteratee, context) {
74 | if (!_.isBoolean(isSorted)) {
75 | context = iteratee;
76 | iteratee = isSorted;
77 | isSorted = false;
78 | }
79 | if (iteratee != null) iteratee = cb(iteratee, context);
80 | var result = [];
81 | var seen = [];
82 | for (var i = 0, length = getLength(array); i < length; i++) {
83 | var value = array[i],
84 | computed = iteratee ? iteratee(value, i, array) : value;
85 | if (isSorted) {
86 | if (!i || seen !== computed) result.push(value);
87 | seen = computed;
88 | } else if (iteratee) {
89 | if (!_.contains(seen, computed)) {
90 | seen.push(computed);
91 | result.push(value);
92 | }
93 | } else if (!_.contains(result, value)) {
94 | result.push(value);
95 | }
96 | }
97 | return result;
98 | };
99 |
100 | // Produce an array that contains the union: each distinct element from all of
101 | // the passed-in arrays.
102 | _.union = function() {
103 | return _.uniq(flatten(arguments, true, true));
104 | };
105 |
106 | // Produce an array that contains every item shared between all the
107 | // passed-in arrays.
108 | _.intersection = function(array) {
109 | var result = [];
110 | var argsLength = arguments.length;
111 | for (var i = 0, length = getLength(array); i < length; i++) {
112 | var item = array[i];
113 | if (_.contains(result, item)) continue;
114 | for (var j = 1; j < argsLength; j++) {
115 | if (!_.contains(arguments[j], item)) break;
116 | }
117 | if (j === argsLength) result.push(item);
118 | }
119 | return result;
120 | };
121 |
122 | // Take the difference between one array and a number of other arrays.
123 | // Only the elements present in just the first array will remain.
124 | _.difference = function(array) {
125 | var rest = flatten(arguments, true, true, 1);
126 | return _.filter(array, function(value){
127 | return !_.contains(rest, value);
128 | });
129 | };
130 |
131 | // Zip together multiple lists into a single array -- elements that share
132 | // an index go together.
133 | _.zip = function() {
134 | return _.unzip(arguments);
135 | };
136 |
137 | // Complement of _.zip. Unzip accepts an array of arrays and groups
138 | // each array's elements on shared indices
139 | _.unzip = function(array) {
140 | var length = array && _.max(array, getLength).length || 0;
141 | var result = Array(length);
142 |
143 | for (var index = 0; index < length; index++) {
144 | result[index] = _.pluck(array, index);
145 | }
146 | return result;
147 | };
148 |
149 | // Converts lists into objects. Pass either a single array of `[key, value]`
150 | // pairs, or two parallel arrays of the same length -- one of keys, and one of
151 | // the corresponding values.
152 | _.object = function(list, values) {
153 | var result = {};
154 | for (var i = 0, length = getLength(list); i < length; i++) {
155 | if (values) {
156 | result[list[i]] = values[i];
157 | } else {
158 | result[list[i][0]] = list[i][1];
159 | }
160 | }
161 | return result;
162 | };
163 |
164 | // Generator function to create the findIndex and findLastIndex functions
165 | function createPredicateIndexFinder(dir) {
166 | return function(array, predicate, context) {
167 | predicate = cb(predicate, context);
168 | var length = getLength(array);
169 | var index = dir > 0 ? 0 : length - 1;
170 | for (; index >= 0 && index < length; index += dir) {
171 | if (predicate(array[index], index, array)) return index;
172 | }
173 | return -1;
174 | };
175 | }
176 |
177 | // Returns the first index on an array-like that passes a predicate test
178 | _.findIndex = createPredicateIndexFinder(1);
179 | _.findLastIndex = createPredicateIndexFinder(-1);
180 |
181 | // Use a comparator function to figure out the smallest index at which
182 | // an object should be inserted so as to maintain order. Uses binary search.
183 | _.sortedIndex = function(array, obj, iteratee, context) {
184 | iteratee = cb(iteratee, context, 1);
185 | var value = iteratee(obj);
186 | var low = 0, high = getLength(array);
187 | while (low < high) {
188 | var mid = Math.floor((low + high) / 2);
189 | if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
190 | }
191 | return low;
192 | };
193 |
194 | // Generator function to create the indexOf and lastIndexOf functions
195 | function createIndexFinder(dir, predicateFind, sortedIndex) {
196 | return function(array, item, idx) {
197 | var i = 0, length = getLength(array);
198 | if (typeof idx == 'number') {
199 | if (dir > 0) {
200 | i = idx >= 0 ? idx : Math.max(idx + length, i);
201 | } else {
202 | length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
203 | }
204 | } else if (sortedIndex && idx && length) {
205 | idx = sortedIndex(array, item);
206 | return array[idx] === item ? idx : -1;
207 | }
208 | if (item !== item) {
209 | idx = predicateFind(slice.call(array, i, length), _.isNaN);
210 | return idx >= 0 ? idx + i : -1;
211 | }
212 | for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
213 | if (array[idx] === item) return idx;
214 | }
215 | return -1;
216 | };
217 | }
218 |
219 | // Return the position of the first occurrence of an item in an array,
220 | // or -1 if the item is not included in the array.
221 | // If the array is large and already in sort order, pass `true`
222 | // for **isSorted** to use binary search.
223 | _.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex);
224 | _.lastIndexOf = createIndexFinder(-1, _.findLastIndex);
225 |
226 | // Generate an integer Array containing an arithmetic progression. A port of
227 | // the native Python `range()` function. See
228 | // [the Python documentation](http://docs.python.org/library/functions.html#range).
229 | _.range = function(start, stop, step) {
230 | if (stop == null) {
231 | stop = start || 0;
232 | start = 0;
233 | }
234 | step = step || 1;
235 |
236 | var length = Math.max(Math.ceil((stop - start) / step), 0);
237 | var range = Array(length);
238 |
239 | for (var idx = 0; idx < length; idx++, start += step) {
240 | range[idx] = start;
241 | }
242 |
243 | return range;
244 | };
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/collections.js:
--------------------------------------------------------------------------------
1 | // Collection Functions
2 | // --------------------
3 |
4 | // The cornerstone, an `each` implementation, aka `forEach`.
5 | // Handles raw objects in addition to array-likes. Treats all
6 | // sparse array-likes as if they were dense.
7 | _.each = _.forEach = function(obj, iteratee, context) {
8 | iteratee = optimizeCb(iteratee, context);
9 | var i, length;
10 | if (isArrayLike(obj)) {
11 | for (i = 0, length = obj.length; i < length; i++) {
12 | iteratee(obj[i], i, obj);
13 | }
14 | } else {
15 | var keys = _.keys(obj);
16 | for (i = 0, length = keys.length; i < length; i++) {
17 | iteratee(obj[keys[i]], keys[i], obj);
18 | }
19 | }
20 | return obj;
21 | };
22 |
23 | // Return the results of applying the iteratee to each element.
24 | _.map = _.collect = function(obj, iteratee, context) {
25 | iteratee = cb(iteratee, context);
26 | var keys = !isArrayLike(obj) && _.keys(obj),
27 | length = (keys || obj).length,
28 | results = Array(length);
29 | for (var index = 0; index < length; index++) {
30 | var currentKey = keys ? keys[index] : index;
31 | results[index] = iteratee(obj[currentKey], currentKey, obj);
32 | }
33 | return results;
34 | };
35 |
36 | // Create a reducing function iterating left or right.
37 | function createReduce(dir) {
38 | // Optimized iterator function as using arguments.length
39 | // in the main function will deoptimize the, see #1991.
40 | function iterator(obj, iteratee, memo, keys, index, length) {
41 | for (; index >= 0 && index < length; index += dir) {
42 | var currentKey = keys ? keys[index] : index;
43 | memo = iteratee(memo, obj[currentKey], currentKey, obj);
44 | }
45 | return memo;
46 | }
47 |
48 | return function(obj, iteratee, memo, context) {
49 | iteratee = optimizeCb(iteratee, context, 4);
50 | var keys = !isArrayLike(obj) && _.keys(obj),
51 | length = (keys || obj).length,
52 | index = dir > 0 ? 0 : length - 1;
53 | // Determine the initial value if none is provided.
54 | if (arguments.length < 3) {
55 | memo = obj[keys ? keys[index] : index];
56 | index += dir;
57 | }
58 | return iterator(obj, iteratee, memo, keys, index, length);
59 | };
60 | }
61 |
62 | // **Reduce** builds up a single result from a list of values, aka `inject`,
63 | // or `foldl`.
64 | _.reduce = _.foldl = _.inject = createReduce(1);
65 |
66 | // The right-associative version of reduce, also known as `foldr`.
67 | _.reduceRight = _.foldr = createReduce(-1);
68 |
69 | // Return the first value which passes a truth test. Aliased as `detect`.
70 | _.find = _.detect = function(obj, predicate, context) {
71 | var key;
72 | if (isArrayLike(obj)) {
73 | key = _.findIndex(obj, predicate, context);
74 | } else {
75 | key = _.findKey(obj, predicate, context);
76 | }
77 | if (key !== void 0 && key !== -1) return obj[key];
78 | };
79 |
80 | // Return all the elements that pass a truth test.
81 | // Aliased as `select`.
82 | _.filter = _.select = function(obj, predicate, context) {
83 | var results = [];
84 | predicate = cb(predicate, context);
85 | _.each(obj, function(value, index, list) {
86 | if (predicate(value, index, list)) results.push(value);
87 | });
88 | return results;
89 | };
90 |
91 | // Return all the elements for which a truth test fails.
92 | _.reject = function(obj, predicate, context) {
93 | return _.filter(obj, _.negate(cb(predicate)), context);
94 | };
95 |
96 | // Determine whether all of the elements match a truth test.
97 | // Aliased as `all`.
98 | _.every = _.all = function(obj, predicate, context) {
99 | predicate = cb(predicate, context);
100 | var keys = !isArrayLike(obj) && _.keys(obj),
101 | length = (keys || obj).length;
102 | for (var index = 0; index < length; index++) {
103 | var currentKey = keys ? keys[index] : index;
104 | if (!predicate(obj[currentKey], currentKey, obj)) return false;
105 | }
106 | return true;
107 | };
108 |
109 | // Determine if at least one element in the object matches a truth test.
110 | // Aliased as `any`.
111 | _.some = _.any = function(obj, predicate, context) {
112 | predicate = cb(predicate, context);
113 | var keys = !isArrayLike(obj) && _.keys(obj),
114 | length = (keys || obj).length;
115 | for (var index = 0; index < length; index++) {
116 | var currentKey = keys ? keys[index] : index;
117 | if (predicate(obj[currentKey], currentKey, obj)) return true;
118 | }
119 | return false;
120 | };
121 |
122 | // Determine if the array or object contains a given item (using `===`).
123 | // Aliased as `includes` and `include`.
124 | _.contains = _.includes = _.include = function(obj, item, fromIndex, guard) {
125 | if (!isArrayLike(obj)) obj = _.values(obj);
126 | if (typeof fromIndex != 'number' || guard) fromIndex = 0;
127 | return _.indexOf(obj, item, fromIndex) >= 0;
128 | };
129 |
130 | // Invoke a method (with arguments) on every item in a collection.
131 | _.invoke = function(obj, method) {
132 | var args = slice.call(arguments, 2);
133 | var isFunc = _.isFunction(method);
134 | return _.map(obj, function(value) {
135 | var func = isFunc ? method : value[method];
136 | return func == null ? func : func.apply(value, args);
137 | });
138 | };
139 |
140 | // Convenience version of a common use case of `map`: fetching a property.
141 | _.pluck = function(obj, key) {
142 | return _.map(obj, _.property(key));
143 | };
144 |
145 | // Convenience version of a common use case of `filter`: selecting only objects
146 | // containing specific `key:value` pairs.
147 | _.where = function(obj, attrs) {
148 | return _.filter(obj, _.matcher(attrs));
149 | };
150 |
151 | // Convenience version of a common use case of `find`: getting the first object
152 | // containing specific `key:value` pairs.
153 | _.findWhere = function(obj, attrs) {
154 | return _.find(obj, _.matcher(attrs));
155 | };
156 |
157 | // Return the maximum element (or element-based computation).
158 | _.max = function(obj, iteratee, context) {
159 | var result = -Infinity, lastComputed = -Infinity,
160 | value, computed;
161 | if (iteratee == null && obj != null) {
162 | obj = isArrayLike(obj) ? obj : _.values(obj);
163 | for (var i = 0, length = obj.length; i < length; i++) {
164 | value = obj[i];
165 | if (value > result) {
166 | result = value;
167 | }
168 | }
169 | } else {
170 | iteratee = cb(iteratee, context);
171 | _.each(obj, function(value, index, list) {
172 | computed = iteratee(value, index, list);
173 | if (computed > lastComputed || computed === -Infinity && result === -Infinity) {
174 | result = value;
175 | lastComputed = computed;
176 | }
177 | });
178 | }
179 | return result;
180 | };
181 |
182 | // Return the minimum element (or element-based computation).
183 | _.min = function(obj, iteratee, context) {
184 | var result = Infinity, lastComputed = Infinity,
185 | value, computed;
186 | if (iteratee == null && obj != null) {
187 | obj = isArrayLike(obj) ? obj : _.values(obj);
188 | for (var i = 0, length = obj.length; i < length; i++) {
189 | value = obj[i];
190 | if (value < result) {
191 | result = value;
192 | }
193 | }
194 | } else {
195 | iteratee = cb(iteratee, context);
196 | _.each(obj, function(value, index, list) {
197 | computed = iteratee(value, index, list);
198 | if (computed < lastComputed || computed === Infinity && result === Infinity) {
199 | result = value;
200 | lastComputed = computed;
201 | }
202 | });
203 | }
204 | return result;
205 | };
206 |
207 | // Shuffle a collection, using the modern version of the
208 | // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
209 | _.shuffle = function(obj) {
210 | var set = isArrayLike(obj) ? obj : _.values(obj);
211 | var length = set.length;
212 | var shuffled = Array(length);
213 | for (var index = 0, rand; index < length; index++) {
214 | rand = _.random(0, index);
215 | if (rand !== index) shuffled[index] = shuffled[rand];
216 | shuffled[rand] = set[index];
217 | }
218 | return shuffled;
219 | };
220 |
221 | // Sample **n** random values from a collection.
222 | // If **n** is not specified, returns a single random element.
223 | // The internal `guard` argument allows it to work with `map`.
224 | _.sample = function(obj, n, guard) {
225 | if (n == null || guard) {
226 | if (!isArrayLike(obj)) obj = _.values(obj);
227 | return obj[_.random(obj.length - 1)];
228 | }
229 | return _.shuffle(obj).slice(0, Math.max(0, n));
230 | };
231 |
232 | // Sort the object's values by a criterion produced by an iteratee.
233 | _.sortBy = function(obj, iteratee, context) {
234 | iteratee = cb(iteratee, context);
235 | return _.pluck(_.map(obj, function(value, index, list) {
236 | return {
237 | value: value,
238 | index: index,
239 | criteria: iteratee(value, index, list)
240 | };
241 | }).sort(function(left, right) {
242 | var a = left.criteria;
243 | var b = right.criteria;
244 | if (a !== b) {
245 | if (a > b || a === void 0) return 1;
246 | if (a < b || b === void 0) return -1;
247 | }
248 | return left.index - right.index;
249 | }), 'value');
250 | };
251 |
252 | // An internal function used for aggregate "group by" operations.
253 | var group = function(behavior) {
254 | return function(obj, iteratee, context) {
255 | var result = {};
256 | iteratee = cb(iteratee, context);
257 | _.each(obj, function(value, index) {
258 | var key = iteratee(value, index, obj);
259 | behavior(result, value, key);
260 | });
261 | return result;
262 | };
263 | };
264 |
265 | // Groups the object's values by a criterion. Pass either a string attribute
266 | // to group by, or a function that returns the criterion.
267 | _.groupBy = group(function(result, value, key) {
268 | if (_.has(result, key)) result[key].push(value); else result[key] = [value];
269 | });
270 |
271 | // Indexes the object's values by a criterion, similar to `groupBy`, but for
272 | // when you know that your index values will be unique.
273 | _.indexBy = group(function(result, value, key) {
274 | result[key] = value;
275 | });
276 |
277 | // Counts instances of an object that group by a certain criterion. Pass
278 | // either a string attribute to count by, or a function that returns the
279 | // criterion.
280 | _.countBy = group(function(result, value, key) {
281 | if (_.has(result, key)) result[key]++; else result[key] = 1;
282 | });
283 |
284 | // Safely create a real, live array from anything iterable.
285 | _.toArray = function(obj) {
286 | if (!obj) return [];
287 | if (_.isArray(obj)) return slice.call(obj);
288 | if (isArrayLike(obj)) return _.map(obj, _.identity);
289 | return _.values(obj);
290 | };
291 |
292 | // Return the number of elements in an object.
293 | _.size = function(obj) {
294 | if (obj == null) return 0;
295 | return isArrayLike(obj) ? obj.length : _.keys(obj).length;
296 | };
297 |
298 | // Split a collection into two arrays: one whose elements all satisfy the given
299 | // predicate, and one whose elements all do not satisfy the predicate.
300 | _.partition = function(obj, predicate, context) {
301 | predicate = cb(predicate, context);
302 | var pass = [], fail = [];
303 | _.each(obj, function(value, key, obj) {
304 | (predicate(value, key, obj) ? pass : fail).push(value);
305 | });
306 | return [pass, fail];
307 | };
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/objects.js:
--------------------------------------------------------------------------------
1 | // Object Functions
2 | // ----------------
3 |
4 | // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
5 | var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
6 | var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
7 | 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
8 |
9 | function collectNonEnumProps(obj, keys) {
10 | var nonEnumIdx = nonEnumerableProps.length;
11 | var constructor = obj.constructor;
12 | var proto = (_.isFunction(constructor) && constructor.prototype) || ObjProto;
13 |
14 | // Constructor is a special case.
15 | var prop = 'constructor';
16 | if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);
17 |
18 | while (nonEnumIdx--) {
19 | prop = nonEnumerableProps[nonEnumIdx];
20 | if (prop in obj && obj[prop] !== proto[prop] && !_.contains(keys, prop)) {
21 | keys.push(prop);
22 | }
23 | }
24 | }
25 |
26 | // Retrieve the names of an object's own properties.
27 | // Delegates to **ECMAScript 5**'s native `Object.keys`
28 | _.keys = function(obj) {
29 | if (!_.isObject(obj)) return [];
30 | if (nativeKeys) return nativeKeys(obj);
31 | var keys = [];
32 | for (var key in obj) if (_.has(obj, key)) keys.push(key);
33 | // Ahem, IE < 9.
34 | if (hasEnumBug) collectNonEnumProps(obj, keys);
35 | return keys;
36 | };
37 |
38 | // Retrieve all the property names of an object.
39 | _.allKeys = function(obj) {
40 | if (!_.isObject(obj)) return [];
41 | var keys = [];
42 | for (var key in obj) keys.push(key);
43 | // Ahem, IE < 9.
44 | if (hasEnumBug) collectNonEnumProps(obj, keys);
45 | return keys;
46 | };
47 |
48 | // Retrieve the values of an object's properties.
49 | _.values = function(obj) {
50 | var keys = _.keys(obj);
51 | var length = keys.length;
52 | var values = Array(length);
53 | for (var i = 0; i < length; i++) {
54 | values[i] = obj[keys[i]];
55 | }
56 | return values;
57 | };
58 |
59 | // Returns the results of applying the iteratee to each element of the object
60 | // In contrast to _.map it returns an object
61 | _.mapObject = function(obj, iteratee, context) {
62 | iteratee = cb(iteratee, context);
63 | var keys = _.keys(obj),
64 | length = keys.length,
65 | results = {},
66 | currentKey;
67 | for (var index = 0; index < length; index++) {
68 | currentKey = keys[index];
69 | results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
70 | }
71 | return results;
72 | };
73 |
74 | // Convert an object into a list of `[key, value]` pairs.
75 | _.pairs = function(obj) {
76 | var keys = _.keys(obj);
77 | var length = keys.length;
78 | var pairs = Array(length);
79 | for (var i = 0; i < length; i++) {
80 | pairs[i] = [keys[i], obj[keys[i]]];
81 | }
82 | return pairs;
83 | };
84 |
85 | // Invert the keys and values of an object. The values must be serializable.
86 | _.invert = function(obj) {
87 | var result = {};
88 | var keys = _.keys(obj);
89 | for (var i = 0, length = keys.length; i < length; i++) {
90 | result[obj[keys[i]]] = keys[i];
91 | }
92 | return result;
93 | };
94 |
95 | // Return a sorted list of the function names available on the object.
96 | // Aliased as `methods`
97 | _.functions = _.methods = function(obj) {
98 | var names = [];
99 | for (var key in obj) {
100 | if (_.isFunction(obj[key])) names.push(key);
101 | }
102 | return names.sort();
103 | };
104 |
105 | // Extend a given object with all the properties in passed-in object(s).
106 | _.extend = createAssigner(_.allKeys);
107 |
108 | // Assigns a given object with all the own properties in the passed-in object(s)
109 | // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)
110 | _.extendOwn = _.assign = createAssigner(_.keys);
111 |
112 | // Returns the first key on an object that passes a predicate test
113 | _.findKey = function(obj, predicate, context) {
114 | predicate = cb(predicate, context);
115 | var keys = _.keys(obj), key;
116 | for (var i = 0, length = keys.length; i < length; i++) {
117 | key = keys[i];
118 | if (predicate(obj[key], key, obj)) return key;
119 | }
120 | };
121 |
122 | // Return a copy of the object only containing the whitelisted properties.
123 | _.pick = function(object, oiteratee, context) {
124 | var result = {}, obj = object, iteratee, keys;
125 | if (obj == null) return result;
126 | if (_.isFunction(oiteratee)) {
127 | keys = _.allKeys(obj);
128 | iteratee = optimizeCb(oiteratee, context);
129 | } else {
130 | keys = flatten(arguments, false, false, 1);
131 | iteratee = function(value, key, obj) { return key in obj; };
132 | obj = Object(obj);
133 | }
134 | for (var i = 0, length = keys.length; i < length; i++) {
135 | var key = keys[i];
136 | var value = obj[key];
137 | if (iteratee(value, key, obj)) result[key] = value;
138 | }
139 | return result;
140 | };
141 |
142 | // Return a copy of the object without the blacklisted properties.
143 | _.omit = function(obj, iteratee, context) {
144 | if (_.isFunction(iteratee)) {
145 | iteratee = _.negate(iteratee);
146 | } else {
147 | var keys = _.map(flatten(arguments, false, false, 1), String);
148 | iteratee = function(value, key) {
149 | return !_.contains(keys, key);
150 | };
151 | }
152 | return _.pick(obj, iteratee, context);
153 | };
154 |
155 | // Fill in a given object with default properties.
156 | _.defaults = createAssigner(_.allKeys, true);
157 |
158 | // Creates an object that inherits from the given prototype object.
159 | // If additional properties are provided then they will be added to the
160 | // created object.
161 | _.create = function(prototype, props) {
162 | var result = baseCreate(prototype);
163 | if (props) _.extendOwn(result, props);
164 | return result;
165 | };
166 |
167 | // Create a (shallow-cloned) duplicate of an object.
168 | _.clone = function(obj) {
169 | if (!_.isObject(obj)) return obj;
170 | return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
171 | };
172 |
173 | // Invokes interceptor with the obj, and then returns obj.
174 | // The primary purpose of this method is to "tap into" a method chain, in
175 | // order to perform operations on intermediate results within the chain.
176 | _.tap = function(obj, interceptor) {
177 | interceptor(obj);
178 | return obj;
179 | };
180 |
181 | // Returns whether an object has a given set of `key:value` pairs.
182 | _.isMatch = function(object, attrs) {
183 | var keys = _.keys(attrs), length = keys.length;
184 | if (object == null) return !length;
185 | var obj = Object(object);
186 | for (var i = 0; i < length; i++) {
187 | var key = keys[i];
188 | if (attrs[key] !== obj[key] || !(key in obj)) return false;
189 | }
190 | return true;
191 | };
192 |
193 |
194 | // Internal recursive comparison function for `isEqual`.
195 | var eq = function(a, b, aStack, bStack) {
196 | // Identical objects are equal. `0 === -0`, but they aren't identical.
197 | // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).
198 | if (a === b) return a !== 0 || 1 / a === 1 / b;
199 | // A strict comparison is necessary because `null == undefined`.
200 | if (a == null || b == null) return a === b;
201 | // Unwrap any wrapped objects.
202 | if (a instanceof _) a = a._wrapped;
203 | if (b instanceof _) b = b._wrapped;
204 | // Compare `[[Class]]` names.
205 | var className = toString.call(a);
206 | if (className !== toString.call(b)) return false;
207 | switch (className) {
208 | // Strings, numbers, regular expressions, dates, and booleans are compared by value.
209 | case '[object RegExp]':
210 | // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')
211 | case '[object String]':
212 | // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
213 | // equivalent to `new String("5")`.
214 | return '' + a === '' + b;
215 | case '[object Number]':
216 | // `NaN`s are equivalent, but non-reflexive.
217 | // Object(NaN) is equivalent to NaN
218 | if (+a !== +a) return +b !== +b;
219 | // An `egal` comparison is performed for other numeric values.
220 | return +a === 0 ? 1 / +a === 1 / b : +a === +b;
221 | case '[object Date]':
222 | case '[object Boolean]':
223 | // Coerce dates and booleans to numeric primitive values. Dates are compared by their
224 | // millisecond representations. Note that invalid dates with millisecond representations
225 | // of `NaN` are not equivalent.
226 | return +a === +b;
227 | }
228 |
229 | var areArrays = className === '[object Array]';
230 | if (!areArrays) {
231 | if (typeof a != 'object' || typeof b != 'object') return false;
232 |
233 | // Objects with different constructors are not equivalent, but `Object`s or `Array`s
234 | // from different frames are.
235 | var aCtor = a.constructor, bCtor = b.constructor;
236 | if (aCtor !== bCtor && !(_.isFunction(aCtor) && aCtor instanceof aCtor &&
237 | _.isFunction(bCtor) && bCtor instanceof bCtor)
238 | && ('constructor' in a && 'constructor' in b)) {
239 | return false;
240 | }
241 | }
242 | // Assume equality for cyclic structures. The algorithm for detecting cyclic
243 | // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
244 |
245 | // Initializing stack of traversed objects.
246 | // It's done here since we only need them for objects and arrays comparison.
247 | aStack = aStack || [];
248 | bStack = bStack || [];
249 | var length = aStack.length;
250 | while (length--) {
251 | // Linear search. Performance is inversely proportional to the number of
252 | // unique nested structures.
253 | if (aStack[length] === a) return bStack[length] === b;
254 | }
255 |
256 | // Add the first object to the stack of traversed objects.
257 | aStack.push(a);
258 | bStack.push(b);
259 |
260 | // Recursively compare objects and arrays.
261 | if (areArrays) {
262 | // Compare array lengths to determine if a deep comparison is necessary.
263 | length = a.length;
264 | if (length !== b.length) return false;
265 | // Deep compare the contents, ignoring non-numeric properties.
266 | while (length--) {
267 | if (!eq(a[length], b[length], aStack, bStack)) return false;
268 | }
269 | } else {
270 | // Deep compare objects.
271 | var keys = _.keys(a), key;
272 | length = keys.length;
273 | // Ensure that both objects contain the same number of properties before comparing deep equality.
274 | if (_.keys(b).length !== length) return false;
275 | while (length--) {
276 | // Deep compare each member
277 | key = keys[length];
278 | if (!(_.has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;
279 | }
280 | }
281 | // Remove the first object from the stack of traversed objects.
282 | aStack.pop();
283 | bStack.pop();
284 | return true;
285 | };
286 |
287 | // Perform a deep comparison to check if two objects are equal.
288 | _.isEqual = function(a, b) {
289 | return eq(a, b);
290 | };
291 |
292 | // Is a given array, string, or object empty?
293 | // An "empty" object has no enumerable own-properties.
294 | _.isEmpty = function(obj) {
295 | if (obj == null) return true;
296 | if (isArrayLike(obj) && (_.isArray(obj) || _.isString(obj) || _.isArguments(obj))) return obj.length === 0;
297 | return _.keys(obj).length === 0;
298 | };
299 |
300 | // Is a given value a DOM element?
301 | _.isElement = function(obj) {
302 | return !!(obj && obj.nodeType === 1);
303 | };
304 |
305 | // Is a given value an array?
306 | // Delegates to ECMA5's native Array.isArray
307 | _.isArray = nativeIsArray || function(obj) {
308 | return toString.call(obj) === '[object Array]';
309 | };
310 |
311 | // Is a given variable an object?
312 | _.isObject = function(obj) {
313 | var type = typeof obj;
314 | return type === 'function' || type === 'object' && !!obj;
315 | };
316 |
317 | // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError.
318 | _.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) {
319 | _['is' + name] = function(obj) {
320 | return toString.call(obj) === '[object ' + name + ']';
321 | };
322 | });
323 |
324 | // Define a fallback version of the method in browsers (ahem, IE < 9), where
325 | // there isn't any inspectable "Arguments" type.
326 | if (!_.isArguments(arguments)) {
327 | _.isArguments = function(obj) {
328 | return _.has(obj, 'callee');
329 | };
330 | }
331 |
332 | // Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8,
333 | // IE 11 (#1621), and in Safari 8 (#1929).
334 | if (typeof /./ != 'function' && typeof Int8Array != 'object') {
335 | _.isFunction = function(obj) {
336 | return typeof obj == 'function' || false;
337 | };
338 | }
339 |
340 | // Is a given object a finite number?
341 | _.isFinite = function(obj) {
342 | return isFinite(obj) && !isNaN(parseFloat(obj));
343 | };
344 |
345 | // Is the given value `NaN`? (NaN is the only number which does not equal itself).
346 | _.isNaN = function(obj) {
347 | return _.isNumber(obj) && obj !== +obj;
348 | };
349 |
350 | // Is a given value a boolean?
351 | _.isBoolean = function(obj) {
352 | return obj === true || obj === false || toString.call(obj) === '[object Boolean]';
353 | };
354 |
355 | // Is a given value equal to null?
356 | _.isNull = function(obj) {
357 | return obj === null;
358 | };
359 |
360 | // Is a given variable undefined?
361 | _.isUndefined = function(obj) {
362 | return obj === void 0;
363 | };
364 |
365 | // Shortcut function for checking if an object has a given property directly
366 | // on itself (in other words, not on a prototype).
367 | _.has = function(obj, key) {
368 | return obj != null && hasOwnProperty.call(obj, key);
369 | };
--------------------------------------------------------------------------------
/.idea/workspace.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
23 |
24 |
25 |
26 |
27 |
28 |
29 |
30 |
31 |
32 |
33 |
34 |
35 |
36 |
37 |
38 |
39 |
40 |
41 |
42 |
43 |
44 |
45 |
46 |
47 |
48 |
49 |
50 |
51 |
52 |
53 |
58 |
59 |
60 |
61 |
62 |
63 |
69 |
70 |
71 |
72 |
73 | true
74 | DEFINITION_ORDER
75 |
76 |
77 |
78 |
79 |
80 |
81 |
82 |
83 |
84 |
85 |
86 |
87 |
88 |
89 |
90 |
91 |
92 |
93 |
94 |
95 |
96 |
97 |
98 |
99 |
100 |
101 |
102 |
103 |
104 |
105 |
106 |
107 |
108 |
109 |
110 |
111 |
112 |
113 |
114 |
115 |
116 |
117 |
118 |
119 |
120 |
121 |
122 |
123 |
124 |
125 |
126 |
127 |
128 |
129 |
130 |
131 |
132 |
133 |
134 |
135 |
136 |
137 |
138 |
139 |
140 |
141 |
142 |
143 |
144 |
145 |
146 |
147 |
148 |
149 |
150 |
151 |
152 |
153 |
154 |
155 |
156 |
157 |
158 |
159 |
160 |
161 |
162 |
163 |
164 |
165 |
166 |
167 |
168 |
169 |
170 |
171 |
172 |
173 |
174 |
175 |
176 |
177 |
178 |
179 |
180 |
181 |
182 |
183 |
184 |
185 |
186 |
187 |
188 |
189 |
190 | project
191 |
192 |
193 | true
194 |
195 |
196 |
197 | DIRECTORY
198 |
199 | false
200 |
201 |
202 |
203 |
204 |
205 |
206 |
207 |
208 |
209 | 1479388616341
210 |
211 |
212 | 1479388616341
213 |
214 |
215 |
216 |
217 |
218 |
219 |
220 |
221 |
222 |
223 |
224 |
225 |
226 |
227 |
228 |
229 |
230 |
231 |
232 |
233 |
234 |
235 |
236 |
237 |
238 |
239 |
240 |
241 |
242 |
243 |
246 |
249 |
250 |
251 |
252 |
253 |
254 |
255 |
256 |
257 |
258 |
259 |
260 |
261 |
262 |
263 |
264 |
265 |
266 |
267 |
268 |
269 |
270 |
271 |
272 |
273 |
274 |
275 |
276 |
277 |
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/underscore-1.8.3.min.js:
--------------------------------------------------------------------------------
1 | // Underscore.js 1.8.3
2 | // http://underscorejs.org
3 | // (c) 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
4 | // Underscore may be freely distributed under the MIT license.
5 | (function(){function n(n){function t(t,r,e,u,i,o){for(;i>=0&&o>i;i+=n){var a=u?u[i]:i;e=r(e,t[a],a,t)}return e}return function(r,e,u,i){e=b(e,i,4);var o=!k(r)&&m.keys(r),a=(o||r).length,c=n>0?0:a-1;return arguments.length<3&&(u=r[o?o[c]:c],c+=n),t(r,e,u,o,c,a)}}function t(n){return function(t,r,e){r=x(r,e);for(var u=O(t),i=n>0?0:u-1;i>=0&&u>i;i+=n)if(r(t[i],i,t))return i;return-1}}function r(n,t,r){return function(e,u,i){var o=0,a=O(e);if("number"==typeof i)n>0?o=i>=0?i:Math.max(i+a,o):a=i>=0?Math.min(i+1,a):i+a+1;else if(r&&i&&a)return i=r(e,u),e[i]===u?i:-1;if(u!==u)return i=t(l.call(e,o,a),m.isNaN),i>=0?i+o:-1;for(i=n>0?o:a-1;i>=0&&a>i;i+=n)if(e[i]===u)return i;return-1}}function e(n,t){var r=I.length,e=n.constructor,u=m.isFunction(e)&&e.prototype||a,i="constructor";for(m.has(n,i)&&!m.contains(t,i)&&t.push(i);r--;)i=I[r],i in n&&n[i]!==u[i]&&!m.contains(t,i)&&t.push(i)}var u=this,i=u._,o=Array.prototype,a=Object.prototype,c=Function.prototype,f=o.push,l=o.slice,s=a.toString,p=a.hasOwnProperty,h=Array.isArray,v=Object.keys,g=c.bind,y=Object.create,d=function(){},m=function(n){return n instanceof m?n:this instanceof m?void(this._wrapped=n):new m(n)};"undefined"!=typeof exports?("undefined"!=typeof module&&module.exports&&(exports=module.exports=m),exports._=m):u._=m,m.VERSION="1.8.3";var b=function(n,t,r){if(t===void 0)return n;switch(null==r?3:r){case 1:return function(r){return n.call(t,r)};case 2:return function(r,e){return n.call(t,r,e)};case 3:return function(r,e,u){return n.call(t,r,e,u)};case 4:return function(r,e,u,i){return n.call(t,r,e,u,i)}}return function(){return n.apply(t,arguments)}},x=function(n,t,r){return null==n?m.identity:m.isFunction(n)?b(n,t,r):m.isObject(n)?m.matcher(n):m.property(n)};m.iteratee=function(n,t){return x(n,t,1/0)};var _=function(n,t){return function(r){var e=arguments.length;if(2>e||null==r)return r;for(var u=1;e>u;u++)for(var i=arguments[u],o=n(i),a=o.length,c=0;a>c;c++){var f=o[c];t&&r[f]!==void 0||(r[f]=i[f])}return r}},j=function(n){if(!m.isObject(n))return{};if(y)return y(n);d.prototype=n;var t=new d;return d.prototype=null,t},w=function(n){return function(t){return null==t?void 0:t[n]}},A=Math.pow(2,53)-1,O=w("length"),k=function(n){var t=O(n);return"number"==typeof t&&t>=0&&A>=t};m.each=m.forEach=function(n,t,r){t=b(t,r);var e,u;if(k(n))for(e=0,u=n.length;u>e;e++)t(n[e],e,n);else{var i=m.keys(n);for(e=0,u=i.length;u>e;e++)t(n[i[e]],i[e],n)}return n},m.map=m.collect=function(n,t,r){t=x(t,r);for(var e=!k(n)&&m.keys(n),u=(e||n).length,i=Array(u),o=0;u>o;o++){var a=e?e[o]:o;i[o]=t(n[a],a,n)}return i},m.reduce=m.foldl=m.inject=n(1),m.reduceRight=m.foldr=n(-1),m.find=m.detect=function(n,t,r){var e;return e=k(n)?m.findIndex(n,t,r):m.findKey(n,t,r),e!==void 0&&e!==-1?n[e]:void 0},m.filter=m.select=function(n,t,r){var e=[];return t=x(t,r),m.each(n,function(n,r,u){t(n,r,u)&&e.push(n)}),e},m.reject=function(n,t,r){return m.filter(n,m.negate(x(t)),r)},m.every=m.all=function(n,t,r){t=x(t,r);for(var e=!k(n)&&m.keys(n),u=(e||n).length,i=0;u>i;i++){var o=e?e[i]:i;if(!t(n[o],o,n))return!1}return!0},m.some=m.any=function(n,t,r){t=x(t,r);for(var e=!k(n)&&m.keys(n),u=(e||n).length,i=0;u>i;i++){var o=e?e[i]:i;if(t(n[o],o,n))return!0}return!1},m.contains=m.includes=m.include=function(n,t,r,e){return k(n)||(n=m.values(n)),("number"!=typeof r||e)&&(r=0),m.indexOf(n,t,r)>=0},m.invoke=function(n,t){var r=l.call(arguments,2),e=m.isFunction(t);return m.map(n,function(n){var u=e?t:n[t];return null==u?u:u.apply(n,r)})},m.pluck=function(n,t){return m.map(n,m.property(t))},m.where=function(n,t){return m.filter(n,m.matcher(t))},m.findWhere=function(n,t){return m.find(n,m.matcher(t))},m.max=function(n,t,r){var e,u,i=-1/0,o=-1/0;if(null==t&&null!=n){n=k(n)?n:m.values(n);for(var a=0,c=n.length;c>a;a++)e=n[a],e>i&&(i=e)}else t=x(t,r),m.each(n,function(n,r,e){u=t(n,r,e),(u>o||u===-1/0&&i===-1/0)&&(i=n,o=u)});return i},m.min=function(n,t,r){var e,u,i=1/0,o=1/0;if(null==t&&null!=n){n=k(n)?n:m.values(n);for(var a=0,c=n.length;c>a;a++)e=n[a],i>e&&(i=e)}else t=x(t,r),m.each(n,function(n,r,e){u=t(n,r,e),(o>u||1/0===u&&1/0===i)&&(i=n,o=u)});return i},m.shuffle=function(n){for(var t,r=k(n)?n:m.values(n),e=r.length,u=Array(e),i=0;e>i;i++)t=m.random(0,i),t!==i&&(u[i]=u[t]),u[t]=r[i];return u},m.sample=function(n,t,r){return null==t||r?(k(n)||(n=m.values(n)),n[m.random(n.length-1)]):m.shuffle(n).slice(0,Math.max(0,t))},m.sortBy=function(n,t,r){return t=x(t,r),m.pluck(m.map(n,function(n,r,e){return{value:n,index:r,criteria:t(n,r,e)}}).sort(function(n,t){var r=n.criteria,e=t.criteria;if(r!==e){if(r>e||r===void 0)return 1;if(e>r||e===void 0)return-1}return n.index-t.index}),"value")};var F=function(n){return function(t,r,e){var u={};return r=x(r,e),m.each(t,function(e,i){var o=r(e,i,t);n(u,e,o)}),u}};m.groupBy=F(function(n,t,r){m.has(n,r)?n[r].push(t):n[r]=[t]}),m.indexBy=F(function(n,t,r){n[r]=t}),m.countBy=F(function(n,t,r){m.has(n,r)?n[r]++:n[r]=1}),m.toArray=function(n){return n?m.isArray(n)?l.call(n):k(n)?m.map(n,m.identity):m.values(n):[]},m.size=function(n){return null==n?0:k(n)?n.length:m.keys(n).length},m.partition=function(n,t,r){t=x(t,r);var e=[],u=[];return m.each(n,function(n,r,i){(t(n,r,i)?e:u).push(n)}),[e,u]},m.first=m.head=m.take=function(n,t,r){return null==n?void 0:null==t||r?n[0]:m.initial(n,n.length-t)},m.initial=function(n,t,r){return l.call(n,0,Math.max(0,n.length-(null==t||r?1:t)))},m.last=function(n,t,r){return null==n?void 0:null==t||r?n[n.length-1]:m.rest(n,Math.max(0,n.length-t))},m.rest=m.tail=m.drop=function(n,t,r){return l.call(n,null==t||r?1:t)},m.compact=function(n){return m.filter(n,m.identity)};var S=function(n,t,r,e){for(var u=[],i=0,o=e||0,a=O(n);a>o;o++){var c=n[o];if(k(c)&&(m.isArray(c)||m.isArguments(c))){t||(c=S(c,t,r));var f=0,l=c.length;for(u.length+=l;l>f;)u[i++]=c[f++]}else r||(u[i++]=c)}return u};m.flatten=function(n,t){return S(n,t,!1)},m.without=function(n){return m.difference(n,l.call(arguments,1))},m.uniq=m.unique=function(n,t,r,e){m.isBoolean(t)||(e=r,r=t,t=!1),null!=r&&(r=x(r,e));for(var u=[],i=[],o=0,a=O(n);a>o;o++){var c=n[o],f=r?r(c,o,n):c;t?(o&&i===f||u.push(c),i=f):r?m.contains(i,f)||(i.push(f),u.push(c)):m.contains(u,c)||u.push(c)}return u},m.union=function(){return m.uniq(S(arguments,!0,!0))},m.intersection=function(n){for(var t=[],r=arguments.length,e=0,u=O(n);u>e;e++){var i=n[e];if(!m.contains(t,i)){for(var o=1;r>o&&m.contains(arguments[o],i);o++);o===r&&t.push(i)}}return t},m.difference=function(n){var t=S(arguments,!0,!0,1);return m.filter(n,function(n){return!m.contains(t,n)})},m.zip=function(){return m.unzip(arguments)},m.unzip=function(n){for(var t=n&&m.max(n,O).length||0,r=Array(t),e=0;t>e;e++)r[e]=m.pluck(n,e);return r},m.object=function(n,t){for(var r={},e=0,u=O(n);u>e;e++)t?r[n[e]]=t[e]:r[n[e][0]]=n[e][1];return r},m.findIndex=t(1),m.findLastIndex=t(-1),m.sortedIndex=function(n,t,r,e){r=x(r,e,1);for(var u=r(t),i=0,o=O(n);o>i;){var a=Math.floor((i+o)/2);r(n[a])i;i++,n+=r)u[i]=n;return u};var E=function(n,t,r,e,u){if(!(e instanceof t))return n.apply(r,u);var i=j(n.prototype),o=n.apply(i,u);return m.isObject(o)?o:i};m.bind=function(n,t){if(g&&n.bind===g)return g.apply(n,l.call(arguments,1));if(!m.isFunction(n))throw new TypeError("Bind must be called on a function");var r=l.call(arguments,2),e=function(){return E(n,e,t,this,r.concat(l.call(arguments)))};return e},m.partial=function(n){var t=l.call(arguments,1),r=function(){for(var e=0,u=t.length,i=Array(u),o=0;u>o;o++)i[o]=t[o]===m?arguments[e++]:t[o];for(;e=e)throw new Error("bindAll must be passed function names");for(t=1;e>t;t++)r=arguments[t],n[r]=m.bind(n[r],n);return n},m.memoize=function(n,t){var r=function(e){var u=r.cache,i=""+(t?t.apply(this,arguments):e);return m.has(u,i)||(u[i]=n.apply(this,arguments)),u[i]};return r.cache={},r},m.delay=function(n,t){var r=l.call(arguments,2);return setTimeout(function(){return n.apply(null,r)},t)},m.defer=m.partial(m.delay,m,1),m.throttle=function(n,t,r){var e,u,i,o=null,a=0;r||(r={});var c=function(){a=r.leading===!1?0:m.now(),o=null,i=n.apply(e,u),o||(e=u=null)};return function(){var f=m.now();a||r.leading!==!1||(a=f);var l=t-(f-a);return e=this,u=arguments,0>=l||l>t?(o&&(clearTimeout(o),o=null),a=f,i=n.apply(e,u),o||(e=u=null)):o||r.trailing===!1||(o=setTimeout(c,l)),i}},m.debounce=function(n,t,r){var e,u,i,o,a,c=function(){var f=m.now()-o;t>f&&f>=0?e=setTimeout(c,t-f):(e=null,r||(a=n.apply(i,u),e||(i=u=null)))};return function(){i=this,u=arguments,o=m.now();var f=r&&!e;return e||(e=setTimeout(c,t)),f&&(a=n.apply(i,u),i=u=null),a}},m.wrap=function(n,t){return m.partial(t,n)},m.negate=function(n){return function(){return!n.apply(this,arguments)}},m.compose=function(){var n=arguments,t=n.length-1;return function(){for(var r=t,e=n[t].apply(this,arguments);r--;)e=n[r].call(this,e);return e}},m.after=function(n,t){return function(){return--n<1?t.apply(this,arguments):void 0}},m.before=function(n,t){var r;return function(){return--n>0&&(r=t.apply(this,arguments)),1>=n&&(t=null),r}},m.once=m.partial(m.before,2);var M=!{toString:null}.propertyIsEnumerable("toString"),I=["valueOf","isPrototypeOf","toString","propertyIsEnumerable","hasOwnProperty","toLocaleString"];m.keys=function(n){if(!m.isObject(n))return[];if(v)return v(n);var t=[];for(var r in n)m.has(n,r)&&t.push(r);return M&&e(n,t),t},m.allKeys=function(n){if(!m.isObject(n))return[];var t=[];for(var r in n)t.push(r);return M&&e(n,t),t},m.values=function(n){for(var t=m.keys(n),r=t.length,e=Array(r),u=0;r>u;u++)e[u]=n[t[u]];return e},m.mapObject=function(n,t,r){t=x(t,r);for(var e,u=m.keys(n),i=u.length,o={},a=0;i>a;a++)e=u[a],o[e]=t(n[e],e,n);return o},m.pairs=function(n){for(var t=m.keys(n),r=t.length,e=Array(r),u=0;r>u;u++)e[u]=[t[u],n[t[u]]];return e},m.invert=function(n){for(var t={},r=m.keys(n),e=0,u=r.length;u>e;e++)t[n[r[e]]]=r[e];return t},m.functions=m.methods=function(n){var t=[];for(var r in n)m.isFunction(n[r])&&t.push(r);return t.sort()},m.extend=_(m.allKeys),m.extendOwn=m.assign=_(m.keys),m.findKey=function(n,t,r){t=x(t,r);for(var e,u=m.keys(n),i=0,o=u.length;o>i;i++)if(e=u[i],t(n[e],e,n))return e},m.pick=function(n,t,r){var e,u,i={},o=n;if(null==o)return i;m.isFunction(t)?(u=m.allKeys(o),e=b(t,r)):(u=S(arguments,!1,!1,1),e=function(n,t,r){return t in r},o=Object(o));for(var a=0,c=u.length;c>a;a++){var f=u[a],l=o[f];e(l,f,o)&&(i[f]=l)}return i},m.omit=function(n,t,r){if(m.isFunction(t))t=m.negate(t);else{var e=m.map(S(arguments,!1,!1,1),String);t=function(n,t){return!m.contains(e,t)}}return m.pick(n,t,r)},m.defaults=_(m.allKeys,!0),m.create=function(n,t){var r=j(n);return t&&m.extendOwn(r,t),r},m.clone=function(n){return m.isObject(n)?m.isArray(n)?n.slice():m.extend({},n):n},m.tap=function(n,t){return t(n),n},m.isMatch=function(n,t){var r=m.keys(t),e=r.length;if(null==n)return!e;for(var u=Object(n),i=0;e>i;i++){var o=r[i];if(t[o]!==u[o]||!(o in u))return!1}return!0};var N=function(n,t,r,e){if(n===t)return 0!==n||1/n===1/t;if(null==n||null==t)return n===t;n instanceof m&&(n=n._wrapped),t instanceof m&&(t=t._wrapped);var u=s.call(n);if(u!==s.call(t))return!1;switch(u){case"[object RegExp]":case"[object String]":return""+n==""+t;case"[object Number]":return+n!==+n?+t!==+t:0===+n?1/+n===1/t:+n===+t;case"[object Date]":case"[object Boolean]":return+n===+t}var i="[object Array]"===u;if(!i){if("object"!=typeof n||"object"!=typeof t)return!1;var o=n.constructor,a=t.constructor;if(o!==a&&!(m.isFunction(o)&&o instanceof o&&m.isFunction(a)&&a instanceof a)&&"constructor"in n&&"constructor"in t)return!1}r=r||[],e=e||[];for(var c=r.length;c--;)if(r[c]===n)return e[c]===t;if(r.push(n),e.push(t),i){if(c=n.length,c!==t.length)return!1;for(;c--;)if(!N(n[c],t[c],r,e))return!1}else{var f,l=m.keys(n);if(c=l.length,m.keys(t).length!==c)return!1;for(;c--;)if(f=l[c],!m.has(t,f)||!N(n[f],t[f],r,e))return!1}return r.pop(),e.pop(),!0};m.isEqual=function(n,t){return N(n,t)},m.isEmpty=function(n){return null==n?!0:k(n)&&(m.isArray(n)||m.isString(n)||m.isArguments(n))?0===n.length:0===m.keys(n).length},m.isElement=function(n){return!(!n||1!==n.nodeType)},m.isArray=h||function(n){return"[object Array]"===s.call(n)},m.isObject=function(n){var t=typeof n;return"function"===t||"object"===t&&!!n},m.each(["Arguments","Function","String","Number","Date","RegExp","Error"],function(n){m["is"+n]=function(t){return s.call(t)==="[object "+n+"]"}}),m.isArguments(arguments)||(m.isArguments=function(n){return m.has(n,"callee")}),"function"!=typeof/./&&"object"!=typeof Int8Array&&(m.isFunction=function(n){return"function"==typeof n||!1}),m.isFinite=function(n){return isFinite(n)&&!isNaN(parseFloat(n))},m.isNaN=function(n){return m.isNumber(n)&&n!==+n},m.isBoolean=function(n){return n===!0||n===!1||"[object Boolean]"===s.call(n)},m.isNull=function(n){return null===n},m.isUndefined=function(n){return n===void 0},m.has=function(n,t){return null!=n&&p.call(n,t)},m.noConflict=function(){return u._=i,this},m.identity=function(n){return n},m.constant=function(n){return function(){return n}},m.noop=function(){},m.property=w,m.propertyOf=function(n){return null==n?function(){}:function(t){return n[t]}},m.matcher=m.matches=function(n){return n=m.extendOwn({},n),function(t){return m.isMatch(t,n)}},m.times=function(n,t,r){var e=Array(Math.max(0,n));t=b(t,r,1);for(var u=0;n>u;u++)e[u]=t(u);return e},m.random=function(n,t){return null==t&&(t=n,n=0),n+Math.floor(Math.random()*(t-n+1))},m.now=Date.now||function(){return(new Date).getTime()};var B={"&":"&","<":"<",">":">",'"':""","'":"'","`":"`"},T=m.invert(B),R=function(n){var t=function(t){return n[t]},r="(?:"+m.keys(n).join("|")+")",e=RegExp(r),u=RegExp(r,"g");return function(n){return n=null==n?"":""+n,e.test(n)?n.replace(u,t):n}};m.escape=R(B),m.unescape=R(T),m.result=function(n,t,r){var e=null==n?void 0:n[t];return e===void 0&&(e=r),m.isFunction(e)?e.call(n):e};var q=0;m.uniqueId=function(n){var t=++q+"";return n?n+t:t},m.templateSettings={evaluate:/<%([\s\S]+?)%>/g,interpolate:/<%=([\s\S]+?)%>/g,escape:/<%-([\s\S]+?)%>/g};var K=/(.)^/,z={"'":"'","\\":"\\","\r":"r","\n":"n","\u2028":"u2028","\u2029":"u2029"},D=/\\|'|\r|\n|\u2028|\u2029/g,L=function(n){return"\\"+z[n]};m.template=function(n,t,r){!t&&r&&(t=r),t=m.defaults({},t,m.templateSettings);var e=RegExp([(t.escape||K).source,(t.interpolate||K).source,(t.evaluate||K).source].join("|")+"|$","g"),u=0,i="__p+='";n.replace(e,function(t,r,e,o,a){return i+=n.slice(u,a).replace(D,L),u=a+t.length,r?i+="'+\n((__t=("+r+"))==null?'':_.escape(__t))+\n'":e?i+="'+\n((__t=("+e+"))==null?'':__t)+\n'":o&&(i+="';\n"+o+"\n__p+='"),t}),i+="';\n",t.variable||(i="with(obj||{}){\n"+i+"}\n"),i="var __t,__p='',__j=Array.prototype.join,"+"print=function(){__p+=__j.call(arguments,'');};\n"+i+"return __p;\n";try{var o=new Function(t.variable||"obj","_",i)}catch(a){throw a.source=i,a}var c=function(n){return o.call(this,n,m)},f=t.variable||"obj";return c.source="function("+f+"){\n"+i+"}",c},m.chain=function(n){var t=m(n);return t._chain=!0,t};var P=function(n,t){return n._chain?m(t).chain():t};m.mixin=function(n){m.each(m.functions(n),function(t){var r=m[t]=n[t];m.prototype[t]=function(){var n=[this._wrapped];return f.apply(n,arguments),P(this,r.apply(m,n))}})},m.mixin(m),m.each(["pop","push","reverse","shift","sort","splice","unshift"],function(n){var t=o[n];m.prototype[n]=function(){var r=this._wrapped;return t.apply(r,arguments),"shift"!==n&&"splice"!==n||0!==r.length||delete r[0],P(this,r)}}),m.each(["concat","join","slice"],function(n){var t=o[n];m.prototype[n]=function(){return P(this,t.apply(this._wrapped,arguments))}}),m.prototype.value=function(){return this._wrapped},m.prototype.valueOf=m.prototype.toJSON=m.prototype.value,m.prototype.toString=function(){return""+this._wrapped},"function"==typeof define&&define.amd&&define("underscore",[],function(){return m})}).call(this);
6 | //# sourceMappingURL=underscore-min.map
--------------------------------------------------------------------------------
/underscore-1.8.3.js/src/underscore-1.8.3.js:
--------------------------------------------------------------------------------
1 | // Underscore.js 1.8.3
2 | // http://underscorejs.org
3 | // (c) 2009-2015 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 | // Save bytes in the minified (but not gzipped) version:
18 | var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
19 |
20 | // Create quick reference variables for speed access to core prototypes.
21 | var
22 | push = ArrayProto.push,
23 | slice = ArrayProto.slice,
24 | toString = ObjProto.toString,
25 | hasOwnProperty = ObjProto.hasOwnProperty;
26 |
27 | // All **ECMAScript 5** native function implementations that we hope to use
28 | // are declared here.
29 | var
30 | nativeIsArray = Array.isArray,
31 | nativeKeys = Object.keys,
32 | nativeBind = FuncProto.bind,
33 | nativeCreate = Object.create;
34 |
35 | // Naked function reference for surrogate-prototype-swapping.
36 | var Ctor = function(){};
37 |
38 | // Create a safe reference to the Underscore object for use below.
39 | var _ = function(obj) {
40 | if (obj instanceof _) return obj;
41 | if (!(this instanceof _)) return new _(obj);
42 | this._wrapped = obj;
43 | };
44 |
45 | // Export the Underscore object for **Node.js**, with
46 | // backwards-compatibility for the old `require()` API. If we're in
47 | // the browser, add `_` as a global object.
48 | if (typeof exports !== 'undefined') {
49 | if (typeof module !== 'undefined' && module.exports) {
50 | exports = module.exports = _;
51 | }
52 | exports._ = _;
53 | } else {
54 | root._ = _;
55 | }
56 |
57 | // Current version.
58 | _.VERSION = '1.8.3';
59 |
60 | // Internal function that returns an efficient (for current engines) version
61 | // of the passed-in callback, to be repeatedly applied in other Underscore
62 | // functions.
63 | var optimizeCb = function(func, context, argCount) {
64 | if (context === void 0) return func;
65 | switch (argCount == null ? 3 : argCount) {
66 | case 1: return function(value) {
67 | return func.call(context, value);
68 | };
69 | case 2: return function(value, other) {
70 | return func.call(context, value, other);
71 | };
72 | case 3: return function(value, index, collection) {
73 | return func.call(context, value, index, collection);
74 | };
75 | case 4: return function(accumulator, value, index, collection) {
76 | return func.call(context, accumulator, value, index, collection);
77 | };
78 | }
79 | return function() {
80 | return func.apply(context, arguments);
81 | };
82 | };
83 |
84 | // A mostly-internal function to generate callbacks that can be applied
85 | // to each element in a collection, returning the desired result — either
86 | // identity, an arbitrary callback, a property matcher, or a property accessor.
87 | var cb = function(value, context, argCount) {
88 | if (value == null) return _.identity;
89 | if (_.isFunction(value)) return optimizeCb(value, context, argCount);
90 | if (_.isObject(value)) return _.matcher(value);
91 | return _.property(value);
92 | };
93 | _.iteratee = function(value, context) {
94 | return cb(value, context, Infinity);
95 | };
96 |
97 | // An internal function for creating assigner functions.
98 | var createAssigner = function(keysFunc, undefinedOnly) {
99 | return function(obj) {
100 | var length = arguments.length;
101 | if (length < 2 || obj == null) return obj;
102 | for (var index = 1; index < length; index++) {
103 | var source = arguments[index],
104 | keys = keysFunc(source),
105 | l = keys.length;
106 | for (var i = 0; i < l; i++) {
107 | var key = keys[i];
108 | if (!undefinedOnly || obj[key] === void 0) obj[key] = source[key];
109 | }
110 | }
111 | return obj;
112 | };
113 | };
114 |
115 | // An internal function for creating a new object that inherits from another.
116 | var baseCreate = function(prototype) {
117 | if (!_.isObject(prototype)) return {};
118 | if (nativeCreate) return nativeCreate(prototype);
119 | Ctor.prototype = prototype;
120 | var result = new Ctor;
121 | Ctor.prototype = null;
122 | return result;
123 | };
124 |
125 | var property = function(key) {
126 | return function(obj) {
127 | return obj == null ? void 0 : obj[key];
128 | };
129 | };
130 |
131 | // Helper for collection methods to determine whether a collection
132 | // should be iterated as an array or as an object
133 | // Related: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
134 | // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
135 | var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;
136 | var getLength = property('length');
137 | var isArrayLike = function(collection) {
138 | var length = getLength(collection);
139 | return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX;
140 | };
141 |
142 | // Collection Functions
143 | // --------------------
144 |
145 | // The cornerstone, an `each` implementation, aka `forEach`.
146 | // Handles raw objects in addition to array-likes. Treats all
147 | // sparse array-likes as if they were dense.
148 | _.each = _.forEach = function(obj, iteratee, context) {
149 | iteratee = optimizeCb(iteratee, context);
150 | var i, length;
151 | if (isArrayLike(obj)) {
152 | for (i = 0, length = obj.length; i < length; i++) {
153 | iteratee(obj[i], i, obj);
154 | }
155 | } else {
156 | var keys = _.keys(obj);
157 | for (i = 0, length = keys.length; i < length; i++) {
158 | iteratee(obj[keys[i]], keys[i], obj);
159 | }
160 | }
161 | return obj;
162 | };
163 |
164 | // Return the results of applying the iteratee to each element.
165 | _.map = _.collect = function(obj, iteratee, context) {
166 | iteratee = cb(iteratee, context);
167 | var keys = !isArrayLike(obj) && _.keys(obj),
168 | length = (keys || obj).length,
169 | results = Array(length);
170 | for (var index = 0; index < length; index++) {
171 | var currentKey = keys ? keys[index] : index;
172 | results[index] = iteratee(obj[currentKey], currentKey, obj);
173 | }
174 | return results;
175 | };
176 |
177 | // Create a reducing function iterating left or right.
178 | function createReduce(dir) {
179 | // Optimized iterator function as using arguments.length
180 | // in the main function will deoptimize the, see #1991.
181 | function iterator(obj, iteratee, memo, keys, index, length) {
182 | for (; index >= 0 && index < length; index += dir) {
183 | var currentKey = keys ? keys[index] : index;
184 | memo = iteratee(memo, obj[currentKey], currentKey, obj);
185 | }
186 | return memo;
187 | }
188 |
189 | return function(obj, iteratee, memo, context) {
190 | iteratee = optimizeCb(iteratee, context, 4);
191 | var keys = !isArrayLike(obj) && _.keys(obj),
192 | length = (keys || obj).length,
193 | index = dir > 0 ? 0 : length - 1;
194 | // Determine the initial value if none is provided.
195 | if (arguments.length < 3) {
196 | memo = obj[keys ? keys[index] : index];
197 | index += dir;
198 | }
199 | return iterator(obj, iteratee, memo, keys, index, length);
200 | };
201 | }
202 |
203 | // **Reduce** builds up a single result from a list of values, aka `inject`,
204 | // or `foldl`.
205 | _.reduce = _.foldl = _.inject = createReduce(1);
206 |
207 | // The right-associative version of reduce, also known as `foldr`.
208 | _.reduceRight = _.foldr = createReduce(-1);
209 |
210 | // Return the first value which passes a truth test. Aliased as `detect`.
211 | _.find = _.detect = function(obj, predicate, context) {
212 | var key;
213 | if (isArrayLike(obj)) {
214 | key = _.findIndex(obj, predicate, context);
215 | } else {
216 | key = _.findKey(obj, predicate, context);
217 | }
218 | if (key !== void 0 && key !== -1) return obj[key];
219 | };
220 |
221 | // Return all the elements that pass a truth test.
222 | // Aliased as `select`.
223 | _.filter = _.select = function(obj, predicate, context) {
224 | var results = [];
225 | predicate = cb(predicate, context);
226 | _.each(obj, function(value, index, list) {
227 | if (predicate(value, index, list)) results.push(value);
228 | });
229 | return results;
230 | };
231 |
232 | // Return all the elements for which a truth test fails.
233 | _.reject = function(obj, predicate, context) {
234 | return _.filter(obj, _.negate(cb(predicate)), context);
235 | };
236 |
237 | // Determine whether all of the elements match a truth test.
238 | // Aliased as `all`.
239 | _.every = _.all = function(obj, predicate, context) {
240 | predicate = cb(predicate, context);
241 | var keys = !isArrayLike(obj) && _.keys(obj),
242 | length = (keys || obj).length;
243 | for (var index = 0; index < length; index++) {
244 | var currentKey = keys ? keys[index] : index;
245 | if (!predicate(obj[currentKey], currentKey, obj)) return false;
246 | }
247 | return true;
248 | };
249 |
250 | // Determine if at least one element in the object matches a truth test.
251 | // Aliased as `any`.
252 | _.some = _.any = function(obj, predicate, context) {
253 | predicate = cb(predicate, context);
254 | var keys = !isArrayLike(obj) && _.keys(obj),
255 | length = (keys || obj).length;
256 | for (var index = 0; index < length; index++) {
257 | var currentKey = keys ? keys[index] : index;
258 | if (predicate(obj[currentKey], currentKey, obj)) return true;
259 | }
260 | return false;
261 | };
262 |
263 | // Determine if the array or object contains a given item (using `===`).
264 | // Aliased as `includes` and `include`.
265 | _.contains = _.includes = _.include = function(obj, item, fromIndex, guard) {
266 | if (!isArrayLike(obj)) obj = _.values(obj);
267 | if (typeof fromIndex != 'number' || guard) fromIndex = 0;
268 | return _.indexOf(obj, item, fromIndex) >= 0;
269 | };
270 |
271 | // Invoke a method (with arguments) on every item in a collection.
272 | _.invoke = function(obj, method) {
273 | var args = slice.call(arguments, 2);
274 | var isFunc = _.isFunction(method);
275 | return _.map(obj, function(value) {
276 | var func = isFunc ? method : value[method];
277 | return func == null ? func : func.apply(value, args);
278 | });
279 | };
280 |
281 | // Convenience version of a common use case of `map`: fetching a property.
282 | _.pluck = function(obj, key) {
283 | return _.map(obj, _.property(key));
284 | };
285 |
286 | // Convenience version of a common use case of `filter`: selecting only objects
287 | // containing specific `key:value` pairs.
288 | _.where = function(obj, attrs) {
289 | return _.filter(obj, _.matcher(attrs));
290 | };
291 |
292 | // Convenience version of a common use case of `find`: getting the first object
293 | // containing specific `key:value` pairs.
294 | _.findWhere = function(obj, attrs) {
295 | return _.find(obj, _.matcher(attrs));
296 | };
297 |
298 | // Return the maximum element (or element-based computation).
299 | _.max = function(obj, iteratee, context) {
300 | var result = -Infinity, lastComputed = -Infinity,
301 | value, computed;
302 | if (iteratee == null && obj != null) {
303 | obj = isArrayLike(obj) ? obj : _.values(obj);
304 | for (var i = 0, length = obj.length; i < length; i++) {
305 | value = obj[i];
306 | if (value > result) {
307 | result = value;
308 | }
309 | }
310 | } else {
311 | iteratee = cb(iteratee, context);
312 | _.each(obj, function(value, index, list) {
313 | computed = iteratee(value, index, list);
314 | if (computed > lastComputed || computed === -Infinity && result === -Infinity) {
315 | result = value;
316 | lastComputed = computed;
317 | }
318 | });
319 | }
320 | return result;
321 | };
322 |
323 | // Return the minimum element (or element-based computation).
324 | _.min = function(obj, iteratee, context) {
325 | var result = Infinity, lastComputed = Infinity,
326 | value, computed;
327 | if (iteratee == null && obj != null) {
328 | obj = isArrayLike(obj) ? obj : _.values(obj);
329 | for (var i = 0, length = obj.length; i < length; i++) {
330 | value = obj[i];
331 | if (value < result) {
332 | result = value;
333 | }
334 | }
335 | } else {
336 | iteratee = cb(iteratee, context);
337 | _.each(obj, function(value, index, list) {
338 | computed = iteratee(value, index, list);
339 | if (computed < lastComputed || computed === Infinity && result === Infinity) {
340 | result = value;
341 | lastComputed = computed;
342 | }
343 | });
344 | }
345 | return result;
346 | };
347 |
348 | // Shuffle a collection, using the modern version of the
349 | // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
350 | _.shuffle = function(obj) {
351 | var set = isArrayLike(obj) ? obj : _.values(obj);
352 | var length = set.length;
353 | var shuffled = Array(length);
354 | for (var index = 0, rand; index < length; index++) {
355 | rand = _.random(0, index);
356 | if (rand !== index) shuffled[index] = shuffled[rand];
357 | shuffled[rand] = set[index];
358 | }
359 | return shuffled;
360 | };
361 |
362 | // Sample **n** random values from a collection.
363 | // If **n** is not specified, returns a single random element.
364 | // The internal `guard` argument allows it to work with `map`.
365 | _.sample = function(obj, n, guard) {
366 | if (n == null || guard) {
367 | if (!isArrayLike(obj)) obj = _.values(obj);
368 | return obj[_.random(obj.length - 1)];
369 | }
370 | return _.shuffle(obj).slice(0, Math.max(0, n));
371 | };
372 |
373 | // Sort the object's values by a criterion produced by an iteratee.
374 | _.sortBy = function(obj, iteratee, context) {
375 | iteratee = cb(iteratee, context);
376 | return _.pluck(_.map(obj, function(value, index, list) {
377 | return {
378 | value: value,
379 | index: index,
380 | criteria: iteratee(value, index, list)
381 | };
382 | }).sort(function(left, right) {
383 | var a = left.criteria;
384 | var b = right.criteria;
385 | if (a !== b) {
386 | if (a > b || a === void 0) return 1;
387 | if (a < b || b === void 0) return -1;
388 | }
389 | return left.index - right.index;
390 | }), 'value');
391 | };
392 |
393 | // An internal function used for aggregate "group by" operations.
394 | var group = function(behavior) {
395 | return function(obj, iteratee, context) {
396 | var result = {};
397 | iteratee = cb(iteratee, context);
398 | _.each(obj, function(value, index) {
399 | var key = iteratee(value, index, obj);
400 | behavior(result, value, key);
401 | });
402 | return result;
403 | };
404 | };
405 |
406 | // Groups the object's values by a criterion. Pass either a string attribute
407 | // to group by, or a function that returns the criterion.
408 | _.groupBy = group(function(result, value, key) {
409 | if (_.has(result, key)) result[key].push(value); else result[key] = [value];
410 | });
411 |
412 | // Indexes the object's values by a criterion, similar to `groupBy`, but for
413 | // when you know that your index values will be unique.
414 | _.indexBy = group(function(result, value, key) {
415 | result[key] = value;
416 | });
417 |
418 | // Counts instances of an object that group by a certain criterion. Pass
419 | // either a string attribute to count by, or a function that returns the
420 | // criterion.
421 | _.countBy = group(function(result, value, key) {
422 | if (_.has(result, key)) result[key]++; else result[key] = 1;
423 | });
424 |
425 | // Safely create a real, live array from anything iterable.
426 | _.toArray = function(obj) {
427 | if (!obj) return [];
428 | if (_.isArray(obj)) return slice.call(obj);
429 | if (isArrayLike(obj)) return _.map(obj, _.identity);
430 | return _.values(obj);
431 | };
432 |
433 | // Return the number of elements in an object.
434 | _.size = function(obj) {
435 | if (obj == null) return 0;
436 | return isArrayLike(obj) ? obj.length : _.keys(obj).length;
437 | };
438 |
439 | // Split a collection into two arrays: one whose elements all satisfy the given
440 | // predicate, and one whose elements all do not satisfy the predicate.
441 | _.partition = function(obj, predicate, context) {
442 | predicate = cb(predicate, context);
443 | var pass = [], fail = [];
444 | _.each(obj, function(value, key, obj) {
445 | (predicate(value, key, obj) ? pass : fail).push(value);
446 | });
447 | return [pass, fail];
448 | };
449 |
450 | // Array Functions
451 | // ---------------
452 |
453 | // Get the first element of an array. Passing **n** will return the first N
454 | // values in the array. Aliased as `head` and `take`. The **guard** check
455 | // allows it to work with `_.map`.
456 | _.first = _.head = _.take = function(array, n, guard) {
457 | if (array == null) return void 0;
458 | if (n == null || guard) return array[0];
459 | return _.initial(array, array.length - n);
460 | };
461 |
462 | // Returns everything but the last entry of the array. Especially useful on
463 | // the arguments object. Passing **n** will return all the values in
464 | // the array, excluding the last N.
465 | _.initial = function(array, n, guard) {
466 | return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));
467 | };
468 |
469 | // Get the last element of an array. Passing **n** will return the last N
470 | // values in the array.
471 | _.last = function(array, n, guard) {
472 | if (array == null) return void 0;
473 | if (n == null || guard) return array[array.length - 1];
474 | return _.rest(array, Math.max(0, array.length - n));
475 | };
476 |
477 | // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
478 | // Especially useful on the arguments object. Passing an **n** will return
479 | // the rest N values in the array.
480 | _.rest = _.tail = _.drop = function(array, n, guard) {
481 | return slice.call(array, n == null || guard ? 1 : n);
482 | };
483 |
484 | // Trim out all falsy values from an array.
485 | _.compact = function(array) {
486 | return _.filter(array, _.identity);
487 | };
488 |
489 | // Internal implementation of a recursive `flatten` function.
490 | var flatten = function(input, shallow, strict, startIndex) {
491 | var output = [], idx = 0;
492 | for (var i = startIndex || 0, length = getLength(input); i < length; i++) {
493 | var value = input[i];
494 | if (isArrayLike(value) && (_.isArray(value) || _.isArguments(value))) {
495 | //flatten current level of array or arguments object
496 | if (!shallow) value = flatten(value, shallow, strict);
497 | var j = 0, len = value.length;
498 | output.length += len;
499 | while (j < len) {
500 | output[idx++] = value[j++];
501 | }
502 | } else if (!strict) {
503 | output[idx++] = value;
504 | }
505 | }
506 | return output;
507 | };
508 |
509 | // Flatten out an array, either recursively (by default), or just one level.
510 | _.flatten = function(array, shallow) {
511 | return flatten(array, shallow, false);
512 | };
513 |
514 | // Return a version of the array that does not contain the specified value(s).
515 | _.without = function(array) {
516 | return _.difference(array, slice.call(arguments, 1));
517 | };
518 |
519 | // Produce a duplicate-free version of the array. If the array has already
520 | // been sorted, you have the option of using a faster algorithm.
521 | // Aliased as `unique`.
522 | _.uniq = _.unique = function(array, isSorted, iteratee, context) {
523 | if (!_.isBoolean(isSorted)) {
524 | context = iteratee;
525 | iteratee = isSorted;
526 | isSorted = false;
527 | }
528 | if (iteratee != null) iteratee = cb(iteratee, context);
529 | var result = [];
530 | var seen = [];
531 | for (var i = 0, length = getLength(array); i < length; i++) {
532 | var value = array[i],
533 | computed = iteratee ? iteratee(value, i, array) : value;
534 | if (isSorted) {
535 | if (!i || seen !== computed) result.push(value);
536 | seen = computed;
537 | } else if (iteratee) {
538 | if (!_.contains(seen, computed)) {
539 | seen.push(computed);
540 | result.push(value);
541 | }
542 | } else if (!_.contains(result, value)) {
543 | result.push(value);
544 | }
545 | }
546 | return result;
547 | };
548 |
549 | // Produce an array that contains the union: each distinct element from all of
550 | // the passed-in arrays.
551 | _.union = function() {
552 | return _.uniq(flatten(arguments, true, true));
553 | };
554 |
555 | // Produce an array that contains every item shared between all the
556 | // passed-in arrays.
557 | _.intersection = function(array) {
558 | var result = [];
559 | var argsLength = arguments.length;
560 | for (var i = 0, length = getLength(array); i < length; i++) {
561 | var item = array[i];
562 | if (_.contains(result, item)) continue;
563 | for (var j = 1; j < argsLength; j++) {
564 | if (!_.contains(arguments[j], item)) break;
565 | }
566 | if (j === argsLength) result.push(item);
567 | }
568 | return result;
569 | };
570 |
571 | // Take the difference between one array and a number of other arrays.
572 | // Only the elements present in just the first array will remain.
573 | _.difference = function(array) {
574 | var rest = flatten(arguments, true, true, 1);
575 | return _.filter(array, function(value){
576 | return !_.contains(rest, value);
577 | });
578 | };
579 |
580 | // Zip together multiple lists into a single array -- elements that share
581 | // an index go together.
582 | _.zip = function() {
583 | return _.unzip(arguments);
584 | };
585 |
586 | // Complement of _.zip. Unzip accepts an array of arrays and groups
587 | // each array's elements on shared indices
588 | _.unzip = function(array) {
589 | var length = array && _.max(array, getLength).length || 0;
590 | var result = Array(length);
591 |
592 | for (var index = 0; index < length; index++) {
593 | result[index] = _.pluck(array, index);
594 | }
595 | return result;
596 | };
597 |
598 | // Converts lists into objects. Pass either a single array of `[key, value]`
599 | // pairs, or two parallel arrays of the same length -- one of keys, and one of
600 | // the corresponding values.
601 | _.object = function(list, values) {
602 | var result = {};
603 | for (var i = 0, length = getLength(list); i < length; i++) {
604 | if (values) {
605 | result[list[i]] = values[i];
606 | } else {
607 | result[list[i][0]] = list[i][1];
608 | }
609 | }
610 | return result;
611 | };
612 |
613 | // Generator function to create the findIndex and findLastIndex functions
614 | function createPredicateIndexFinder(dir) {
615 | return function(array, predicate, context) {
616 | predicate = cb(predicate, context);
617 | var length = getLength(array);
618 | var index = dir > 0 ? 0 : length - 1;
619 | for (; index >= 0 && index < length; index += dir) {
620 | if (predicate(array[index], index, array)) return index;
621 | }
622 | return -1;
623 | };
624 | }
625 |
626 | // Returns the first index on an array-like that passes a predicate test
627 | _.findIndex = createPredicateIndexFinder(1);
628 | _.findLastIndex = createPredicateIndexFinder(-1);
629 |
630 | // Use a comparator function to figure out the smallest index at which
631 | // an object should be inserted so as to maintain order. Uses binary search.
632 | _.sortedIndex = function(array, obj, iteratee, context) {
633 | iteratee = cb(iteratee, context, 1);
634 | var value = iteratee(obj);
635 | var low = 0, high = getLength(array);
636 | while (low < high) {
637 | var mid = Math.floor((low + high) / 2);
638 | if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
639 | }
640 | return low;
641 | };
642 |
643 | // Generator function to create the indexOf and lastIndexOf functions
644 | function createIndexFinder(dir, predicateFind, sortedIndex) {
645 | return function(array, item, idx) {
646 | var i = 0, length = getLength(array);
647 | if (typeof idx == 'number') {
648 | if (dir > 0) {
649 | i = idx >= 0 ? idx : Math.max(idx + length, i);
650 | } else {
651 | length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
652 | }
653 | } else if (sortedIndex && idx && length) {
654 | idx = sortedIndex(array, item);
655 | return array[idx] === item ? idx : -1;
656 | }
657 | if (item !== item) {
658 | idx = predicateFind(slice.call(array, i, length), _.isNaN);
659 | return idx >= 0 ? idx + i : -1;
660 | }
661 | for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
662 | if (array[idx] === item) return idx;
663 | }
664 | return -1;
665 | };
666 | }
667 |
668 | // Return the position of the first occurrence of an item in an array,
669 | // or -1 if the item is not included in the array.
670 | // If the array is large and already in sort order, pass `true`
671 | // for **isSorted** to use binary search.
672 | _.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex);
673 | _.lastIndexOf = createIndexFinder(-1, _.findLastIndex);
674 |
675 | // Generate an integer Array containing an arithmetic progression. A port of
676 | // the native Python `range()` function. See
677 | // [the Python documentation](http://docs.python.org/library/functions.html#range).
678 | _.range = function(start, stop, step) {
679 | if (stop == null) {
680 | stop = start || 0;
681 | start = 0;
682 | }
683 | step = step || 1;
684 |
685 | var length = Math.max(Math.ceil((stop - start) / step), 0);
686 | var range = Array(length);
687 |
688 | for (var idx = 0; idx < length; idx++, start += step) {
689 | range[idx] = start;
690 | }
691 |
692 | return range;
693 | };
694 |
695 | // Function (ahem) Functions
696 | // ------------------
697 |
698 | // Determines whether to execute a function as a constructor
699 | // or a normal function with the provided arguments
700 | var executeBound = function(sourceFunc, boundFunc, context, callingContext, args) {
701 | if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
702 | var self = baseCreate(sourceFunc.prototype);
703 | var result = sourceFunc.apply(self, args);
704 | if (_.isObject(result)) return result;
705 | return self;
706 | };
707 |
708 | // Create a function bound to a given object (assigning `this`, and arguments,
709 | // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
710 | // available.
711 | _.bind = function(func, context) {
712 | if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
713 | if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function');
714 | var args = slice.call(arguments, 2);
715 | var bound = function() {
716 | return executeBound(func, bound, context, this, args.concat(slice.call(arguments)));
717 | };
718 | return bound;
719 | };
720 |
721 | // Partially apply a function by creating a version that has had some of its
722 | // arguments pre-filled, without changing its dynamic `this` context. _ acts
723 | // as a placeholder, allowing any combination of arguments to be pre-filled.
724 | _.partial = function(func) {
725 | var boundArgs = slice.call(arguments, 1);
726 | var bound = function() {
727 | var position = 0, length = boundArgs.length;
728 | var args = Array(length);
729 | for (var i = 0; i < length; i++) {
730 | args[i] = boundArgs[i] === _ ? arguments[position++] : boundArgs[i];
731 | }
732 | while (position < arguments.length) args.push(arguments[position++]);
733 | return executeBound(func, bound, this, this, args);
734 | };
735 | return bound;
736 | };
737 |
738 | // Bind a number of an object's methods to that object. Remaining arguments
739 | // are the method names to be bound. Useful for ensuring that all callbacks
740 | // defined on an object belong to it.
741 | _.bindAll = function(obj) {
742 | var i, length = arguments.length, key;
743 | if (length <= 1) throw new Error('bindAll must be passed function names');
744 | for (i = 1; i < length; i++) {
745 | key = arguments[i];
746 | obj[key] = _.bind(obj[key], obj);
747 | }
748 | return obj;
749 | };
750 |
751 | // Memoize an expensive function by storing its results.
752 | _.memoize = function(func, hasher) {
753 | var memoize = function(key) {
754 | var cache = memoize.cache;
755 | var address = '' + (hasher ? hasher.apply(this, arguments) : key);
756 | if (!_.has(cache, address)) cache[address] = func.apply(this, arguments);
757 | return cache[address];
758 | };
759 | memoize.cache = {};
760 | return memoize;
761 | };
762 |
763 | // Delays a function for the given number of milliseconds, and then calls
764 | // it with the arguments supplied.
765 | _.delay = function(func, wait) {
766 | var args = slice.call(arguments, 2);
767 | return setTimeout(function(){
768 | return func.apply(null, args);
769 | }, wait);
770 | };
771 |
772 | // Defers a function, scheduling it to run after the current call stack has
773 | // cleared.
774 | _.defer = _.partial(_.delay, _, 1);
775 |
776 | // Returns a function, that, when invoked, will only be triggered at most once
777 | // during a given window of time. Normally, the throttled function will run
778 | // as much as it can, without ever going more than once per `wait` duration;
779 | // but if you'd like to disable the execution on the leading edge, pass
780 | // `{leading: false}`. To disable execution on the trailing edge, ditto.
781 | _.throttle = function(func, wait, options) {
782 | var context, args, result;
783 | var timeout = null;
784 | var previous = 0;
785 | if (!options) options = {};
786 | var later = function() {
787 | previous = options.leading === false ? 0 : _.now();
788 | timeout = null;
789 | result = func.apply(context, args);
790 | if (!timeout) context = args = null;
791 | };
792 | return function() {
793 | var now = _.now();
794 | if (!previous && options.leading === false) previous = now;
795 | var remaining = wait - (now - previous);
796 | context = this;
797 | args = arguments;
798 | if (remaining <= 0 || remaining > wait) {
799 | if (timeout) {
800 | clearTimeout(timeout);
801 | timeout = null;
802 | }
803 | previous = now;
804 | result = func.apply(context, args);
805 | if (!timeout) context = args = null;
806 | } else if (!timeout && options.trailing !== false) {
807 | timeout = setTimeout(later, remaining);
808 | }
809 | return result;
810 | };
811 | };
812 |
813 | // Returns a function, that, as long as it continues to be invoked, will not
814 | // be triggered. The function will be called after it stops being called for
815 | // N milliseconds. If `immediate` is passed, trigger the function on the
816 | // leading edge, instead of the trailing.
817 | _.debounce = function(func, wait, immediate) {
818 | var timeout, args, context, timestamp, result;
819 |
820 | var later = function() {
821 | var last = _.now() - timestamp;
822 |
823 | if (last < wait && last >= 0) {
824 | timeout = setTimeout(later, wait - last);
825 | } else {
826 | timeout = null;
827 | if (!immediate) {
828 | result = func.apply(context, args);
829 | if (!timeout) context = args = null;
830 | }
831 | }
832 | };
833 |
834 | return function() {
835 | context = this;
836 | args = arguments;
837 | timestamp = _.now();
838 | var callNow = immediate && !timeout;
839 | if (!timeout) timeout = setTimeout(later, wait);
840 | if (callNow) {
841 | result = func.apply(context, args);
842 | context = args = null;
843 | }
844 |
845 | return result;
846 | };
847 | };
848 |
849 | // Returns the first function passed as an argument to the second,
850 | // allowing you to adjust arguments, run code before and after, and
851 | // conditionally execute the original function.
852 | _.wrap = function(func, wrapper) {
853 | return _.partial(wrapper, func);
854 | };
855 |
856 | // Returns a negated version of the passed-in predicate.
857 | _.negate = function(predicate) {
858 | return function() {
859 | return !predicate.apply(this, arguments);
860 | };
861 | };
862 |
863 | // Returns a function that is the composition of a list of functions, each
864 | // consuming the return value of the function that follows.
865 | _.compose = function() {
866 | var args = arguments;
867 | var start = args.length - 1;
868 | return function() {
869 | var i = start;
870 | var result = args[start].apply(this, arguments);
871 | while (i--) result = args[i].call(this, result);
872 | return result;
873 | };
874 | };
875 |
876 | // Returns a function that will only be executed on and after the Nth call.
877 | _.after = function(times, func) {
878 | return function() {
879 | if (--times < 1) {
880 | return func.apply(this, arguments);
881 | }
882 | };
883 | };
884 |
885 | // Returns a function that will only be executed up to (but not including) the Nth call.
886 | _.before = function(times, func) {
887 | var memo;
888 | return function() {
889 | if (--times > 0) {
890 | memo = func.apply(this, arguments);
891 | }
892 | if (times <= 1) func = null;
893 | return memo;
894 | };
895 | };
896 |
897 | // Returns a function that will be executed at most one time, no matter how
898 | // often you call it. Useful for lazy initialization.
899 | _.once = _.partial(_.before, 2);
900 |
901 | // Object Functions
902 | // ----------------
903 |
904 | // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
905 | var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
906 | var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
907 | 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
908 |
909 | function collectNonEnumProps(obj, keys) {
910 | var nonEnumIdx = nonEnumerableProps.length;
911 | var constructor = obj.constructor;
912 | var proto = (_.isFunction(constructor) && constructor.prototype) || ObjProto;
913 |
914 | // Constructor is a special case.
915 | var prop = 'constructor';
916 | if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);
917 |
918 | while (nonEnumIdx--) {
919 | prop = nonEnumerableProps[nonEnumIdx];
920 | if (prop in obj && obj[prop] !== proto[prop] && !_.contains(keys, prop)) {
921 | keys.push(prop);
922 | }
923 | }
924 | }
925 |
926 | // Retrieve the names of an object's own properties.
927 | // Delegates to **ECMAScript 5**'s native `Object.keys`
928 | _.keys = function(obj) {
929 | if (!_.isObject(obj)) return [];
930 | if (nativeKeys) return nativeKeys(obj);
931 | var keys = [];
932 | for (var key in obj) if (_.has(obj, key)) keys.push(key);
933 | // Ahem, IE < 9.
934 | if (hasEnumBug) collectNonEnumProps(obj, keys);
935 | return keys;
936 | };
937 |
938 | // Retrieve all the property names of an object.
939 | _.allKeys = function(obj) {
940 | if (!_.isObject(obj)) return [];
941 | var keys = [];
942 | for (var key in obj) keys.push(key);
943 | // Ahem, IE < 9.
944 | if (hasEnumBug) collectNonEnumProps(obj, keys);
945 | return keys;
946 | };
947 |
948 | // Retrieve the values of an object's properties.
949 | _.values = function(obj) {
950 | var keys = _.keys(obj);
951 | var length = keys.length;
952 | var values = Array(length);
953 | for (var i = 0; i < length; i++) {
954 | values[i] = obj[keys[i]];
955 | }
956 | return values;
957 | };
958 |
959 | // Returns the results of applying the iteratee to each element of the object
960 | // In contrast to _.map it returns an object
961 | _.mapObject = function(obj, iteratee, context) {
962 | iteratee = cb(iteratee, context);
963 | var keys = _.keys(obj),
964 | length = keys.length,
965 | results = {},
966 | currentKey;
967 | for (var index = 0; index < length; index++) {
968 | currentKey = keys[index];
969 | results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
970 | }
971 | return results;
972 | };
973 |
974 | // Convert an object into a list of `[key, value]` pairs.
975 | _.pairs = function(obj) {
976 | var keys = _.keys(obj);
977 | var length = keys.length;
978 | var pairs = Array(length);
979 | for (var i = 0; i < length; i++) {
980 | pairs[i] = [keys[i], obj[keys[i]]];
981 | }
982 | return pairs;
983 | };
984 |
985 | // Invert the keys and values of an object. The values must be serializable.
986 | _.invert = function(obj) {
987 | var result = {};
988 | var keys = _.keys(obj);
989 | for (var i = 0, length = keys.length; i < length; i++) {
990 | result[obj[keys[i]]] = keys[i];
991 | }
992 | return result;
993 | };
994 |
995 | // Return a sorted list of the function names available on the object.
996 | // Aliased as `methods`
997 | _.functions = _.methods = function(obj) {
998 | var names = [];
999 | for (var key in obj) {
1000 | if (_.isFunction(obj[key])) names.push(key);
1001 | }
1002 | return names.sort();
1003 | };
1004 |
1005 | // Extend a given object with all the properties in passed-in object(s).
1006 | _.extend = createAssigner(_.allKeys);
1007 |
1008 | // Assigns a given object with all the own properties in the passed-in object(s)
1009 | // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)
1010 | _.extendOwn = _.assign = createAssigner(_.keys);
1011 |
1012 | // Returns the first key on an object that passes a predicate test
1013 | _.findKey = function(obj, predicate, context) {
1014 | predicate = cb(predicate, context);
1015 | var keys = _.keys(obj), key;
1016 | for (var i = 0, length = keys.length; i < length; i++) {
1017 | key = keys[i];
1018 | if (predicate(obj[key], key, obj)) return key;
1019 | }
1020 | };
1021 |
1022 | // Return a copy of the object only containing the whitelisted properties.
1023 | _.pick = function(object, oiteratee, context) {
1024 | var result = {}, obj = object, iteratee, keys;
1025 | if (obj == null) return result;
1026 | if (_.isFunction(oiteratee)) {
1027 | keys = _.allKeys(obj);
1028 | iteratee = optimizeCb(oiteratee, context);
1029 | } else {
1030 | keys = flatten(arguments, false, false, 1);
1031 | iteratee = function(value, key, obj) { return key in obj; };
1032 | obj = Object(obj);
1033 | }
1034 | for (var i = 0, length = keys.length; i < length; i++) {
1035 | var key = keys[i];
1036 | var value = obj[key];
1037 | if (iteratee(value, key, obj)) result[key] = value;
1038 | }
1039 | return result;
1040 | };
1041 |
1042 | // Return a copy of the object without the blacklisted properties.
1043 | _.omit = function(obj, iteratee, context) {
1044 | if (_.isFunction(iteratee)) {
1045 | iteratee = _.negate(iteratee);
1046 | } else {
1047 | var keys = _.map(flatten(arguments, false, false, 1), String);
1048 | iteratee = function(value, key) {
1049 | return !_.contains(keys, key);
1050 | };
1051 | }
1052 | return _.pick(obj, iteratee, context);
1053 | };
1054 |
1055 | // Fill in a given object with default properties.
1056 | _.defaults = createAssigner(_.allKeys, true);
1057 |
1058 | // Creates an object that inherits from the given prototype object.
1059 | // If additional properties are provided then they will be added to the
1060 | // created object.
1061 | _.create = function(prototype, props) {
1062 | var result = baseCreate(prototype);
1063 | if (props) _.extendOwn(result, props);
1064 | return result;
1065 | };
1066 |
1067 | // Create a (shallow-cloned) duplicate of an object.
1068 | _.clone = function(obj) {
1069 | if (!_.isObject(obj)) return obj;
1070 | return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
1071 | };
1072 |
1073 | // Invokes interceptor with the obj, and then returns obj.
1074 | // The primary purpose of this method is to "tap into" a method chain, in
1075 | // order to perform operations on intermediate results within the chain.
1076 | _.tap = function(obj, interceptor) {
1077 | interceptor(obj);
1078 | return obj;
1079 | };
1080 |
1081 | // Returns whether an object has a given set of `key:value` pairs.
1082 | _.isMatch = function(object, attrs) {
1083 | var keys = _.keys(attrs), length = keys.length;
1084 | if (object == null) return !length;
1085 | var obj = Object(object);
1086 | for (var i = 0; i < length; i++) {
1087 | var key = keys[i];
1088 | if (attrs[key] !== obj[key] || !(key in obj)) return false;
1089 | }
1090 | return true;
1091 | };
1092 |
1093 |
1094 | // Internal recursive comparison function for `isEqual`.
1095 | var eq = function(a, b, aStack, bStack) {
1096 | // Identical objects are equal. `0 === -0`, but they aren't identical.
1097 | // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).
1098 | if (a === b) return a !== 0 || 1 / a === 1 / b;
1099 | // A strict comparison is necessary because `null == undefined`.
1100 | if (a == null || b == null) return a === b;
1101 | // Unwrap any wrapped objects.
1102 | if (a instanceof _) a = a._wrapped;
1103 | if (b instanceof _) b = b._wrapped;
1104 | // Compare `[[Class]]` names.
1105 | var className = toString.call(a);
1106 | if (className !== toString.call(b)) return false;
1107 | switch (className) {
1108 | // Strings, numbers, regular expressions, dates, and booleans are compared by value.
1109 | case '[object RegExp]':
1110 | // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')
1111 | case '[object String]':
1112 | // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
1113 | // equivalent to `new String("5")`.
1114 | return '' + a === '' + b;
1115 | case '[object Number]':
1116 | // `NaN`s are equivalent, but non-reflexive.
1117 | // Object(NaN) is equivalent to NaN
1118 | if (+a !== +a) return +b !== +b;
1119 | // An `egal` comparison is performed for other numeric values.
1120 | return +a === 0 ? 1 / +a === 1 / b : +a === +b;
1121 | case '[object Date]':
1122 | case '[object Boolean]':
1123 | // Coerce dates and booleans to numeric primitive values. Dates are compared by their
1124 | // millisecond representations. Note that invalid dates with millisecond representations
1125 | // of `NaN` are not equivalent.
1126 | return +a === +b;
1127 | }
1128 |
1129 | var areArrays = className === '[object Array]';
1130 | if (!areArrays) {
1131 | if (typeof a != 'object' || typeof b != 'object') return false;
1132 |
1133 | // Objects with different constructors are not equivalent, but `Object`s or `Array`s
1134 | // from different frames are.
1135 | var aCtor = a.constructor, bCtor = b.constructor;
1136 | if (aCtor !== bCtor && !(_.isFunction(aCtor) && aCtor instanceof aCtor &&
1137 | _.isFunction(bCtor) && bCtor instanceof bCtor)
1138 | && ('constructor' in a && 'constructor' in b)) {
1139 | return false;
1140 | }
1141 | }
1142 | // Assume equality for cyclic structures. The algorithm for detecting cyclic
1143 | // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
1144 |
1145 | // Initializing stack of traversed objects.
1146 | // It's done here since we only need them for objects and arrays comparison.
1147 | aStack = aStack || [];
1148 | bStack = bStack || [];
1149 | var length = aStack.length;
1150 | while (length--) {
1151 | // Linear search. Performance is inversely proportional to the number of
1152 | // unique nested structures.
1153 | if (aStack[length] === a) return bStack[length] === b;
1154 | }
1155 |
1156 | // Add the first object to the stack of traversed objects.
1157 | aStack.push(a);
1158 | bStack.push(b);
1159 |
1160 | // Recursively compare objects and arrays.
1161 | if (areArrays) {
1162 | // Compare array lengths to determine if a deep comparison is necessary.
1163 | length = a.length;
1164 | if (length !== b.length) return false;
1165 | // Deep compare the contents, ignoring non-numeric properties.
1166 | while (length--) {
1167 | if (!eq(a[length], b[length], aStack, bStack)) return false;
1168 | }
1169 | } else {
1170 | // Deep compare objects.
1171 | var keys = _.keys(a), key;
1172 | length = keys.length;
1173 | // Ensure that both objects contain the same number of properties before comparing deep equality.
1174 | if (_.keys(b).length !== length) return false;
1175 | while (length--) {
1176 | // Deep compare each member
1177 | key = keys[length];
1178 | if (!(_.has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;
1179 | }
1180 | }
1181 | // Remove the first object from the stack of traversed objects.
1182 | aStack.pop();
1183 | bStack.pop();
1184 | return true;
1185 | };
1186 |
1187 | // Perform a deep comparison to check if two objects are equal.
1188 | _.isEqual = function(a, b) {
1189 | return eq(a, b);
1190 | };
1191 |
1192 | // Is a given array, string, or object empty?
1193 | // An "empty" object has no enumerable own-properties.
1194 | _.isEmpty = function(obj) {
1195 | if (obj == null) return true;
1196 | if (isArrayLike(obj) && (_.isArray(obj) || _.isString(obj) || _.isArguments(obj))) return obj.length === 0;
1197 | return _.keys(obj).length === 0;
1198 | };
1199 |
1200 | // Is a given value a DOM element?
1201 | _.isElement = function(obj) {
1202 | return !!(obj && obj.nodeType === 1);
1203 | };
1204 |
1205 | // Is a given value an array?
1206 | // Delegates to ECMA5's native Array.isArray
1207 | _.isArray = nativeIsArray || function(obj) {
1208 | return toString.call(obj) === '[object Array]';
1209 | };
1210 |
1211 | // Is a given variable an object?
1212 | _.isObject = function(obj) {
1213 | var type = typeof obj;
1214 | return type === 'function' || type === 'object' && !!obj;
1215 | };
1216 |
1217 | // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError.
1218 | _.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) {
1219 | _['is' + name] = function(obj) {
1220 | return toString.call(obj) === '[object ' + name + ']';
1221 | };
1222 | });
1223 |
1224 | // Define a fallback version of the method in browsers (ahem, IE < 9), where
1225 | // there isn't any inspectable "Arguments" type.
1226 | if (!_.isArguments(arguments)) {
1227 | _.isArguments = function(obj) {
1228 | return _.has(obj, 'callee');
1229 | };
1230 | }
1231 |
1232 | // Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8,
1233 | // IE 11 (#1621), and in Safari 8 (#1929).
1234 | if (typeof /./ != 'function' && typeof Int8Array != 'object') {
1235 | _.isFunction = function(obj) {
1236 | return typeof obj == 'function' || false;
1237 | };
1238 | }
1239 |
1240 | // Is a given object a finite number?
1241 | _.isFinite = function(obj) {
1242 | return isFinite(obj) && !isNaN(parseFloat(obj));
1243 | };
1244 |
1245 | // Is the given value `NaN`? (NaN is the only number which does not equal itself).
1246 | _.isNaN = function(obj) {
1247 | return _.isNumber(obj) && obj !== +obj;
1248 | };
1249 |
1250 | // Is a given value a boolean?
1251 | _.isBoolean = function(obj) {
1252 | return obj === true || obj === false || toString.call(obj) === '[object Boolean]';
1253 | };
1254 |
1255 | // Is a given value equal to null?
1256 | _.isNull = function(obj) {
1257 | return obj === null;
1258 | };
1259 |
1260 | // Is a given variable undefined?
1261 | _.isUndefined = function(obj) {
1262 | return obj === void 0;
1263 | };
1264 |
1265 | // Shortcut function for checking if an object has a given property directly
1266 | // on itself (in other words, not on a prototype).
1267 | _.has = function(obj, key) {
1268 | return obj != null && hasOwnProperty.call(obj, key);
1269 | };
1270 |
1271 | // Utility Functions
1272 | // -----------------
1273 |
1274 | // Run Underscore.js in *noConflict* mode, returning the `_` variable to its
1275 | // previous owner. Returns a reference to the Underscore object.
1276 | _.noConflict = function() {
1277 | root._ = previousUnderscore;
1278 | return this;
1279 | };
1280 |
1281 | // Keep the identity function around for default iteratees.
1282 | _.identity = function(value) {
1283 | return value;
1284 | };
1285 |
1286 | // Predicate-generating functions. Often useful outside of Underscore.
1287 | _.constant = function(value) {
1288 | return function() {
1289 | return value;
1290 | };
1291 | };
1292 |
1293 | _.noop = function(){};
1294 |
1295 | _.property = property;
1296 |
1297 | // Generates a function for a given object that returns a given property.
1298 | _.propertyOf = function(obj) {
1299 | return obj == null ? function(){} : function(key) {
1300 | return obj[key];
1301 | };
1302 | };
1303 |
1304 | // Returns a predicate for checking whether an object has a given set of
1305 | // `key:value` pairs.
1306 | _.matcher = _.matches = function(attrs) {
1307 | attrs = _.extendOwn({}, attrs);
1308 | return function(obj) {
1309 | return _.isMatch(obj, attrs);
1310 | };
1311 | };
1312 |
1313 | // Run a function **n** times.
1314 | _.times = function(n, iteratee, context) {
1315 | var accum = Array(Math.max(0, n));
1316 | iteratee = optimizeCb(iteratee, context, 1);
1317 | for (var i = 0; i < n; i++) accum[i] = iteratee(i);
1318 | return accum;
1319 | };
1320 |
1321 | // Return a random integer between min and max (inclusive).
1322 | _.random = function(min, max) {
1323 | if (max == null) {
1324 | max = min;
1325 | min = 0;
1326 | }
1327 | return min + Math.floor(Math.random() * (max - min + 1));
1328 | };
1329 |
1330 | // A (possibly faster) way to get the current timestamp as an integer.
1331 | _.now = Date.now || function() {
1332 | return new Date().getTime();
1333 | };
1334 |
1335 | // List of HTML entities for escaping.
1336 | var escapeMap = {
1337 | '&': '&',
1338 | '<': '<',
1339 | '>': '>',
1340 | '"': '"',
1341 | "'": ''',
1342 | '`': '`'
1343 | };
1344 | var unescapeMap = _.invert(escapeMap);
1345 |
1346 | // Functions for escaping and unescaping strings to/from HTML interpolation.
1347 | var createEscaper = function(map) {
1348 | var escaper = function(match) {
1349 | return map[match];
1350 | };
1351 | // Regexes for identifying a key that needs to be escaped
1352 | var source = '(?:' + _.keys(map).join('|') + ')';
1353 | var testRegexp = RegExp(source);
1354 | var replaceRegexp = RegExp(source, 'g');
1355 | return function(string) {
1356 | string = string == null ? '' : '' + string;
1357 | return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
1358 | };
1359 | };
1360 | _.escape = createEscaper(escapeMap);
1361 | _.unescape = createEscaper(unescapeMap);
1362 |
1363 | // If the value of the named `property` is a function then invoke it with the
1364 | // `object` as context; otherwise, return it.
1365 | _.result = function(object, property, fallback) {
1366 | var value = object == null ? void 0 : object[property];
1367 | if (value === void 0) {
1368 | value = fallback;
1369 | }
1370 | return _.isFunction(value) ? value.call(object) : value;
1371 | };
1372 |
1373 | // Generate a unique integer id (unique within the entire client session).
1374 | // Useful for temporary DOM ids.
1375 | var idCounter = 0;
1376 | _.uniqueId = function(prefix) {
1377 | var id = ++idCounter + '';
1378 | return prefix ? prefix + id : id;
1379 | };
1380 |
1381 | // By default, Underscore uses ERB-style template delimiters, change the
1382 | // following template settings to use alternative delimiters.
1383 | _.templateSettings = {
1384 | evaluate : /<%([\s\S]+?)%>/g,
1385 | interpolate : /<%=([\s\S]+?)%>/g,
1386 | escape : /<%-([\s\S]+?)%>/g
1387 | };
1388 |
1389 | // When customizing `templateSettings`, if you don't want to define an
1390 | // interpolation, evaluation or escaping regex, we need one that is
1391 | // guaranteed not to match.
1392 | var noMatch = /(.)^/;
1393 |
1394 | // Certain characters need to be escaped so that they can be put into a
1395 | // string literal.
1396 | var escapes = {
1397 | "'": "'",
1398 | '\\': '\\',
1399 | '\r': 'r',
1400 | '\n': 'n',
1401 | '\u2028': 'u2028',
1402 | '\u2029': 'u2029'
1403 | };
1404 |
1405 | var escaper = /\\|'|\r|\n|\u2028|\u2029/g;
1406 |
1407 | var escapeChar = function(match) {
1408 | return '\\' + escapes[match];
1409 | };
1410 |
1411 | // JavaScript micro-templating, similar to John Resig's implementation.
1412 | // Underscore templating handles arbitrary delimiters, preserves whitespace,
1413 | // and correctly escapes quotes within interpolated code.
1414 | // NB: `oldSettings` only exists for backwards compatibility.
1415 | _.template = function(text, settings, oldSettings) {
1416 | if (!settings && oldSettings) settings = oldSettings;
1417 | settings = _.defaults({}, settings, _.templateSettings);
1418 |
1419 | // Combine delimiters into one regular expression via alternation.
1420 | var matcher = RegExp([
1421 | (settings.escape || noMatch).source,
1422 | (settings.interpolate || noMatch).source,
1423 | (settings.evaluate || noMatch).source
1424 | ].join('|') + '|$', 'g');
1425 |
1426 | // Compile the template source, escaping string literals appropriately.
1427 | var index = 0;
1428 | var source = "__p+='";
1429 | text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
1430 | source += text.slice(index, offset).replace(escaper, escapeChar);
1431 | index = offset + match.length;
1432 |
1433 | if (escape) {
1434 | source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
1435 | } else if (interpolate) {
1436 | source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
1437 | } else if (evaluate) {
1438 | source += "';\n" + evaluate + "\n__p+='";
1439 | }
1440 |
1441 | // Adobe VMs need the match returned to produce the correct offest.
1442 | return match;
1443 | });
1444 | source += "';\n";
1445 |
1446 | // If a variable is not specified, place data values in local scope.
1447 | if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
1448 |
1449 | source = "var __t,__p='',__j=Array.prototype.join," +
1450 | "print=function(){__p+=__j.call(arguments,'');};\n" +
1451 | source + 'return __p;\n';
1452 |
1453 | try {
1454 | var render = new Function(settings.variable || 'obj', '_', source);
1455 | } catch (e) {
1456 | e.source = source;
1457 | throw e;
1458 | }
1459 |
1460 | var template = function(data) {
1461 | return render.call(this, data, _);
1462 | };
1463 |
1464 | // Provide the compiled source as a convenience for precompilation.
1465 | var argument = settings.variable || 'obj';
1466 | template.source = 'function(' + argument + '){\n' + source + '}';
1467 |
1468 | return template;
1469 | };
1470 |
1471 | // Add a "chain" function. Start chaining a wrapped Underscore object.
1472 | _.chain = function(obj) {
1473 | var instance = _(obj);
1474 | instance._chain = true;
1475 | return instance;
1476 | };
1477 |
1478 | // OOP
1479 | // ---------------
1480 | // If Underscore is called as a function, it returns a wrapped object that
1481 | // can be used OO-style. This wrapper holds altered versions of all the
1482 | // underscore functions. Wrapped objects may be chained.
1483 |
1484 | // Helper function to continue chaining intermediate results.
1485 | var result = function(instance, obj) {
1486 | return instance._chain ? _(obj).chain() : obj;
1487 | };
1488 |
1489 | // Add your own custom functions to the Underscore object.
1490 | _.mixin = function(obj) {
1491 | _.each(_.functions(obj), function(name) {
1492 | var func = _[name] = obj[name];
1493 | _.prototype[name] = function() {
1494 | var args = [this._wrapped];
1495 | push.apply(args, arguments);
1496 | return result(this, func.apply(_, args));
1497 | };
1498 | });
1499 | };
1500 |
1501 | // Add all of the Underscore functions to the wrapper object.
1502 | _.mixin(_);
1503 |
1504 | // Add all mutator Array functions to the wrapper.
1505 | _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
1506 | var method = ArrayProto[name];
1507 | _.prototype[name] = function() {
1508 | var obj = this._wrapped;
1509 | method.apply(obj, arguments);
1510 | if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];
1511 | return result(this, obj);
1512 | };
1513 | });
1514 |
1515 | // Add all accessor Array functions to the wrapper.
1516 | _.each(['concat', 'join', 'slice'], function(name) {
1517 | var method = ArrayProto[name];
1518 | _.prototype[name] = function() {
1519 | return result(this, method.apply(this._wrapped, arguments));
1520 | };
1521 | });
1522 |
1523 | // Extracts the result from a wrapped and chained object.
1524 | _.prototype.value = function() {
1525 | return this._wrapped;
1526 | };
1527 |
1528 | // Provide unwrapping proxy for some methods used in engine operations
1529 | // such as arithmetic and JSON stringification.
1530 | _.prototype.valueOf = _.prototype.toJSON = _.prototype.value;
1531 |
1532 | _.prototype.toString = function() {
1533 | return '' + this._wrapped;
1534 | };
1535 |
1536 | // AMD registration happens at the end for compatibility with AMD loaders
1537 | // that may not enforce next-turn semantics on modules. Even though general
1538 | // practice for AMD registration is to be anonymous, underscore registers
1539 | // as a named module because, like jQuery, it is a base library that is
1540 | // popular enough to be bundled in a third party lib, but not be part of
1541 | // an AMD load request. Those cases could generate an error when an
1542 | // anonymous define() is called outside of a loader request.
1543 | if (typeof define === 'function' && define.amd) {
1544 | define('underscore', [], function() {
1545 | return _;
1546 | });
1547 | }
1548 | }.call(this));
--------------------------------------------------------------------------------