/** * Swiper 3.4.2 * Most modern mobile touch slider and framework with hardware accelerated transitions * * http://www.idangero.us/swiper/ * * Copyright 2017, Vladimir Kharlampidi * The iDangero.us * http://www.idangero.us/ * * Licensed under MIT * * Released on: March 10, 2017 */ .swiper-container{margin-left:auto;margin-right:auto;position:relative;overflow:hidden;z-index:1}.swiper-container-no-flexbox .swiper-slide{float:left}.swiper-container-vertical>.swiper-wrapper{-webkit-box-orient:vertical;-moz-box-orient:vertical;-ms-flex-direction:column;-webkit-flex-direction:column;flex-direction:column}.swiper-wrapper{position:relative;width:100%;height:100%;z-index:1;display:-webkit-box;display:-moz-box;display:-ms-flexbox;display:-webkit-flex;display:flex;-webkit-transition-property:-webkit-transform;-moz-transition-property:-moz-transform;-o-transition-property:-o-transform;-ms-transition-property:-ms-transform;transition-property:transform;-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box}.swiper-container-android .swiper-slide,.swiper-wrapper{-webkit-transform:translate3d(0,0,0);-moz-transform:translate3d(0,0,0);-o-transform:translate(0,0);-ms-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}.swiper-container-multirow>.swiper-wrapper{-webkit-box-lines:multiple;-moz-box-lines:multiple;-ms-flex-wrap:wrap;-webkit-flex-wrap:wrap;flex-wrap:wrap}.swiper-container-free-mode>.swiper-wrapper{-webkit-transition-timing-function:ease-out;-moz-transition-timing-function:ease-out;-ms-transition-timing-function:ease-out;-o-transition-timing-function:ease-out;transition-timing-function:ease-out;margin:0 auto}.swiper-slide{-webkit-flex-shrink:0;-ms-flex:0 0 auto;flex-shrink:0;width:100%;height:100%;position:relative}.swiper-container-autoheight,.swiper-container-autoheight .swiper-slide{height:auto}.swiper-container-autoheight .swiper-wrapper{-webkit-box-align:start;-ms-flex-align:start;-webkit-align-items:flex-start;align-items:flex-start;-webkit-transition-property:-webkit-transform,height;-moz-transition-property:-moz-transform;-o-transition-property:-o-transform;-ms-transition-property:-ms-transform;transition-property:transform,height}.swiper-container .swiper-notification{position:absolute;left:0;top:0;pointer-events:none;opacity:0;z-index:-1000}.swiper-wp8-horizontal{-ms-touch-action:pan-y;touch-action:pan-y}.swiper-wp8-vertical{-ms-touch-action:pan-x;touch-action:pan-x}.swiper-button-next,.swiper-button-prev{position:absolute;top:50%;width:27px;height:44px;margin-top:-22px;z-index:10;cursor:pointer;-moz-background-size:27px 44px;-webkit-background-size:27px 44px;background-size:27px 44px;background-position:center;background-repeat:no-repeat}.swiper-button-next.swiper-button-disabled,.swiper-button-prev.swiper-button-disabled{opacity:.35;cursor:auto;pointer-events:none}.swiper-button-prev,.swiper-container-rtl .swiper-button-next{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg%20xmlns%3D'http%3A%2F%2Fwww.w3.org%2F2000%2Fsvg'%20viewBox%3D'0%200%2027%2044'%3E%3Cpath%20d%3D'M0%2C22L22%2C0l2.1%2C2.1L4.2%2C22l19.9%2C19.9L22%2C44L0%2C22L0%2C22L0%2C22z'%20fill%3D'%23007aff'%2F%3E%3C%2Fsvg%3E");left:10px;right:auto}.swiper-button-prev.swiper-button-black,.swiper-container-rtl .swiper-button-next.swiper-button-black{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg%20xmlns%3D'http%3A%2F%2Fwww.w3.org%2F2000%2Fsvg'%20viewBox%3D'0%200%2027%2044'%3E%3Cpath%20d%3D'M0%2C22L22%2C0l2.1%2C2.1L4.2%2C22l19.9%2C19.9L22%2C44L0%2C22L0%2C22L0%2C22z'%20fill%3D'%23000000'%2F%3E%3C%2Fsvg%3E")}.swiper-button-prev.swiper-button-white,.swiper-container-rtl .swiper-button-next.swiper-button-white{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg%20xmlns%3D'http%3A%2F%2Fwww.w3.org%2F2000%2Fsvg'%20viewBox%3D'0%200%2027%2044'%3E%3Cpath%20d%3D'M0%2C22L22%2C0l2.1%2C2.1L4.2%2C22l19.9%2C19.9L22%2C44L0%2C22L0%2C22L0%2C22z'%20fill%3D'%23ffffff'%2F%3E%3C%2Fsvg%3E")}.swiper-button-next,.swiper-container-rtl .swiper-button-prev{background-image:url("data:image/svg+xml;charse"use strict"; var toPosInt = require("../number/to-pos-integer"); var test = function (arg1, arg2) { return arg2; }; var desc, defineProperty, generate, mixin; try { Object.defineProperty(test, "length", { configurable: true, writable: false, enumerable: false, value: 1 }); } catch (ignore) {} if (test.length === 1) { // ES6 desc = { configurable: true, writable: false, enumerable: false }; defineProperty = Object.defineProperty; module.exports = function (fn, length) { length = toPosInt(length); if (fn.length === length) return fn; desc.value = length; return defineProperty(fn, "length", desc); }; } else { mixin = require("../object/mixin"); generate = (function () { var cache = []; return function (length) { var args, i = 0; if (cache[length]) return cache[length]; args = []; while (length--) args.push("a" + (++i).toString(36)); // eslint-disable-next-line no-new-func return new Function( "fn", "return function (" + args.join(", ") + ") { return fn.apply(this, arguments); };" ); }; }()); module.exports = function (src, length) { var target; length = toPosInt(length); if (src.length === length) return src; target = generate(length)(src); try { mixin(target, src); } catch (ignore) {} return target; }; } "use strict"; var compact = require("../array/#/compact") , isObject = require("../object/is-object") , toArray = require("../object/to-array") , isArray = Array.isArray , stringify = JSON.stringify; module.exports = function self(value /*, replacer, space*/) { var replacer = arguments[1], space = arguments[2]; try { return stringify(value, replacer, space); } catch (e) { if (!isObject(value)) return null; if (typeof value.toJSON === "function") return null; if (isArray(value)) { return ( "[" + compact.call( value.map(function (item) { return self(item, replacer, space); }) ) + "]" ); } return ( "{" + compact .call( toArray(value, function (item, key) { item = self(item, replacer, space); if (!item) return null; return stringify(key) + ":" + item; }) ) .join(",") + "}" ); } }; /* eslint no-bitwise: "off" */ // Credit: https://github.com/paulmillr/es6-shim/ "use strict"; var abs = Math.abs , floor = Math.floor , log = Math.log , min = Math.min , pow = Math.pow , LN2 = Math.LN2 , roundToEven; roundToEven = function (num) { var whole = floor(num), fraction = num - whole; if (fraction < 0.5) return whole; if (fraction > 0.5) return whole + 1; return whole % 2 ? whole + 1 : whole; }; // eslint-disable-next-line max-statements module.exports = function (value, ebits, fbits) { var bias = (1 << (ebits - 1)) - 1, sign, e, fraction, i, bits, str, bytes; // Compute sign, exponent, fraction if (isNaN(value)) { // NaN // http://dev.w3.org/2006/webapi/WebIDL/#es-type-mapping e = (1 << ebits) - 1; fraction = pow(2, fbits - 1); sign = 0; } else if (value === Infinity || value === -Infinity) { e = (1 << ebits) - 1; fraction = 0; sign = value < 0 ? 1 : 0; } else if (value === 0) { e = 0; fraction = 0; sign = 1 / value === -Infinity ? 1 : 0; } else { sign = value < 0; value = abs(value); if (value >= pow(2, 1 - bias)) { e = min(floor(log(value) / LN2), 1023); fraction = roundToEven(value / pow(2, e) * pow(2, fbits)); if (fraction / pow(2, fbits) >= 2) { e += 1; fraction = 1; } if (e > bias) { // Overflow e = (1 << ebits) - 1; fraction = 0; } else { // Normal e += bias; fraction -= pow(2, fbits); } } else { // Subnormal e = 0; fraction = roundToEven(value / pow(2, 1 - bias - fbits)); } } // Pack sign, exponent, fraction bits = []; for (i = fbits; i; i -= 1) { bits.push(fraction % 2 ? 1 : 0); fraction = floor(fraction / 2); } for (i = ebits; i; i -= 1) { bits.push(e % 2 ? 1 : 0); e = floor(e / 2); } bits.push(sign ? 1 : 0); bits.reverse(); str = bits.join(""); // Bits to bytes bytes = []; while (str.length) { bytes.push(parseInt(str.substring(0, 8), 2)); str = str.substring(8); } return bytes; }; /* eslint no-bitwise: "off" */ // Credit: https://github.com/paulmillr/es6-shim/ "use strict"; var pow = Math.pow; module.exports = function (bytes, ebits, fbits) { // Bytes to bits var bits = [], i, j, bit, str, bias, sign, e, fraction; for (i = bytes.length; i; i -= 1) { bit = bytes[i - 1]; for (j = 8; j; j -= 1) { bits.push(bit % 2 ? 1 : 0); bit >>= 1; } } bits.reverse(); str = bits.join(""); // Unpack sign, exponent, fraction bias = (1 << (ebits - 1)) - 1; sign = parseInt(str.substring(0, 1), 2) ? -1 : 1; e = parseInt(str.substring(1, 1 + ebits), 2); fraction = parseInt(str.substring(1 + ebits), 2); // Produce number if (e === (1 << ebits) - 1) return fraction === 0 ? sign * Infinity : NaN; if (e > 0) return sign * pow(2, e - bias) * (1 + fraction / pow(2, fbits)); if (fraction !== 0) return sign * pow(2, -(bias - 1)) * (fraction / pow(2, fbits)); return sign < 0 ? -0 : 0; };