Lines Matching refs:m
31 /******/ __webpack_require__.m = modules;
1871 var e, m
1887 m = e & ((1 << (-nBits)) - 1)
1890 for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {}
1895 return m ? NaN : ((s ? -1 : 1) * Infinity)
1897 m = m + Math.pow(2, mLen)
1900 return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
1904 var e, m, c
1916 m = isNaN(value) ? 1 : 0
1935 m = 0
1938 m = (value * c - 1) * Math.pow(2, mLen)
1941 m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
1946 for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
1948 e = (e << mLen) | m
15624 var aligns = v[2], m = aligns.length;
15625 for (var i = 0; i < m; ++i) {
15626 var minj = (i===0 || i===m-1 ? 1 : 0), maxj = (i===0 ? m-1 : m);
17518 var m;
17545 var m;
17547 m = this._maxListeners;
17549 m = EventEmitter.defaultMaxListeners;
17552 if (m && m > 0 && this._events[type].length > m) {
21583 var p, n, m, more, str;
21626 m = s.head[--p];
21627 s.head[p] = (m >= _w_size ? m - _w_size : 0);
21633 m = s.prev[--p];
21634 s.prev[p] = (m >= _w_size ? m - _w_size : 0);
23401 var n, m; /* iterate over the tree elements */
23465 m = s.heap[--h];
23466 if (m > max_code) { continue; }
23467 if (tree[m*2 + 1]/*.Len*/ !== bits) {
23469 s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/;
23470 tree[m*2 + 1]/*.Len*/ = bits;
23684 function smaller(tree, n, m, depth) {
23686 var _m2 = m*2;
23688 (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
23798 var n, m; /* iterate over heap elements */
23854 m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */
23857 s.heap[--s.heap_max] = m;
23860 tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
23861 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
23862 tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;
28173 …var bounds, dx, dy, encode, fn, form, grad, group, gstate, i, last, m, m0, m1, m11, m12, m2, m21, …
28213 m = this.doc._ctm.slice();
28214 m0 = m[0], m1 = m[1], m2 = m[2], m3 = m[3], m4 = m[4], m5 = m[5];
28216 m[0] = m0 * m11 + m2 * m12;
28217 m[1] = m1 * m11 + m3 * m12;
28218 m[2] = m0 * m21 + m2 * m22;
28219 m[3] = m1 * m21 + m3 * m22;
28220 m[4] = m0 * dx + m2 * dy + m4;
28221 m[5] = m1 * dx + m3 * dy + m5;
28231 for (_j = 0, _len = m.length; _j < _len; _j++) {
28232 v = m[_j];
28431 miterLimit: function(m) {
28432 return this.addContent("" + m + " M");
28561 var m, m0, m1, m2, m3, m4, m5, v, values;
28562 m = this._ctm;
28563 m0 = m[0], m1 = m[1], m2 = m[2], m3 = m[3], m4 = m[4], m5 = m[5];
28564 m[0] = m0 * m11 + m2 * m12;
28565 m[1] = m1 * m11 + m3 * m12;
28566 m[2] = m0 * m21 + m2 * m22;
28567 m[3] = m1 * m21 + m3 * m22;
28568 m[4] = m0 * dx + m2 * dy + m4;
28569 m[5] = m1 * dx + m3 * dy + m5;
28657 m: 2,
28769 m: function(doc, a) {
30588 var i, last, lsbCount, m, _i, _j, _ref, _results;
30611 m = _ref1[_j];
30612 _results.push(m.advance);