/* Minification failed. Returning unminified contents. (6666,15-16): run-time error JS1300: Strict-mode does not allow assignment to undefined variables: j (6666,43-44): run-time error JS1294: Strict-mode does not allow ++ or -- on certain objects: j */ (function($){var escapeable=/["\\\x00-\x1f\x7f-\x9f]/g,meta={'\b':'\\b','\t':'\\t','\n':'\\n','\f':'\\f','\r':'\\r','"':'\\"','\\':'\\\\'};$.toJSON=typeof JSON==='object'&&JSON.stringify?JSON.stringify:function(o){if(o===null){return'null';} var type=typeof o;if(type==='undefined'){return undefined;} if(type==='number'||type==='boolean'){return''+o;} if(type==='string'){return $.quoteString(o);} if(type==='object'){if(typeof o.toJSON==='function'){return $.toJSON(o.toJSON());} if(o.constructor===Date){var month=o.getUTCMonth()+1,day=o.getUTCDate(),year=o.getUTCFullYear(),hours=o.getUTCHours(),minutes=o.getUTCMinutes(),seconds=o.getUTCSeconds(),milli=o.getUTCMilliseconds();if(month<10){month='0'+month;} if(day<10){day='0'+day;} if(hours<10){hours='0'+hours;} if(minutes<10){minutes='0'+minutes;} if(seconds<10){seconds='0'+seconds;} if(milli<100){milli='0'+milli;} if(milli<10){milli='0'+milli;} return'"'+year+'-'+month+'-'+day+'T'+ hours+':'+minutes+':'+seconds+'.'+milli+'Z"';} if(o.constructor===Array){var ret=[];for(var i=0;i t ? r.getTarget("next") : r.getTarget("prev"); r.flexAnimate(e, r.vars.pauseOnAction) }); r.vars.pausePlay && v.pausePlay.setup(); r.vars.slideshow && r.vars.pauseInvisible && v.pauseInvisible.init(); r.vars.slideshow && (r.vars.pauseOnHover && r.hover(function () { r.manualPlay || r.manualPause || r.pause() }, function () { r.manualPause || r.manualPlay || r.stopped || r.play() }), r.vars.pauseInvisible && v.pauseInvisible.isHidden() || (0 < r.vars.initDelay ? r.startTimeout = setTimeout(r.play, r.vars.initDelay) : r.play())); p && v.asNav.setup(); o && r.vars.touch && v.touch(); (!h || h && r.vars.smoothHeight) && e(window).bind("resize orientationchange focus", v.resize); r.find("img").attr("draggable", "false"); setTimeout(function () { r.vars.start(r) }, 200) }, asNav: { setup: function () { r.asNav = !0; r.animatingTo = Math.floor(r.currentSlide / r.move); r.currentItem = r.currentSlide; r.slides.removeClass(i + "active-slide").eq(r.currentItem).addClass(i + "active-slide"); if (s) t._slider = r, r.slides.each(function () { this._gesture = new MSGesture; this._gesture.target = this; this.addEventListener("MSPointerDown", function (e) { e.preventDefault(); e.currentTarget._gesture && e.currentTarget._gesture.addPointer(e.pointerId) }, !1); this.addEventListener("MSGestureTap", function (t) { t.preventDefault(); t = e(this); var n = t.index(); e(r.vars.asNavFor).data("flexslider").animating || t.hasClass("active") || (r.direction = r.currentItem < n ? "next" : "prev", r.flexAnimate(n, r.vars.pauseOnAction, !1, !0, !0)) }) }); else r.slides.on("click touchend MSPointerUp", function (t) { t.preventDefault(); t = e(this); var n = t.index(); 0 >= t.offset().left - e(r).scrollLeft() && t.hasClass(i + "active-slide") ? r.flexAnimate(r.getTarget("prev"), !0) : e(r.vars.asNavFor).data("flexslider").animating || t.hasClass(i + "active-slide") || (r.direction = r.currentItem < n ? "next" : "prev", r.flexAnimate(n, r.vars.pauseOnAction, !1, !0, !0)) }) } }, controlNav: { setup: function () { r.manualControls ? v.controlNav.setupManual() : v.controlNav.setupPaging() }, setupPaging: function () { var t = 1, n, s; r.controlNavScaffold = e('
    '); if (1 < r.pagingCount) for (var o = 0; o < r.pagingCount; o++) s = r.slides.eq(o), n = "thumbnails" === r.vars.controlNav ? '' : "" + t + "", "thumbnails" === r.vars.controlNav && !0 === r.vars.thumbCaptions && (s = s.attr("data-thumbcaption"), "" != s && void 0 != s && (n += '' + s + "")), r.controlNavScaffold.append("
  1. " + n + "
    2. "), t++; r.controlsContainer ? e(r.controlsContainer).append(r.controlNavScaffold) : r.append(r.controlNavScaffold); v.controlNav.set(); v.controlNav.active(); r.controlNavScaffold.delegate("a, img", "click touchend MSPointerUp", function (t) { t.preventDefault(); if ("" === u || u === t.type) { var n = e(this), s = r.controlNav.index(n); n.hasClass(i + "active") || (r.direction = s > r.currentSlide ? "next" : "prev", r.flexAnimate(s, r.vars.pauseOnAction)) } "" === u && (u = t.type); v.setToClearWatchedEvent() }) }, setupManual: function () { r.controlNav = r.manualControls; v.controlNav.active(); r.controlNav.bind("click touchend MSPointerUp", function (t) { t.preventDefault(); if ("" === u || u === t.type) { var n = e(this), s = r.controlNav.index(n); n.hasClass(i + "active") || (s > r.currentSlide ? r.direction = "next" : r.direction = "prev", r.flexAnimate(s, r.vars.pauseOnAction)) } "" === u && (u = t.type); v.setToClearWatchedEvent() }) }, set: function () { r.controlNav = e("." + i + "control-nav li " + ("thumbnails" === r.vars.controlNav ? "img" : "a"), r.controlsContainer ? r.controlsContainer : r) }, active: function () { r.controlNav.removeClass(i + "active").eq(r.animatingTo).addClass(i + "active") }, update: function (t, n) { 1 < r.pagingCount && "add" === t ? r.controlNavScaffold.append(e("
  2. " + r.count + "
    3. ")) : 1 === r.pagingCount ? r.controlNavScaffold.find("li").remove() : r.controlNav.eq(n).closest("li").remove(); v.controlNav.set(); 1 < r.pagingCount && r.pagingCount !== r.controlNav.length ? r.update(n, t) : v.controlNav.active() } }, directionNav: { setup: function () { var t = e('"); r.controlsContainer ? (e(r.controlsContainer).append(t), r.directionNav = e("." + i + "direction-nav li a", r.controlsContainer)) : (r.append(t), r.directionNav = e("." + i + "direction-nav li a", r)); v.directionNav.update(); r.directionNav.bind("click touchend MSPointerUp", function (t) { t.preventDefault(); var n; if ("" === u || u === t.type) n = e(this).hasClass(i + "next") ? r.getTarget("next") : r.getTarget("prev"), r.flexAnimate(n, r.vars.pauseOnAction); "" === u && (u = t.type); v.setToClearWatchedEvent() }) }, update: function () { var e = i + "disabled"; 1 === r.pagingCount ? r.directionNav.addClass(e).attr("tabindex", "-1") : r.vars.animationLoop ? r.directionNav.removeClass(e).removeAttr("tabindex") : 0 === r.animatingTo ? r.directionNav.removeClass(e).filter("." + i + "prev").addClass(e).attr("tabindex", "-1") : r.animatingTo === r.last ? r.directionNav.removeClass(e).filter("." + i + "next").addClass(e).attr("tabindex", "-1") : r.directionNav.removeClass(e).removeAttr("tabindex") } }, pausePlay: { setup: function () { var t = e('
    '); r.controlsContainer ? (r.controlsContainer.append(t), r.pausePlay = e("." + i + "pauseplay a", r.controlsContainer)) : (r.append(t), r.pausePlay = e("." + i + "pauseplay a", r)); v.pausePlay.update(r.vars.slideshow ? i + "pause" : i + "play"); r.pausePlay.bind("click touchend MSPointerUp", function (t) { t.preventDefault(); if ("" === u || u === t.type) e(this).hasClass(i + "pause") ? (r.manualPause = !0, r.manualPlay = !1, r.pause()) : (r.manualPause = !1, r.manualPlay = !0, r.play()); "" === u && (u = t.type); v.setToClearWatchedEvent() }) }, update: function (e) { "play" === e ? r.pausePlay.removeClass(i + "pause").addClass(i + "play").html(r.vars.playText) : r.pausePlay.removeClass(i + "play").addClass(i + "pause").html(r.vars.pauseText) } }, touch: function () { var e, n, i, o, u, a, p = !1, d = 0, v = 0, m = 0; if (s) { t.style.msTouchAction = "none"; t._gesture = new MSGesture; t._gesture.target = t; t.addEventListener("MSPointerDown", y, !1); t._slider = r; t.addEventListener("MSGestureChange", b, !1); t.addEventListener("MSGestureEnd", w, !1); var y = function (e) { e.stopPropagation(); r.animating ? e.preventDefault() : (r.pause(), t._gesture.addPointer(e.pointerId), m = 0, o = f ? r.h : r.w, a = Number(new Date), i = c && l && r.animatingTo === r.last ? 0 : c && l ? r.limit - (r.itemW + r.vars.itemMargin) * r.move * r.animatingTo : c && r.currentSlide === r.last ? r.limit : c ? (r.itemW + r.vars.itemMargin) * r.move * r.currentSlide : l ? (r.last - r.currentSlide + r.cloneOffset) * o : (r.currentSlide + r.cloneOffset) * o) }, b = function (e) { e.stopPropagation(); var n = e.target._slider; if (n) { var r = -e.translationX, s = -e.translationY; u = m += f ? s : r; p = f ? Math.abs(m) < Math.abs(-r) : Math.abs(m) < Math.abs(-s); if (e.detail === e.MSGESTURE_FLAG_INERTIA) setImmediate(function () { t._gesture.stop() }); else if (!p || 500 < Number(new Date) - a) e.preventDefault(), !h && n.transitions && (n.vars.animationLoop || (u = m / (0 === n.currentSlide && 0 > m || n.currentSlide === n.last && 0 < m ? Math.abs(m) / o + 2 : 1)), n.setProps(i + u, "setTouch")) } }, w = function (t) { t.stopPropagation(); if (t = t.target._slider) { if (t.animatingTo === t.currentSlide && !p && null !== u) { var r = l ? -u : u, s = 0 < r ? t.getTarget("next") : t.getTarget("prev"); t.canAdvance(s) && (550 > Number(new Date) - a && 50 < Math.abs(r) || Math.abs(r) > o / 2) ? t.flexAnimate(s, t.vars.pauseOnAction) : h || t.flexAnimate(t.currentSlide, t.vars.pauseOnAction, !0) } i = u = n = e = null; m = 0 } } } else { t.addEventListener("touchstart", E, !1); var E = function (s) { if (r.animating) s.preventDefault(); else if (window.navigator.msPointerEnabled || 1 === s.touches.length) r.pause(), o = f ? r.h : r.w, a = Number(new Date), d = s.touches[0].pageX, v = s.touches[0].pageY, i = c && l && r.animatingTo === r.last ? 0 : c && l ? r.limit - (r.itemW + r.vars.itemMargin) * r.move * r.animatingTo : c && r.currentSlide === r.last ? r.limit : c ? (r.itemW + r.vars.itemMargin) * r.move * r.currentSlide : l ? (r.last - r.currentSlide + r.cloneOffset) * o : (r.currentSlide + r.cloneOffset) * o, e = f ? v : d, n = f ? d : v, t.addEventListener("touchmove", S, !1), t.addEventListener("touchend", x, !1) }, S = function (t) { d = t.touches[0].pageX; v = t.touches[0].pageY; u = f ? e - v : e - d; p = f ? Math.abs(u) < Math.abs(d - n) : Math.abs(u) < Math.abs(v - n); if (!p || 500 < Number(new Date) - a) t.preventDefault(), !h && r.transitions && (r.vars.animationLoop || (u /= 0 === r.currentSlide && 0 > u || r.currentSlide === r.last && 0 < u ? Math.abs(u) / o + 2 : 1), r.setProps(i + u, "setTouch")) }, x = function (s) { t.removeEventListener("touchmove", S, !1); if (r.animatingTo === r.currentSlide && !p && null !== u) { s = l ? -u : u; var f = 0 < s ? r.getTarget("next") : r.getTarget("prev"); r.canAdvance(f) && (550 > Number(new Date) - a && 50 < Math.abs(s) || Math.abs(s) > o / 2) ? r.flexAnimate(f, r.vars.pauseOnAction) : h || r.flexAnimate(r.currentSlide, r.vars.pauseOnAction, !0) } t.removeEventListener("touchend", x, !1); i = u = n = e = null } } }, resize: function () { !r.animating && r.is(":visible") && (c || r.doMath(), h ? v.smoothHeight() : c ? (r.slides.width(r.computedW), r.update(r.pagingCount), r.setProps()) : f ? (r.viewport.height(r.h), r.setProps(r.h, "setTotal")) : (r.vars.smoothHeight && v.smoothHeight(), r.newSlides.width(r.computedW), r.setProps(r.computedW, "setTotal"))) }, smoothHeight: function (e) { if (!f || h) { var t = h ? r : r.viewport; e ? t.animate({ height: r.slides.eq(r.animatingTo).height() }, e) : t.height(r.slides.eq(r.animatingTo).height()) } }, sync: function (t) { var n = e(r.vars.sync).data("flexslider"), i = r.animatingTo; switch (t) { case "animate": n.flexAnimate(i, r.vars.pauseOnAction, !1, !0); break; case "play": n.playing || n.asNav || n.play(); break; case "pause": n.pause() } }, uniqueID: function (t) { t.find("[id]").each(function () { var t = e(this); t.attr("id", t.attr("id") + "_clone") }); return t }, pauseInvisible: { visProp: null, init: function () { var e = ["webkit", "moz", "ms", "o"]; if ("hidden" in document) return "hidden"; for (var t = 0; t < e.length; t++) e[t] + "Hidden" in document && (v.pauseInvisible.visProp = e[t] + "Hidden"); v.pauseInvisible.visProp && (e = v.pauseInvisible.visProp.replace(/[H|h]idden/, "") + "visibilitychange", document.addEventListener(e, function () { v.pauseInvisible.isHidden() ? r.startTimeout ? clearTimeout(r.startTimeout) : r.pause() : r.started ? r.play() : 0 < r.vars.initDelay ? setTimeout(r.play, r.vars.initDelay) : r.play() })) }, isHidden: function () { return document[v.pauseInvisible.visProp] || !1 } }, setToClearWatchedEvent: function () { clearTimeout(a); a = setTimeout(function () { u = "" }, 3e3) } }; r.flexAnimate = function (t, n, s, u, a) { r.vars.animationLoop || t === r.currentSlide || (r.direction = t > r.currentSlide ? "next" : "prev"); p && 1 === r.pagingCount && (r.direction = r.currentItem < t ? "next" : "prev"); if (!r.animating && (r.canAdvance(t, a) || s) && r.is(":visible")) { if (p && u) if (s = e(r.vars.asNavFor).data("flexslider"), r.atEnd = 0 === t || t === r.count - 1, s.flexAnimate(t, !0, !1, !0, a), r.direction = r.currentItem < t ? "next" : "prev", s.direction = r.direction, Math.ceil((t + 1) / r.visible) - 1 !== r.currentSlide && 0 !== t) r.currentItem = t, r.slides.removeClass(i + "active-slide").eq(t).addClass(i + "active-slide"), t = Math.floor(t / r.visible); else return r.currentItem = t, r.slides.removeClass(i + "active-slide").eq(t).addClass(i + "active-slide"), !1; r.animating = !0; r.animatingTo = t; n && r.pause(); r.vars.before(r); r.syncExists && !a && v.sync("animate"); r.vars.controlNav && v.controlNav.active(); c || r.slides.removeClass(i + "active-slide").eq(t).addClass(i + "active-slide"); r.atEnd = 0 === t || t === r.last; r.vars.directionNav && v.directionNav.update(); t === r.last && (r.vars.end(r), r.vars.animationLoop || r.pause()); if (h) o ? (r.slides.eq(r.currentSlide).css({ opacity: 0, zIndex: 1 }), r.slides.eq(t).css({ opacity: 1, zIndex: 2 }), r.wrapup(m)) : (r.slides.eq(r.currentSlide).css({ zIndex: 1 }).animate({ opacity: 0 }, r.vars.animationSpeed, r.vars.easing), r.slides.eq(t).css({ zIndex: 2 }).animate({ opacity: 1 }, r.vars.animationSpeed, r.vars.easing, r.wrapup)); else { var m = f ? r.slides.filter(":first").height() : r.computedW; c ? (t = r.vars.itemMargin, t = (r.itemW + t) * r.move * r.animatingTo, t = t > r.limit && 1 !== r.visible ? r.limit : t) : t = 0 === r.currentSlide && t === r.count - 1 && r.vars.animationLoop && "next" !== r.direction ? l ? (r.count + r.cloneOffset) * m : 0 : r.currentSlide === r.last && 0 === t && r.vars.animationLoop && "prev" !== r.direction ? l ? 0 : (r.count + 1) * m : l ? (r.count - 1 - t + r.cloneOffset) * m : (t + r.cloneOffset) * m; r.setProps(t, "", r.vars.animationSpeed); r.transitions ? (r.vars.animationLoop && r.atEnd || (r.animating = !1, r.currentSlide = r.animatingTo), t = function () { var e = !1; return function () { e || r.wrapup(m); e = !0 } } (), r.container.unbind("webkitTransitionEnd transitionend"), r.container.bind("webkitTransitionEnd transitionend", t), setTimeout(t, r.vars.animationSpeed + 200)) : r.container.animate(r.args, r.vars.animationSpeed, r.vars.easing, function () { r.wrapup(m) }) } r.vars.smoothHeight && v.smoothHeight(r.vars.animationSpeed) } }; r.wrapup = function (e) { h || c || (0 === r.currentSlide && r.animatingTo === r.last && r.vars.animationLoop ? r.setProps(e, "jumpEnd") : r.currentSlide === r.last && 0 === r.animatingTo && r.vars.animationLoop && r.setProps(e, "jumpStart")); r.animating = !1; r.currentSlide = r.animatingTo; r.vars.after(r) }; r.animateSlides = function () { r.animating || r.flexAnimate(r.getTarget("next")) }; r.pause = function () { clearInterval(r.animatedSlides); r.animatedSlides = null; r.playing = !1; r.vars.pausePlay && v.pausePlay.update("play"); r.syncExists && v.sync("pause") }; r.play = function () { r.playing && clearInterval(r.animatedSlides); r.animatedSlides = r.animatedSlides || setInterval(r.animateSlides, r.vars.slideshowSpeed); r.started = r.playing = !0; r.vars.pausePlay && v.pausePlay.update("pause"); r.syncExists && v.sync("play") }; r.stop = function () { r.pause(); r.stopped = !0 }; r.canAdvance = function (e, t) { var n = p ? r.pagingCount - 1 : r.last; return t ? !0 : p && r.currentItem === r.count - 1 && 0 === e && "prev" === r.direction ? !0 : p && 0 === r.currentItem && e === r.pagingCount - 1 && "next" !== r.direction ? !1 : e !== r.currentSlide || p ? r.vars.animationLoop ? !0 : r.atEnd && 0 === r.currentSlide && e === n && "next" !== r.direction ? !1 : r.atEnd && r.currentSlide === n && 0 === e && "next" === r.direction ? !1 : !0 : !1 }; r.getTarget = function (e) { r.direction = e; return "next" === e ? r.currentSlide === r.last ? 0 : r.currentSlide + 1 : 0 === r.currentSlide ? r.last : r.currentSlide - 1 }; r.setProps = function (e, t, n) { var i = function () { var n = e ? e : (r.itemW + r.vars.itemMargin) * r.move * r.animatingTo; return -1 * function () { if (c) return "setTouch" === t ? e : l && r.animatingTo === r.last ? 0 : l ? r.limit - (r.itemW + r.vars.itemMargin) * r.move * r.animatingTo : r.animatingTo === r.last ? r.limit : n; switch (t) { case "setTotal": return l ? (r.count - 1 - r.currentSlide + r.cloneOffset) * e : (r.currentSlide + r.cloneOffset) * e; case "setTouch": return e; case "jumpEnd": return l ? e : r.count * e; case "jumpStart": return l ? r.count * e : e; default: return e } } () + "px" } (); r.transitions && (i = f ? "translate3d(0," + i + ",0)" : "translate3d(" + i + ",0,0)", n = void 0 !== n ? n / 1e3 + "s" : "0s", r.container.css("-" + r.pfx + "-transition-duration", n), r.container.css("transition-duration", n)); r.args[r.prop] = i; (r.transitions || void 0 === n) && r.container.css(r.args); r.container.css("transform", i) }; r.setup = function (t) { if (h) r.slides.css({ width: "100%", "float": "left", marginRight: "-100%", position: "relative" }), "init" === t && (o ? r.slides.css({ opacity: 0, display: "block", webkitTransition: "opacity " + r.vars.animationSpeed / 1e3 + "s ease", zIndex: 1 }).eq(r.currentSlide).css({ opacity: 1, zIndex: 2 }) : r.slides.css({ opacity: 0, display: "block", zIndex: 1 }).eq(r.currentSlide).css({ zIndex: 2 }).animate({ opacity: 1 }, r.vars.animationSpeed, r.vars.easing)), r.vars.smoothHeight && v.smoothHeight(); else { var n, s; "init" === t && (r.viewport = e('
    ').css({ overflow: "hidden", position: "relative" }).appendTo(r).append(r.container), r.cloneCount = 0, r.cloneOffset = 0, l && (s = e.makeArray(r.slides).reverse(), r.slides = e(s), r.container.empty().append(r.slides))); r.vars.animationLoop && !c && (r.cloneCount = 2, r.cloneOffset = 1, "init" !== t && r.container.find(".clone").remove(), v.uniqueID(r.slides.first().clone().addClass("clone").attr("aria-hidden", "true")).appendTo(r.container), v.uniqueID(r.slides.last().clone().addClass("clone").attr("aria-hidden", "true")).prependTo(r.container)); r.newSlides = e(r.vars.selector, r); n = l ? r.count - 1 - r.currentSlide + r.cloneOffset : r.currentSlide + r.cloneOffset; f && !c ? (r.container.height(200 * (r.count + r.cloneCount) + "%").css("position", "absolute").width("100%"), setTimeout(function () { r.newSlides.css({ display: "block" }); r.doMath(); r.viewport.height(r.h); r.setProps(n * r.h, "init") }, "init" === t ? 100 : 0)) : (r.container.width(200 * (r.count + r.cloneCount) + "%"), r.setProps(n * r.computedW, "init"), setTimeout(function () { r.doMath(); r.newSlides.css({ width: r.computedW, "float": "left", display: "block" }); r.vars.smoothHeight && v.smoothHeight() }, "init" === t ? 100 : 0)) } c || r.slides.removeClass(i + "active-slide").eq(r.currentSlide).addClass(i + "active-slide"); r.vars.init(r) }; r.doMath = function () { var e = r.slides.first(), t = r.vars.itemMargin, n = r.vars.minItems, i = r.vars.maxItems; r.w = void 0 === r.viewport ? r.width() : r.viewport.width(); r.h = e.height(); r.boxPadding = e.outerWidth() - e.width(); c ? (r.itemT = r.vars.itemWidth + t, r.minW = n ? n * r.itemT : r.w, r.maxW = i ? i * r.itemT - t : r.w, r.itemW = r.minW > r.w ? (r.w - t * (n - 1)) / n : r.maxW < r.w ? (r.w - t * (i - 1)) / i : r.vars.itemWidth > r.w ? r.w : r.vars.itemWidth, r.visible = Math.floor(r.w / r.itemW), r.move = 0 < r.vars.move && r.vars.move < r.visible ? r.vars.move : r.visible, r.pagingCount = Math.ceil((r.count - r.visible) / r.move + 1), r.last = r.pagingCount - 1, r.limit = 1 === r.pagingCount ? 0 : r.vars.itemWidth > r.w ? r.itemW * (r.count - 1) + t * (r.count - 1) : (r.itemW + t) * r.count - r.w - t) : (r.itemW = r.w, r.pagingCount = r.count, r.last = r.count - 1); r.computedW = r.itemW - r.boxPadding }; r.update = function (e, t) { r.doMath(); c || (e < r.currentSlide ? r.currentSlide += 1 : e <= r.currentSlide && 0 !== e && (r.currentSlide -= 1), r.animatingTo = r.currentSlide); if (r.vars.controlNav && !r.manualControls) if ("add" === t && !c || r.pagingCount > r.controlNav.length) v.controlNav.update("add"); else if ("remove" === t && !c || r.pagingCount < r.controlNav.length) c && r.currentSlide > r.last && (r.currentSlide -= 1, r.animatingTo -= 1), v.controlNav.update("remove", r.last); r.vars.directionNav && v.directionNav.update() }; r.addSlide = function (t, n) { var i = e(t); r.count += 1; r.last = r.count - 1; f && l ? void 0 !== n ? r.slides.eq(r.count - n).after(i) : r.container.prepend(i) : void 0 !== n ? r.slides.eq(n).before(i) : r.container.append(i); r.update(n, "add"); r.slides = e(r.vars.selector + ":not(.clone)", r); r.setup(); r.vars.added(r) }; r.removeSlide = function (t) { var n = isNaN(t) ? r.slides.index(e(t)) : t; r.count -= 1; r.last = r.count - 1; isNaN(t) ? e(t, r.slides).remove() : f && l ? r.slides.eq(r.last).remove() : r.slides.eq(t).remove(); r.doMath(); r.update(n, "remove"); r.slides = e(r.vars.selector + ":not(.clone)", r); r.setup(); r.vars.removed(r) }; v.init() }; e(window).blur(function (e) { focused = !1 }).focus(function (e) { focused = !0 }); e.flexslider.defaults = { namespace: "flex-", selector: ".slides > li", animation: "fade", easing: "swing", direction: "horizontal", reverse: !1, animationLoop: !0, smoothHeight: !1, startAt: 0, slideshow: !0, slideshowSpeed: 7e3, animationSpeed: 600, initDelay: 0, randomize: !1, thumbCaptions: !1, pauseOnAction: !0, pauseOnHover: !1, pauseInvisible: !0, useCSS: !0, touch: !0, video: !1, controlNav: !0, directionNav: !0, prevText: "Previous", nextText: "Next", keyboard: !0, multipleKeyboard: !1, mousewheel: !1, pausePlay: !1, pauseText: "Pause", playText: "Play", controlsContainer: "", manualControls: "", sync: "", asNavFor: "", itemWidth: 0, itemMargin: 0, minItems: 1, maxItems: 0, move: 0, allowOneSlide: !0, start: function () { }, before: function () { }, after: function () { }, end: function () { }, added: function () { }, removed: function () { }, init: function () { } }; e.fn.flexslider = function (t) { void 0 === t && (t = {}); if ("object" === typeof t) return this.each(function () { var n = e(this), r = n.find(t.selector ? t.selector : ".slides > li"); 1 === r.length && !0 === t.allowOneSlide || 0 === r.length ? (r.fadeIn(400), t.start && t.start(n)) : void 0 === n.data("flexslider") && new e.flexslider(this, t) }); var n = e(this).data("flexslider"); switch (t) { case "play": n.play(); break; case "pause": n.pause(); break; case "stop": n.stop(); break; case "next": n.flexAnimate(n.getTarget("next"), !0); break; case "prev": case "previous": n.flexAnimate(n.getTarget("prev"), !0); break; default: "number" === typeof t && n.flexAnimate(t, !0) } } })(jQuery); /* * Jquery LiveSearch plugin * * Original Created by nakajima - https://github.com/nakajima/jquery-livesearch * * Modified to support special character searches by Dean Vigoren - vigoren@ualberta.ca * */ (function(b){function f(a){try{if(val=this.val())return b(a).filter(function(a,d){return!!b(d).text().match(RegExp(val.replace(/[\-\[\]\/\{\}\(\)\*\+\?\.\\\^\$\|]/g,"\\$&"),"gi"))})}catch(c){alert(c)}return!1}b.extend(b.expr[":"],{containsi:function(a,c,e){return 0<=b(a).text().toLowerCase().indexOf((e[3]||"").toLowerCase())}});var c=function(a){this.callbacks={};a(this)};c.prototype.all=function(a){this.callbacks.all=a};c.prototype.reset=function(a){this.callbacks.reset=a};c.prototype.empty=function(a){this.callbacks.empty=a};c.prototype.results=function(a){this.callbacks.results=a};b.fn.search=function(a,g){function e(){if(result=f.call(b(this),a)){d.all&&d.all.call(this,result);var c=0 - see code for available vars comparator: function(tweet1, tweet2) { // [function] comparator used to sort tweets (see Array.sort) return tweet2["tweet_time"] - tweet1["tweet_time"]; }, filter: function(tweet) { // [function] whether or not to include a particular tweet (be sure to also set 'fetch') return true; } // You can attach callbacks to the following events using jQuery's standard .bind() mechanism: // "loaded" -- triggered when tweets have been fetched and rendered }, o); // See http://daringfireball.net/2010/07/improved_regex_for_matching_urls var url_regexp = /\b((?:https?:\/\/|www\d{0,3}[.]|[a-z0-9.\-]+[.][a-z]{2,4}\/)(?:[^\s()<>]+|\(([^\s()<>]+|(\([^\s()<>]+\)))*\))+(?:\(([^\s()<>]+|(\([^\s()<>]+\)))*\)|[^\s`!()\[\]{};:'".,<>?«»“”‘’]))/gi; // Expand values inside simple string templates with {placeholders} function t(template, info) { if (typeof template === "string") { var result = template; for(var key in info) { var val = info[key]; result = result.split('{'+key+'}').join(val === null ? '' : val); } return result; } else return template(info); } // Export the t function for use when passing a function as the 'template' option $.extend({tweet: {t: t}}); function replacer (regex, replacement) { return function() { var returning = []; this.each(function() { returning.push(this.replace(regex, replacement)); }); return $(returning); }; } function escapeHTML(s) { return s.replace(//g,"^>"); } $.fn.extend({ linkUser: replacer(/(^|[\W])@(\w+)/gi, "$1@$2"), // Support various latin1 (\u00**) and arabic (\u06**) alphanumeric chars linkHash: replacer(/(?:^| )[\#]+([\w\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u00ff\u0600-\u06ff]+)/gi, ' #$1'), makeHeart: replacer(/(<)+[3]/gi, "♥") }); function linkURLs(text, entities) { return text.replace(url_regexp, function(match) { var url = (/^[a-z]+:/i).test(match) ? match : "http://"+match; var text = match; for(var i = 0; i < entities.length; ++i) { var entity = entities[i]; if (entity.url == url && entity.expanded_url) { url = entity.expanded_url; text = entity.display_url; break; } } return ""+escapeHTML(text)+""; }); } function parse_date(date_str) { // The non-search twitter APIs return inconsistently-formatted dates, which Date.parse // cannot handle in IE. We therefore perform the following transformation: // "Wed Apr 29 08:53:31 +0000 2009" => "Wed, Apr 29 2009 08:53:31 +0000" return Date.parse(date_str.replace(/^([a-z]{3})( [a-z]{3} \d\d?)(.*)( \d{4})$/i, '$1,$2$4$3')); } function extract_relative_time(date) { var toInt = function(val) { return parseInt(val, 10); }; var relative_to = new Date(); var delta = toInt((relative_to.getTime() - date) / 1000); if (delta < 1) delta = 0; return { days: toInt(delta / 86400), hours: toInt(delta / 3600), minutes: toInt(delta / 60), seconds: toInt(delta) }; } function format_relative_time(time_ago) { if ( time_ago.days > 2 ) return 'about ' + time_ago.days + ' days ago'; if ( time_ago.hours > 24 ) return 'about a day ago'; if ( time_ago.hours > 2 ) return 'about ' + time_ago.hours + ' hours ago'; if ( time_ago.minutes > 45 ) return 'about an hour ago'; if ( time_ago.minutes > 2 ) return 'about ' + time_ago.minutes + ' minutes ago'; if ( time_ago.seconds > 1 ) return 'about ' + time_ago.seconds + ' seconds ago'; return 'just now'; } function build_auto_join_text(text) { if (text.match(/^(@([A-Za-z0-9-_]+)) .*/i)) { return s.auto_join_text_reply; } else if (text.match(url_regexp)) { return s.auto_join_text_url; } else if (text.match(/^((\w+ed)|just) .*/im)) { return s.auto_join_text_ed; } else if (text.match(/^(\w*ing) .*/i)) { return s.auto_join_text_ing; } else { return s.auto_join_text_default; } } function build_api_url() { var proto = ('https:' == document.location.protocol ? 'https:' : 'http:'); var count = (s.fetch === null) ? s.count : s.fetch; var common_params = '&callback=?'; if (s.list) { return proto+"//"+s.twitter_api_url+"/1/"+s.username[0]+"/lists/"+s.list+"/statuses.json?page="+s.page+"&per_page="+count+common_params; } else if (s.favorites) { return proto+"//"+s.twitter_api_url+"/1/favorites.json?screen_name="+s.username[0]+"&page="+s.page+"&count="+count+common_params; } else if (s.query === null && s.username.length == 1) { return proto+'//'+s.twitter_api_url+'/1/statuses/user_timeline.json?screen_name='+s.username[0]+'&count='+count+(s.retweets ? '&include_rts=1' : '')+'&page='+s.page+common_params; } else { var query = (s.query || 'from:'+s.username.join(' OR from:')); return proto+'//'+s.twitter_search_url+'/search.json?&q='+encodeURIComponent(query)+'&rpp='+count+'&page='+s.page+common_params; } } function extract_avatar_url(item, secure) { if (secure) { return ('user' in item) ? item.user.profile_image_url_https : extract_avatar_url(item, false). replace(/^http:\/\/[a-z0-9]{1,3}\.twimg\.com\//, "https://s3.amazonaws.com/twitter_production/"); } else { return item.profile_image_url || item.user.profile_image_url; } } // Convert twitter API objects into data available for // constructing each tweet
  3. using a template function extract_template_data(item){ var o = {}; o.item = item; o.source = item.source; o.screen_name = item.from_user || item.user.screen_name; // The actual user name is not returned by all Twitter APIs, so please do not // file an issue if it is empty: o.name = item.from_user_name || item.user.name; o.retweet = typeof(item.retweeted_status) != 'undefined'; o.tweet_time = parse_date(item.created_at); o.join_text = s.join_text == "auto" ? build_auto_join_text(item.text) : s.join_text; o.tweet_id = item.id_str; o.twitter_base = "http://"+s.twitter_url+"/"; o.user_url = o.twitter_base+o.screen_name; o.tweet_url = o.user_url+"/status/"+o.tweet_id; o.reply_url = o.twitter_base+"intent/tweet?in_reply_to="+o.tweet_id; o.retweet_url = o.twitter_base+"intent/retweet?tweet_id="+o.tweet_id; o.favorite_url = o.twitter_base+"intent/favorite?tweet_id="+o.tweet_id; o.retweeted_screen_name = o.retweet && item.retweeted_status.user.screen_name; o.tweet_relative_time = format_relative_time(extract_relative_time(o.tweet_time)); o.entities = item.entities ? (item.entities.urls || []).concat(item.entities.media || []) : []; o.tweet_raw_text = o.retweet ? ('RT @'+o.retweeted_screen_name+' '+item.retweeted_status.text) : item.text; // avoid '...' in long retweets o.tweet_text = $([linkURLs(o.tweet_raw_text, o.entities)]).linkUser().linkHash()[0]; o.retweeted_tweet_text = $([linkURLs(item.text, o.entities)]).linkUser().linkHash()[0]; o.tweet_text_fancy = $([o.tweet_text]).makeHeart()[0]; o.avatar_size = s.avatar_size; o.avatar_url = extract_avatar_url(o.retweet ? item.retweeted_status : item, (document.location.protocol === 'https:')); o.avatar_screen_name = o.retweet ? o.retweeted_screen_name : o.screen_name; o.avatar_profile_url = o.twitter_base+o.avatar_screen_name; // Default spans, and pre-formatted blocks for common layouts o.user = t('{screen_name}', o); o.join = s.join_text ? t('{join_text}', o) : ''; o.avatar = o.avatar_size ? t('{avatar_screen_name}\'s avatar', o) : ''; o.time = t('{tweet_relative_time}', o); o.text = t('{tweet_text_fancy}', o); o.retweeted_text = t('{retweeted_tweet_text}', o); o.reply_action = t('reply', o); o.retweet_action = t('retweet', o); o.favorite_action = t('favorite', o); return o; } function render_tweets(widget, tweets) { var list = $('
      '); list.append($.map(tweets, function(o) { return "
    • " + t(s.template, o) + "
      • "; }).join('')). children('li:first').addClass('tweet_first').end(). children('li:odd').addClass('tweet_even').end(). children('li:even').addClass('tweet_odd'); $(widget).empty().append(list); if (s.intro_text) list.before('

      '+s.intro_text+'

      '); if (s.outro_text) list.after('

      '+s.outro_text+'

      '); $(widget).trigger("loaded").trigger((tweets.length === 0 ? "empty" : "full")); if (s.refresh_interval) { window.setTimeout(function() { $(widget).trigger("tweet:load"); }, 1000 * s.refresh_interval); } } function load(widget) { var loading = $('

      '+s.loading_text+'

      '); if (s.loading_text) $(widget).not(":has(.tweet_list)").empty().append(loading); $.getJSON(build_api_url(), function(data){ var tweets = $.map(data.results || data, extract_template_data); tweets = $.grep(tweets, s.filter).sort(s.comparator).slice(0, s.count); $(widget).trigger("tweet:retrieved", [tweets]); }); } return this.each(function(i, widget){ if(s.username && typeof(s.username) == "string"){ s.username = [s.username]; } $(widget).unbind("tweet:render").unbind("tweet:retrieved").unbind("tweet:load"). bind({ "tweet:load": function() { load(widget); }, "tweet:retrieved": function(ev, tweets) { $(widget).trigger("tweet:render", [tweets]) }, "tweet:render": function(ev, tweets) { render_tweets($(widget), tweets); } }).trigger("tweet:load"); }); }; })); ; //Twitters generated Javascript for all of their widgets (Tweet button, follow button) !function (d, s, id) { var js, fjs = d.getElementsByTagName(s)[0]; if (!d.getElementById(id)) { js = d.createElement(s); js.id = id; js.src = "//platform.twitter.com/widgets.js"; fjs.parentNode.insertBefore(js, fjs); } } (document, "script", "twitter-wjs");; /* * jQuery-dateFormat * http://github.com/phstc/jquery-dateFormat */ (function (a) { var b = ["Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"]; var c = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"]; var d = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"]; var e = []; e["Jan"] = "01"; e["Feb"] = "02"; e["Mar"] = "03"; e["Apr"] = "04"; e["May"] = "05"; e["Jun"] = "06"; e["Jul"] = "07"; e["Aug"] = "08"; e["Sep"] = "09"; e["Oct"] = "10"; e["Nov"] = "11"; e["Dec"] = "12"; a.format = function () { function a(a) { return b[parseInt(a, 10)] || a } function f(a) { var b = parseInt(a, 10) - 1; return c[b] || a } function g(a) { var b = parseInt(a, 10) - 1; return d[b] || a } var h = function (a) { return e[a] || a }; var i = function (a) { var b = a; var c = ""; if (b.indexOf(".") !== -1) { var d = b.split("."); b = d[0]; c = d[1] } var e = b.split(":"); if (e.length === 3) { hour = e[0]; minute = e[1]; second = e[2]; return { time: b, hour: hour, minute: minute, second: second, millis: c} } else { return { time: "", hour: "", minute: "", second: "", millis: ""} } }; return { date: function (b, c) { try { var d = null; var e = null; var j = null; var k = null; var l = null; var m = null; if (typeof b == "number") { return this.date(new Date(b), c) } else if (typeof b.getFullYear == "function") { e = b.getFullYear(); j = b.getMonth() + 1; k = b.getDate(); l = b.getDay(); m = i(b.toTimeString()) } else if (b.search(/\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}\.?\d{0,3}[-+]?\d{2}:?\d{2}/) != -1) { var n = b.split(/[T\+-]/); e = n[0]; j = n[1]; k = n[2]; m = i(n[3].split(".")[0]); d = new Date(e, j - 1, k); l = d.getDay() } else { var n = b.split(" "); switch (n.length) { case 6: e = n[5]; j = h(n[1]); k = n[2]; m = i(n[3]); d = new Date(e, j - 1, k); l = d.getDay(); break; case 2: var o = n[0].split("-"); e = o[0]; j = o[1]; k = o[2]; m = i(n[1]); d = new Date(e, j - 1, k); l = d.getDay(); break; case 7: case 9: case 10: e = n[3]; j = h(n[1]); k = n[2]; m = i(n[4]); d = new Date(e, j - 1, k); l = d.getDay(); break; case 1: var o = n[0].split(""); e = o[0] + o[1] + o[2] + o[3]; j = o[5] + o[6]; k = o[8] + o[9]; m = i(o[13] + o[14] + o[15] + o[16] + o[17] + o[18] + o[19] + o[20]); d = new Date(e, j - 1, k); l = d.getDay(); break; default: return b } } var p = ""; var q = ""; var r = ""; for (var s = 0; s < c.length; s++) { var t = c.charAt(s); p += t; r = ""; switch (p) { case "ddd": q += a(l); p = ""; break; case "dd": if (c.charAt(s + 1) == "d") { break } if (String(k).length === 1) { k = "0" + k } q += k; p = ""; break; case "d": if (c.charAt(s + 1) == "d") { break } q += parseInt(k, 10); p = ""; break; case "MMMM": q += g(j); p = ""; break; case "MMM": if (c.charAt(s + 1) === "M") { break } q += f(j); p = ""; break; case "MM": if (c.charAt(s + 1) == "M") { break } if (String(j).length === 1) { j = "0" + j } q += j; p = ""; break; case "M": if (c.charAt(s + 1) == "M") { break } q += parseInt(j, 10); p = ""; break; case "yyyy": q += e; p = ""; break; case "yy": if (c.charAt(s + 1) == "y" && c.charAt(s + 2) == "y") { break } q += String(e).slice(-2); p = ""; break; case "HH": q += m.hour; p = ""; break; case "hh": var u = m.hour == 0 ? 12 : m.hour < 13 ? m.hour : m.hour - 12; u = String(u).length == 1 ? "0" + u : u; q += u; p = ""; break; case "h": if (c.charAt(s + 1) == "h") { break } var u = m.hour == 0 ? 12 : m.hour < 13 ? m.hour : m.hour - 12; q += parseInt(u, 10); p = ""; break; case "mm": q += m.minute; p = ""; break; case "ss": q += m.second.substring(0, 2); p = ""; break; case "SSS": q += m.millis.substring(0, 3); p = ""; break; case "a": q += m.hour >= 12 ? "PM" : "AM"; p = ""; break; case " ": q += t; p = ""; break; case "/": q += t; p = ""; break; case ":": q += t; p = ""; break; default: if (p.length === 2 && p.indexOf("y") !== 0 && p != "SS") { q += p.substring(0, 1); p = p.substring(1, 2) } else if (p.length === 3 && p.indexOf("yyy") === -1) { p = "" } else { r = p } } } q += r; return q } catch (v) { console.log(v); return b } } } } () })(jQuery); jQuery.format.date.defaultShortDateFormat = "dd/MM/yyyy"; jQuery.format.date.defaultLongDateFormat = "dd/MM/yyyy hh:mm:ss"; jQuery(document).ready(function () { jQuery(".shortDateFormat").each(function (a, b) { if (jQuery(b).is(":input")) { jQuery(b).val(jQuery.format.date(jQuery(b).val(), jQuery.format.date.defaultShortDateFormat)) } else { jQuery(b).text(jQuery.format.date(jQuery(b).text(), jQuery.format.date.defaultShortDateFormat)) } }); jQuery(".longDateFormat").each(function (a, b) { if (jQuery(b).is(":input")) { jQuery(b).val(jQuery.format.date(jQuery(b).val(), jQuery.format.date.defaultLongDateFormat)) } else { jQuery(b).text(jQuery.format.date(jQuery(b).text(), jQuery.format.date.defaultLongDateFormat)) } }) }) ; /* ============================================================= * bootstrap-collapse.js v2.1.1 * http://twitter.github.com/bootstrap/javascript.html#collapse * ============================================================= * Copyright 2012 Twitter, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ============================================================ */ !function ($) { "use strict"; // jshint ;_; /* COLLAPSE PUBLIC CLASS DEFINITION * ================================ */ var Collapse = function (element, options) { this.$element = $(element) this.options = $.extend({}, $.fn.collapse.defaults, options) if (this.options.parent) { this.$parent = $(this.options.parent) } this.options.toggle && this.toggle() } Collapse.prototype = { constructor: Collapse , dimension: function () { var hasWidth = this.$element.hasClass('width') return hasWidth ? 'width' : 'height' } , show: function () { var dimension , scroll , actives , hasData if (this.transitioning) return dimension = this.dimension() scroll = $.camelCase(['scroll', dimension].join('-')) actives = this.$parent && this.$parent.find('> .accordion-group > .in') if (actives && actives.length) { hasData = actives.data('collapse') if (hasData && hasData.transitioning) return actives.collapse('hide') hasData || actives.data('collapse', null) } this.$element[dimension](0) this.transition('addClass', $.Event('show'), 'shown') $.support.transition && this.$element[dimension](this.$element[0][scroll]) } , hide: function () { var dimension if (this.transitioning) return dimension = this.dimension() this.reset(this.$element[dimension]()) this.transition('removeClass', $.Event('hide'), 'hidden') this.$element[dimension](0) } , reset: function (size) { var dimension = this.dimension() this.$element .removeClass('collapse') [dimension](size || 'auto') [0].offsetWidth this.$element[size !== null ? 'addClass' : 'removeClass']('collapse') return this } , transition: function (method, startEvent, completeEvent) { var that = this , complete = function () { if (startEvent.type == 'show') that.reset() that.transitioning = 0 that.$element.trigger(completeEvent) } this.$element.trigger(startEvent) if (startEvent.isDefaultPrevented()) return this.transitioning = 1 this.$element[method]('in') $.support.transition && this.$element.hasClass('collapse') ? this.$element.one($.support.transition.end, complete) : complete() } , toggle: function () { this[this.$element.hasClass('in') ? 'hide' : 'show']() } } /* COLLAPSIBLE PLUGIN DEFINITION * ============================== */ $.fn.collapse = function (option) { return this.each(function () { var $this = $(this) , data = $this.data('collapse') , options = typeof option == 'object' && option if (!data) $this.data('collapse', (data = new Collapse(this, options))) if (typeof option == 'string') data[option]() }) } $.fn.collapse.defaults = { toggle: true } $.fn.collapse.Constructor = Collapse /* COLLAPSIBLE DATA-API * ==================== */ $(function () { $('body').on('click.collapse.data-api', '[data-toggle=collapse]', function (e) { var $this = $(this), href , target = $this.attr('data-target') || e.preventDefault() || (href = $this.attr('href')) && href.replace(/.*(?=#[^\s]+$)/, '') //strip for ie7 , option = $(target).data('collapse') ? 'toggle' : $this.data() $this[$(target).hasClass('in') ? 'addClass' : 'removeClass']('collapsed') $(target).collapse(option) }) }) }(window.jQuery);/* ============================================================ * bootstrap-dropdown.js v2.1.1 * http://twitter.github.com/bootstrap/javascript.html#dropdowns * ============================================================ * Copyright 2012 Twitter, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ============================================================ */ !function ($) { "use strict"; // jshint ;_; /* DROPDOWN CLASS DEFINITION * ========================= */ var toggle = '[data-toggle=dropdown]' , Dropdown = function (element) { var $el = $(element).on('click.dropdown.data-api', this.toggle) $('html').on('click.dropdown.data-api', function () { $el.parent().removeClass('open') }) } Dropdown.prototype = { constructor: Dropdown , toggle: function (e) { var $this = $(this) , $parent , isActive if ($this.is('.disabled, :disabled')) return $parent = getParent($this) isActive = $parent.hasClass('open') clearMenus() if (!isActive) { $parent.toggleClass('open') $this.focus() } return false } , keydown: function (e) { var $this , $items , $active , $parent , isActive , index if (!/(38|40|27)/.test(e.keyCode)) return $this = $(this) e.preventDefault() e.stopPropagation() if ($this.is('.disabled, :disabled')) return $parent = getParent($this) isActive = $parent.hasClass('open') if (!isActive || (isActive && e.keyCode == 27)) return $this.click() $items = $('[role=menu] li:not(.divider) a', $parent) if (!$items.length) return index = $items.index($items.filter(':focus')) if (e.keyCode == 38 && index > 0) index-- // up if (e.keyCode == 40 && index < $items.length - 1) index++ // down if (!~index) index = 0 $items .eq(index) .focus() } } function clearMenus() { getParent($(toggle)) .removeClass('open') } function getParent($this) { var selector = $this.attr('data-target') , $parent if (!selector) { selector = $this.attr('href') selector = selector && /#/.test(selector) && selector.replace(/.*(?=#[^\s]*$)/, '') //strip for ie7 } $parent = $(selector) $parent.length || ($parent = $this.parent()) return $parent } /* DROPDOWN PLUGIN DEFINITION * ========================== */ $.fn.dropdown = function (option) { return this.each(function () { var $this = $(this) , data = $this.data('dropdown') if (!data) $this.data('dropdown', (data = new Dropdown(this))) if (typeof option == 'string') data[option].call($this) }) } $.fn.dropdown.Constructor = Dropdown /* APPLY TO STANDARD DROPDOWN ELEMENTS * =================================== */ $(function () { $('html') .on('click.dropdown.data-api', clearMenus) $('body') .on('click.dropdown touchstart.dropdown.data-api', '.dropdown form', function (e) { e.stopPropagation() }) .on('click.dropdown.data-api' , toggle, Dropdown.prototype.toggle) .on('keydown.dropdown.data-api touchstart.dropdown.data-api', toggle + ', [role=menu]' , Dropdown.prototype.keydown) }) }(window.jQuery);/* ========================================================= * bootstrap-modal.js v2.3.2 * http://getbootstrap.com/2.3.2/javascript.html#modals * ========================================================= * Copyright 2013 Twitter, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ========================================================= */ !function ($) { "use strict"; // jshint ;_; /* MODAL CLASS DEFINITION * ====================== */ var Modal = function (element, options) { this.options = options this.$element = $(element) .delegate('[data-dismiss="modal"]', 'click.dismiss.modal', $.proxy(this.hide, this)) this.options.remote && this.$element.find('.modal-body').load(this.options.remote) } Modal.prototype = { constructor: Modal , toggle: function () { return this[!this.isShown ? 'show' : 'hide']() } , show: function () { var that = this , e = $.Event('show') this.$element.trigger(e) if (this.isShown || e.isDefaultPrevented()) return this.isShown = true this.escape() this.backdrop(function () { var transition = $.support.transition && that.$element.hasClass('fade') if (!that.$element.parent().length) { that.$element.appendTo(document.body) //don't move modals dom position } that.$element.show() if (transition) { that.$element[0].offsetWidth // force reflow } that.$element .addClass('in') .attr('aria-hidden', false) that.enforceFocus() transition ? that.$element.one($.support.transition.end, function () { that.$element.focus().trigger('shown') }) : that.$element.focus().trigger('shown') }) } , hide: function (e) { e && e.preventDefault() var that = this e = $.Event('hide') this.$element.trigger(e) if (!this.isShown || e.isDefaultPrevented()) return this.isShown = false this.escape() $(document).off('focusin.modal') this.$element .removeClass('in') .attr('aria-hidden', true) $.support.transition && this.$element.hasClass('fade') ? this.hideWithTransition() : this.hideModal() } , enforceFocus: function () { var that = this $(document).on('focusin.modal', function (e) { if (that.$element[0] !== e.target && !that.$element.has(e.target).length) { that.$element.focus() } }) } , escape: function () { var that = this if (this.isShown && this.options.keyboard) { this.$element.on('keyup.dismiss.modal', function ( e ) { e.which == 27 && that.hide() }) } else if (!this.isShown) { this.$element.off('keyup.dismiss.modal') } } , hideWithTransition: function () { var that = this , timeout = setTimeout(function () { that.$element.off($.support.transition.end) that.hideModal() }, 500) this.$element.one($.support.transition.end, function () { clearTimeout(timeout) that.hideModal() }) } , hideModal: function () { var that = this this.$element.hide() this.backdrop(function () { that.removeBackdrop() that.$element.trigger('hidden') }) } , removeBackdrop: function () { this.$backdrop && this.$backdrop.remove() this.$backdrop = null } , backdrop: function (callback) { var that = this , animate = this.$element.hasClass('fade') ? 'fade' : '' if (this.isShown && this.options.backdrop) { var doAnimate = $.support.transition && animate this.$backdrop = $('
      ') .appendTo(document.body) this.$backdrop.click( this.options.backdrop == 'static' ? $.proxy(this.$element[0].focus, this.$element[0]) : $.proxy(this.hide, this) ) if (doAnimate) this.$backdrop[0].offsetWidth // force reflow this.$backdrop.addClass('in') if (!callback) return doAnimate ? this.$backdrop.one($.support.transition.end, callback) : callback() } else if (!this.isShown && this.$backdrop) { this.$backdrop.removeClass('in') $.support.transition && this.$element.hasClass('fade')? this.$backdrop.one($.support.transition.end, callback) : callback() } else if (callback) { callback() } } } /* MODAL PLUGIN DEFINITION * ======================= */ var old = $.fn.modal $.fn.modal = function (option) { return this.each(function () { var $this = $(this) , data = $this.data('modal') , options = $.extend({}, $.fn.modal.defaults, $this.data(), typeof option == 'object' && option) if (!data) $this.data('modal', (data = new Modal(this, options))) if (typeof option == 'string') data[option]() else if (options.show) data.show() }) } $.fn.modal.defaults = { backdrop: true , keyboard: true , show: true } $.fn.modal.Constructor = Modal /* MODAL NO CONFLICT * ================= */ $.fn.modal.noConflict = function () { $.fn.modal = old return this } /* MODAL DATA-API * ============== */ $(document).on('click.modal.data-api', '[data-toggle="modal"]', function (e) { var $this = $(this) , href = $this.attr('href') , $target = $($this.attr('data-target') || (href && href.replace(/.*(?=#[^\s]+$)/, ''))) //strip for ie7 , option = $target.data('modal') ? 'toggle' : $.extend({ remote:!/#/.test(href) && href }, $target.data(), $this.data()) e.preventDefault() $target .modal(option) .one('hide', function () { $this.focus() }) }) }(window.jQuery);/* =========================================================== * bootstrap-tooltip.js v2.1.1 * http://twitter.github.com/bootstrap/javascript.html#tooltips * Inspired by the original jQuery.tipsy by Jason Frame * =========================================================== * Copyright 2012 Twitter, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ========================================================== */ !function ($) { "use strict"; // jshint ;_; /* TOOLTIP PUBLIC CLASS DEFINITION * =============================== */ var Tooltip = function (element, options) { this.init('tooltip', element, options) } Tooltip.prototype = { constructor: Tooltip , init: function (type, element, options) { var eventIn , eventOut this.type = type this.$element = $(element) this.options = this.getOptions(options) this.enabled = true if (this.options.trigger == 'click') { this.$element.on('click.' + this.type, this.options.selector, $.proxy(this.toggle, this)) } else if (this.options.trigger != 'manual') { eventIn = this.options.trigger == 'hover' ? 'mouseenter' : 'focus' eventOut = this.options.trigger == 'hover' ? 'mouseleave' : 'blur' this.$element.on(eventIn + '.' + this.type, this.options.selector, $.proxy(this.enter, this)) this.$element.on(eventOut + '.' + this.type, this.options.selector, $.proxy(this.leave, this)) } this.options.selector ? (this._options = $.extend({}, this.options, { trigger: 'manual', selector: '' })) : this.fixTitle() } , getOptions: function (options) { options = $.extend({}, $.fn[this.type].defaults, options, this.$element.data()) if (options.delay && typeof options.delay == 'number') { options.delay = { show: options.delay , hide: options.delay } } return options } , enter: function (e) { var self = $(e.currentTarget)[this.type](this._options).data(this.type) if (!self.options.delay || !self.options.delay.show) return self.show() clearTimeout(this.timeout) self.hoverState = 'in' this.timeout = setTimeout(function() { if (self.hoverState == 'in') self.show() }, self.options.delay.show) } , leave: function (e) { var self = $(e.currentTarget)[this.type](this._options).data(this.type) if (this.timeout) clearTimeout(this.timeout) if (!self.options.delay || !self.options.delay.hide) return self.hide() self.hoverState = 'out' this.timeout = setTimeout(function() { if (self.hoverState == 'out') self.hide() }, self.options.delay.hide) } , show: function () { var $tip , inside , pos , actualWidth , actualHeight , placement , tp if (this.hasContent() && this.enabled) { $tip = this.tip() this.setContent() if (this.options.animation) { $tip.addClass('fade') } placement = typeof this.options.placement == 'function' ? this.options.placement.call(this, $tip[0], this.$element[0]) : this.options.placement inside = /in/.test(placement) $tip .remove() .css({ top: 0, left: 0, display: 'block' }) .appendTo(inside ? this.$element : document.body) pos = this.getPosition(inside) actualWidth = $tip[0].offsetWidth actualHeight = $tip[0].offsetHeight switch (inside ? placement.split(' ')[1] : placement) { case 'bottom': tp = {top: pos.top + pos.height, left: pos.left + pos.width / 2 - actualWidth / 2} break case 'top': tp = {top: pos.top - actualHeight, left: pos.left + pos.width / 2 - actualWidth / 2} break case 'left': tp = {top: pos.top + pos.height / 2 - actualHeight / 2, left: pos.left - actualWidth} break case 'right': tp = {top: pos.top + pos.height / 2 - actualHeight / 2, left: pos.left + pos.width} break } $tip .css(tp) .addClass(placement) .addClass('in') } } , setContent: function () { var $tip = this.tip() , title = this.getTitle() $tip.find('.tooltip-inner')[this.options.html ? 'html' : 'text'](title) $tip.removeClass('fade in top bottom left right') } , hide: function () { var that = this , $tip = this.tip() $tip.removeClass('in') function removeWithAnimation() { var timeout = setTimeout(function () { $tip.off($.support.transition.end).remove() }, 500) $tip.one($.support.transition.end, function () { clearTimeout(timeout) $tip.remove() }) } $.support.transition && this.$tip.hasClass('fade') ? removeWithAnimation() : $tip.remove() return this } , fixTitle: function () { var $e = this.$element if ($e.attr('title') || typeof($e.attr('data-original-title')) != 'string') { $e.attr('data-original-title', $e.attr('title') || '').removeAttr('title') } } , hasContent: function () { return this.getTitle() } , getPosition: function (inside) { return $.extend({}, (inside ? {top: 0, left: 0} : this.$element.offset()), { width: this.$element[0].offsetWidth , height: this.$element[0].offsetHeight }) } , getTitle: function () { var title , $e = this.$element , o = this.options title = $e.attr('data-original-title') || (typeof o.title == 'function' ? o.title.call($e[0]) : o.title) return title } , tip: function () { return this.$tip = this.$tip || $(this.options.template) } , validate: function () { if (!this.$element[0].parentNode) { this.hide() this.$element = null this.options = null } } , enable: function () { this.enabled = true } , disable: function () { this.enabled = false } , toggleEnabled: function () { this.enabled = !this.enabled } , toggle: function () { this[this.tip().hasClass('in') ? 'hide' : 'show']() } , destroy: function () { this.hide().$element.off('.' + this.type).removeData(this.type) } } /* TOOLTIP PLUGIN DEFINITION * ========================= */ $.fn.tooltip = function ( option ) { return this.each(function () { var $this = $(this) , data = $this.data('tooltip') , options = typeof option == 'object' && option if (!data) $this.data('tooltip', (data = new Tooltip(this, options))) if (typeof option == 'string') data[option]() }) } $.fn.tooltip.Constructor = Tooltip $.fn.tooltip.defaults = { animation: true , placement: 'top' , selector: false , template: '
      ' , trigger: 'hover' , title: '' , delay: 0 , html: true } }(window.jQuery); /* =========================================================== * bootstrap-popover.js v2.1.1 * http://twitter.github.com/bootstrap/javascript.html#popovers * =========================================================== * Copyright 2012 Twitter, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * =========================================================== */ !function ($) { "use strict"; // jshint ;_; /* POPOVER PUBLIC CLASS DEFINITION * =============================== */ var Popover = function (element, options) { this.init('popover', element, options) } /* NOTE: POPOVER EXTENDS BOOTSTRAP-TOOLTIP.js ========================================== */ Popover.prototype = $.extend({}, $.fn.tooltip.Constructor.prototype, { constructor: Popover , setContent: function () { var $tip = this.tip() , title = this.getTitle() , content = this.getContent() $tip.find('.popover-title')[this.options.html ? 'html' : 'text'](title) $tip.find('.popover-content > *')[this.options.html ? 'html' : 'text'](content) $tip.removeClass('fade top bottom left right in') } , hasContent: function () { return this.getTitle() || this.getContent() } , getContent: function () { var content , $e = this.$element , o = this.options content = $e.attr('data-content') || (typeof o.content == 'function' ? o.content.call($e[0]) : o.content) return content } , tip: function () { if (!this.$tip) { this.$tip = $(this.options.template) } return this.$tip } , destroy: function () { this.hide().$element.off('.' + this.type).removeData(this.type) } }) /* POPOVER PLUGIN DEFINITION * ======================= */ $.fn.popover = function (option) { return this.each(function () { var $this = $(this) , data = $this.data('popover') , options = typeof option == 'object' && option if (!data) $this.data('popover', (data = new Popover(this, options))) if (typeof option == 'string') data[option]() }) } $.fn.popover.Constructor = Popover $.fn.popover.defaults = $.extend({} , $.fn.tooltip.defaults, { placement: 'right' , trigger: 'click' , content: '' , template: '

      ' }) }(window.jQuery);/* ======================================================== * bootstrap-tab.js v2.1.1 * http://twitter.github.com/bootstrap/javascript.html#tabs * ======================================================== * Copyright 2012 Twitter, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ======================================================== */ !function ($) { "use strict"; // jshint ;_; /* TAB CLASS DEFINITION * ==================== */ var Tab = function (element) { this.element = $(element) } Tab.prototype = { constructor: Tab , show: function () { var $this = this.element , $ul = $this.closest('ul:not(.dropdown-menu)') , selector = $this.attr('data-target') , previous , $target , e if (!selector) { selector = $this.attr('href') selector = selector && selector.replace(/.*(?=#[^\s]*$)/, '') //strip for ie7 } if ( $this.parent('li').hasClass('active') ) return previous = $ul.find('.active a').last()[0] e = $.Event('show', { relatedTarget: previous }) $this.trigger(e) if (e.isDefaultPrevented()) return $target = $(selector) this.activate($this.parent('li'), $ul) this.activate($target, $target.parent(), function () { $this.trigger({ type: 'shown' , relatedTarget: previous }) }) } , activate: function ( element, container, callback) { var $active = container.find('> .active') , transition = callback && $.support.transition && $active.hasClass('fade') function next() { $active .removeClass('active') .find('> .dropdown-menu > .active') .removeClass('active') element.addClass('active') if (transition) { element[0].offsetWidth // reflow for transition element.addClass('in') } else { element.removeClass('fade') } if ( element.parent('.dropdown-menu') ) { element.closest('li.dropdown').addClass('active') } callback && callback() } transition ? $active.one($.support.transition.end, next) : next() $active.removeClass('in') } } /* TAB PLUGIN DEFINITION * ===================== */ $.fn.tab = function ( option ) { return this.each(function () { var $this = $(this) , data = $this.data('tab') if (!data) $this.data('tab', (data = new Tab(this))) if (typeof option == 'string') data[option]() }) } $.fn.tab.Constructor = Tab /* TAB DATA-API * ============ */ $(function () { $('body').on('click.tab.data-api', '[data-toggle="tab"], [data-toggle="pill"]', function (e) { e.preventDefault() $(this).tab('show') }) }) }(window.jQuery);; /* =========================================================== * bootstrap-modalmanager.js v2.2.5 * =========================================================== * Copyright 2012 Jordan Schroter. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ========================================================== */ !function ($) { "use strict"; // jshint ;_; /* MODAL MANAGER CLASS DEFINITION * ====================== */ var ModalManager = function (element, options) { this.init(element, options); }; ModalManager.prototype = { constructor: ModalManager, init: function (element, options) { this.$element = $(element); this.options = $.extend({}, $.fn.modalmanager.defaults, this.$element.data(), typeof options == 'object' && options); this.stack = []; this.backdropCount = 0; if (this.options.resize) { var resizeTimeout, that = this; $(window).on('resize.modal', function(){ resizeTimeout && clearTimeout(resizeTimeout); resizeTimeout = setTimeout(function(){ for (var i = 0; i < that.stack.length; i++){ that.stack[i].isShown && that.stack[i].layout(); } }, 10); }); } }, createModal: function (element, options) { $(element).modal($.extend({ manager: this }, options)); }, appendModal: function (modal) { this.stack.push(modal); var that = this; modal.$element.on('show.modalmanager', targetIsSelf(function (e) { var showModal = function(){ modal.isShown = true; var transition = $.support.transition && modal.$element.hasClass('fade'); that.$element .toggleClass('modal-open', that.hasOpenModal()) .toggleClass('page-overflow', $(window).height() < that.$element.height()); modal.$parent = modal.$element.parent(); modal.$container = that.createContainer(modal); modal.$element.appendTo(modal.$container); that.backdrop(modal, function () { modal.$element.show(); if (transition) { //modal.$element[0].style.display = 'run-in'; modal.$element[0].offsetWidth; //modal.$element.one($.support.transition.end, function () { modal.$element[0].style.display = 'block' }); } modal.layout(); modal.$element .addClass('in') .attr('aria-hidden', false); var complete = function () { that.setFocus(); modal.$element.trigger('shown'); }; transition ? modal.$element.one($.support.transition.end, complete) : complete(); }); }; modal.options.replace ? that.replace(showModal) : showModal(); })); modal.$element.on('hidden.modalmanager', targetIsSelf(function (e) { that.backdrop(modal); // handle the case when a modal may have been removed from the dom before this callback executes if (!modal.$element.parent().length) { that.destroyModal(modal); } else if (modal.$backdrop){ var transition = $.support.transition && modal.$element.hasClass('fade'); // trigger a relayout due to firebox's buggy transition end event if (transition) { modal.$element[0].offsetWidth; } $.support.transition && modal.$element.hasClass('fade') ? modal.$backdrop.one($.support.transition.end, function () { modal.destroy(); }) : modal.destroy(); } else { modal.destroy(); } })); modal.$element.on('destroyed.modalmanager', targetIsSelf(function (e) { that.destroyModal(modal); })); }, getOpenModals: function () { var openModals = []; for (var i = 0; i < this.stack.length; i++){ if (this.stack[i].isShown) openModals.push(this.stack[i]); } return openModals; }, hasOpenModal: function () { return this.getOpenModals().length > 0; }, setFocus: function () { var topModal; for (var i = 0; i < this.stack.length; i++){ if (this.stack[i].isShown) topModal = this.stack[i]; } if (!topModal) return; topModal.focus(); }, destroyModal: function (modal) { modal.$element.off('.modalmanager'); if (modal.$backdrop) this.removeBackdrop(modal); this.stack.splice(this.getIndexOfModal(modal), 1); var hasOpenModal = this.hasOpenModal(); this.$element.toggleClass('modal-open', hasOpenModal); if (!hasOpenModal){ this.$element.removeClass('page-overflow'); } this.removeContainer(modal); this.setFocus(); }, getModalAt: function (index) { return this.stack[index]; }, getIndexOfModal: function (modal) { for (var i = 0; i < this.stack.length; i++){ if (modal === this.stack[i]) return i; } }, replace: function (callback) { var topModal; for (var i = 0; i < this.stack.length; i++){ if (this.stack[i].isShown) topModal = this.stack[i]; } if (topModal) { this.$backdropHandle = topModal.$backdrop; topModal.$backdrop = null; callback && topModal.$element.one('hidden', targetIsSelf( $.proxy(callback, this) )); topModal.hide(); } else if (callback) { callback(); } }, removeBackdrop: function (modal) { modal.$backdrop.remove(); modal.$backdrop = null; }, createBackdrop: function (animate, tmpl) { var $backdrop; if (!this.$backdropHandle) { $backdrop = $(tmpl) .addClass(animate) .appendTo(this.$element); } else { $backdrop = this.$backdropHandle; $backdrop.off('.modalmanager'); this.$backdropHandle = null; this.isLoading && this.removeSpinner(); } return $backdrop; }, removeContainer: function (modal) { modal.$container.remove(); modal.$container = null; }, createContainer: function (modal) { var $container; $container = $('
      ') .css('z-index', getzIndex('modal', this.getOpenModals().length)) .appendTo(this.$element); if (modal && modal.options.backdrop != 'static') { $container.on('click.modal', targetIsSelf(function (e) { modal.hide(); })); } else if (modal) { $container.on('click.modal', targetIsSelf(function (e) { modal.attention(); })); } return $container; }, backdrop: function (modal, callback) { var animate = modal.$element.hasClass('fade') ? 'fade' : '', showBackdrop = modal.options.backdrop && this.backdropCount < this.options.backdropLimit; if (modal.isShown && showBackdrop) { var doAnimate = $.support.transition && animate && !this.$backdropHandle; modal.$backdrop = this.createBackdrop(animate, modal.options.backdropTemplate); modal.$backdrop.css('z-index', getzIndex( 'backdrop', this.getOpenModals().length )); if (doAnimate) modal.$backdrop[0].offsetWidth; // force reflow modal.$backdrop.addClass('in'); this.backdropCount += 1; doAnimate ? modal.$backdrop.one($.support.transition.end, callback) : callback(); } else if (!modal.isShown && modal.$backdrop) { modal.$backdrop.removeClass('in'); this.backdropCount -= 1; var that = this; $.support.transition && modal.$element.hasClass('fade')? modal.$backdrop.one($.support.transition.end, function () { that.removeBackdrop(modal) }) : that.removeBackdrop(modal); } else if (callback) { callback(); } }, removeSpinner: function(){ this.$spinner && this.$spinner.remove(); this.$spinner = null; this.isLoading = false; }, removeLoading: function () { this.$backdropHandle && this.$backdropHandle.remove(); this.$backdropHandle = null; this.removeSpinner(); }, loading: function (callback) { callback = callback || function () { }; this.$element .toggleClass('modal-open', !this.isLoading || this.hasOpenModal()) .toggleClass('page-overflow', $(window).height() < this.$element.height()); if (!this.isLoading) { this.$backdropHandle = this.createBackdrop('fade', this.options.backdropTemplate); this.$backdropHandle[0].offsetWidth; // force reflow var openModals = this.getOpenModals(); this.$backdropHandle .css('z-index', getzIndex('backdrop', openModals.length + 1)) .addClass('in'); var $spinner = $(this.options.spinner) .css('z-index', getzIndex('modal', openModals.length + 1)) .appendTo(this.$element) .addClass('in'); this.$spinner = $(this.createContainer()) .append($spinner) .on('click.modalmanager', $.proxy(this.loading, this)); this.isLoading = true; $.support.transition ? this.$backdropHandle.one($.support.transition.end, callback) : callback(); } else if (this.isLoading && this.$backdropHandle) { this.$backdropHandle.removeClass('in'); var that = this; $.support.transition ? this.$backdropHandle.one($.support.transition.end, function () { that.removeLoading() }) : that.removeLoading(); } else if (callback) { callback(this.isLoading); } } }; /* PRIVATE METHODS * ======================= */ // computes and caches the zindexes var getzIndex = (function () { var zIndexFactor, baseIndex = {}; return function (type, pos) { if (typeof zIndexFactor === 'undefined'){ var $baseModal = $('
      ').appendTo('body'), $baseBackdrop = $('
      ').appendTo('body'); baseIndex['modal'] = +$baseModal.css('z-index'); baseIndex['backdrop'] = +$baseBackdrop.css('z-index'); zIndexFactor = baseIndex['modal'] - baseIndex['backdrop']; $baseModal.remove(); $baseBackdrop.remove(); $baseBackdrop = $baseModal = null; } return baseIndex[type] + (zIndexFactor * pos); } }()); // make sure the event target is the modal itself in order to prevent // other components such as tabsfrom triggering the modal manager. // if Boostsrap namespaced events, this would not be needed. function targetIsSelf(callback){ return function (e) { if (e && this === e.target){ return callback.apply(this, arguments); } } } /* MODAL MANAGER PLUGIN DEFINITION * ======================= */ $.fn.modalmanager = function (option, args) { return this.each(function () { var $this = $(this), data = $this.data('modalmanager'); if (!data) $this.data('modalmanager', (data = new ModalManager(this, option))); if (typeof option === 'string') data[option].apply(data, [].concat(args)) }) }; $.fn.modalmanager.defaults = { backdropLimit: 999, resize: true, spinner: '', backdropTemplate: '
      ' }; $.fn.modalmanager.Constructor = ModalManager // ModalManager handles the modal-open class so we need // to remove conflicting bootstrap 3 event handlers $(function () { $(document).off('show.bs.modal').off('hidden.bs.modal'); }); }(jQuery); ; /* =========================================================== * bootstrap-modal.js v2.2.5 * =========================================================== * Copyright 2012 Jordan Schroter * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * ========================================================== */ !function ($) { "use strict"; // jshint ;_; /* MODAL CLASS DEFINITION * ====================== */ var Modal = function (element, options) { this.init(element, options); }; Modal.prototype = { constructor: Modal, init: function (element, options) { var that = this; this.options = options; this.$element = $(element) .delegate('[data-dismiss="modal"]', 'click.dismiss.modal', $.proxy(this.hide, this)); this.options.remote && this.$element.find('.modal-body').load(this.options.remote, function () { var e = $.Event('loaded'); that.$element.trigger(e); }); var manager = typeof this.options.manager === 'function' ? this.options.manager.call(this) : this.options.manager; manager = manager.appendModal ? manager : $(manager).modalmanager().data('modalmanager'); manager.appendModal(this); }, toggle: function () { return this[!this.isShown ? 'show' : 'hide'](); }, show: function () { var e = $.Event('show'); if (this.isShown) return; this.$element.trigger(e); if (e.isDefaultPrevented()) return; this.escape(); this.tab(); this.options.loading && this.loading(); }, hide: function (e) { e && e.preventDefault(); e = $.Event('hide'); this.$element.trigger(e); if (!this.isShown || e.isDefaultPrevented()) return; this.isShown = false; this.escape(); this.tab(); this.isLoading && this.loading(); $(document).off('focusin.modal'); this.$element .removeClass('in') .removeClass('animated') .removeClass(this.options.attentionAnimation) .removeClass('modal-overflow') .attr('aria-hidden', true); $.support.transition && this.$element.hasClass('fade') ? this.hideWithTransition() : this.hideModal(); }, layout: function () { var prop = this.options.height ? 'height' : 'max-height', value = this.options.height || this.options.maxHeight; if (this.options.width){ this.$element.css('width', this.options.width); var that = this; this.$element.css('margin-left', function () { if (/%/ig.test(that.options.width)){ return -(parseInt(that.options.width) / 2) + '%'; } else { return -($(this).width() / 2) + 'px'; } }); } else { this.$element.css('width', ''); this.$element.css('margin-left', ''); } this.$element.find('.modal-body') .css('overflow', '') .css(prop, ''); if (value){ this.$element.find('.modal-body') .css('overflow', 'auto') .css(prop, value); } var modalOverflow = $(window).height() - 10 < this.$element.height(); if (modalOverflow || this.options.modalOverflow) { this.$element .css('margin-top', 0) .addClass('modal-overflow'); } else { this.$element .css('margin-top', 0 - this.$element.height() / 2) .removeClass('modal-overflow'); } }, tab: function () { var that = this; if (this.isShown && this.options.consumeTab) { this.$element.on('keydown.tabindex.modal', '[data-tabindex]', function (e) { if (e.keyCode && e.keyCode == 9){ var elements = [], tabindex = Number($(this).data('tabindex')); that.$element.find('[data-tabindex]:enabled:visible:not([readonly])').each(function (ev) { elements.push(Number($(this).data('tabindex'))); }); elements.sort(function(a,b){return a-b}); var arrayPos = $.inArray(tabindex, elements); if (!e.shiftKey){ arrayPos < elements.length-1 ? that.$element.find('[data-tabindex='+elements[arrayPos+1]+']').focus() : that.$element.find('[data-tabindex='+elements[0]+']').focus(); } else { arrayPos == 0 ? that.$element.find('[data-tabindex='+elements[elements.length-1]+']').focus() : that.$element.find('[data-tabindex='+elements[arrayPos-1]+']').focus(); } e.preventDefault(); } }); } else if (!this.isShown) { this.$element.off('keydown.tabindex.modal'); } }, escape: function () { var that = this; if (this.isShown && this.options.keyboard) { if (!this.$element.attr('tabindex')) this.$element.attr('tabindex', -1); this.$element.on('keyup.dismiss.modal', function (e) { e.which == 27 && that.hide(); }); } else if (!this.isShown) { this.$element.off('keyup.dismiss.modal') } }, hideWithTransition: function () { var that = this , timeout = setTimeout(function () { that.$element.off($.support.transition.end); that.hideModal(); }, 500); this.$element.one($.support.transition.end, function () { clearTimeout(timeout); that.hideModal(); }); }, hideModal: function () { var prop = this.options.height ? 'height' : 'max-height'; var value = this.options.height || this.options.maxHeight; if (value){ this.$element.find('.modal-body') .css('overflow', '') .css(prop, ''); } this.$element .hide() .trigger('hidden'); }, removeLoading: function () { this.$loading.remove(); this.$loading = null; this.isLoading = false; }, loading: function (callback) { callback = callback || function () {}; var animate = this.$element.hasClass('fade') ? 'fade' : ''; if (!this.isLoading) { var doAnimate = $.support.transition && animate; this.$loading = $('
      ') .append(this.options.spinner) .appendTo(this.$element); if (doAnimate) this.$loading[0].offsetWidth; // force reflow this.$loading.addClass('in'); this.isLoading = true; doAnimate ? this.$loading.one($.support.transition.end, callback) : callback(); } else if (this.isLoading && this.$loading) { this.$loading.removeClass('in'); var that = this; $.support.transition && this.$element.hasClass('fade')? this.$loading.one($.support.transition.end, function () { that.removeLoading() }) : that.removeLoading(); } else if (callback) { callback(this.isLoading); } }, focus: function () { var $focusElem = this.$element.find(this.options.focusOn); $focusElem = $focusElem.length ? $focusElem : this.$element; $focusElem.focus(); }, attention: function (){ // NOTE: transitionEnd with keyframes causes odd behaviour if (this.options.attentionAnimation){ this.$element .removeClass('animated') .removeClass(this.options.attentionAnimation); var that = this; setTimeout(function () { that.$element .addClass('animated') .addClass(that.options.attentionAnimation); }, 0); } this.focus(); }, destroy: function () { var e = $.Event('destroy'); this.$element.trigger(e); if (e.isDefaultPrevented()) return; this.$element .off('.modal') .removeData('modal') .removeClass('in') .attr('aria-hidden', true); if (this.$parent !== this.$element.parent()) { this.$element.appendTo(this.$parent); } else if (!this.$parent.length) { // modal is not part of the DOM so remove it. this.$element.remove(); this.$element = null; } this.$element.trigger('destroyed'); } }; /* MODAL PLUGIN DEFINITION * ======================= */ $.fn.modal = function (option, args) { return this.each(function () { var $this = $(this), data = $this.data('modal'), options = $.extend({}, $.fn.modal.defaults, $this.data(), typeof option == 'object' && option); if (!data) $this.data('modal', (data = new Modal(this, options))); if (typeof option == 'string') data[option].apply(data, [].concat(args)); else if (options.show) data.show() }) }; $.fn.modal.defaults = { keyboard: true, backdrop: true, loading: false, show: true, width: null, height: null, maxHeight: null, modalOverflow: false, consumeTab: true, focusOn: null, replace: false, resize: false, attentionAnimation: 'shake', manager: 'body', spinner: '', backdropTemplate: '
      ' }; $.fn.modal.Constructor = Modal; /* MODAL DATA-API * ============== */ $(function () { $(document).off('click.modal').on('click.modal.data-api', '[data-toggle="modal"]', function ( e ) { var $this = $(this), href = $this.attr('href'), $target = $($this.attr('data-target') || (href && href.replace(/.*(?=#[^\s]+$)/, ''))), //strip for ie7 option = $target.data('modal') ? 'toggle' : $.extend({ remote: !/#/.test(href) && href }, $target.data(), $this.data()); e.preventDefault(); $target .modal(option) .one('hide', function () { $this.focus(); }) }); }); }(window.jQuery); ; /** * UAlberta Utilities * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.Utilities = UAlberta.Sitecore.Utilities || (function ($) { 'use strict'; var WindowType = { Mobile: "mobile", Tablet: "tablet", Desktop: "desktop", Highres: "high-resolution" }; var DateFormat = { Unix: "yyyy-MM-dd HH:mm:ss", UnixDateOnly: "yyyy-MM-dd", Long: "MMMM d, yyyy h:mm a", LongNoYear: "MMMM d h:mm a", Short: "MMMM d, yyyy", ShortNoYear: "MMMM d", TimeOnly: "h:mm a", Timestamp: "timestamp" }; // call a function after an interval has passed var delay = (function () { var timers = {}; return function (callback, time, id) { if(timers[id]) { clearTimeout(timers[id]); } timers[id] = setTimeout(callback, time); }; })(); // get the window type function getWindowType() { var width = $(window).width(); if(width < 690) { return WindowType.Mobile; } if(width < 980) { return WindowType.Tablet; } if(width < 1200) { return WindowType.Desktop; } return WindowType.Highres; } // get date from json string function getDateFromJson(jsonString, format) { if(jsonString == undefined || format == undefined) { return ""; } var date = new Date(parseInt(jsonString.substr(6))).getTime(); if(format == DateFormat.Timestamp) { return date; } return $.format.date(date, format); } // multiselect button text function multiselectButtonText(options, select) { if (options.length == 0) { return 'Show All '; } else if (options.length > 2) { return options.length + ' selected '; } else { var selected = ''; options.each(function() { selected += $(this).text() + ', '; }); return selected.substr(0, selected.length -2) + ' '; } } return { WindowType: WindowType, DateFormat: DateFormat, Delay: delay, GetWindowType: getWindowType, GetDateFromJson: getDateFromJson, MultiselectButtonText: multiselectButtonText } })(jQuery); ; (function ($) { $.fn.DeviceImageScaling = function (options) { var defOptions = { smWidth: 480, mWidth: 690, tWidth: 980, dWidth: 1200, contentID: "layoutcontainer" }; defOptions = $.extend(defOptions, options); return this.each(function () { var vpWidth = $("#" + defOptions.contentID).width(), type = ""; if (vpWidth <= defOptions.smWidth) { type = "smallmobile"; } else if (vpWidth <= defOptions.mWidth) { type = "mobile"; } else if (vpWidth <= defOptions.tWidth) { type = "tablet"; } else { type = "desktop"; } // Modified below for IE6 compatibility if ($(this).attr("src") !== $(this).attr("data-imgsize-" + type)) { $(this).attr("src", $(this).attr("data-imgsize-" + type)); } }); }; })(jQuery);; // Build out the Name space if it doesn't all ready exist var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.EmergencyMessage = function ($) { var _url = '/api/emergencymessage.json', _containerSelector = '#emergencyMessage', _timeout = 90000; /* * Get Messages * Retrieves any emergency messages from the web service * * containerSelector: [String] The JQuery selector string of the DOM Element to place the message in * timeout: [Integer] The time in milliseconds to wait for the response as well as the delay before making the request again */ function getMessages(containerSelector, timeout) { // If the container selector is a string use the passed value if (typeof containerSelector == 'string') { _containerSelector = containerSelector; } // If the timeout is not a number use the default value of 90 seconds if (typeof timeout == 'number') { _timeout = timeout; } //Call the function and set up a repeating call to that function var messageInterval = setInterval(processRequest, _timeout); setTimeout(function () { clearInterval(messageInterval); }, 600000); processRequest(); } /* * Process Request * Makes the ajax call to the server */ function processRequest() { $.ajax({ type: 'GET', dataType: 'json', contentType: 'application/json', url: _url, timeout: _timeout, cache: false, success: ajaxSuccess, error: ajaxError }); } /* * Ajax Success * Processes the successful ajax call * * data: [Object] The returned object from the web service */ function ajaxSuccess(data) { var message = ''; if (data.MessageText != '') { if ($(_containerSelector).length <= 0) { $('header').before("
      "); } if (data.MessageTitle != '') { message = '

      ' + data.MessageTitle + '

        '; } message += '

      ' + data.MessageText + '

      '; $(_containerSelector).empty().html(message); } else { $(_containerSelector).remove(); } } /* * Ajax Error * Processes the error event during an ajax call * * data: [Object] The returned object from the web service */ function ajaxError(data) { } return { GetMessages: getMessages }; } (jQuery);; /** * Placeholder Processing * Author: Dean Vigoren - vigoren@ualberta.ca * * Adds placeholder text to inputs for browsers that do not support that attribute. * Requires a placeholder css class * * This is global functionality (why it's directly under the UAlberta name space) it is not specific to sitecore but for browser compatibility */ var UAlberta = UAlberta || {}; UAlberta.InputPlaceholders = function ($) { var _isPlaceholderSupported = 'placeholder' in document.createElement('input') && 'placeholder' in document.createElement('textarea'), _placeholderClass = 'placeholder'; function init(placeholderClass){ if(!_isPlaceholderSupported){ if(placeholderClass){ _placeholderClass = placeholderClass; } //Get the text areas and inputs that have placeholders but do not have the placeholder class $('input[placeholder], textarea[placeholder]').bind({ 'focus': clearPlaceholder, 'blur': addPlaceholder }).trigger('blur'); //Functionality for when enter is pressed on the search box or the search button is clicked the placeholder is cleared $('.search-query').keydown(function (a) { a = a || window.event; if (a.keyCode == 13 || a.which == 13) { $('.' + _placeholderClass).each(clearPlaceholder); } }); $('.global-search-btn').click(function () { $('.' + _placeholderClass).each(clearPlaceholder); }); //On form submit make sure to clear all placeholders $(document).delegate('form', 'submit',function(){ $('.' + _placeholderClass).each(clearPlaceholder); }); //Clear the placeholder when a page is reloaded $(window).bind('beforeunload',function(){ $('.' + _placeholderClass).each(clearPlaceholder); }); } } /* * Clear Placeholder * Removes the text from the input and removes the placeholder class */ function clearPlaceholder(){ var input = $(this); if(input.val() == input.attr('placeholder')){ input.val(''); input.removeClass(_placeholderClass); } } /* * Add Placeholder * Adds the placeholder text to the input and adds the placeholder class */ function addPlaceholder(){ var input = $(this); if(input.val() == '' || input.val() == input.attr('placeholder')){ input.addClass(_placeholderClass); input.val(input.attr('placeholder')); } else{ input.removeClass(_placeholderClass); } } return{ initialize: init } }(jQuery);; /** * UAlberta Global Search (Blade) * Author: Jason Kulatunga - jk17@ualberta.ca */ var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.GlobalSearch = (function ($) { function KeyValue(key, value) { this.key = key; this.value = value; } function search(options) { var value = jQuery(options.selector).val(); if (value == "") { return false; } options.query = escape(value); var params = []; params.push(new KeyValue("cx", options.googleId)); params.push(new KeyValue("q", options.query)); params.push(new KeyValue("cof", "FORID%3A11#1150")); var resultUrl = options.resultUrl; for (var ndx in params) { var param = params[ndx]; if (param && param.key && param.value) { resultUrl = updateQueryString(param.key, param.value, resultUrl); } } window.location.href = resultUrl; return false; }; function updateQueryString(key, value, url) { if (!url) url = window.location.href; var re = new RegExp("([?|&])" + key + "=.*?(&|#|$)", "gi"); if (url.match(re)) { if (value) return url.replace(re, '$1' + key + "=" + value + '$2'); else return url.replace(re, '$2'); } else { if (value) { var separator = url.indexOf('?') !== -1 ? '&' : '?', hash = url.split('#'); url = hash[0] + separator + key + '=' + value; if (hash[1]) url += '#' + hash[1]; return url; } else return url; } } function init(customOptions) { var options = {}; options.selector = '.search-query'; options.btnSelector = '.global-search-btn'; options.googleId = ''; options.query = ''; options.resultUrl = ''; //override defaults. options = $.extend({}, options, customOptions); if (!options.resultUrl || !options.selector || !options.googleId) { //if missing a required value, dont attach handler. return; } $(options.selector).keydown(function (a) { a = a || window.event; if (a.keyCode == 13 || a.which == 13) { a.preventDefault(); return search(options); } }); $(options.btnSelector).click(function (a) { a.preventDefault(); return search(options); }); } return { init: init } })(jQuery);; /** * UAlberta Sitecore Page Load * Script that is run on every page load to provide certain site wide functionality */ // All functionality that needs to be called on dom ready $(document).ready(function () { //Setting Global Variables var winHeight = $(window).height(), headHeight = $('header').height(), footerHeight = $('footer').height(), bodyMinHeight = winHeight - (headHeight + footerHeight + 20), navTitle = $('#main-nav .navigation-toggle span'); $('.content-wrapper').css('min-height', bodyMinHeight + 'px'); $('.heading-link').tooltip(); // navigation $('.nav-toggle').on('click', function (e) { $(this).parent().toggleClass('expanded'); $(this).parent().parent().toggleClass('nav-expand'); e.stopPropagation(); return false; }); $("header .navigation-toggle").on('click', function (e) { $(this).toggleClass('collapsed'); $('header .nav-wrapper').toggleClass('on'); $('header .nav-wrapper').trigger('classToggled', 'on'); e.stopPropagation(); return false; }); $('header .nav-wrapper').on('classToggled', function (e, className) { navTitle.html($(this).hasClass(className) ? 'Hide Navigation' : 'Show Navigation'); }); // Process all of the images on the page to load the correct resolution for the screen size $('img').DeviceImageScaling(); $(window).resize(function () { $('img').DeviceImageScaling(); }); // Processes the Emergency messaging call to check for any emergency messages to be displayed UAlberta.Sitecore.EmergencyMessage.GetMessages(); //run the collapse plugin for Bootstrap. Initializes all collapsible elements $(".collapse").collapse(); //Set up input placeholders for browsers that do not support them UAlberta.InputPlaceholders.initialize(); }); //Index of functionality for Older IE Versions if (!Array.prototype.indexOf) { Array.prototype.indexOf = function (elt /*, from*/) { var len = this.length >>> 0; var from = Number(arguments[1]) || 0; from = (from < 0) ? Math.ceil(from) : Math.floor(from); if (from < 0) from += len; for (; from < len; from++) { if (from in this && this[from] === elt) return from; } return -1; }; } // make sure the sidebar does not extend past content area on desktop view $(document).ready(function () { var contentContainerLandingPage, contentContainerFacultyHome = null; var nudgeOffset = 110; if ($('.content-wrapper').hasClass('landing-page')) { contentContainerLandingPage = $('.content-wrapper.landing-page'); } if ($('.content-wrapper').hasClass('faculty-home')) { contentContainerFacultyHome = $('.content-wrapper.faculty-home'); } function resizeContainer() { var newHeight = ($('.sidebar').height() + nudgeOffset) + 'px'; if ($(window).width() > 979 && contentContainerLandingPage) { contentContainerLandingPage.css('min-height', newHeight); } if ($(window).width() > 689 && contentContainerFacultyHome) { contentContainerFacultyHome.css('min-height', newHeight); } }; resizeContainer(); $(window).resize(resizeContainer); });; /** * UAlberta Athletics Game List * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.AthleticsGameList = UAlberta.Sitecore.AthleticsGameList || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { serviceUrl: "", // the url of the games service displayLimit: 8, // the maximum number of games to show // constants Constants: { // program type ProgramType: { Bears: 1, Pandas: 2, Athletics: 3 } } }, Utils = { // get the program type name getProgramType: function (programId) { switch(programId) { case Data.Constants.ProgramType.Bears: return "bears"; break; case Data.Constants.ProgramType.Pandas: return "pandas"; break; default: return "athletics"; break; } } }, AJAX = { // get games getGames: function () { // get data $.ajax({ dataType: "json", error: AJAX.Events.error, success: AJAX.Events.success, url: Data.serviceUrl + "&limit=" + Data.displayLimit }); }, Events: { error: function () { Interface.showError(); }, success: function (data) { Interface.showGames(data); } } }, Interface = { container: [], // setup the interface setup: function (containerId) { // store the list Interface.container = $("#" + containerId); }, // show the games showGames: function(games) { // remove loader Interface.container.find("li:first").remove(); // save bottom row var bottomRow = Interface.container.html(); // if no games, show message if(games.length == 0) { Interface.container.html("
    • There are no games to display.
      • " + bottomRow); return; } Interface.container.html(""); for(var i in games) { var game = games[i]; // get game markup strings var completedStr = game.Completed ? "played-game" : "upcoming-game"; var isHomeGame = game.HomeTeam.IsUAlberta; var teamStr = Utils.getProgramType(isHomeGame ? game.HomeTeam.Program.ID : game.AwayTeam.Program.ID); var teamString = (isHomeGame ? (game.HomeTeam.Name == null ? "" : (game.HomeTeam.Name + " ")) : (game.AwayTeam.Name == null ? "" : (game.AwayTeam.Name + " "))); var opponentString = game.IsEvent ? game.EventName : (isHomeGame ? "vs " + game.AwayTeam.Name : "@ " + game.HomeTeam.Name); var isHomeWin = game.Completed ? game.HomeScore > game.AwayScore : false; var isTie = game.Completed && game.HomeScore == game.AwayScore; var isUAlbertaWin = isHomeGame && isHomeWin || !isHomeGame && !isHomeWin; var resultsStr = game.Completed && !game.IsEvent ? ("" + (isHomeWin ? game.HomeScore : game.AwayScore) + " - " + (isHomeWin ? game.AwayScore : game.HomeScore) + "" + (isTie ? "T" : (isUAlbertaWin ? (game.Overtime ? "OTW" : "W") : (game.Overtime ? "OTL" : "L"))) + "") : UAlberta.Sitecore.Utilities.GetDateFromJson(game.Start, UAlberta.Sitecore.Utilities.DateFormat.LongNoYear); // get link strings var gameUrl = game.GameUrl != null ? game.GameUrl : "#"; var teamUrl = game.TeamUrl != null ? game.TeamUrl : "#"; var recapUrl = game.RecapUrl != null ? " | Recap" : ""; var gameHtml = "
    • " + "
      " + "" + resultsStr + "" + (game.Completed ? "" + recapUrl + " | Boxscore" : "") + "
      " + "" + teamString + game.HomeTeam.Sport.Description + " " + opponentString + "" + "
      • "; Interface.container.append(gameHtml); } // add back on bottom row Interface.container.append(bottomRow); }, // show an error showError: function () { // remove loader Interface.container.find("li:first").remove(); // save bottom row var bottomRow = Interface.container.html(); // set error Interface.container.html("
    • An error occurred while loading the games. Please refresh the page to try again.
      • " + bottomRow); } } ; // instance initialization function init(containerId, serviceUrl, displayLimit) { Data.serviceUrl = serviceUrl; Data.displayLimit = displayLimit; Interface.setup(containerId); AJAX.getGames(); } return { Initialize: init }; } (jQuery)); } return { GetInstance: getInstance }; } ()); ; /** * UAlberta Athletics Game Slider * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.AthleticsGameSlider = UAlberta.Sitecore.AthleticsGameSlider || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { serviceUrl: "", // the url of the games service games: [], // the list of games that have been loaded currentDisplay: 0, // the current number of games to display on each slide // constants Constants: { // display type DisplaySize: { Small: 2, Medium: 4, Large: 6 }, // program type ProgramType: { Bears: 1, Pandas: 2, Athletics: 3 } } }, Utils = { // get the current display type getDisplayType: function () { var displayType; switch(UAlberta.Sitecore.Utilities.GetWindowType()) { case UAlberta.Sitecore.Utilities.WindowType.Small: case UAlberta.Sitecore.Utilities.WindowType.Mobile: displayType = Data.Constants.DisplaySize.Small; break; case UAlberta.Sitecore.Utilities.WindowType.Tablet: displayType = Data.Constants.DisplaySize.Medium; break; default: displayType = Data.Constants.DisplaySize.Large; break; } return displayType; }, // get the program type name getProgramType: function (programId) { switch(programId) { case Data.Constants.ProgramType.Bears: return "bears"; break; case Data.Constants.ProgramType.Pandas: return "pandas"; break; default: return "athletics"; break; } } }, AJAX = { loadingData: false, // get games getGames: function (afterGameId) { if(AJAX.loadingData) { return; } AJAX.loadingData = true; // get extra url params var extra = ""; if(afterGameId != undefined) { extra += "&aftergame=" + encodeURIComponent(afterGameId); } // get data $.ajax({ dataType: "json", error: AJAX.Events.error, success: function (data) { AJAX.Events.success(data, afterGameId > 0); }, url: Data.serviceUrl + "&limit=" + Data.currentDisplay + extra }); }, Events: { error: function () { Interface.showError(); AJAX.loadingData = false; }, success: function (data, addToEnd) { Interface.addGames(data, addToEnd, false); AJAX.loadingData = false; } } }, Interface = { slider: [], // setup the interface setup: function (containerId) { // get vars Data.currentDisplay = Utils.getDisplayType(); // create slider $("#" + containerId).flexslider({ animation: "slide", animationLoop: false, controlNav: false, slideshow: false, start: Interface.Events.sliderStart, after: Interface.Events.sliderAfter }); // setup resize logic $(window).resize(function() { UAlberta.Sitecore.Utilities.Delay(Interface.Events.resize, 300, containerId + "-resize"); }); }, // add games addGames: function(games, addToEnd, isRefresh) { // if no games, remove the loading slide if(games.length == 0 && !isRefresh) { // remove slider if there are no games to display at all if(Data.games.length == 0) { Interface.slider.remove(); } Interface.slider.removeSlide(addToEnd ? Interface.slider.count - 1 : 0); return; } var gamesHtml = []; var gamesList = []; var slideIndex = addToEnd ? Interface.slider.count - 1 : 1; var gameIndex = addToEnd ? Data.games.length : 0; var slideTo = slideIndex - 1; var firstLoad = Data.games.length == 0; for(var i in games) { var game = games[i]; // get game markup strings var completedStr = game.Completed ? "played-game" : "upcoming-game"; var isHomeGame = game.HomeTeam.IsUAlberta; var teamStr = Utils.getProgramType(isHomeGame ? game.HomeTeam.Program.Id : game.AwayTeam.Program.Id); var opponentString = game.IsEvent ? game.EventName : (isHomeGame ? "vs " + game.AwayTeam.Name : "@ " + game.HomeTeam.Name); var isHomeWin = game.Completed ? game.HomeScore > game.AwayScore : false; var isTie = game.Completed && game.HomeScore == game.AwayScore; var isUAlbertaWin = isHomeGame && isHomeWin || !isHomeGame && !isHomeWin; var resultsStr = game.Completed && !game.IsEvent ? ((isHomeWin ? game.HomeScore : game.AwayScore) + " - " + (isHomeWin ? game.AwayScore : game.HomeScore) + " " + (isTie ? "T" : (isUAlbertaWin ? (game.Overtime ? "OTW" : "W") : (game.Overtime ? "OTL" : "L")))) : UAlberta.Sitecore.Utilities.GetDateFromJson(game.Start, UAlberta.Sitecore.Utilities.DateFormat.ShortNoYear); var iconStr = game.HomeTeam.Sport.Description.toLowerCase().replace(/\s/g, "-"); // get link strings var gameUrl = game.GameUrl != null ? game.GameUrl : "#"; var teamUrl = game.TeamUrl != null ? game.TeamUrl : "#"; var newsUrl = game.RecapUrl != null && game.Completed ? "Recap | " : (game.PreviewUrl != null ? "Preview | " : ""); var gameHtml = "
      " + "
      " + " " + game.HomeTeam.Sport.Description + "" + "" + newsUrl + "Game Info" + "
      " + "" + opponentString + "" + "
      " + "

      " + resultsStr + "

      " + "
      " + "
      "; gamesHtml.push(gameHtml); gamesList.push(game); if(gamesHtml.length == Data.currentDisplay || i == games.length - 1) { Interface.slider.addSlide("
    • " + gamesHtml.join("") + "
      • ", slideIndex); gamesHtml.length = 0; slideIndex++; if(!addToEnd) { slideTo++; } if(!isRefresh) { for(var j in gamesList) { Data.games.splice(gameIndex, 0, gamesList[j]); gameIndex++; } gamesList.length = 0; } } } if(Interface.slider.vars != undefined) { var previousAnimationSpeed = Interface.slider.vars.animationSpeed; Interface.slider.vars.animationSpeed = 0; Interface.slider.flexAnimate(firstLoad ? 1 : Interface.slider.currentSlide > 0 ? slideTo + 1 : slideTo); Interface.slider.vars.animationSpeed = previousAnimationSpeed; } else { Interface.slider.flexAnimate(firstLoad ? 1 : slideTo); } }, // show an error showError: function () { Interface.slider.html("An error occurred while loading the games. Please refresh the page to try again."); }, Events: { // slider event for when the first slide is shown sliderStart: function (slider) { // save slider Interface.slider = slider; // get initial games AJAX.getGames(); }, // slider event after a slide has slid sliderAfter: function (slider) { // check for need to load previous games if(slider.animatingTo == 0 && slider.slides.first().hasClass("loading")) { AJAX.getGames(Data.games[0].Id * -1); } // check for need to load next games if(slider.animatingTo == slider.count - 1 && slider.slides.last().hasClass("loading")) { AJAX.getGames(Data.games[Data.games.length - 1].Id); } }, // window/viewport was resized resize: function () { // check for new display type var displayType = Utils.getDisplayType(); if(displayType != Data.currentDisplay) { Data.currentDisplay = displayType; // store current first game visible var currentGame = $(Interface.slider.slides[Interface.slider.currentSlide]).find(".score-module:first").data("id"); // ensure "loading" slides are in place (this prevents a bug) if(!Interface.slider.slides.first().hasClass("loading")) { Interface.slider.addSlide("
    • ", 0); } if(!Interface.slider.slides.last().hasClass("loading")) { Interface.slider.addSlide("
    • "); } // remove all game slides, then re-add them for(var i = Interface.slider.count - 1; i >= 0; i--) { if(!$(Interface.slider.slides[i]).hasClass("loading")) { Interface.slider.removeSlide(i); } } Interface.addGames(Data.games, false, true); // move to slide that has the current game Interface.slider.flexAnimate(Interface.slider.slides.find("[data-id=" + currentGame + "]").parent().index()); } } } } ; // instance initialization function init(containerId, serviceUrl) { Data.serviceUrl = serviceUrl; Interface.setup(containerId); } return { Initialize: init }; } (jQuery)); } return { GetInstance: getInstance }; } ()); ; /** * UAlberta Athletics Roster * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.AthleticsRoster = UAlberta.Sitecore.AthleticsRoster || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { serviceUrl: "" }, AJAX = { // get person getPerson: function (element, id) { $.ajax({ dataType: "json", error: function () { AJAX.Events.error(element); }, success: function (data) { AJAX.Events.success(element, data); }, url: Data.serviceUrl.replace("{id}", encodeURIComponent(id)) }); }, Events: { error: function (element) { Interface.showError(element); }, success: function (element, person) { Interface.showPerson(element, person); } } }, Interface = { historyCount: 0, // setup the interface setup: function (containerId) { // set all name links to open the bio container and get the person $("#" + containerId).find("li[data-id]").not("li[data-id$='-bio']").click(function() { var bioItem = $(this).next(); $(".roster li[data-id$='-bio']").not(bioItem).addClass("hidden"); if(bioItem.hasClass("loading")) { AJAX.getPerson($(this), $(this).data("id")); } bioItem.toggleClass("hidden"); window.location.hash = bioItem.hasClass("hidden") ? "" : $(this).attr("id"); }); // open preset person setTimeout(function() { Interface.expandPerson(containerId); }, 100); // hash change event $(window).hashchange(function () { Interface.expandPerson(containerId); }); }, // expand person expandPerson: function (containerId) { // check hash var hash = window.location.hash.replace("#", ""); if(hash == "") { // hide all bios $(".roster li[data-id$='-bio']").addClass("hidden"); } else { // check if the hash item is hidden if($("#" + containerId).find("#" + hash).next().hasClass("hidden")) { // simulate click on the hash item $("#" + containerId).find("#" + hash).click(); } } }, // show the person showPerson: function (element, person) { var bioItem = element.next(); bioItem.toggleClass("loading"); var html = ""; // image if(person.HasPhoto) { html += "" + person.FirstName + " " + person.LastName + ""; } // fields html += "
        "; html += Interface.addField("Position", person.Position); html += Interface.addField("Height", person.Height); html += Interface.addField("Eligibility", person.Eligibility); html += Interface.addField("Faculty", person.Faculty); html += Interface.addField("Hometown", person.Hometown); html += Interface.addField("Last Team", person.PreviousTeam); html += Interface.addField("Experience", person.Years, " year(s)"); html += Interface.addField("Twitter", person.Twitter != undefined && person.Twitter != "" ? "@" + person.Twitter + "" : person.Twitter); html += Interface.addField("EMail", person.Email != undefined && person.Email != "" ? "" + person.Email + "" : person.Email); // add adopt url if(person.AdoptUrl != undefined && person.AdoptUrl != "") { html += "
      • Adopt This Athlete
        • "; } html += "
      "; // bio html += "
      " + person.Bio + "
      "; bioItem.html(html); }, // add field addField: function (label, value, extra) { if(extra == undefined) { extra = ""; } if(value != undefined && value != "") { return "
    • " + label + ": " + value + extra + "
      • "; } return ""; }, // show an error showError: function (element) { var bioItem = element.next(); bioItem.toggleClass("loading"); bioItem.html("An error occurred while obtaining the person. Please refresh the page and try again."); } } ; // instance initialization function init(containerId, serviceUrl) { Data.serviceUrl = serviceUrl; Interface.setup(containerId); } return { Initialize: init }; } (jQuery)); } return { GetInstance: getInstance }; } ()); ; /** * UAlberta Athletics Schedule * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.AthleticsSchedule = UAlberta.Sitecore.AthleticsSchedule || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { teams: [], // teams teamItems: [], // team items currentDate: "", // the current date games: [], // games teamId: [], // team to show schedule for // Constant values Constants: { // Calendar types CalendarTypes: { Day: "day", Month: "month" }, // Date postfix DatePostfix: "T00:00:00.000-00:00", // Games per page GamesPerPage: 10 } }, Utils = { // Left pad a string using the specified string up to the desired length padLeft: function (theString, padString, length) { return theString.toString().length < length ? Utils.padLeft(padString + theString, padString, length) : theString; }, // Get the value of a multilist widget getMultilistValue: function (obj) { return obj.multiselect("getSelected").val() || []; }, // Set the value of a multilist widget setMultilistValue: function (obj, value) { obj.val(value); obj.multiselect("refresh"); }, // Get the value of a datepicker widget getDatepickerValue: function (obj) { return obj.data("datepicker").getFormattedDate(); }, // Check if a date is before another date isDateBefore: function (value, checkDate) { var date = Date.parse(value.substr(0, 10)), beforeDate = Date.parse(checkDate.substr(0, 10)); if (isNaN(date)) { date = Date.parse($.format.date(value.substr(0, 10) + Data.Constants.DatePostfix, UAlberta.Sitecore.Utilities.DateFormat.Short)); beforeDate = Date.parse($.format.date(checkDate.substr(0, 10) + Data.Constants.DatePostfix, UAlberta.Sitecore.Utilities.DateFormat.Short)); } if (isNaN(date) || isNaN(beforeDate)) { return false; } return date <= beforeDate; } }, AJAX = { currentRequest: undefined, // the current AJAX xhr item // get games from server or cache if already pulled getGames: function (dateType, date) { // check if a request is already in progress if (AJAX.currentRequest != undefined) { // abort request and reset var AJAX.currentRequest.abort(); } // check if params not passed in dateType = dateType !== undefined ? dateType : Utils.getMultilistValue(Interface.calendarTypeControl); date = date !== undefined ? date : (dateType == Data.Constants.CalendarTypes.Month ? (Interface.monthVisible + "-01") : Utils.getDatepickerValue(Interface.calendarControl)); // get month and year from date var monthString = date.substr(0, 7); // show date string Interface.showDateText(dateType, date); // clear game list control and paging control Interface.gameListControl.html(""); Interface.gamePagingControl.html(""); // show loading spinner Interface.showLoading(); // check if games are already saved var request = { Month: monthString }; if (Data.games[monthString] == undefined) { // get extra service url string var serviceUrlExtra = ""; if (Data.teamId.length > 1) { serviceUrlExtra = "Program/" + Data.teamId[0] + "/Sport/" + Data.teamId[1] + "/"; } // get games for month from service AJAX.currentRequest = $.ajax({ cache: false, contentType: "application/json; charset=utf-8", data: $.toJSON(request), dataType: "json", error: AJAX.Events.error, success: function (data) { AJAX.Events.success(monthString, data); }, type: "POST", url: "/api/athletics/" + serviceUrlExtra + "games.json" }); } else { // get games from array Interface.showGames(Data.games[monthString]); } }, Events: { error: function () { Interface.gameListControl.html("

    • An error occurred while obtaining game/event information. Please refresh the page and try again.

      • "); AJAX.currentRequest = undefined; }, success: function (monthString, data) { Data.games[monthString] = data; Interface.showGames(data); AJAX.currentRequest = undefined; } } }, Interface = { containerId: "", // id of the container of the schedule calendarControl: [], // calendar control calendarTypeControl: [], // calendar type control teamListControl: [], // team list control dateTextControl: [], // selected date text control gameListControl: [], // game list control gamePagingControl: [], // game paging control monthVisible: "", // the month visible in the calendar control, gamesVisible: [], // the games that can be seen (based on filters), used for paging loadingSelector: "", // the selector for the loading spinner // setup the interface setup: function (containerId) { // get interface components Interface.containerId = containerId; Interface.calendarControl = $("#" + Interface.containerId + " .event-list-calendar-filter"); Interface.calendarTypeControl = $("#" + Interface.containerId + " .filter-day select"); Interface.teamListControl = $("#" + Interface.containerId + " .calendar-event select"); Interface.dateTextControl = $("#" + containerId + " .latest-news .filtered-by"); Interface.gameListControl = $("#" + containerId + " .event-list"); Interface.gamePagingControl = $("#" + containerId + " .events-pagination"); Interface.loadingSelector = "#" + containerId + " .events-loading"; // set default values Interface.calendarTypeControl.val(Data.Constants.CalendarTypes.Month); if (window.location.hash != "") { Interface.teamListControl.val(window.location.hash.replace("#", "").split(";")); } // create widgets Interface.calendarControl.datepicker({ format: "yyyy-mm-dd", todayHighlight: true }).on("changeMonth", Interface.Events.monthChanged).on("changeDate", Interface.Events.dateSelected); Interface.calendarTypeControl.multiselect({ onChange: Interface.Events.calendarTypeChanged }); Interface.teamListControl.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function (element) { window.location.hash = Utils.getMultilistValue(Interface.teamListControl).join(";"); Interface.Events.filterListChanged(); } }); // hash change event $(window).hashchange(function () { Utils.setMultilistValue(Interface.teamListControl, window.location.hash.replace("#", "").split(";")); AJAX.getGames(); }); // set stored values Interface.monthVisible = Utils.getDatepickerValue(Interface.calendarControl).substr(0, 7); }, // show date text showDateText: function (dateType, date) { var html = "| "; switch (dateType) { case Data.Constants.CalendarTypes.Day: html += $.format.date(date + " ", "ddd, MMMM d, yyyy"); break; case Data.Constants.CalendarTypes.Month: html += $.format.date(date + " ", "MMMM, yyyy"); break; } Interface.dateTextControl.html(html); }, // show games on page showGames: function (gameList) { // empty the viewable games list Interface.gamesVisible.length = 0; // process games for (var i in gameList) { var game = gameList[i]; // HACK: Ensure we are only processing actual games if (game.Id == undefined) { continue; } // fix game start date game.StartDate = UAlberta.Sitecore.Utilities.GetDateFromJson(game.Start, UAlberta.Sitecore.Utilities.DateFormat.ShortNoYear); game.StartTime = UAlberta.Sitecore.Utilities.GetDateFromJson(game.Start, UAlberta.Sitecore.Utilities.DateFormat.TimeOnly); game.StartUnix = UAlberta.Sitecore.Utilities.GetDateFromJson(game.Start, UAlberta.Sitecore.Utilities.DateFormat.UnixDateOnly); // check filters if (!Interface.checkFilters(game)) { continue; } // add game to viewable list Interface.gamesVisible.push(game); } // display first page of games Interface.showPage(1); }, // show paging links showPaging: function (page) { // clear pages Interface.gamePagingControl.html(""); // check for empty list if (Interface.gamesVisible.length == 0) { return; } // add pages var activePage = parseInt(page); var maxPage = Math.ceil(Interface.gamesVisible.length / 10); for (var i = 1; i <= maxPage; i++) { // check for active page if (i == activePage) { Interface.gamePagingControl.append('
    • ' + i + '
      • '); } else { Interface.gamePagingControl.append('
    • ' + i + '
      • '); } } // add click handler Interface.gamePagingControl.find("a").click(Interface.Events.pageClicked); }, // show selected page of games showPage: function (page) { // clear games Interface.gameListControl.html(""); // check for empty list if (Interface.gamesVisible.length == 0) { // display "no games" message Interface.gameListControl.html('

    • No Games/Events Found

      • '); return; } // show games on selected page for (var i = (parseInt(page) - 1) * Data.Constants.GamesPerPage; i < Data.Constants.GamesPerPage * page; i++) { var game = Interface.gamesVisible[i]; // ensure game is valid if (game == undefined) { continue; } // create html components var isHomeGame = game.HomeTeam.IsUAlberta; var teamString = (isHomeGame ? (game.HomeTeam.Name == null ? "" : (game.HomeTeam.Name + " ")) : (game.AwayTeam.Name == null ? "" : (game.AwayTeam.Name + " "))); var isHomeWin = game.Completed ? game.HomeScore > game.AwayScore : false; var isTie = game.Completed && game.HomeScore == game.AwayScore; var isUAlbertaWin = isHomeGame && isHomeWin || !isHomeGame && !isHomeWin; var gameTitle = teamString + game.HomeTeam.Sport.Description + (game.IsEvent ? ": " + game.EventName : (isHomeGame ? " vs " + game.AwayTeam.Name : " @ " + game.HomeTeam.Name)); var dateHtml = game.StartDate + (game.StartTime == "12:00 AM" ? "" : " " + game.StartTime); var resultsStr = game.Completed && !game.IsEvent ? ((isHomeWin ? game.HomeScore : game.AwayScore) + " - " + (isHomeWin ? game.AwayScore : game.HomeScore) + "" + (isTie ? "T" : (isUAlbertaWin ? (game.Overtime ? "OTW" : "W") : (game.Overtime ? "OTL" : "L"))) + "") : ""; // create game html var html = '
    • ' + '' + '
      ' + '

      ' + gameTitle + '

      ' + '

      ' + dateHtml + '

      ' + (resultsStr != '' ? '

      ' + resultsStr + '

      ' : '') + '
      ' + '      ' + '
      • '; // add game to list Interface.gameListControl.append(html); } // show paging Interface.showPaging(page); }, // check to see if an game is part of filters checkFilters: function (game) { // check dates based on calendar type switch (Utils.getMultilistValue(Interface.calendarTypeControl)) { // check if the date selected is on the game date case Data.Constants.CalendarTypes.Day: if (Utils.getDatepickerValue(Interface.calendarControl) != game.StartUnix) { return false; } break; // month is skipped as we are pulling games based on the month, so show all for month type case Data.Constants.CalendarTypes.Month: break; } // check selected teams (none selected = select all) var selectedTeams = Utils.getMultilistValue(Interface.teamListControl); if (selectedTeams.length > 0 && $.inArray(game.HomeTeam.Program.Id + "-" + game.HomeTeam.Sport.Id, selectedTeams) < 0) { return false; } return true; }, // show the loading spinner showLoading: function () { // check if the spinner is already shown if ($(Interface.loadingSelector).length == 0) { Interface.gameListControl.append('
    • '); } }, Events: { monthChanged: function (event) { // set calendar type to month Utils.setMultilistValue(Interface.calendarTypeControl, Data.Constants.CalendarTypes.Month); // store visible month Interface.monthVisible = event.date.getUTCFullYear() + "-" + Utils.padLeft(event.date.getUTCMonth() + 1, "0", 2); AJAX.getGames(Data.Constants.CalendarTypes.Month, Interface.monthVisible + "-01"); }, dateSelected: function (event) { // set calendar type to day Utils.setMultilistValue(Interface.calendarTypeControl, Data.Constants.CalendarTypes.Day); var date = event.date.getUTCFullYear() + "-" + Utils.padLeft(event.date.getUTCMonth() + 1, "0", 2) + "-" + Utils.padLeft(event.date.getUTCDate(), "0", 2); AJAX.getGames(Data.Constants.CalendarTypes.Day, date); }, calendarTypeChanged: function (option) { AJAX.getGames(); }, filterListChanged: function () { AJAX.getGames(); }, pageClicked: function () { // show clicked page Interface.showPage($(this).html()); } } }; // instance initialization function init(containerId, teamId) { Interface.setup(containerId); Data.teamId = teamId.split("-"); // initialize data objects Data.teams = Interface.teamListControl.children().map(function () { return this.value; }).get(); Interface.teamListControl.children().each(function () { Data.teamItems[this.value] = this.text; }); Data.currentDate = Utils.getDatepickerValue(Interface.calendarControl); // get games AJAX.getGames(Utils.getMultilistValue(Interface.calendarTypeControl), Data.currentDate); } return { Initialize: init }; }(jQuery)); } return { GetInstance: getInstance }; }());; /** * UAlberta Data List */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.DataList = function($) { var _options = { ContainerId: '', ServiceUrl : '', CssClassPrefix : 'data', ShowDate: true, ShowDescription: true, ItemsPerPage: 20 }, _cookieValue = '', _currentPage = ''; function init(options) { $.extend(_options, options); _cookieValue = $.cookie('data-list-current-page'); _currentPage = (_cookieValue == '' || _cookieValue == null) ? 1 : _cookieValue; select(); } function select() { $.ajax({ type: 'GET', dataType: 'json', url: _options.ServiceUrl, timeout: 30000, success: ajaxSuccess, error: ajaxError }); } function ajaxSuccess(data) { if (data.length > 0) { for (var e = 0; e < data.length; e++) { var className = '.' + _options.CssClassPrefix + '-module'; $(className).toggleClass('loading'); var item = data[e]; // First, create the list element var listElement = document.createElement('li'); // If the item has a link, wrap the title in it var titleHeading = document.createElement('h4'); // If the title is longer than X characters, truncate it and add an ellipsis var maxTitleLength = 30; var truncatedTitle; var title = item.Title.length > maxTitleLength, str = title ? item.Title.substr(0, maxTitleLength - 1) : item.Title; str = title ? str.substr(0, str.lastIndexOf(' ')) : str; truncatedTitle = title ? str + '...' : str; if (item.Link != '') { var link = document.createElement('a'); link.href = item.Link; link.innerHTML = truncatedTitle; titleHeading.appendChild(link); } else { titleHeading.innerHTML = truncatedTitle; } listElement.appendChild(titleHeading); // If a publication date is available and configured to // display, add it now. var dateString = item.Date.match(/\d+/); if (dateString != '' && _options.ShowDate) { var dateParagraph = document.createElement('p'); dateParagraph.className = 'date'; var dateInt = parseInt(dateString[0]); var d = new Date(dateInt); dateParagraph.innerHTML = d.toLocaleDateString(); listElement.appendChild(dateParagraph); } // If a description is availalble and configured to // display, add it if (item.Description != '' && _options.ShowDescription) { var descDiv = document.createElement('p'); descDiv.className = 'description'; descDiv.innerHTML = item.Description; listElement.appendChild(descDiv); } $(_options.ContainerId).append(listElement); } // If the list is greater than 15 items, paginate it if (data.length > _options.ItemsPerPage) { $('.data-list-navigation').jPages({ containerID: 'data-list', minHeight: '', startPage: _currentPage, perPage: _options.ItemsPerPage, first: 'first', previous: 'previous', next: 'next', last: 'last', startRange: 1, midRange: 5, endRange: 1, callback: function (pages, items) { $.cookie('data-list-current-page', pages.current, { expires: 1, path: '/' }); } }); } } } function ajaxError() { } return { Initialize: init }; }(jQuery);; /** * UAlberta Event * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.Event = UAlberta.Sitecore.Event || (function() { function getInstance() { return (function($) { 'use strict'; var Data = { event: {} // the event }, Interface = { // Setup the interface setup: function (containerId) { // set page title $("title").html($("title").html().trim().replace(/^Event/, Data.event.Title)); $("ul.breadcrumbs > li.bc-here").html(Data.event.Title); $("h1.page-title").html(Data.event.Title); // add click event to link $("#" + containerId + " .event-map-link").click(Interface.Events.mapLinkClicked); }, Events: { mapLinkClicked: function() { var event = Data.event; // ensure an event was actually added if(event.Title == undefined) { alert("No event was specified to be viewed on Campus Maps.\n\nPlease refresh the page and try again.") return; } // ensure hidden container exists if($("#hiddenFormContainer").length == 0) { $("body").append('
      '); } // add form to container and submit $("#hiddenFormContainer") .html("") .append($("
      ") .attr({ method: "POST", action: "http://www.campusmap.ualberta.ca", id: "hidForm", target: "_blank" }) .append($("").attr({ type: "hidden", name: "title", value: event.Title })) .append($("").attr({ type: "hidden", name: "desc", value: event.Description })) .append($("").attr({ type: "hidden", name: "location", value: event.Location })) .append($("").attr({ type: "hidden", name: "time", value: event.Date })) .append($("").attr({ type: "hidden", name: "category", value: event.Categories })) .append($("").attr({ type: "hidden", name: "faculty", value: event.Calendars })) .append($("").attr({ type: "hidden", name: "lat", value: event.PositionLat })) .append($("").attr({ type: "hidden", name: "lng", value: event.PositionLng })) .submit() ); } } } ; // instance initialization function init(containerId, event) { // initialize data objects Data.event = event; // setup interface Interface.setup(containerId); } return { Initialize: init }; }(jQuery)); } return { GetInstance: getInstance }; }()); ; /** * UAlberta Event List * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.EventList = UAlberta.Sitecore.EventList || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { calendars: [], // calendars calendarItems: [], // calendar items categoryItems: [], // category items currentDate: "", // the current date events: [], // events // Constant values Constants: { // Calendar types CalendarTypes: { Current: "current", Day: "day", Month: "month" }, // Date formats DateFormats: { Long: "MMM d, yyyy h:mm a", Short: "MMM d, yyyy", TimeOnly: "h:mm a" }, // Date postfix DatePostfix: "T00:00:00.000-00:00", // Events per page EventsPerPage: 10 } }, Utils = { // Left pad a string using the specified string up to the desired length padLeft: function (theString, padString, length) { return theString.toString().length < length ? Utils.padLeft(padString + theString, padString, length) : theString; }, // Get the value of a multilist widget getMultilistValue: function (obj) { return obj.multiselect("getSelected").val() || []; }, // Set the value of a multilist widget setMultilistValue: function (obj, value) { obj.val(value); obj.multiselect("refresh"); }, // Get the value of a datepicker widget getDatepickerValue: function (obj) { return obj.data("datepicker").getFormattedDate(); }, // Check if a date is in a date range isDateInRange: function (value, start, end) { var date = Date.parse(value.substr(0, 10)), startDate = Date.parse(start.substr(0, 10)), endDate = Date.parse(end.substr(0, 10)); if (isNaN(date)) { date = Date.parse($.format.date(value.substr(0, 10) + Data.Constants.DatePostfix, Data.Constants.DateFormats.Short)); startDate = Date.parse($.format.date(start.substr(0, 10) + Data.Constants.DatePostfix, Data.Constants.DateFormats.Short)); endDate = Date.parse($.format.date(end.substr(0, 10) + Data.Constants.DatePostfix, Data.Constants.DateFormats.Short)); } if (isNaN(date) || isNaN(startDate) || isNaN(endDate)) { return false; } return ((startDate <= date) && (date <= endDate)); }, // Check if a date is before another date isDateBefore: function (value, checkDate) { var date = Date.parse(value.substr(0, 10)), beforeDate = Date.parse(checkDate.substr(0, 10)); if (isNaN(date)) { date = Date.parse($.format.date(value.substr(0, 10) + Data.Constants.DatePostfix, Data.Constants.DateFormats.Short)); beforeDate = Date.parse($.format.date(checkDate.substr(0, 10) + Data.Constants.DatePostfix, Data.Constants.DateFormats.Short)); } if (isNaN(date) || isNaN(beforeDate)) { return false; } return date <= beforeDate; }, // Format date range as a string formatDateRange: function (start, end) { var format = Data.Constants.DateFormats.Long; // check if only date is specified (all day event) if (start.length == 10) { // use short date format format = Data.Constants.DateFormats.Short; // make dates proper timestamps start += Data.Constants.DatePostfix; end += Data.Constants.DatePostfix; // check if only one day (return the date if so) if (start == end) { return $.format.date(start, format); } } // get formatted dates var startFormatted = $.format.date(start, format); var endFormatted = $.format.date(end, start.substr(0, 10) != end.substr(0, 10) ? format : Data.Constants.DateFormats.TimeOnly); return startFormatted + " - " + endFormatted; }, // Get array intersection arrayIntersect: function (arr1, arr2) { return $.map(arr1, function (val) { return $.inArray(val, arr2) < 0 ? null : val; }); }, // Add a click handler to items if one does not already exist addClickHandler: function (items, handler) { if (items.data("events") == undefined || items.data("events").click == undefined) { items.click(handler); } } }, AJAX = { currentRequest: undefined, // the current AJAX xhr item // get events from server or cache if already pulled getEvents: function (dateType, date) { // check if a request is already in progress if (AJAX.currentRequest != undefined) { // abort request and reset var AJAX.currentRequest.abort(); } // check if params not passed in dateType = dateType !== undefined ? dateType : Utils.getMultilistValue(Interface.calendarTypeControl); date = date !== undefined ? date : (dateType == Data.Constants.CalendarTypes.Month ? (Interface.monthVisible + "-01") : Utils.getDatepickerValue(Interface.calendarControl)); // get month and year from date var monthString = date.substr(0, 7); // show date string Interface.showDateText(dateType, date); // clear event list control and paging control Interface.eventListControl.html(""); Interface.eventPagingControl.html(""); // show loading spinner Interface.showLoading(); // check if events are already saved var request = { Calendars: Data.calendars, Month: monthString }; if (Data.events[monthString] == undefined) { // get events for month from service AJAX.currentRequest = $.ajax({ cache: false, contentType: "application/json; charset=utf-8", data: $.toJSON(request), dataType: "json", error: AJAX.Events.error, success: function (data) { AJAX.Events.success(monthString, data); }, type: "POST", url: "/api/events/eventlist.json" }); } else { // get events from array Interface.showEvents(Data.events[monthString]); } }, Events: { error: function () { Interface.eventListControl.html("

    • An error occurred while obtaining event information. Please refresh the page and try again.

      • "); AJAX.currentRequest = undefined; }, success: function (monthString, data) { Data.events[monthString] = data; Interface.showEvents(data); AJAX.currentRequest = undefined; } } }, Interface = { containerId: "", // id of the container of the event list isCondensedView: false, // condensed view or not hideCategories: false, // hide categories or not eventsPath: "", // the path of the events page calendarControl: [], // calendar control calendarTypeControl: [], // calendar type control calendarListControl: [], // calendar list control categoryListControl: [], // category list control dateTextControl: [], // selected date text control eventListControl: [], // event list control eventPagingControl: [], // event paging control monthVisible: "", // the month visible in the calendar control, eventsVisible: [], // the events that can be seen (based on filters), used for paging loadingSelector: "", // the selector for the loading spinner // setup the interface setup: function (containerId, isCondensedView, hideCategories, eventsPath) { // get interface components Interface.containerId = containerId; Interface.isCondensedView = isCondensedView; Interface.hideCategories = hideCategories; Interface.eventsPath = eventsPath; Interface.calendarControl = $("#" + Interface.containerId + " .event-list-calendar-filter"); Interface.calendarTypeControl = $("#" + Interface.containerId + " .filter-day select"); Interface.calendarListControl = $("#" + Interface.containerId + " .calendar-event select"); Interface.categoryListControl = $("#" + containerId + " .category-event select"); Interface.dateTextControl = $("#" + containerId + " .latest-news .filtered-by"); Interface.eventListControl = $("#" + containerId + " .event-list"); Interface.eventPagingControl = $("#" + containerId + " .events-pagination"); Interface.loadingSelector = "#" + containerId + " .events-loading"; // check for condensed view if (Interface.isCondensedView) { // change interface to condensed view $("#" + Interface.containerId + " .filter-cont .span6").removeClass("span6"); $("#" + Interface.containerId + " .news-heading").hide(); Data.Constants.EventsPerPage = 5; } // set default values Interface.calendarTypeControl.val(Data.Constants.CalendarTypes.Current); // create widgets Interface.calendarControl.datepicker({ format: "yyyy-mm-dd", todayHighlight: true }).on("changeMonth", Interface.Events.monthChanged).on("changeDate", Interface.Events.dateSelected); Interface.calendarTypeControl.multiselect({ onChange: Interface.Events.calendarTypeChanged }); Interface.calendarListControl.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: Interface.Events.filterListChanged }); Interface.categoryListControl.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: Interface.Events.filterListChanged }); // hide calendar list control if only one item in list if (Interface.calendarListControl.children().length == 1) { $("#" + Interface.containerId + " .calendar-event").hide(); } // check if we are to hide the categories if (Interface.hideCategories) { $("#" + Interface.containerId + " .category-event").hide(); } // set stored values Interface.monthVisible = Utils.getDatepickerValue(Interface.calendarControl).substr(0, 7); }, // show date text showDateText: function (dateType, date) { var html = "| "; switch (dateType) { case Data.Constants.CalendarTypes.Current: html += Interface.calendarTypeControl.find(":selected").html(); break; case Data.Constants.CalendarTypes.Day: html += $.format.date(date + " ", "ddd, MMMM d, yyyy"); break; case Data.Constants.CalendarTypes.Month: html += $.format.date(date + " ", "MMMM, yyyy"); break; } Interface.dateTextControl.html(html); }, // show events on page showEvents: function (eventList) { // empty the viewable events list Interface.eventsVisible.length = 0; // process events for (var i in eventList) { var event = eventList[i]; // check filters if (!Interface.checkFilters(event)) { continue; } // add event to viewable list Interface.eventsVisible.push(event); } // display first page of events Interface.showPage(1); }, // show paging links showPaging: function (page) { // clear pages Interface.eventPagingControl.html(""); // check for empty list if (Interface.eventsVisible.length == 0) { return; } // add pages var activePage = parseInt(page); var maxPage = Math.ceil(Interface.eventsVisible.length / 10); for (var i = 1; i <= maxPage; i++) { // check for active page if (i == activePage) { Interface.eventPagingControl.append('
    • ' + i + '
      • '); } else { Interface.eventPagingControl.append('
    • ' + i + '
      • '); } } // add click handler Interface.eventPagingControl.find("a").click(Interface.Events.pageClicked); }, // show selected page of events showPage: function (page) { // clear events Interface.eventListControl.html(""); // check for empty list if (Interface.eventsVisible.length == 0) { // display "no events" message Interface.eventListControl.html('

    • No Events Found

      • '); return; } // show events on selected page for (var i = (parseInt(page) - 1) * Data.Constants.EventsPerPage; i < Data.Constants.EventsPerPage * page; i++) { var event = Interface.eventsVisible[i]; // ensure event is valid if (event == undefined) { continue; } // create html components var dateHtml = Utils.formatDateRange(event.StartDate, event.EndDate), eventLinkHtml = event.Calendars == undefined || event.Calendars[0] == undefined || Data.calendarItems[event.Calendars[0]] == undefined ? "#" : Interface.eventsPath + Data.calendarItems[event.Calendars[0]].key + "/" + event.EventId, locationHtml = event.Location == undefined ? "" : event.Location; // create event html var html = '
    • ' + '' + '
      ' + '

      ' + event.Title + '

      ' + '

      ' + dateHtml + '

      ' + (Interface.isCondensedView ? '' : '

      ' + locationHtml + '

      ') + '
      ' + '      ' + '
      • '; // add event to list Interface.eventListControl.append(html); } // check for condensed view if (!Interface.isCondensedView) { // show paging Interface.showPaging(page); } else { // add show more events link Interface.eventListControl.append('
    • Show More Events
      • '); // hide paging list Interface.eventPagingControl.hide(); } }, // check to see if an event is part of filters checkFilters: function (event) { // skip invalid date events if (event.StartDate == undefined || event.EndDate == undefined) { return false; } // check dates based on calendar type switch (Utils.getMultilistValue(Interface.calendarTypeControl)) { // check if the date selected (current date) is on or before the event end date case Data.Constants.CalendarTypes.Current: if (!Utils.isDateBefore(Utils.getDatepickerValue(Interface.calendarControl), event.EndDate)) { return false; } break; // check if the date selected is between the event dates case Data.Constants.CalendarTypes.Day: if (!Utils.isDateInRange(Utils.getDatepickerValue(Interface.calendarControl), event.StartDate, event.EndDate)) { return false; } break; // month is skipped as we are pulling events based on the month, so show all for month type case Data.Constants.CalendarTypes.Month: break; } // check selected calendars (none selected = select all) var selectedCalendars = Utils.getMultilistValue(Interface.calendarListControl); var eventCalendars = event.Calendars == undefined ? [] : $.map(event.Calendars, function (val) { return val; }); if (selectedCalendars.length > 0 && Utils.arrayIntersect(selectedCalendars, eventCalendars).length == 0) { return false; } // check selected categories (none selected = select all) var selectedCategories = Utils.getMultilistValue(Interface.categoryListControl); var eventCategories = event.Categories == undefined ? [] : $.map(event.Categories, function (val) { return val; }); if (selectedCategories.length > 0 && Utils.arrayIntersect(selectedCategories, eventCategories).length == 0) { return false; } return true; }, // show the loading spinner showLoading: function () { // check if the spinner is already shown if ($(Interface.loadingSelector).length == 0) { Interface.eventListControl.append('
    • '); } }, Events: { monthChanged: function (event) { // set calendar type to month Utils.setMultilistValue(Interface.calendarTypeControl, Data.Constants.CalendarTypes.Month); // store visible month Interface.monthVisible = event.date.getUTCFullYear() + "-" + Utils.padLeft(event.date.getUTCMonth() + 1, "0", 2); AJAX.getEvents(Data.Constants.CalendarTypes.Month, Interface.monthVisible + "-01"); }, dateSelected: function (event) { // set calendar type to day Utils.setMultilistValue(Interface.calendarTypeControl, Data.Constants.CalendarTypes.Day); var date = event.date.getUTCFullYear() + "-" + Utils.padLeft(event.date.getUTCMonth() + 1, "0", 2) + "-" + Utils.padLeft(event.date.getUTCDate(), "0", 2); AJAX.getEvents(Data.Constants.CalendarTypes.Day, date); }, calendarTypeChanged: function (option) { // change calendar value if type changed to "current" if (option.val() == Data.Constants.CalendarTypes.Current) { Interface.calendarControl.datepicker("update", Data.currentDate); } AJAX.getEvents(); }, filterListChanged: function () { AJAX.getEvents(); }, pageClicked: function () { // show clicked page Interface.showPage($(this).html()); } } }; // instance initialization function init(containerId, isCondensedView, hideCategories, eventsPath) { Interface.setup(containerId, isCondensedView, hideCategories, eventsPath); // initialize data objects Data.calendars = Interface.calendarListControl.children().map(function () { return this.value; }).get(); Interface.calendarListControl.children().each(function () { Data.calendarItems[this.value] = { key: $(this).data("key"), name: this.text }; }); Interface.categoryListControl.children().each(function () { Data.categoryItems[this.value] = this.text; }); Data.currentDate = Utils.getDatepickerValue(Interface.calendarControl); // get events AJAX.getEvents(Utils.getMultilistValue(Interface.calendarTypeControl), Data.currentDate); } return { Initialize: init }; }(jQuery)); } return { GetInstance: getInstance }; }());; /** * UAlberta FMA Carousel * Author: Dean Vigoren - vigoren@ualberta.ca */ //References To Other Scripts //@reference jquery.flexslider-min.js // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.Feature = UAlberta.Sitecore.Feature || {}; UAlberta.Sitecore.Feature.Carousel = UAlberta.Sitecore.Feature.Carousel || (function () { function getInstance() { return (function ($) { function start(containerId, pauseOnHover, randomize) { $('#' + containerId + '.flexslider').flexslider({ animation: "slide", selector: ".slides > div.slide", pauseOnHover: pauseOnHover, randomize: randomize, slideshowSpeed: 12000 }); } return { Start: start }; } (jQuery)); } return { GetInstance: getInstance }; } ()); ; /** * UAlberta FMA Tabbed Slider * Author: Dean Vigoren - vigoren@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.Feature = UAlberta.Sitecore.Feature || {}; UAlberta.Sitecore.Feature.Tabbed = function ($) { function init() { $('.slide').addClass('fma-slide').removeClass('slide'); // init var fmaContainer = $('.fma-container'); var fmaSlides = fmaContainer.find('.fma-slide'); var fmaTabs = fmaContainer.parent().find('.fma-tabs li'); // setActive fmaTabs.click(function () { setActive($(this).index()); return false; }); fmaSlides.click(function () { setActive($(this).index()); return fmaSlides.eq(index).hasClass('fma-active'); }); fmaTabs.hover(function () { toggleHover($(this).index()); }, function () { toggleHover($(this).index()); }); fmaSlides.hover(function () { toggleHover($(this).index()); }, function () { toggleHover($(this).index()); }); var getSlidesWidth = function () { var slidesWidth = 0; fmaSlides.each(function () { slidesWidth += $(this).width(); }); return slidesWidth; }; var totalWidth = getSlidesWidth(); var setActive = function (i) { var leftPoint = fmaSlides.eq(i).position().left; var containerWidth = $('.fma-slide-wrapper').width(); var slidePosition = 0; fmaSlides.removeClass('fma-active'); fmaSlides.eq(i).addClass('fma-active'); fmaTabs.removeClass('fma-button-active'); fmaTabs.eq(i).addClass('fma-button-active'); if (i == 0) { $('.fma-slide-scroller').css('left', '0px'); } else if (i == (fmaSlides.length - 1)) { slidePosition = containerWidth - getSlidesWidth(); $('.fma-slide-scroller').css('left', slidePosition + 'px'); } else { slidePosition = ((containerWidth - fmaSlides.eq(i).width()) / 2) - leftPoint; $('.fma-slide-scroller').css('left', slidePosition + 'px'); } return false; }; var toggleHover = function (i) { fmaSlides.eq(i).toggleClass('fma-hover'); fmaTabs.eq(i).toggleClass('fma-button-hover'); return false; }; setActive(0); } return { Initialize: init }; } (jQuery);; /** * UAlberta Filterable Data List * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca * Based on code from Lane Olson - lane.olson@ualberta.ca */ (function ($) { $.fn.FilterableDataList = function (options) { // create settings, extending them with any options that were provided var Data = { id: "", settings: $.extend({ categoryWrapper: "", classPrefix: "filterable-list", filterTextboxIconClass: "icon-filter", filterTextboxText: "filter items", noResultsText: "Sorry, there are no items matching your filter.", resultsCategoryText: "Filtered Items" }, options) }, Utils = { getNewRandomId: function () { var newId = "filteredDataList_" + Math.floor((Math.random() * 1000) + 1); if ($("#" + newId).length > 0) { return Utils.getNewRandomId(); } return newId; } }, Methods = { addMarkup: function (widget) { var wrapper = Data.settings.categoryWrapper, prefix = Data.settings.classPrefix, icon = Data.settings.filterTextboxIconClass, textboxText = Data.settings.filterTextboxText, noResults = Data.settings.noResultsText, resultsCategory = Data.settings.resultsCategoryText; // add id to widget if needed and store id if (widget.attr("id") == "") { // add id widget.attr("id", Utils.getNewRandomId()); } Data.id = widget.attr("id"); widget // add filtering .append('
    • ' + '' + resultsCategory + '' + '' + '' + '
        ' + '
      • ' + '<' + wrapper + '>' + '
        • ' + '
      • ' + '

        ' + noResults + '

        ' + '
        • ' + '
      ' + '
      • ') // process categories .children("li") .addClass(prefix + "-category") .each(function () { // process items if (wrapper != "") { $(this).children("a") .wrap("<" + wrapper + "/>"); } $(this).children("ul") .addClass(prefix + "-items") .not("." + prefix + "-results") .addClass(prefix + "-searchable"); }) .first() .addClass(prefix + "-active"); }, addEvents: function (widget) { var wrapper = Data.settings.categoryWrapper, prefix = Data.settings.classPrefix; // add active class to link category when clicked widget.find("." + prefix + "-category > " + (wrapper == "" ? "a" : wrapper) + ", ." + prefix + "-category input").click(function () { widget.find("." + prefix + "-category").removeClass(prefix + "-active"); $(this).parent().addClass(prefix + "-active"); return false; }); // populate results with all links by default widget.find("." + prefix + "-result-title > " + (wrapper == "" ? "a" : wrapper)).html("Displaying all " + widget.find("." + prefix + "-searchable a").size() + " items. Begin typing to filter..."); widget.find("." + prefix + "-searchable a").each(function () { widget.find("." + prefix + "-results").append('
    • ' + $(this).parent().html() + "
      • "); }); widget.find("." + prefix + "-result-none").hide(); // live search plugin initialization widget.find("." + prefix + "-filter-field").search("#" + Data.id + " ." + prefix + "-searchable a", function (on) { // this happens on any keydown, keyup, keypress, or blur event on.all(function (results) { var size = results ? results.size() : 0; widget.find("." + prefix + "-result-title > " + (wrapper == "" ? "a" : wrapper)).html("Displaying " + size + " matches for "" + widget.find("." + prefix + "-filter-field").val().replace(/>/g, ">").replace(/ " + (wrapper == "" ? "a" : wrapper)).html("Displaying all " + widget.find("." + prefix + "-searchable a").size() + " links. Begin typing to filter..."); widget.find("." + prefix + "-result-item").remove(); widget.find("." + prefix + "-searchable a").each(function () { widget.find("." + prefix + "-results").append('
    • ' + $(this).parent().html() + "
      • "); }); widget.find("." + prefix + "-result-none").hide(); }); // this happens when there are no results base on the query on.empty(function () { widget.find("." + prefix + "-result-none").show(); widget.find("." + prefix + "-result-item").remove(); }); // this happens when there are results on.results(function (results) { widget.find("." + prefix + "-result-none").hide(); widget.find("." + prefix + "-result-item").remove(); results.each(function () { widget.find("." + prefix + "-results").append('
    • ' + $(this).parent().html() + "
      • "); }); }); }); } } ; return this.each(function () { Methods.addMarkup($(this)); Methods.addEvents($(this)); }); }; })(jQuery); ; /** * UAlberta Media Gallery * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.MediaGallery = UAlberta.Sitecore.MediaGallery || (function () { function getInstance() { return (function ($) { 'use strict'; // description object var Description = function () { this.value = "" }; Description.prototype.addValue = function (field, value) { if(Data.fieldsToShow.indexOf(field) != -1 && value.length > 0) { this.value = this.value + (this.value.length > 0 ? "
      " : "") + value; } }; var Data = { items: [], // items itemsPerPage: 9, // items per page presetCategories: [], // categories to always filter on presetType: "", // type to always filter on fieldsToShow: [], // fields to show // Constant values Constants: { // Media types MediaTypes: { Audio: "audio", Image: "image", Video: "video" } } }, Utils = { // Get the value of a multilist widget getMultilistValue: function (obj) { return obj.multiselect("getSelected").val() || []; }, // Set the value of a multilist widget setMultilistValue: function (obj, value) { obj.val(value); if(Utils.isMultilistCreated(obj)) { obj.multiselect("refresh"); } }, // check if a multilist has been created isMultilistCreated: function (obj) { return obj.next().has(".multiselect-container.dropdown-menu").length > 0; }, // Get array intersection arrayIntersect: function (arr1, arr2) { return $.map(arr1, function (val) { return $.inArray(val, arr2) < 0 ? null : val; }); } }, AJAX = { // get items from server getItems: function (folderId, orderBy) { // show loading spinner Interface.showLoading(); // get items from service AJAX.currentRequest = $.ajax({ error: AJAX.Events.error, success: AJAX.Events.success, url: "/api/mediagallery/folder/" + encodeURIComponent(folderId) + ".json?orderby=" + encodeURIComponent(orderBy) }); }, Events: { error: function () { Interface.itemsControl.html("

      An error occurred while obtaining item information. Please refresh the page and try again.

      "); }, success: function (data) { // store the items $(data).each(function(index, item) { // check preset categories and type var categoryCheck = Data.presetCategories.length == 0 || Utils.arrayIntersect($.map(item.Categories, function (val) { return val.Key; }), Data.presetCategories).length > 0; var typeCheck = Data.presetType == "" || item.Type == Data.presetType; if(categoryCheck && typeCheck) { Data.items[item.Id] = item; } }); Interface.showItems(); } } }, Interface = { containerId: "", // id of the container of the schedule categoryListControl: [], // category list control typeListControl: [], // type list control customListControl1: [], // custom list control 1 customListControl2: [], // custom list control 2 customListControl3: [], // custom list control 3 customListControl4: [], // custom list control 4 itemsControl: [], // items control itemPagingControl: [], // item paging control itemsVisible: [], // the items that can be seen (based on filters), used for paging loadingSelector: "", // the selector for the loading spinner // setup the interface setup: function (containerId) { // get interface components Interface.containerId = containerId; Interface.categoryListControl = $("#" + Interface.containerId + " .media-filter-category select"); Interface.typeListControl = $("#" + Interface.containerId + " .media-filter-type select"); Interface.customListControl1 = $("#" + Interface.containerId + " .media-filter-custom1 select"); Interface.customListControl2 = $("#" + Interface.containerId + " .media-filter-custom2 select"); Interface.customListControl3 = $("#" + Interface.containerId + " .media-filter-custom3 select"); Interface.customListControl4 = $("#" + Interface.containerId + " .media-filter-custom4 select"); Interface.itemsControl = $("#" + Interface.containerId + " .gallery-container"); Interface.itemPagingControl = $("#" + Interface.containerId + " .events-pagination"); Interface.loadingSelector = "#" + Interface.containerId + " .events-loading"; // set default values if(window.location.hash != "") { Interface.setDropdownsUsingHash(); } // create widgets Interface.categoryListControl.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function() { Interface.setHash(); Interface.Events.filtersChanged(); } }); Interface.typeListControl.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function() { Interface.setHash(); Interface.Events.filtersChanged(); } }); Interface.customListControl1.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function() { Interface.setHash(); Interface.Events.filtersChanged(); } }); Interface.customListControl2.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function() { Interface.setHash(); Interface.Events.filtersChanged(); } }); Interface.customListControl3.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function() { Interface.setHash(); Interface.Events.filtersChanged(); } }); Interface.customListControl4.multiselect({ buttonText: UAlberta.Sitecore.Utilities.MultiselectButtonText, onChange: function() { Interface.setHash(); Interface.Events.filtersChanged(); } }); // set up masonry Interface.itemsControl.masonry({ // options columnWidth: '.gallery-item', itemSelector: '.gallery-item', gutter: 15, transitionDuration: 0 }); // hash change event $(window).hashchange(function () { Interface.setDropdownsUsingHash(); Interface.showItems(); }); }, // show items on page showItems: function () { // empty the viewable items list Interface.itemsVisible.length = 0; // process games for (var i in Data.items) { var item = Data.items[i]; // HACK: Ensure we are only processing actual items if(item.Id == undefined) { continue; } // format item date item.DateFormatted = item.Date == undefined ? "" : item.DateFormatted || UAlberta.Sitecore.Utilities.GetDateFromJson(item.Date, UAlberta.Sitecore.Utilities.DateFormat.Short); // fix empty thumbnail and image url's if(item.ThumbnailImageUrl.length == 0) { item.ThumbnailImageUrl = "/Design/img/" + item.Type + ".png"; } // check filters if (!Interface.checkFilters(item)) { continue; } // add item to viewable list Interface.itemsVisible.push(item); } // display first page of games Interface.showPage(1); }, // show paging links showPaging: function (page) { // clear pages Interface.itemPagingControl.html(""); // check for empty list if (Interface.itemsVisible.length == 0) { return; } // add pages var activePage = parseInt(page); var maxPage = Math.ceil(Interface.itemsVisible.length / Data.itemsPerPage); for (var i = 1; i <= maxPage; i++) { // check for active page if (i == activePage) { Interface.itemPagingControl.append('
    • ' + i + '
      • '); } else { Interface.itemPagingControl.append('
    • ' + i + '
      • '); } } // add click handler Interface.itemPagingControl.find("a").click(Interface.Events.pageClicked); }, // show selected page of items showPage: function (page) { // hide items in order to prevent rendering flash Interface.itemsControl.css("visibility", "hidden"); // clear games Interface.itemsControl.html(""); // check for empty list if (Interface.itemsVisible.length == 0) { // display "no items" message Interface.itemsControl.html('

      No Items Found

      '); Interface.showPaging(page); return; } // show items on selected page for (var i = (parseInt(page) - 1) * Data.itemsPerPage; i < Data.itemsPerPage * page; i++) { var item = Interface.itemsVisible[i]; // ensure item is valid if (item == undefined) { continue; } // create description var description = new Description(); description.addValue("caption", item.Caption); description.addValue("duration", item.Duration); description.addValue("attribution", item.Attribution); // create item html var showTitle = Data.fieldsToShow.indexOf("title") != -1 && item.Title.length > 0; var showDate = Data.fieldsToShow.indexOf("date") != -1 && item.DateFormatted.length > 0; var showDescription = description.value.length > 0; var link = item.Link.length > 0 ? item.Link : "#"; var addData = item.Link.length == 0; var html = '' + '' + ((showTitle || showDescription) ? ('
      ' + (showTitle ? ('

      ' + item.Title + '

      ') : '') + (showDate ? ('

      ' + item.DateFormatted + '

      ') : '') + (showDescription ? ('

      ' + description.value + '

      ') : '') + '
      ') : '') + '      '; // add item to list Interface.itemsControl.append(html); } // initialize Masonry after all images have loaded imagesLoaded(Interface.itemsControl[0], function() { Interface.itemsControl.masonry('reloadItems'); Interface.itemsControl.masonry(); Interface.itemsControl.css("visibility", "visible"); }); // add script for items to load content Interface.itemsControl.find("a[data-id]").click(Interface.Events.itemClicked); // show paging Interface.showPaging(page); }, // check to see if an item is part of filters checkFilters: function (item) { // check selected categories (none selected = select all) var selectedCategories = Utils.getMultilistValue(Interface.categoryListControl); var itemCategories = $.map(item.Categories, function (val) { return val.Key; }); if (selectedCategories.length > 0 && Utils.arrayIntersect(selectedCategories, itemCategories).length == 0) { return false; } // check selected types (none selected = select all) var selectedTypes = Utils.getMultilistValue(Interface.typeListControl); if (selectedTypes.length > 0 && $.inArray(item.Type, selectedTypes) < 0) { return false; } // check selected custom field 1 (none selected = select all) var selectedCustom1 = Utils.getMultilistValue(Interface.customListControl1); if (selectedCustom1.length > 0 && Utils.arrayIntersect(selectedCustom1, item.CustomField1).length == 0) { return false; } // check selected custom field 2 (none selected = select all) var selectedCustom2 = Utils.getMultilistValue(Interface.customListControl2); if (selectedCustom2.length > 0 && Utils.arrayIntersect(selectedCustom2, item.CustomField2).length == 0) { return false; } // check selected custom field 3 (none selected = select all) var selectedCustom3 = Utils.getMultilistValue(Interface.customListControl3); if (selectedCustom3.length > 0 && Utils.arrayIntersect(selectedCustom3, item.CustomField3).length == 0) { return false; } // check selected custom field 4 (none selected = select all) var selectedCustom4 = Utils.getMultilistValue(Interface.customListControl4); if (selectedCustom4.length > 0 && Utils.arrayIntersect(selectedCustom4, item.CustomField4).length == 0) { return false; } return true; }, // show the loading spinner showLoading: function () { // check if the spinner is already shown if ($(Interface.loadingSelector).length == 0) { Interface.itemsControl.append(''); } }, // set dropdowns using hash value setDropdownsUsingHash: function () { var categories = []; var types = []; var custom1 = []; var custom2 = []; var custom3 = []; var custom4 = []; $(window.location.hash.replace(/^#/, "").split("#")).each(function () { var keys = this.split(";"); switch(keys.shift()) { case "category": categories = keys; break; case "type": types = keys; break; case Interface.customListControl1.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""): // custom field 1 custom1 = keys; break; case Interface.customListControl2.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""): // custom field 2 custom2 = keys; break; case Interface.customListControl3.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""): // custom field 3 custom3 = keys; break; case Interface.customListControl4.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""): // custom field 4 custom4 = keys; break; } }); Utils.setMultilistValue(Interface.categoryListControl, categories); Utils.setMultilistValue(Interface.typeListControl, types); Utils.setMultilistValue(Interface.customListControl1, custom1); Utils.setMultilistValue(Interface.customListControl2, custom2); Utils.setMultilistValue(Interface.customListControl3, custom3); Utils.setMultilistValue(Interface.customListControl4, custom4); }, // set the hash value setHash: function () { var hash = ""; // get categories var categories = Utils.getMultilistValue(Interface.categoryListControl).join(";"); if(categories.length > 0) { hash += "#category;" + categories; } // get types var types = Utils.getMultilistValue(Interface.typeListControl).join(";"); if(types.length > 0) { hash += "#type;" + types; } // custom 1 var custom1 = Utils.getMultilistValue(Interface.customListControl1).join(";"); if(custom1.length > 0) { var custom1Name = Interface.customListControl1.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""); hash += "#" + custom1Name + ";" + custom1; } // custom 2 var custom2 = Utils.getMultilistValue(Interface.customListControl2).join(";"); if(custom2.length > 0) { var custom2Name = Interface.customListControl2.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""); hash += "#" + custom2Name + ";" + custom2; } // custom 3 var custom3 = Utils.getMultilistValue(Interface.customListControl3).join(";"); if(custom3.length > 0) { var custom3Name = Interface.customListControl3.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""); hash += "#" + custom3Name + ";" + custom3; } // custom 4 var custom4 = Utils.getMultilistValue(Interface.customListControl4).join(";"); if(custom4.length > 0) { var custom4Name = Interface.customListControl4.siblings("h3").children().text().toLowerCase().replace(/\s/g, ""); hash += "#" + custom4Name + ";" + custom4; } window.location.hash = hash; }, Events: { // filters were changed, filter items filtersChanged: function () { Interface.showItems(); }, // a page was clicked on, change view to that page pageClicked: function () { // show clicked page Interface.showPage($(this).html()); }, // an item was clicked on, show details itemClicked: function () { var item = Data.items[$(this).data("id")]; // set title $("#videoModal .modal-header h3").text(item.Title); // check item type switch(item.Type) { case Data.Constants.MediaTypes.Audio: // hide iframe $("#videoModal .video-mod-container").hide(); // add custom audio markup var audioHtml = ''; $("#videoModal .modal-body").append(audioHtml); break; case Data.Constants.MediaTypes.Image: // hide iframe $("#videoModal .video-mod-container").hide(); // add custom image markup if(item.ImageUrl.length > 0) { var imageHtml = '
      ' + item.Title + '
      '; $("#videoModal .modal-body").append(imageHtml); } break; case Data.Constants.MediaTypes.Video: // no modal for mobile if ($(window).width() < 690) { window.location = item.VideoUrlMobile; return; } // set video iframe url $("#videoModal iframe").attr("src", item.VideoUrl + "&autoplay=1"); break; } // add custom description markup if(item.Description.length > 0) { $("#videoModal .modal-body").append("
      " + item.Description + "
      "); } } } } ; // instance initialization function init(containerId, folderId, itemsPerPage, presetCategories, presetType, fieldsToShow, orderBy) { Interface.setup(containerId); // set vars Data.itemsPerPage = itemsPerPage; Data.presetCategories = presetCategories.length > 0 ? presetCategories.split(";") : []; Data.presetType = presetType; Data.fieldsToShow = fieldsToShow.length > 0 ? fieldsToShow.split(";") : []; // get items AJAX.getItems(folderId, orderBy); } return { Initialize: init }; } (jQuery)); } return { GetInstance: getInstance }; } ()); ; /** * UAlberta News Archive * Author: Dean Vigoren - vigoren@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.News = UAlberta.Sitecore.News || {}; UAlberta.Sitecore.News.Archive = function ($) { var _options = { ServiceUrl: "", ItemsPerPage: 10, NumberOfPages: 1, PageLinksToShow: 10, ActivePage: 1, SearchTerm: "", Categories: "", StickySorting: false }, _prevHash = "", _intervalPrevHash = "", _paging = { pageChange: function (pageNumber) { if (pageNumber != _options.ActivePage) { _ajax.getArticleData(pageNumber); _paging.updatePageSelection(pageNumber); _options.ActivePage = pageNumber; $(".news-pagination > li").removeClass("active"); $("a[data-archive-page = '" + pageNumber + "']").parent().addClass("active"); _hashtag.updateHash(pageNumber); } }, updatePageSelection: function (pageNumber) { if (_options.NumberOfPages > _options.PageLinksToShow) { var showFirstEllipse = (pageNumber >= (_options.PageLinksToShow / 2)), showLastEllipse = (pageNumber <= (_options.NumberOfPages - (_options.PageLinksToShow / 2))), pagesToShow = _options.PageLinksToShow; $(".news-pagination > li").addClass("hidden"); if (showFirstEllipse) { $(".news-pagination-break").first().removeClass("hidden"); $("a[data-archive-page = '1']").parent().removeClass("hidden"); pagesToShow -= 2; } if (showLastEllipse) { $(".news-pagination-break").last().removeClass("hidden"); $("a[data-archive-page = '" + _options.NumberOfPages + "']").parent().removeClass("hidden"); pagesToShow -= 2; } var beginningNumber = pageNumber - (pagesToShow / 2) + 1, endNumber = beginningNumber + pagesToShow - 1; if (beginningNumber <= 0) { beginningNumber = 1; endNumber = pagesToShow; } else if (beginningNumber >= (_options.NumberOfPages - pagesToShow)) { beginningNumber = _options.NumberOfPages - pagesToShow; endNumber = _options.NumberOfPages; } for (var i = beginningNumber; i <= endNumber; i++) { $("a[data-archive-page = '" + i + "']").parent().removeClass("hidden"); } } } }, _search = { preformSearch: function () { var url = document.location.search.substr(1).split('&'), value = encodeURI($("#search").val()); if (url == '') { document.location.search = '?search=' + value; } else { var i = url.length; var x; while (i--) { x = url[i].split('='); if (x[0] == 'search') { x[1] = value; url[i] = x.join('='); break; } } if (i < 0) { url[url.length] = ['search', value].join('='); } document.location.search = url.join('&'); } } }, _hashtag = { updateHash: function (newHash) { _prevHash = window.location.hash; window.location.hash = newHash; }, back: function () { window.location.hash = window.location.hash == _prevHash ? "" : _prevHash; }, urlInit: function () { var h = window.location.hash.replace(/#/g, ""); if (h != "") { $(".news-pagination-item[data-archive-page = '" + h + "']").click(); } } }, _ajax = { getArticleData: function (pageNumber) { $.ajax({ type: "GET", url: _options.ServiceUrl + "?pagesize=" + _options.ItemsPerPage + "&page=" + pageNumber + "&search=" + _options.SearchTerm + "&categories=" + _options.Categories + "&stickysorting=" + _options.StickySorting, dataType: "json", contentType: "application/json", timeout: 1000, success: _ajax.ajaxSuccess, error: _ajax.ajaxError }); }, ajaxSuccess: function (data) { if (!data) { data = []; } var newList = ''; for (var i = 0; i < data.length; i++) { var imgHtml = ''; if (data[i].SImage != '') { imgHtml = '
      '; } newList += '
    • ' + imgHtml + '

      ' + data[i].Title + '

      ' + data[i].Date + '

      ' + data[i].Description + '

      • '; } if (newList == '') { newList = '
    • There was an error retrieving the news articles.
      • '; } $('.news-archive-list').html(newList); }, ajaxError: function () { } }; function init(options) { _options = $.extend(_options, options); $(".news-pagination-item[data-archive-page]").click(function () { _paging.pageChange($(this).attr("data-archive-page")); }); $(".news-pagination-item[data-archive-page]").parent().first().addClass('active'); //Search Stuff $("#searchButton").click(function (a) { a.preventDefault(); var value = $("#search").val(); if (value != "" && value != $("#search").attr("placeholder")) { _search.preformSearch(); } }); $("#search").keydown(function (a) { a = a || window.event; if (a.keyCode == 13 || a.which == 13) { a.preventDefault(); $("#searchButton").click(); } }); //Set search value $("#search").val(_options.SearchTerm); //Hashtags for pages _hashtag.urlInit(); } return { Initialise: init }; }(jQuery);; // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.News = UAlberta.Sitecore.News || {}; UAlberta.Sitecore.News.Article = (function ($) { function init() { // Check the image size, and float it if it's small var img = $(".image-caption-container:first img"); if (img.length) { $("") // Make in memory copy of image to avoid css issues .attr("src", $(img).attr("src").split("?")[0]) .load(function () { if (this.width < 350) { $('.frame').css({ 'float': 'right', 'width': '50%', 'margin-left': '1em' }); } }); } // Grab links from the article for related links var storyLinks = $('article .story p a'); if (storyLinks.length) { storyLinks.each(function () { $('#related-links').append('
    • ' + $(this).html() + '
      • '); }); } // Fetch Top Stories // -------------------- var newsEl = $('#top-stories'); $.getJSON('https://sc3-cdn.ualberta.ca/api/news/headlines.jsonp?callback=?', function (data) { newsEl.removeClass('loading'); for (var i = 0; i < data.length; i++) { newsEl.append('
    • ' + data[i].Title + '
      • '); } } ); // Fix Videos (Temporary, needs to be fixed) // ------------------ $('.story iframe').css('width', '100%'); } return { Initialise: init }; })(jQuery); ; /** * UAlberta Graduate Program Search Functionality * Author: Dean Vigoren - vigoren@ualberta.ca * Edited: Kyle Schmidt - kyle.schmidt@ualberta.ca (Sept 2014) */ // Build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.SearchGraduateProgram = function ($) { var _departmentList = new Dictionary(), _facultyList = new Dictionary(), _intervalPrevHash = "", _urlType = null, _utils = { getFlatTextValue: function (obj) { var strings = ""; for(var i in obj) { if(!obj.hasOwnProperty(i)) { continue; } if(typeof obj[i] == "object") { strings += " " + _utils.getFlatTextValue(obj[i]); } else { // remove ID's if(obj[i][0] == "{" && obj[i][obj[i].length - 1] == "}") { continue; } strings += " " + obj[i].replace(/\n/g, " ").toLowerCase(); } } return strings; } }, _ajax = { getData: function (callback) { $.getJSON("/api/gradprograms", function (data) { _ajax.ajaxSuccess(data); callback(); }); }, ajaxSuccess: function (data) { if (data && data.length > 0) { for (var i = 0; i < data.length; i++) { var d = data[i], department = d.Department || "", faculties = d.Faculties || []; if (!_departmentList.containsKey(department)) { d._FullText = _utils.getFlatTextValue(d); _departmentList.add(department, d); } for (var x = 0; x < faculties.length; x++) { if (!_facultyList.containsKey(faculties[x].Name)) { _facultyList.add(faculties[x].Name, faculties[x]); } } } _main.populateFacultyDropDown(); _departmentList.sortKeys(); _facultyList.sortKeys(); } }, ajaxError: function () { } }, _navigation = { urlType: { Main: 1, Details: 2 }, parseUrl: function () { var anchor = window.location.hash; //Details page if (anchor != "") { return { urlType: _navigation.urlType.Details, value: anchor }; } return { urlType: _navigation.urlType.Main, value: "" }; }, urlChange: function () { _urlType = _navigation.parseUrl(); switch (_urlType.urlType) { case _navigation.urlType.Main: $("#gradDetailsWrapper").slideUp(500, function () { $("#gradSearchWrapper,#search-instructions").slideDown(500); _results.displayResults(); }); break; case _navigation.urlType.Details: $("#gradSearchWrapper,#search-instructions").slideUp(500, function () { $("#gradDetailsWrapper").slideDown(500); _details.displayDetails(_urlType); }); break; } }, updateHash: function(newHash){ window.location.hash = newHash; } }, _main = { populateFacultyDropDown: function () { var select = $("#sFacultyList"); for (var i = 0; i < _facultyList.length(); i++) { var data = _facultyList.lookup(_facultyList.lookupKey(i)); select.append(""); } select.change(function () { _results.displayResults(); }); } }, _results = { displayResults: function () { var results = [], facultyValue = $("#sFacultyList").val(), searchValues = $.grep($("#gradSearchBox").val().trim().toLowerCase().split(' '), function(n) { return(n); }); resultLoop: for (var i = 0; i < _departmentList.length(); i++) { var key = _departmentList.lookupKey(i), data = _departmentList.lookup(key), degrees = "", faculties = "", x; // filter on search if (searchValues.length > 0) { for (x = 0; x < searchValues.length; x++) { if (data._FullText.indexOf(searchValues[x]) == -1) { continue resultLoop; } } } // filter by faculty for (x = 0; x < data.Faculties.length; x++) { if (facultyValue != "" && facultyValue != data.Faculties[x].ID) { continue; } if (faculties != "") { faculties += "
      "; } faculties += data.Faculties[x].Name; } if (faculties == "") { continue; } for (x = 0; x < data.Degrees.length; x++) { if (degrees != "") { degrees += ", "; } degrees += data.Degrees[x].Abbreviation; } results.push({ Department: data.Department, Degrees: degrees, Faculty: faculties, hash: data.ID.replace(/-|{|}/g, "") }); } var tableBody = $("#gradResultsTable > tbody"); tableBody.empty(); for (var i = 0; i < results.length; i++) { tableBody.append("" + results[i].Department + "" + results[i].Degrees + "" + results[i].Faculty + ""); } if (results.length == 0) { tableBody.append("No results found."); } } }, _details = { displayDetails: function (urlType) { var id = urlType.value.replace("#", ""), item = null, faculties = "", degrees = "", i; for (i = 0; i < _departmentList.length(); i++) { var key = _departmentList.lookupKey(i), data = _departmentList.lookup(key); if (data.ID.replace(/-|{|}/g, "") == id) { item = data; break; } } for (i = 0; i < item.Degrees.length; i++) { degrees += "
    • " + item.Degrees[i].Name + "
      • "; } for (i = 0; i < item.Faculties.length; i++) { if (faculties != "") { faculties += "
      "; } faculties += item.Faculties[i].Name; } $("#gradDetail_department").html(item.Department); $("#gradDetail_faculty").html(faculties); $("#gradDetail_website").html(item.ProgramUrl).attr('href', item.ProgramUrl); $("#gradDetail_email").html(item.Email).attr('href', 'mailto:' + item.Email); $("#gradDetail_research").html(item.ResearchAreas); $("#gradDetail_degrees").html(degrees); item.GraduateSudentPositionsUrl != "" ? $("#gradDetail_studentPos").html(item.GraduateSudentPositionsUrl).attr('href', item.GraduateSudentPositionsUrl).parent().show() : $("#gradDetail_studentPos").parent().hide(); } }; function init() { $("#gradSearchWrapper,#search-instructions").show(); jQuery.easing.def = "easeInCubic"; // check for search via url if (window.location.hash.indexOf('search_') != -1) { $("#gradSearchBox").val(window.location.hash.replace(/^[#]?search_/g, '')); _navigation.updateHash(""); } _ajax.getData(_navigation.urlChange); if ("onhashchange" in window && (document.documentMode === undefined || document.documentMode > 7 )) { $(window).bind("hashchange", function (e) { _navigation.urlChange(); }); } else { setInterval(function () { var newHash = window.location.hash; if (_intervalPrevHash !== newHash) { _intervalPrevHash = newHash; _navigation.urlChange(); } },50); } $("#gradSearchBox").keyup(function (a) { a = a || window.event; if (a.keyCode == 13 || a.which == 13) { a.preventDefault(); return; } _results.displayResults(); }); } return { initialize: init, updateHash: _navigation.updateHash }; } (jQuery); /* * Dictionary Object * Created by Dean Vigoren - vigoren@ualberta.ca */ function Dictionary() { this.keys = new Array(); this.data = new Array(); } window['Dictionary'] = Dictionary; Dictionary.prototype.add = function () { for (var c = 0; c < arguments.length; c += 2) { this.data[arguments[c]] = arguments[c + 1]; this.keys[this.keys.length] = arguments[c]; } }; Dictionary.prototype.lookup = function (key) { return (this.data[key]); }; Dictionary.prototype.length = function () { return this.keys.length; }; Dictionary.prototype.lookupKey = function (index) { return this.keys[index]; }; Dictionary.prototype.containsKey = function(key) { return !!(this.keys.indexOf(key) > -1); }; Dictionary.prototype.sortKeys = function () { this.keys.sort(); };; /** * UAlberta Teaser Data List * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.TeaserDataList = UAlberta.Sitecore.TeaserDataList || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { // options options: { isInSidebar: false, cssClassPrefix: "", showDescriptions: false, showDate: false, showImages: false, showSource: false, displayLimit: 5 } }, AJAX = { // get items from the feed getItems: function (feedUrl) { $.ajax({ cache: false, dataType: "json", error: AJAX.Events.error, success: AJAX.Events.success, url: "/api/news/convertfeed.json?feed=" + encodeURIComponent(feedUrl) }); }, Events: { error: function () { Interface.itemList.find(".loading").remove(); Interface.itemList.prepend("

    • An error occurred while obtaining the item information. Please refresh the page and try again.

      • "); }, success: function (data) { Interface.showItems(data.Items); } } }, Interface = { itemList: [], // the item list // setup the interface setup: function (containerId) { Interface.itemList = $("#" + containerId + " > ul"); }, // show the items showItems: function (items) { Interface.itemList.find(".loading").remove(); var bottomRow = Interface.itemList.find(".bottom-row"); var bottomRowHtml = $(bottomRow).clone().wrap('

      ').parent().html(); bottomRow.remove(); for (var i = 0; i < items.length; i++) { if (i >= Data.options.displayLimit) { break; } Interface.addItem(items[i]); } Interface.itemList.append(bottomRowHtml); }, // add item to the list addItem: function (item) { // ensure valid item if (item.Title.Content == '') { return; } // get date and description html var linkHtml = '

      '; // set title linkHtml += '

      ' + item.Title.Content + '

      '; // get date if (Data.options.showDate) { linkHtml += '

      ' + Interface.getDate(item) + '

      '; } // show source if (Data.options.showSource && item.SourceFeed != null && item.SourceFeed.Title != null && item.SourceFeed.Title.Content != null) { var title = item.SourceFeed.Title.Content; if (item.SourceFeed.Links != null && item.SourceFeed.Links.length > 0) { title = '' + title + ''; } linkHtml += '

      ' + title + "

      "; } // show description if (Data.options.showDescriptions && (item.Summary.Content != null || item.Content.Content != null)) { var description = item.Summary.Content != null ? item.Summary.Content : item.Content.Content; linkHtml += '

      ' + description + '

      '; } linkHtml += '
      '; // set inner html var innerHtml = ''; var imageHtml = ''; if (Data.options.showImages) { for (var i = 0; i < item.Links.length; i++) { var link = item.Links[i]; if (link.MediaType != null && link.MediaType.toLowerCase().indexOf("image") !== -1) { imageHtml = '
      ' + '
      '; } } } // set link var link = Interface.getLink(item); if (link != '') { innerHtml = '' + imageHtml + linkHtml + ''; } else { innerHtml = imageHtml + linkHtml; } // set class var itemClass = ''; if (Data.options.cssClassPrefix != '') { itemClass += Data.options.cssClassPrefix + '-row'; } if (link == '') { itemClass += ' list-content-item'; } // add item Interface.itemList.append('' + innerHtml + ''); }, // get the item link getLink: function (item) { if (item.Links && item.Links.length > 0) { for (var i = 0; i < item.Links.length; i++) { var link = item.Links[i]; if (link.RelationshipType != null && link.RelationshipType.toLowerCase() == "alternate") { return link.Uri; } } return item.Links[0].Uri; } return ''; }, // get the item date getDate: function (item) { if (item.GoogleCalendarWhen != null) { return item.GoogleCalendarWhen; } return UAlberta.Sitecore.Utilities.GetDateFromJson(item.PublishDate, UAlberta.Sitecore.Utilities.DateFormat.Short); } }; // instance initialization function init(containerId, feedUrl, options) { Data.options = $.extend(Data.options, options); Interface.setup(containerId); AJAX.getItems(feedUrl); } return { Initialize: init }; }(jQuery)); } return { GetInstance: getInstance }; }());; (function ($) { $(document).ready(function () { //Add Modal markup, ensurers it is only added once. if ($("#videoModal").length == 0) { $("#mainform").append( ""); } $(document).on("click", ".video-modal-link", function () { var videoSrc = $(this).attr('href'); // no modal for mobile if ($(window).width() < 690) { window.location = $(this).attr('data-mobileurl'); return; } $('#videoModal iframe').attr('src', videoSrc); $('#videoModal .modal-header h3').text($(this).data('title')); }); $('#videoModal').bind('hidden', function () { // clear iframe $("#videoModal iframe").attr('src', ''); // reset other possible containers $("#videoModal .video-mod-container").show(); $("#videoModal .modal-description").remove(); $("#videoModal .modal-audio").remove(); $("#videoModal .modal-image").remove(); }); }); })(jQuery); ; /** * UAlberta Web Service Content * Author: Kyle Schmidt - kyle.schmidt@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.WebServiceContent = UAlberta.Sitecore.WebServiceContent || (function () { function getInstance() { return (function ($) { 'use strict'; var AJAX = { // get content from web service getContent: function (webServiceUrl) { // get content from web service $.ajax({ dataType: "jsonp", error: AJAX.Events.error, success: AJAX.Events.success, url: webServiceUrl }); }, Events: { error: function () { Interface.showContent("

      An error occurred while loading this content. Please refresh the page and try again.

      "); }, success: function (content) { Interface.showContent(content); } } }, Interface = { container: [], // the container loadingSelector: "", // the selector for the loading spinner // setup the interface setup: function (containerId) { // get interface components Interface.container = $("#" + containerId); }, // show content showContent: function (content) { Interface.container.html(content); } } ; // instance initialization function init(containerId, webServiceUrl) { Interface.setup(containerId); AJAX.getContent(webServiceUrl); } return { Initialize: init }; } (jQuery)); } return { GetInstance: getInstance }; } ());; /** * UAlberta Person Menu * Author: Daniel Sanabria */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.PersonLayout = function ($) { function init() { // init $(".people-section-nav .navigation-toggle").on('click', function (e) { $(this).toggleClass('collapsed'); $('.people-nav-cont').toggle(); $('.people-section-nav .navigation-toggle span').html(($(this).hasClass('collapsed') ? 'Show' : 'Hide') + ' Navigation'); e.stopPropagation(); return false; }); var navTabs = $('.people-nav li'); // setActive navTabs.click(function () { setActive($(this).index()); return false; }); var setActive = function (i) { navTabs.removeClass('active'); navTabs.eq(i).addClass('active'); $('.person-section').hide(); switch (i) { case 1: $('.ph-person-courses').show(); break; case 2: $('.ph-person-activities').show(); break; case 3: $('.ph-person-publications').show(); break; case 4: $('.ph-person-events').show(); break; default: $('.ph-person-home').show(); break; } return false; }; setActive(0); } return { Initialize: init }; }(jQuery);; /** * UAlberta Person Profile * Author: Daniel Sanabria - sanabria@ualberta.ca */ // build namespace var UAlberta = UAlberta || {}; UAlberta.Sitecore = UAlberta.Sitecore || {}; UAlberta.Sitecore.PersonProfile = UAlberta.Sitecore.PersonProfile || (function () { function getInstance() { return (function ($) { 'use strict'; var Data = { items: [], // items itemsPerPage: 10, // items per page // Constant values Constants: { // Media types Modules: { Publications: "Publications", Courses: "Courses", Scholarly: "Scholarly" } } }, AJAX = { // get content from web service getContent: function (webServiceUrl) { // get content from web service $.ajax({ dataType: "json", url: webServiceUrl, error: AJAX.Events.error, success: function (data) { AJAX.Events.success(data); } }); }, Events: { error: function (hr, textStatus, errorThrown) { Interface.showContent("

      An error occurred while loading this content. Please refresh the page and try again.
      Error: " + errorThrown.text + "

      "); }, success: function (data) { Data.items = data; Interface.showItems(); } } }, Interface = { module:"", itemsControl: [], // items control itemsPagingControl: [], // item paging control itemsVisible: [], // the items that can be seen (based on filters), used for paging // setup the interface setup: function (containerId, module) { // get interface components Interface.module = module; Interface.itemsControl = $("#" + containerId + " #control-items"); Interface.itemsPagingControl = $("#" + containerId + " .events-pagination"); }, // show items showItems: function () { var page = 1; // remove loader Interface.itemsControl.find("li:first").remove(); // if no records, show message if (Data.items.length == 0 || Data.items[0].Items == 0) { $("#nav" + Interface.module).hide(); return; } if (Interface.module == Data.Constants.Modules.Publications) { // empty the viewable items list Interface.itemsVisible.length = 0; //Sorting Items by Date Data.items[0].Items.sort(function (a, b) { var d1 = Date.parse(a.Date.length == 6 ? a.Date.insert(4, 0, "-") : a.Date.length == 8 ? a.Date.insert(4, 0, "-").insert(7, 0, "-") : a.Date); // "-" is added for parsing var d2 = Date.parse(b.Date.length == 6 ? b.Date.insert(4, 0, "-") : b.Date.length == 8 ? b.Date.insert(4, 0, "-").insert(7, 0, "-") : b.Date); return ((d1 < d2) ? 1 : ((d1 > d2) ? -1 : 0)); }); // process items for (var x in Data.items[0].Items) { var item = Data.items[0].Items[x]; // HACK: Ensure we are only processing actual items if (item.Id == undefined) { continue; } // add item to viewable list Interface.itemsVisible.push(item); } } Interface.showPage(page); }, renderItems: function(child, accordion) { var html = ""; if (accordion) { html += "
      • "; } else { html += "
        • "; } var dates = ""; var fieldsToExclude = ["Term", "Type", "Category"]; var booleanFields = ["Instructor", "Coordinator"]; for (var k in child.Fields) { if (child.Fields[k] != "" && fieldsToExclude.indexOf(k) == -1) { if (k.toLowerCase().indexOf("title") > -1) { html += "
        • " + child.Fields[k] + "
          • "; } else { if (booleanFields.indexOf(k) > -1) { html += "
        • " + k + "
          • "; } else { if (k.toLowerCase().indexOf("documents and images") > -1) { var links = Interface.getKeyLinkList(child.Fields[k]); if (links != "") { html += "
        • " + k + ":
          • " + links; } } else if (child.Fields[k]) { // Checking if date is valid if (child.Fields[k].length < 25 && (Interface.isValidDate(child.Fields[k]) || k.toLowerCase().indexOf("date") != -1)) { var vdate = child.Fields[k].length == 6 ? child.Fields[k].insert(4, 0, "-") : child.Fields[k].length == 8 ? child.Fields[k].insert(4, 0, "-").insert(7,0,"-") : child.Fields[k].substr(0, 10); if (k.toLowerCase().indexOf("start") != -1 || k.toLowerCase().indexOf("end") != -1) { if (k.toLowerCase().indexOf("start") != -1) dates = vdate; else if (k.toLowerCase().indexOf("end") != -1) { if (dates == "") dates = "\"" + vdate; else dates += " to " + vdate; html += "
        • " + dates.toString('MMMM d, yyyy') + "
          • "; } } else { html += "
        • " + k + ": " + vdate + "
          • "; } } else { if (k.toLowerCase().indexOf("author") > -1) { html += "
        • " + k + "(s): " + child.Fields[k] + "
          • "; } else { if (k.indexOf("Link") != -1) { var link = "" + child.Fields[k] + ""; html += "
        • " + k + ": " + link + "
          • "; } else { if (k.toLowerCase().indexOf("description") != -1 && Interface.module == Data.Constants.Modules.Publications) { html += "
        • " + k + ": " + child.Fields[k] + "
          • "; } else { html += "
        • " + k + ": " + child.Fields[k] + "
          • "; } } } } } } } } } html += "
        • "; return html; }, // show selected page of items showPage: function (page) { Interface.itemsControl.html(""); var accordion; var html = "
          "; for (var i in Data.items) { var parent = Data.items[i]; if (parent.Items != 0) { accordion = parent.Name != "Items"; if (accordion) { html += "
        • "; html += "" + parent.Name + ""; html += ""; html += "
            "; } else { html = "
              "; } if (Interface.module == Data.Constants.Modules.Publications) { for (var j = (parseInt(page) - 1) * Data.itemsPerPage; j < Data.itemsPerPage * page; j++) { if (parent.Items[j] == undefined) continue; html += Interface.renderItems(parent.Items[j], accordion); } } else { for (var k in parent.Items) { if (parent.Items[k] == undefined) continue; html += Interface.renderItems(parent.Items[k], accordion); } } if (accordion) { html += "
            "; } else { html += "
          "; } } } Interface.itemsControl.append(html); Interface.itemsControl.find(".accordion-list li:first-child").toggleClass('expanded'); Interface.itemsControl.find(".accordion-toggle").click(function () { $(this).parent().toggleClass('expanded'); return false; }); Interface.itemsControl.find(".publication-description").shorten({ showChars: 75, moreText: 'read more', lessText: 'read less' }); $('.people-section-nav').show(); $('.people-nav-cont').show(); // show paging Interface.showPaging(page); }, // show paging links showPaging: function (page) { // check for empty list if (Interface.itemsVisible.length == 0) { return; } var html = ""; // add pages var activePage = parseInt(page); var maxPage = Math.ceil(Interface.itemsVisible.length / Data.itemsPerPage); for (var i = 1; i <= maxPage; i++) { // check for active page if (i == activePage) { html += '
        • ' + i + '
          • '; } else { html += '
        • ' + i + '
          • '; } } Interface.itemsPagingControl.html(""); Interface.itemsPagingControl.append(html); // add click handler Interface.itemsPagingControl.find("a").click(Interface.pageClicked); }, // a page was clicked on, change view to that page pageClicked: function () { // show clicked page Interface.showPage($(this).html()); }, insert: String.prototype.insert = function( idx, rem, str ) { return (this.slice(0,idx) + str + this.slice(idx + Math.abs(rem))); }, isValidDate: function(dateStr) { var day, month, year; if (dateStr == null || dateStr.length < 8) return false; // Checks for the following valid date formats: YYYY-MM-DD // Also separates date into month, day, and year variables var datePat = /^(\d{4})([\/-])?(\d{1,2})\2?(\d{1,2})$/; var matchArray = dateStr.substring(0,10).match(datePat); // is the format ok? if (matchArray == null) { //console.log("Date must be in YYYY/MM/DD format (" + dateStr + ")"); return false; } year = matchArray[1]; // parse date into variables month = matchArray[3]; day = matchArray[4]; if (month < 1 || month > 12) { // check month range //alert("Month must be between 1 and 12"); return false; } if (day < 1 || day > 31) { //alert("Day must be between 1 and 31"); return false; } if ((month == 4 || month == 6 || month == 9 || month == 11) && day == 31) { //alert("Month " + month + " doesn't have 31 days!"); return false; } if (month == 2) { // check for february 29th var isleap = (year % 4 == 0 && (year % 100 != 0 || year % 400 == 0)); if (day > 29 || (day == 29 && !isleap)) { //alert("February " + year + " doesn't have " + day + " days!"); return false; } } return true; // date is valid }, getKeyLinkList: function(arrays) { var links = arrays.split('|'); var regex = /^\{\w{8}-\w{4}-\w{4}-\w{4}-\w{12}\}$/; var htmlLinks = ""; for (var item in links) { var itemId = links[item].replace(/\W/g, ''); if (regex.test(links[item])) { htmlLinks += "
        • Document
          • "; } else { var linksArray = eval('(' + links[item] + ')'); htmlLinks += "
        • " + linksArray.Title + "
          • "; } } return htmlLinks; }, error: function () { console.log(content); } }; // instance initialization function init(containerId, webServiceUrl, module) { Interface.setup(containerId, module); AJAX.getContent(webServiceUrl); } return { Initialize: init }; }(jQuery)); } return { GetInstance: getInstance }; }());; /* * jQuery Shorten plugin 1.1.0 * * Copyright (c) 2014 Viral Patel * http://viralpatel.net * * Licensed under the MIT license: * http://www.opensource.org/licenses/mit-license.php */ /* ** updated by Jeff Richardson ** Updated to use strict, ** IE 7 has a "bug" It is returning underfined when trying to reference string characters in this format ** content[i]. IE 7 allows content.charAt(i) This works fine in all modern browsers. ** I've also added brackets where they werent added just for readability (mostly for me). */ (function ($) { $.fn.shorten = function (settings) { "use strict"; var config = { showChars: 100, ellipsesText: "...", moreText: "more", lessText: "less", errMsg: null, force: false }; if (settings) { $.extend(config, settings); } if ($(this).data('jquery.shorten') && !config.force) { return false; } $(this).data('jquery.shorten', true); $(document).off("click", '.morelink'); $(document).on({ click: function () { var $this = $(this); if ($this.hasClass('less')) { $this.removeClass('less'); $this.html(config.moreText); $this.parent().prev().prev().show(); // shortcontent $this.parent().prev().hide(); // allcontent } else { $this.addClass('less'); $this.html(config.lessText); $this.parent().prev().prev().hide(); // shortcontent $this.parent().prev().show(); // allcontent } return false; } }, '.morelink'); return this.each(function () { var $this = $(this); var content = $this.html(); var contentlen = $this.text().length; if (contentlen > config.showChars) { var c = content.substr(0, config.showChars); if (c.indexOf('<') >= 0) // If there's HTML don't want to cut it { var inTag = false; // I'm in a tag? var bag = ''; // Put the characters to be shown here var countChars = 0; // Current bag size var openTags = []; // Stack for opened tags, so I can close them later var tagName = null; for (var i = 0, r = 0; r <= config.showChars; i++) { if (content[i] == '<' && !inTag) { inTag = true; // This could be "tag" or "/tag" tagName = content.substring(i + 1, content.indexOf('>', i)); // If its a closing tag if (tagName[0] == '/') { if (tagName != '/' + openTags[0]) { config.errMsg = 'ERROR en HTML: the top of the stack should be the tag that closes'; } else { openTags.shift(); // Pops the last tag from the open tag stack (the tag is closed in the retult HTML!) } } else { // There are some nasty tags that don't have a close tag like
          if (tagName.toLowerCase() != 'br') { openTags.unshift(tagName); // Add to start the name of the tag that opens } } } if (inTag && content[i] == '>') { inTag = false; } if (inTag) { bag += content.charAt(i); } // Add tag name chars to the result else { r++; if (countChars <= config.showChars) { bag += content.charAt(i); // Fix to ie 7 not allowing you to reference string characters using the [] countChars++; } else // Now I have the characters needed { if (openTags.length > 0) // I have unclosed tags { //console.log('They were open tags'); //console.log(openTags); for (j = 0; j < openTags.length; j++) { //console.log('Cierro tag ' + openTags[j]); bag += ''; // Close all tags that were opened // You could shift the tag from the stack to check if you end with an empty stack, that means you have closed all open tags } break; } } } } c = $('
          ').html(bag + '' + config.ellipsesText + '').html(); } else { c += config.ellipsesText; } var html = '
          ' + c + '
          ' + content + '
          ' + config.moreText + ''; $this.html(html); $this.find(".allcontent").hide(); // Hide all text $('.shortcontent p:last', $this).css('margin-bottom', 0); //Remove bottom margin on last paragraph as it's likely shortened } }); }; })(jQuery);; /** * @license * lodash 3.1.0 (Custom Build) * Build: `lodash compat -o ./lodash.js` * Copyright 2012-2015 The Dojo Foundation * Based on Underscore.js 1.7.0 * Copyright 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors * Available under MIT license */ ;(function() { /** Used as a safe reference for `undefined` in pre-ES5 environments. */ var undefined; /** Used as the semantic version number. */ var VERSION = '3.1.0'; /** Used to compose bitmasks for wrapper metadata. */ var BIND_FLAG = 1, BIND_KEY_FLAG = 2, CURRY_BOUND_FLAG = 4, CURRY_FLAG = 8, CURRY_RIGHT_FLAG = 16, PARTIAL_FLAG = 32, PARTIAL_RIGHT_FLAG = 64, REARG_FLAG = 128, ARY_FLAG = 256; /** Used as default options for `_.trunc`. */ var DEFAULT_TRUNC_LENGTH = 30, DEFAULT_TRUNC_OMISSION = '...'; /** Used to detect when a function becomes hot. */ var HOT_COUNT = 150, HOT_SPAN = 16; /** Used to indicate the type of lazy iteratees. */ var LAZY_FILTER_FLAG = 0, LAZY_MAP_FLAG = 1, LAZY_WHILE_FLAG = 2; /** Used as the `TypeError` message for "Functions" methods. */ var FUNC_ERROR_TEXT = 'Expected a function'; /** Used as the internal argument placeholder. */ var PLACEHOLDER = '__lodash_placeholder__'; /** `Object#toString` result references. */ var argsTag = '[object Arguments]', arrayTag = '[object Array]', boolTag = '[object Boolean]', dateTag = '[object Date]', errorTag = '[object Error]', funcTag = '[object Function]', mapTag = '[object Map]', numberTag = '[object Number]', objectTag = '[object Object]', regexpTag = '[object RegExp]', setTag = '[object Set]', stringTag = '[object String]', weakMapTag = '[object WeakMap]'; var arrayBufferTag = '[object ArrayBuffer]', float32Tag = '[object Float32Array]', float64Tag = '[object Float64Array]', int8Tag = '[object Int8Array]', int16Tag = '[object Int16Array]', int32Tag = '[object Int32Array]', uint8Tag = '[object Uint8Array]', uint8ClampedTag = '[object Uint8ClampedArray]', uint16Tag = '[object Uint16Array]', uint32Tag = '[object Uint32Array]'; /** Used to match empty string literals in compiled template source. */ var reEmptyStringLeading = /\b__p \+= '';/g, reEmptyStringMiddle = /\b(__p \+=) '' \+/g, reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g; /** Used to match HTML entities and HTML characters. */ var reEscapedHtml = /&(?:amp|lt|gt|quot|#39|#96);/g, reUnescapedHtml = /[&<>"'`]/g, reHasEscapedHtml = RegExp(reEscapedHtml.source), reHasUnescapedHtml = RegExp(reUnescapedHtml.source); /** Used to match template delimiters. */ var reEscape = /<%-([\s\S]+?)%>/g, reEvaluate = /<%([\s\S]+?)%>/g, reInterpolate = /<%=([\s\S]+?)%>/g; /** * Used to match ES template delimiters. * See the [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-template-literal-lexical-components) * for more details. */ var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g; /** Used to match `RegExp` flags from their coerced string values. */ var reFlags = /\w*$/; /** Used to detect named functions. */ var reFuncName = /^\s*function[ \n\r\t]+\w/; /** Used to detect hexadecimal string values. */ var reHexPrefix = /^0[xX]/; /** Used to detect host constructors (Safari > 5). */ var reHostCtor = /^\[object .+?Constructor\]$/; /** Used to match latin-1 supplementary letters (excluding mathematical operators). */ var reLatin1 = /[\xc0-\xd6\xd8-\xde\xdf-\xf6\xf8-\xff]/g; /** Used to ensure capturing order of template delimiters. */ var reNoMatch = /($^)/; /** * Used to match `RegExp` special characters. * See this [article on `RegExp` characters](http://www.regular-expressions.info/characters.html#special) * for more details. */ var reRegExpChars = /[.*+?^${}()|[\]\/\\]/g, reHasRegExpChars = RegExp(reRegExpChars.source); /** Used to detect functions containing a `this` reference. */ var reThis = /\bthis\b/; /** Used to match unescaped characters in compiled string literals. */ var reUnescapedString = /['\n\r\u2028\u2029\\]/g; /** Used to match words to create compound words. */ var reWords = (function() { var upper = '[A-Z\\xc0-\\xd6\\xd8-\\xde]', lower = '[a-z\\xdf-\\xf6\\xf8-\\xff]+'; return RegExp(upper + '{2,}(?=' + upper + lower + ')|' + upper + '?' + lower + '|' + upper + '+|[0-9]+', 'g'); }()); /** Used to detect and test for whitespace. */ var whitespace = ( // Basic whitespace characters. ' \t\x0b\f\xa0\ufeff' + // Line terminators. '\n\r\u2028\u2029' + // Unicode category "Zs" space separators. '\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000' ); /** Used to assign default `context` object properties. */ var contextProps = [ 'Array', 'ArrayBuffer', 'Date', 'Error', 'Float32Array', 'Float64Array', 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Math', 'Number', 'Object', 'RegExp', 'Set', 'String', '_', 'clearTimeout', 'document', 'isFinite', 'parseInt', 'setTimeout', 'TypeError', 'Uint8Array', 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap', 'window', 'WinRTError' ]; /** Used to fix the JScript `[[DontEnum]]` bug. */ var shadowProps = [ 'constructor', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable', 'toLocaleString', 'toString', 'valueOf' ]; /** Used to make template sourceURLs easier to identify. */ var templateCounter = -1; /** Used to identify `toStringTag` values of typed arrays. */ var typedArrayTags = {}; typedArrayTags[float32Tag] = typedArrayTags[float64Tag] = typedArrayTags[int8Tag] = typedArrayTags[int16Tag] = typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] = typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] = typedArrayTags[uint32Tag] = true; typedArrayTags[argsTag] = typedArrayTags[arrayTag] = typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] = typedArrayTags[dateTag] = typedArrayTags[errorTag] = typedArrayTags[funcTag] = typedArrayTags[mapTag] = typedArrayTags[numberTag] = typedArrayTags[objectTag] = typedArrayTags[regexpTag] = typedArrayTags[setTag] = typedArrayTags[stringTag] = typedArrayTags[weakMapTag] = false; /** Used to identify `toStringTag` values supported by `_.clone`. */ var cloneableTags = {}; cloneableTags[argsTag] = cloneableTags[arrayTag] = cloneableTags[arrayBufferTag] = cloneableTags[boolTag] = cloneableTags[dateTag] = cloneableTags[float32Tag] = cloneableTags[float64Tag] = cloneableTags[int8Tag] = cloneableTags[int16Tag] = cloneableTags[int32Tag] = cloneableTags[numberTag] = cloneableTags[objectTag] = cloneableTags[regexpTag] = cloneableTags[stringTag] = cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] = cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true; cloneableTags[errorTag] = cloneableTags[funcTag] = cloneableTags[mapTag] = cloneableTags[setTag] = cloneableTags[weakMapTag] = false; /** Used as an internal `_.debounce` options object by `_.throttle`. */ var debounceOptions = { 'leading': false, 'maxWait': 0, 'trailing': false }; /** Used to map latin-1 supplementary letters to basic latin letters. */ var deburredLetters = { '\xc0': 'A', '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A', '\xe0': 'a', '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a', '\xc7': 'C', '\xe7': 'c', '\xd0': 'D', '\xf0': 'd', '\xc8': 'E', '\xc9': 'E', '\xca': 'E', '\xcb': 'E', '\xe8': 'e', '\xe9': 'e', '\xea': 'e', '\xeb': 'e', '\xcC': 'I', '\xcd': 'I', '\xce': 'I', '\xcf': 'I', '\xeC': 'i', '\xed': 'i', '\xee': 'i', '\xef': 'i', '\xd1': 'N', '\xf1': 'n', '\xd2': 'O', '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O', '\xf2': 'o', '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o', '\xd9': 'U', '\xda': 'U', '\xdb': 'U', '\xdc': 'U', '\xf9': 'u', '\xfa': 'u', '\xfb': 'u', '\xfc': 'u', '\xdd': 'Y', '\xfd': 'y', '\xff': 'y', '\xc6': 'Ae', '\xe6': 'ae', '\xde': 'Th', '\xfe': 'th', '\xdf': 'ss' }; /** Used to map characters to HTML entities. */ var htmlEscapes = { '&': '&', '<': '<', '>': '>', '"': '"', "'": ''', '`': '`' }; /** Used to map HTML entities to characters. */ var htmlUnescapes = { '&': '&', '<': '<', '>': '>', '"': '"', ''': "'", '`': '`' }; /** Used to determine if values are of the language type `Object`. */ var objectTypes = { 'function': true, 'object': true }; /** Used to escape characters for inclusion in compiled string literals. */ var stringEscapes = { '\\': '\\', "'": "'", '\n': 'n', '\r': 'r', '\u2028': 'u2028', '\u2029': 'u2029' }; /** * Used as a reference to the global object. * * The `this` value is used if it is the global object to avoid Greasemonkey's * restricted `window` object, otherwise the `window` object is used. */ var root = (objectTypes[typeof window] && window !== (this && this.window)) ? window : this; /** Detect free variable `exports`. */ var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports; /** Detect free variable `module`. */ var freeModule = objectTypes[typeof module] && module && !module.nodeType && module; /** Detect free variable `global` from Node.js or Browserified code and use it as `root`. */ var freeGlobal = freeExports && freeModule && typeof global == 'object' && global; if (freeGlobal && (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal || freeGlobal.self === freeGlobal)) { root = freeGlobal; } /** Detect the popular CommonJS extension `module.exports`. */ var moduleExports = freeModule && freeModule.exports === freeExports && freeExports; /*--------------------------------------------------------------------------*/ /** * The base implementation of `compareAscending` which compares values and * sorts them in ascending order without guaranteeing a stable sort. * * @private * @param {*} value The value to compare to `other`. * @param {*} other The value to compare to `value`. * @returns {number} Returns the sort order indicator for `value`. */ function baseCompareAscending(value, other) { if (value !== other) { var valIsReflexive = value === value, othIsReflexive = other === other; if (value > other || !valIsReflexive || (typeof value == 'undefined' && othIsReflexive)) { return 1; } if (value < other || !othIsReflexive || (typeof other == 'undefined' && valIsReflexive)) { return -1; } } return 0; } /** * The base implementation of `_.indexOf` without support for binary searches. * * @private * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {number} [fromIndex=0] The index to search from. * @returns {number} Returns the index of the matched value, else `-1`. */ function baseIndexOf(array, value, fromIndex) { if (value !== value) { return indexOfNaN(array, fromIndex); } var index = (fromIndex || 0) - 1, length = array.length; while (++index < length) { if (array[index] === value) { return index; } } return -1; } /** * The base implementation of `_.sortBy` and `_.sortByAll` which uses `comparer` * to define the sort order of `array` and replaces criteria objects with their * corresponding values. * * @private * @param {Array} array The array to sort. * @param {Function} comparer The function to define sort order. * @returns {Array} Returns `array`. */ function baseSortBy(array, comparer) { var length = array.length; array.sort(comparer); while (length--) { array[length] = array[length].value; } return array; } /** * Converts `value` to a string if it is not one. An empty string is returned * for `null` or `undefined` values. * * @private * @param {*} value The value to process. * @returns {string} Returns the string. */ function baseToString(value) { if (typeof value == 'string') { return value; } return value == null ? '' : (value + ''); } /** * Used by `_.max` and `_.min` as the default callback for string values. * * @private * @param {string} string The string to inspect. * @returns {number} Returns the code unit of the first character of the string. */ function charAtCallback(string) { return string.charCodeAt(0); } /** * Used by `_.trim` and `_.trimLeft` to get the index of the first character * of `string` that is not found in `chars`. * * @private * @param {string} string The string to inspect. * @param {string} chars The characters to find. * @returns {number} Returns the index of the first character not found in `chars`. */ function charsLeftIndex(string, chars) { var index = -1, length = string.length; while (++index < length && chars.indexOf(string.charAt(index)) > -1) {} return index; } /** * Used by `_.trim` and `_.trimRight` to get the index of the last character * of `string` that is not found in `chars`. * * @private * @param {string} string The string to inspect. * @param {string} chars The characters to find. * @returns {number} Returns the index of the last character not found in `chars`. */ function charsRightIndex(string, chars) { var index = string.length; while (index-- && chars.indexOf(string.charAt(index)) > -1) {} return index; } /** * Used by `_.sortBy` to compare transformed elements of a collection and stable * sort them in ascending order. * * @private * @param {Object} object The object to compare to `other`. * @param {Object} other The object to compare to `object`. * @returns {number} Returns the sort order indicator for `object`. */ function compareAscending(object, other) { return baseCompareAscending(object.criteria, other.criteria) || (object.index - other.index); } /** * Used by `_.sortByAll` to compare multiple properties of each element * in a collection and stable sort them in ascending order. * * @private * @param {Object} object The object to compare to `other`. * @param {Object} other The object to compare to `object`. * @returns {number} Returns the sort order indicator for `object`. */ function compareMultipleAscending(object, other) { var index = -1, objCriteria = object.criteria, othCriteria = other.criteria, length = objCriteria.length; while (++index < length) { var result = baseCompareAscending(objCriteria[index], othCriteria[index]); if (result) { return result; } } // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications // that causes it, under certain circumstances, to provide the same value for // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247 // for more details. // // This also ensures a stable sort in V8 and other engines. // See https://code.google.com/p/v8/issues/detail?id=90 for more details. return object.index - other.index; } /** * Used by `_.deburr` to convert latin-1 supplementary letters to basic latin letters. * * @private * @param {string} letter The matched letter to deburr. * @returns {string} Returns the deburred letter. */ function deburrLetter(letter) { return deburredLetters[letter]; } /** * Used by `_.escape` to convert characters to HTML entities. * * @private * @param {string} chr The matched character to escape. * @returns {string} Returns the escaped character. */ function escapeHtmlChar(chr) { return htmlEscapes[chr]; } /** * Used by `_.template` to escape characters for inclusion in compiled * string literals. * * @private * @param {string} chr The matched character to escape. * @returns {string} Returns the escaped character. */ function escapeStringChar(chr) { return '\\' + stringEscapes[chr]; } /** * Gets the index at which the first occurrence of `NaN` is found in `array`. * If `fromRight` is provided elements of `array` are iterated from right to left. * * @private * @param {Array} array The array to search. * @param {number} [fromIndex] The index to search from. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {number} Returns the index of the matched `NaN`, else `-1`. */ function indexOfNaN(array, fromIndex, fromRight) { var length = array.length, index = fromRight ? (fromIndex || length) : ((fromIndex || 0) - 1); while ((fromRight ? index-- : ++index < length)) { var other = array[index]; if (other !== other) { return index; } } return -1; } /** * Checks if `value` is a host object in IE < 9. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a host object, else `false`. */ var isHostObject = (function() { try { Object({ 'toString': 0 } + ''); } catch(e) { return function() { return false; }; } return function(value) { // IE < 9 presents many host objects as `Object` objects that can coerce // to strings despite having improperly defined `toString` methods. return typeof value.toString != 'function' && typeof (value + '') == 'string'; }; }()); /** * Checks if `value` is object-like. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is object-like, else `false`. */ function isObjectLike(value) { return (value && typeof value == 'object') || false; } /** * Used by `trimmedLeftIndex` and `trimmedRightIndex` to determine if a * character code is whitespace. * * @private * @param {number} charCode The character code to inspect. * @returns {boolean} Returns `true` if `charCode` is whitespace, else `false`. */ function isSpace(charCode) { return ((charCode <= 160 && (charCode >= 9 && charCode <= 13) || charCode == 32 || charCode == 160) || charCode == 5760 || charCode == 6158 || (charCode >= 8192 && (charCode <= 8202 || charCode == 8232 || charCode == 8233 || charCode == 8239 || charCode == 8287 || charCode == 12288 || charCode == 65279))); } /** * Replaces all `placeholder` elements in `array` with an internal placeholder * and returns an array of their indexes. * * @private * @param {Array} array The array to modify. * @param {*} placeholder The placeholder to replace. * @returns {Array} Returns the new array of placeholder indexes. */ function replaceHolders(array, placeholder) { var index = -1, length = array.length, resIndex = -1, result = []; while (++index < length) { if (array[index] === placeholder) { array[index] = PLACEHOLDER; result[++resIndex] = index; } } return result; } /** * An implementation of `_.uniq` optimized for sorted arrays without support * for callback shorthands and `this` binding. * * @private * @param {Array} array The array to inspect. * @param {Function} [iteratee] The function invoked per iteration. * @returns {Array} Returns the new duplicate-value-free array. */ function sortedUniq(array, iteratee) { var seen, index = -1, length = array.length, resIndex = -1, result = []; while (++index < length) { var value = array[index], computed = iteratee ? iteratee(value, index, array) : value; if (!index || seen !== computed) { seen = computed; result[++resIndex] = value; } } return result; } /** * Used by `_.trim` and `_.trimLeft` to get the index of the first non-whitespace * character of `string`. * * @private * @param {string} string The string to inspect. * @returns {number} Returns the index of the first non-whitespace character. */ function trimmedLeftIndex(string) { var index = -1, length = string.length; while (++index < length && isSpace(string.charCodeAt(index))) {} return index; } /** * Used by `_.trim` and `_.trimRight` to get the index of the last non-whitespace * character of `string`. * * @private * @param {string} string The string to inspect. * @returns {number} Returns the index of the last non-whitespace character. */ function trimmedRightIndex(string) { var index = string.length; while (index-- && isSpace(string.charCodeAt(index))) {} return index; } /** * Used by `_.unescape` to convert HTML entities to characters. * * @private * @param {string} chr The matched character to unescape. * @returns {string} Returns the unescaped character. */ function unescapeHtmlChar(chr) { return htmlUnescapes[chr]; } /*--------------------------------------------------------------------------*/ /** * Create a new pristine `lodash` function using the given `context` object. * * @static * @memberOf _ * @category Utility * @param {Object} [context=root] The context object. * @returns {Function} Returns a new `lodash` function. * @example * * _.mixin({ 'add': function(a, b) { return a + b; } }); * * var lodash = _.runInContext(); * lodash.mixin({ 'sub': function(a, b) { return a - b; } }); * * _.isFunction(_.add); * // => true * _.isFunction(_.sub); * // => false * * lodash.isFunction(lodash.add); * // => false * lodash.isFunction(lodash.sub); * // => true * * // using `context` to mock `Date#getTime` use in `_.now` * var mock = _.runInContext({ * 'Date': function() { * return { 'getTime': getTimeMock }; * } * }); * * // or creating a suped-up `defer` in Node.js * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer; */ function runInContext(context) { // Avoid issues with some ES3 environments that attempt to use values, named // after built-in constructors like `Object`, for the creation of literals. // ES5 clears this up by stating that literals must use built-in constructors. // See https://es5.github.io/#x11.1.5 for more details. context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root; /** Native constructor references. */ var Array = context.Array, Date = context.Date, Error = context.Error, Function = context.Function, Math = context.Math, Number = context.Number, Object = context.Object, RegExp = context.RegExp, String = context.String, TypeError = context.TypeError; /** Used for native method references. */ var arrayProto = Array.prototype, errorProto = Error.prototype, objectProto = Object.prototype, stringProto = String.prototype; /** Used to detect DOM support. */ var document = (document = context.window) && document.document; /** Used to resolve the decompiled source of functions. */ var fnToString = Function.prototype.toString; /** Used to the length of n-tuples for `_.unzip`. */ var getLength = baseProperty('length'); /** Used to check objects for own properties. */ var hasOwnProperty = objectProto.hasOwnProperty; /** Used to generate unique IDs. */ var idCounter = 0; /** * Used to resolve the `toStringTag` of values. * See the [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring) * for more details. */ var objToString = objectProto.toString; /** Used to restore the original `_` reference in `_.noConflict`. */ var oldDash = context._; /** Used to detect if a method is native. */ var reNative = RegExp('^' + escapeRegExp(objToString) .replace(/toString|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$' ); /** Native method references. */ var ArrayBuffer = isNative(ArrayBuffer = context.ArrayBuffer) && ArrayBuffer, bufferSlice = isNative(bufferSlice = ArrayBuffer && new ArrayBuffer(0).slice) && bufferSlice, ceil = Math.ceil, clearTimeout = context.clearTimeout, floor = Math.floor, getPrototypeOf = isNative(getPrototypeOf = Object.getPrototypeOf) && getPrototypeOf, push = arrayProto.push, propertyIsEnumerable = objectProto.propertyIsEnumerable, Set = isNative(Set = context.Set) && Set, setTimeout = context.setTimeout, splice = arrayProto.splice, Uint8Array = isNative(Uint8Array = context.Uint8Array) && Uint8Array, unshift = arrayProto.unshift, WeakMap = isNative(WeakMap = context.WeakMap) && WeakMap; /** Used to clone array buffers. */ var Float64Array = (function() { // Safari 5 errors when using an array buffer to initialize a typed array // where the array buffer's `byteLength` is not a multiple of the typed // array's `BYTES_PER_ELEMENT`. try { var func = isNative(func = context.Float64Array) && func, result = new func(new ArrayBuffer(10), 0, 1) && func; } catch(e) {} return result; }()); /* Native method references for those with the same name as other `lodash` methods. */ var nativeIsArray = isNative(nativeIsArray = Array.isArray) && nativeIsArray, nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate, nativeIsFinite = context.isFinite, nativeKeys = isNative(nativeKeys = Object.keys) && nativeKeys, nativeMax = Math.max, nativeMin = Math.min, nativeNow = isNative(nativeNow = Date.now) && nativeNow, nativeNumIsFinite = isNative(nativeNumIsFinite = Number.isFinite) && nativeNumIsFinite, nativeParseInt = context.parseInt, nativeRandom = Math.random; /** Used as references for `-Infinity` and `Infinity`. */ var NEGATIVE_INFINITY = Number.NEGATIVE_INFINITY, POSITIVE_INFINITY = Number.POSITIVE_INFINITY; /** Used as references for the maximum length and index of an array. */ var MAX_ARRAY_LENGTH = Math.pow(2, 32) - 1, MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1, HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1; /** Used as the size, in bytes, of each `Float64Array` element. */ var FLOAT64_BYTES_PER_ELEMENT = Float64Array ? Float64Array.BYTES_PER_ELEMENT : 0; /** * Used as the maximum length of an array-like value. * See the [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-number.max_safe_integer) * for more details. */ var MAX_SAFE_INTEGER = Math.pow(2, 53) - 1; /** Used to store function metadata. */ var metaMap = WeakMap && new WeakMap; /** Used to lookup a type array constructors by `toStringTag`. */ var ctorByTag = {}; ctorByTag[float32Tag] = context.Float32Array; ctorByTag[float64Tag] = context.Float64Array; ctorByTag[int8Tag] = context.Int8Array; ctorByTag[int16Tag] = context.Int16Array; ctorByTag[int32Tag] = context.Int32Array; ctorByTag[uint8Tag] = context.Uint8Array; ctorByTag[uint8ClampedTag] = context.Uint8ClampedArray; ctorByTag[uint16Tag] = context.Uint16Array; ctorByTag[uint32Tag] = context.Uint32Array; /** Used to avoid iterating over non-enumerable properties in IE < 9. */ var nonEnumProps = {}; nonEnumProps[arrayTag] = nonEnumProps[dateTag] = nonEnumProps[numberTag] = { 'constructor': true, 'toLocaleString': true, 'toString': true, 'valueOf': true }; nonEnumProps[boolTag] = nonEnumProps[stringTag] = { 'constructor': true, 'toString': true, 'valueOf': true }; nonEnumProps[errorTag] = nonEnumProps[funcTag] = nonEnumProps[regexpTag] = { 'constructor': true, 'toString': true }; nonEnumProps[objectTag] = { 'constructor': true }; arrayEach(shadowProps, function(key) { for (var tag in nonEnumProps) { if (hasOwnProperty.call(nonEnumProps, tag)) { var props = nonEnumProps[tag]; props[key] = hasOwnProperty.call(props, key); } } }); /*------------------------------------------------------------------------*/ /** * Creates a `lodash` object which wraps `value` to enable intuitive chaining. * Methods that operate on and return arrays, collections, and functions can * be chained together. Methods that return a boolean or single value will * automatically end the chain returning the unwrapped value. Explicit chaining * may be enabled using `_.chain`. The execution of chained methods is lazy, * that is, execution is deferred until `_#value` is implicitly or explicitly * called. * * Lazy evaluation allows several methods to support shortcut fusion. Shortcut * fusion is an optimization that merges iteratees to avoid creating intermediate * arrays and reduce the number of iteratee executions. * * Chaining is supported in custom builds as long as the `_#value` method is * directly or indirectly included in the build. * * In addition to lodash methods, wrappers also have the following `Array` methods: * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`, `splice`, * and `unshift` * * The wrapper functions that support shortcut fusion are: * `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `filter`, `first`, * `initial`, `last`, `map`, `pluck`, `reject`, `rest`, `reverse`, `slice`, * `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `where` * * The chainable wrapper functions are: * `after`, `ary`, `assign`, `at`, `before`, `bind`, `bindAll`, `bindKey`, * `callback`, `chain`, `chunk`, `compact`, `concat`, `constant`, `countBy`, * `create`, `curry`, `debounce`, `defaults`, `defer`, `delay`, `difference`, * `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `filter`, `flatten`, * `flattenDeep`, `flow`, `flowRight`, `forEach`, `forEachRight`, `forIn`, * `forInRight`, `forOwn`, `forOwnRight`, `functions`, `groupBy`, `indexBy`, * `initial`, `intersection`, `invert`, `invoke`, `keys`, `keysIn`, `map`, * `mapValues`, `matches`, `memoize`, `merge`, `mixin`, `negate`, `noop`, * `omit`, `once`, `pairs`, `partial`, `partialRight`, `partition`, `pick`, * `pluck`, `property`, `propertyOf`, `pull`, `pullAt`, `push`, `range`, * `rearg`, `reject`, `remove`, `rest`, `reverse`, `shuffle`, `slice`, `sort`, * `sortBy`, `sortByAll`, `splice`, `take`, `takeRight`, `takeRightWhile`, * `takeWhile`, `tap`, `throttle`, `thru`, `times`, `toArray`, `toPlainObject`, * `transform`, `union`, `uniq`, `unshift`, `unzip`, `values`, `valuesIn`, * `where`, `without`, `wrap`, `xor`, `zip`, and `zipObject` * * The wrapper functions that are **not** chainable by default are: * `attempt`, `camelCase`, `capitalize`, `clone`, `cloneDeep`, `deburr`, * `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, * `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`, `has`, * `identity`, `includes`, `indexOf`, `isArguments`, `isArray`, `isBoolean`, * `isDate`, `isElement`, `isEmpty`, `isEqual`, `isError`, `isFinite`, * `isFunction`, `isMatch`, `isNative`, `isNaN`, `isNull`, `isNumber`, * `isObject`, `isPlainObject`, `isRegExp`, `isString`, `isUndefined`, * `isTypedArray`, `join`, `kebabCase`, `last`, `lastIndexOf`, `max`, `min`, * `noConflict`, `now`, `pad`, `padLeft`, `padRight`, `parseInt`, `pop`, * `random`, `reduce`, `reduceRight`, `repeat`, `result`, `runInContext`, * `shift`, `size`, `snakeCase`, `some`, `sortedIndex`, `sortedLastIndex`, * `startCase`, `startsWith`, `template`, `trim`, `trimLeft`, `trimRight`, * `trunc`, `unescape`, `uniqueId`, `value`, and `words` * * The wrapper function `sample` will return a wrapped value when `n` is provided, * otherwise an unwrapped value is returned. * * @name _ * @constructor * @category Chain * @param {*} value The value to wrap in a `lodash` instance. * @returns {Object} Returns a `lodash` instance. * @example * * var wrapped = _([1, 2, 3]); * * // returns an unwrapped value * wrapped.reduce(function(sum, n) { return sum + n; }); * // => 6 * * // returns a wrapped value * var squares = wrapped.map(function(n) { return n * n; }); * * _.isArray(squares); * // => false * * _.isArray(squares.value()); * // => true */ function lodash(value) { if (isObjectLike(value) && !isArray(value)) { if (value instanceof LodashWrapper) { return value; } if (hasOwnProperty.call(value, '__wrapped__')) { return new LodashWrapper(value.__wrapped__, value.__chain__, arrayCopy(value.__actions__)); } } return new LodashWrapper(value); } /** * The base constructor for creating `lodash` wrapper objects. * * @private * @param {*} value The value to wrap. * @param {boolean} [chainAll] Enable chaining for all wrapper methods. * @param {Array} [actions=[]] Actions to peform to resolve the unwrapped value. */ function LodashWrapper(value, chainAll, actions) { this.__actions__ = actions || []; this.__chain__ = !!chainAll; this.__wrapped__ = value; } /** * An object environment feature flags. * * @static * @memberOf _ * @type Object */ var support = lodash.support = {}; (function(x) { var Ctor = function() { this.x = 1; }, object = { '0': 1, 'length': 1 }, props = []; Ctor.prototype = { 'valueOf': 1, 'y': 1 }; for (var key in new Ctor) { props.push(key); } /** * Detect if the `toStringTag` of `arguments` objects is resolvable * (all but Firefox < 4, IE < 9). * * @memberOf _.support * @type boolean */ support.argsTag = objToString.call(arguments) == argsTag; /** * Detect if `name` or `message` properties of `Error.prototype` are * enumerable by default (IE < 9, Safari < 5.1). * * @memberOf _.support * @type boolean */ support.enumErrorProps = propertyIsEnumerable.call(errorProto, 'message') || propertyIsEnumerable.call(errorProto, 'name'); /** * Detect if `prototype` properties are enumerable by default. * * Firefox < 3.6, Opera > 9.50 - Opera < 11.60, and Safari < 5.1 * (if the prototype or a property on the prototype has been set) * incorrectly set the `[[Enumerable]]` value of a function's `prototype` * property to `true`. * * @memberOf _.support * @type boolean */ support.enumPrototypes = propertyIsEnumerable.call(Ctor, 'prototype'); /** * Detect if functions can be decompiled by `Function#toString` * (all but Firefox OS certified apps, older Opera mobile browsers, and * the PlayStation 3; forced `false` for Windows 8 apps). * * @memberOf _.support * @type boolean */ support.funcDecomp = !isNative(context.WinRTError) && reThis.test(runInContext); /** * Detect if `Function#name` is supported (all but IE). * * @memberOf _.support * @type boolean */ support.funcNames = typeof Function.name == 'string'; /** * Detect if the `toStringTag` of DOM nodes is resolvable (all but IE < 9). * * @memberOf _.support * @type boolean */ support.nodeTag = objToString.call(document) != objectTag; /** * Detect if string indexes are non-enumerable * (IE < 9, RingoJS, Rhino, Narwhal). * * @memberOf _.support * @type boolean */ support.nonEnumStrings = !propertyIsEnumerable.call('x', 0); /** * Detect if properties shadowing those on `Object.prototype` are * non-enumerable. * * In IE < 9 an object's own properties, shadowing non-enumerable ones, * are made non-enumerable as well (a.k.a the JScript `[[DontEnum]]` bug). * * @memberOf _.support * @type boolean */ support.nonEnumShadows = !/valueOf/.test(props); /** * Detect if own properties are iterated after inherited properties (IE < 9). * * @memberOf _.support * @type boolean */ support.ownLast = props[0] != 'x'; /** * Detect if `Array#shift` and `Array#splice` augment array-like objects * correctly. * * Firefox < 10, compatibility modes of IE 8, and IE < 9 have buggy Array `shift()` * and `splice()` functions that fail to remove the last element, `value[0]`, * of array-like objects even though the `length` property is set to `0`. * The `shift()` method is buggy in compatibility modes of IE 8, while `splice()` * is buggy regardless of mode in IE < 9. * * @memberOf _.support * @type boolean */ support.spliceObjects = (splice.call(object, 0, 1), !object[0]); /** * Detect lack of support for accessing string characters by index. * * IE < 8 can't access characters by index. IE 8 can only access characters * by index on string literals, not string objects. * * @memberOf _.support * @type boolean */ support.unindexedChars = ('x'[0] + Object('x')[0]) != 'xx'; /** * Detect if the DOM is supported. * * @memberOf _.support * @type boolean */ try { support.dom = document.createDocumentFragment().nodeType === 11; } catch(e) { support.dom = false; } /** * Detect if `arguments` object indexes are non-enumerable. * * In Firefox < 4, IE < 9, PhantomJS, and Safari < 5.1 `arguments` object * indexes are non-enumerable. Chrome < 25 and Node.js < 0.11.0 treat * `arguments` object indexes as non-enumerable and fail `hasOwnProperty` * checks for indexes that exceed their function's formal parameters with * associated values of `0`. * * @memberOf _.support * @type boolean */ try { support.nonEnumArgs = !propertyIsEnumerable.call(arguments, 1); } catch(e) { support.nonEnumArgs = true; } }(0, 0)); /** * By default, the template delimiters used by lodash are like those in * embedded Ruby (ERB). Change the following template settings to use * alternative delimiters. * * @static * @memberOf _ * @type Object */ lodash.templateSettings = { /** * Used to detect `data` property values to be HTML-escaped. * * @memberOf _.templateSettings * @type RegExp */ 'escape': reEscape, /** * Used to detect code to be evaluated. * * @memberOf _.templateSettings * @type RegExp */ 'evaluate': reEvaluate, /** * Used to detect `data` property values to inject. * * @memberOf _.templateSettings * @type RegExp */ 'interpolate': reInterpolate, /** * Used to reference the data object in the template text. * * @memberOf _.templateSettings * @type string */ 'variable': '', /** * Used to import variables into the compiled template. * * @memberOf _.templateSettings * @type Object */ 'imports': { /** * A reference to the `lodash` function. * * @memberOf _.templateSettings.imports * @type Function */ '_': lodash } }; /*------------------------------------------------------------------------*/ /** * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation. * * @private * @param {*} value The value to wrap. */ function LazyWrapper(value) { this.actions = null; this.dir = 1; this.dropCount = 0; this.filtered = false; this.iteratees = null; this.takeCount = POSITIVE_INFINITY; this.views = null; this.wrapped = value; } /** * Creates a clone of the lazy wrapper object. * * @private * @name clone * @memberOf LazyWrapper * @returns {Object} Returns the cloned `LazyWrapper` object. */ function lazyClone() { var actions = this.actions, iteratees = this.iteratees, views = this.views, result = new LazyWrapper(this.wrapped); result.actions = actions ? arrayCopy(actions) : null; result.dir = this.dir; result.dropCount = this.dropCount; result.filtered = this.filtered; result.iteratees = iteratees ? arrayCopy(iteratees) : null; result.takeCount = this.takeCount; result.views = views ? arrayCopy(views) : null; return result; } /** * Reverses the direction of lazy iteration. * * @private * @name reverse * @memberOf LazyWrapper * @returns {Object} Returns the new reversed `LazyWrapper` object. */ function lazyReverse() { if (this.filtered) { var result = new LazyWrapper(this); result.dir = -1; result.filtered = true; } else { result = this.clone(); result.dir *= -1; } return result; } /** * Extracts the unwrapped value from its lazy wrapper. * * @private * @name value * @memberOf LazyWrapper * @returns {*} Returns the unwrapped value. */ function lazyValue() { var array = this.wrapped.value(); if (!isArray(array)) { return baseWrapperValue(array, this.actions); } var dir = this.dir, isRight = dir < 0, view = getView(0, array.length, this.views), start = view.start, end = view.end, length = end - start, dropCount = this.dropCount, takeCount = nativeMin(length, this.takeCount - dropCount), index = isRight ? end : start - 1, iteratees = this.iteratees, iterLength = iteratees ? iteratees.length : 0, resIndex = 0, result = []; outer: while (length-- && resIndex < takeCount) { index += dir; var iterIndex = -1, value = array[index]; while (++iterIndex < iterLength) { var data = iteratees[iterIndex], iteratee = data.iteratee, computed = iteratee(value, index, array), type = data.type; if (type == LAZY_MAP_FLAG) { value = computed; } else if (!computed) { if (type == LAZY_FILTER_FLAG) { continue outer; } else { break outer; } } } if (dropCount) { dropCount--; } else { result[resIndex++] = value; } } return result; } /*------------------------------------------------------------------------*/ /** * Creates a cache object to store key/value pairs. * * @private * @static * @name Cache * @memberOf _.memoize */ function MapCache() { this.__data__ = {}; } /** * Removes `key` and its value from the cache. * * @private * @name delete * @memberOf _.memoize.Cache * @param {string} key The key of the value to remove. * @returns {boolean} Returns `true` if the entry was removed successfully, else `false`. */ function mapDelete(key) { return this.has(key) && delete this.__data__[key]; } /** * Gets the cached value for `key`. * * @private * @name get * @memberOf _.memoize.Cache * @param {string} key The key of the value to get. * @returns {*} Returns the cached value. */ function mapGet(key) { return key == '__proto__' ? undefined : this.__data__[key]; } /** * Checks if a cached value for `key` exists. * * @private * @name has * @memberOf _.memoize.Cache * @param {string} key The key of the entry to check. * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. */ function mapHas(key) { return key != '__proto__' && hasOwnProperty.call(this.__data__, key); } /** * Adds `value` to `key` of the cache. * * @private * @name set * @memberOf _.memoize.Cache * @param {string} key The key of the value to cache. * @param {*} value The value to cache. * @returns {Object} Returns the cache object. */ function mapSet(key, value) { if (key != '__proto__') { this.__data__[key] = value; } return this; } /*------------------------------------------------------------------------*/ /** * * Creates a cache object to store unique values. * * @private * @param {Array} [values] The values to cache. */ function SetCache(values) { var length = values ? values.length : 0; this.data = { 'hash': nativeCreate(null), 'set': new Set }; while (length--) { this.push(values[length]); } } /** * Checks if `value` is in `cache` mimicking the return signature of * `_.indexOf` by returning `0` if the value is found, else `-1`. * * @private * @param {Object} cache The cache to search. * @param {*} value The value to search for. * @returns {number} Returns `0` if `value` is found, else `-1`. */ function cacheIndexOf(cache, value) { var data = cache.data, result = (typeof value == 'string' || isObject(value)) ? data.set.has(value) : data.hash[value]; return result ? 0 : -1; } /** * Adds `value` to the cache. * * @private * @name push * @memberOf SetCache * @param {*} value The value to cache. */ function cachePush(value) { var data = this.data; if (typeof value == 'string' || isObject(value)) { data.set.add(value); } else { data.hash[value] = true; } } /*------------------------------------------------------------------------*/ /** * Copies the values of `source` to `array`. * * @private * @param {Array} source The array to copy values from. * @param {Array} [array=[]] The array to copy values to. * @returns {Array} Returns `array`. */ function arrayCopy(source, array) { var index = -1, length = source.length; array || (array = Array(length)); while (++index < length) { array[index] = source[index]; } return array; } /** * A specialized version of `_.forEach` for arrays without support for callback * shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns `array`. */ function arrayEach(array, iteratee) { var index = -1, length = array.length; while (++index < length) { if (iteratee(array[index], index, array) === false) { break; } } return array; } /** * A specialized version of `_.forEachRight` for arrays without support for * callback shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns `array`. */ function arrayEachRight(array, iteratee) { var length = array.length; while (length--) { if (iteratee(array[length], length, array) === false) { break; } } return array; } /** * A specialized version of `_.every` for arrays without support for callback * shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false`. */ function arrayEvery(array, predicate) { var index = -1, length = array.length; while (++index < length) { if (!predicate(array[index], index, array)) { return false; } } return true; } /** * A specialized version of `_.filter` for arrays without support for callback * shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {Array} Returns the new filtered array. */ function arrayFilter(array, predicate) { var index = -1, length = array.length, resIndex = -1, result = []; while (++index < length) { var value = array[index]; if (predicate(value, index, array)) { result[++resIndex] = value; } } return result; } /** * A specialized version of `_.map` for arrays without support for callback * shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns the new mapped array. */ function arrayMap(array, iteratee) { var index = -1, length = array.length, result = Array(length); while (++index < length) { result[index] = iteratee(array[index], index, array); } return result; } /** * A specialized version of `_.max` for arrays without support for iteratees. * * @private * @param {Array} array The array to iterate over. * @returns {*} Returns the maximum value. */ function arrayMax(array) { var index = -1, length = array.length, result = NEGATIVE_INFINITY; while (++index < length) { var value = array[index]; if (value > result) { result = value; } } return result; } /** * A specialized version of `_.min` for arrays without support for iteratees. * * @private * @param {Array} array The array to iterate over. * @returns {*} Returns the minimum value. */ function arrayMin(array) { var index = -1, length = array.length, result = POSITIVE_INFINITY; while (++index < length) { var value = array[index]; if (value < result) { result = value; } } return result; } /** * A specialized version of `_.reduce` for arrays without support for callback * shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {*} [accumulator] The initial value. * @param {boolean} [initFromArray] Specify using the first element of `array` * as the initial value. * @returns {*} Returns the accumulated value. */ function arrayReduce(array, iteratee, accumulator, initFromArray) { var index = -1, length = array.length; if (initFromArray && length) { accumulator = array[++index]; } while (++index < length) { accumulator = iteratee(accumulator, array[index], index, array); } return accumulator; } /** * A specialized version of `_.reduceRight` for arrays without support for * callback shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {*} [accumulator] The initial value. * @param {boolean} [initFromArray] Specify using the last element of `array` * as the initial value. * @returns {*} Returns the accumulated value. */ function arrayReduceRight(array, iteratee, accumulator, initFromArray) { var length = array.length; if (initFromArray && length) { accumulator = array[--length]; } while (length--) { accumulator = iteratee(accumulator, array[length], length, array); } return accumulator; } /** * A specialized version of `_.some` for arrays without support for callback * shorthands or `this` binding. * * @private * @param {Array} array The array to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. */ function arraySome(array, predicate) { var index = -1, length = array.length; while (++index < length) { if (predicate(array[index], index, array)) { return true; } } return false; } /** * Used by `_.defaults` to customize its `_.assign` use. * * @private * @param {*} objectValue The destination object property value. * @param {*} sourceValue The source object property value. * @returns {*} Returns the value to assign to the destination object. */ function assignDefaults(objectValue, sourceValue) { return typeof objectValue == 'undefined' ? sourceValue : objectValue; } /** * Used by `_.template` to customize its `_.assign` use. * * **Note:** This method is like `assignDefaults` except that it ignores * inherited property values when checking if a property is `undefined`. * * @private * @param {*} objectValue The destination object property value. * @param {*} sourceValue The source object property value. * @param {string} key The key associated with the object and source values. * @param {Object} object The destination object. * @returns {*} Returns the value to assign to the destination object. */ function assignOwnDefaults(objectValue, sourceValue, key, object) { return (typeof objectValue == 'undefined' || !hasOwnProperty.call(object, key)) ? sourceValue : objectValue; } /** * The base implementation of `_.assign` without support for argument juggling, * multiple sources, and `this` binding `customizer` functions. * * @private * @param {Object} object The destination object. * @param {Object} source The source object. * @param {Function} [customizer] The function to customize assigning values. * @returns {Object} Returns the destination object. */ function baseAssign(object, source, customizer) { var props = keys(source); if (!customizer) { return baseCopy(source, object, props); } var index = -1, length = props.length while (++index < length) { var key = props[index], value = object[key], result = customizer(value, source[key], key, object, source); if ((result === result ? result !== value : value === value) || (typeof value == 'undefined' && !(key in object))) { object[key] = result; } } return object; } /** * The base implementation of `_.at` without support for strings and individual * key arguments. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {number[]|string[]} [props] The property names or indexes of elements to pick. * @returns {Array} Returns the new array of picked elements. */ function baseAt(collection, props) { var index = -1, length = collection.length, isArr = isLength(length), propsLength = props.length, result = Array(propsLength); while(++index < propsLength) { var key = props[index]; if (isArr) { key = parseFloat(key); result[index] = isIndex(key, length) ? collection[key] : undefined; } else { result[index] = collection[key]; } } return result; } /** * Copies the properties of `source` to `object`. * * @private * @param {Object} source The object to copy properties from. * @param {Object} [object={}] The object to copy properties to. * @param {Array} props The property names to copy. * @returns {Object} Returns `object`. */ function baseCopy(source, object, props) { if (!props) { props = object; object = {}; } var index = -1, length = props.length; while (++index < length) { var key = props[index]; object[key] = source[key]; } return object; } /** * The base implementation of `_.bindAll` without support for individual * method name arguments. * * @private * @param {Object} object The object to bind and assign the bound methods to. * @param {string[]} methodNames The object method names to bind. * @returns {Object} Returns `object`. */ function baseBindAll(object, methodNames) { var index = -1, length = methodNames.length; while (++index < length) { var key = methodNames[index]; object[key] = createWrapper(object[key], BIND_FLAG, object); } return object; } /** * The base implementation of `_.callback` which supports specifying the * number of arguments to provide to `func`. * * @private * @param {*} [func=_.identity] The value to convert to a callback. * @param {*} [thisArg] The `this` binding of `func`. * @param {number} [argCount] The number of arguments to provide to `func`. * @returns {Function} Returns the callback. */ function baseCallback(func, thisArg, argCount) { var type = typeof func; if (type == 'function') { return (typeof thisArg != 'undefined' && isBindable(func)) ? bindCallback(func, thisArg, argCount) : func; } if (func == null) { return identity; } // Handle "_.property" and "_.matches" style callback shorthands. return type == 'object' ? baseMatches(func) : baseProperty(func + ''); } /** * The base implementation of `_.clone` without support for argument juggling * and `this` binding `customizer` functions. * * @private * @param {*} value The value to clone. * @param {boolean} [isDeep] Specify a deep clone. * @param {Function} [customizer] The function to customize cloning values. * @param {string} [key] The key of `value`. * @param {Object} [object] The object `value` belongs to. * @param {Array} [stackA=[]] Tracks traversed source objects. * @param {Array} [stackB=[]] Associates clones with source counterparts. * @returns {*} Returns the cloned value. */ function baseClone(value, isDeep, customizer, key, object, stackA, stackB) { var result; if (customizer) { result = object ? customizer(value, key, object) : customizer(value); } if (typeof result != 'undefined') { return result; } if (!isObject(value)) { return value; } var isArr = isArray(value); if (isArr) { result = initCloneArray(value); if (!isDeep) { return arrayCopy(value, result); } } else { var tag = objToString.call(value), isFunc = tag == funcTag; if (tag == objectTag || tag == argsTag || (isFunc && !object)) { if (isHostObject(value)) { return object ? value : {}; } result = initCloneObject(isFunc ? {} : value); if (!isDeep) { return baseCopy(value, result, keys(value)); } } else { return cloneableTags[tag] ? initCloneByTag(value, tag, isDeep) : (object ? value : {}); } } // Check for circular references and return corresponding clone. stackA || (stackA = []); stackB || (stackB = []); var length = stackA.length; while (length--) { if (stackA[length] == value) { return stackB[length]; } } // Add the source value to the stack of traversed objects and associate it with its clone. stackA.push(value); stackB.push(result); // Recursively populate clone (susceptible to call stack limits). (isArr ? arrayEach : baseForOwn)(value, function(subValue, key) { result[key] = baseClone(subValue, isDeep, customizer, key, value, stackA, stackB); }); return result; } /** * The base implementation of `_.create` without support for assigning * properties to the created object. * * @private * @param {Object} prototype The object to inherit from. * @returns {Object} Returns the new object. */ var baseCreate = (function() { function Object() {} return function(prototype) { if (isObject(prototype)) { Object.prototype = prototype; var result = new Object; Object.prototype = null; } return result || context.Object(); }; }()); /** * The base implementation of `_.delay` and `_.defer` which accepts an index * of where to slice the arguments to provide to `func`. * * @private * @param {Function} func The function to delay. * @param {number} wait The number of milliseconds to delay invocation. * @param {Object} args The `arguments` object to slice and provide to `func`. * @returns {number} Returns the timer id. */ function baseDelay(func, wait, args, fromIndex) { if (!isFunction(func)) { throw new TypeError(FUNC_ERROR_TEXT); } return setTimeout(function() { func.apply(undefined, baseSlice(args, fromIndex)); }, wait); } /** * The base implementation of `_.difference` which accepts a single array * of values to exclude. * * @private * @param {Array} array The array to inspect. * @param {Array} values The values to exclude. * @returns {Array} Returns the new array of filtered values. */ function baseDifference(array, values) { var length = array ? array.length : 0, result = []; if (!length) { return result; } var index = -1, indexOf = getIndexOf(), isCommon = indexOf == baseIndexOf, cache = isCommon && values.length >= 200 && createCache(values), valuesLength = values.length; if (cache) { indexOf = cacheIndexOf; isCommon = false; values = cache; } outer: while (++index < length) { var value = array[index]; if (isCommon && value === value) { var valuesIndex = valuesLength; while (valuesIndex--) { if (values[valuesIndex] === value) { continue outer; } } result.push(value); } else if (indexOf(values, value) < 0) { result.push(value); } } return result; } /** * The base implementation of `_.forEach` without support for callback * shorthands and `this` binding. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array|Object|string} Returns `collection`. */ function baseEach(collection, iteratee) { var length = collection ? collection.length : 0; if (!isLength(length)) { return baseForOwn(collection, iteratee); } var index = -1, iterable = toObject(collection); while (++index < length) { if (iteratee(iterable[index], index, iterable) === false) { break; } } return collection; } /** * The base implementation of `_.forEachRight` without support for callback * shorthands and `this` binding. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array|Object|string} Returns `collection`. */ function baseEachRight(collection, iteratee) { var length = collection ? collection.length : 0; if (!isLength(length)) { return baseForOwnRight(collection, iteratee); } var iterable = toObject(collection); while (length--) { if (iteratee(iterable[length], length, iterable) === false) { break; } } return collection; } /** * The base implementation of `_.every` without support for callback * shorthands or `this` binding. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false` */ function baseEvery(collection, predicate) { var result = true; baseEach(collection, function(value, index, collection) { result = !!predicate(value, index, collection); return result; }); return result; } /** * The base implementation of `_.filter` without support for callback * shorthands or `this` binding. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {Array} Returns the new filtered array. */ function baseFilter(collection, predicate) { var result = []; baseEach(collection, function(value, index, collection) { if (predicate(value, index, collection)) { result.push(value); } }); return result; } /** * The base implementation of `_.find`, `_.findLast`, `_.findKey`, and `_.findLastKey`, * without support for callback shorthands and `this` binding, which iterates * over `collection` using the provided `eachFunc`. * * @private * @param {Array|Object|string} collection The collection to search. * @param {Function} predicate The function invoked per iteration. * @param {Function} eachFunc The function to iterate over `collection`. * @param {boolean} [retKey] Specify returning the key of the found element * instead of the element itself. * @returns {*} Returns the found element or its key, else `undefined`. */ function baseFind(collection, predicate, eachFunc, retKey) { var result; eachFunc(collection, function(value, key, collection) { if (predicate(value, key, collection)) { result = retKey ? key : value; return false; } }); return result; } /** * The base implementation of `_.flatten` with added support for restricting * flattening and specifying the start index. * * @private * @param {Array} array The array to flatten. * @param {boolean} [isDeep] Specify a deep flatten. * @param {boolean} [isStrict] Restrict flattening to arrays and `arguments` objects. * @param {number} [fromIndex=0] The index to start from. * @returns {Array} Returns the new flattened array. */ function baseFlatten(array, isDeep, isStrict, fromIndex) { var index = (fromIndex || 0) - 1, length = array.length, resIndex = -1, result = []; while (++index < length) { var value = array[index]; if (isObjectLike(value) && isLength(value.length) && (isArray(value) || isArguments(value))) { if (isDeep) { // Recursively flatten arrays (susceptible to call stack limits). value = baseFlatten(value, isDeep, isStrict); } var valIndex = -1, valLength = value.length; result.length += valLength; while (++valIndex < valLength) { result[++resIndex] = value[valIndex]; } } else if (!isStrict) { result[++resIndex] = value; } } return result; } /** * The base implementation of `baseForIn` and `baseForOwn` which iterates * over `object` properties returned by `keysFunc` invoking `iteratee` for * each property. Iterator functions may exit iteration early by explicitly * returning `false`. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {Function} keysFunc The function to get the keys of `object`. * @returns {Object} Returns `object`. */ function baseFor(object, iteratee, keysFunc) { var index = -1, iterable = toObject(object), props = keysFunc(object), length = props.length; while (++index < length) { var key = props[index]; if (iteratee(iterable[key], key, iterable) === false) { break; } } return object; } /** * This function is like `baseFor` except that it iterates over properties * in the opposite order. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {Function} keysFunc The function to get the keys of `object`. * @returns {Object} Returns `object`. */ function baseForRight(object, iteratee, keysFunc) { var iterable = toObject(object), props = keysFunc(object), length = props.length; while (length--) { var key = props[length]; if (iteratee(iterable[key], key, iterable) === false) { break; } } return object; } /** * The base implementation of `_.forIn` without support for callback * shorthands and `this` binding. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */ function baseForIn(object, iteratee) { return baseFor(object, iteratee, keysIn); } /** * The base implementation of `_.forOwn` without support for callback * shorthands and `this` binding. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */ function baseForOwn(object, iteratee) { return baseFor(object, iteratee, keys); } /** * The base implementation of `_.forOwnRight` without support for callback * shorthands and `this` binding. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */ function baseForOwnRight(object, iteratee) { return baseForRight(object, iteratee, keys); } /** * The base implementation of `_.functions` which creates an array of * `object` function property names filtered from those provided. * * @private * @param {Object} object The object to inspect. * @param {Array} props The property names to filter. * @returns {Array} Returns the new array of filtered property names. */ function baseFunctions(object, props) { var index = -1, length = props.length, resIndex = -1, result = []; while (++index < length) { var key = props[index]; if (isFunction(object[key])) { result[++resIndex] = key; } } return result; } /** * The base implementation of `_.invoke` which requires additional arguments * to be provided as an array of arguments rather than individually. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|string} methodName The name of the method to invoke or * the function invoked per iteration. * @param {Array} [args] The arguments to invoke the method with. * @returns {Array} Returns the array of results. */ function baseInvoke(collection, methodName, args) { var index = -1, isFunc = typeof methodName == 'function', length = collection ? collection.length : 0, result = isLength(length) ? Array(length) : []; baseEach(collection, function(value) { var func = isFunc ? methodName : (value != null && value[methodName]); result[++index] = func ? func.apply(value, args) : undefined; }); return result; } /** * The base implementation of `_.isEqual` without support for `this` binding * `customizer` functions. * * @private * @param {*} value The value to compare. * @param {*} other The other value to compare. * @param {Function} [customizer] The function to customize comparing values. * @param {boolean} [isWhere] Specify performing partial comparisons. * @param {Array} [stackA] Tracks traversed `value` objects. * @param {Array} [stackB] Tracks traversed `other` objects. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. */ function baseIsEqual(value, other, customizer, isWhere, stackA, stackB) { // Exit early for identical values. if (value === other) { // Treat `+0` vs. `-0` as not equal. return value !== 0 || (1 / value == 1 / other); } var valType = typeof value, othType = typeof other; // Exit early for unlike primitive values. if ((valType != 'function' && valType != 'object' && othType != 'function' && othType != 'object') || value == null || other == null) { // Return `false` unless both values are `NaN`. return value !== value && other !== other; } return baseIsEqualDeep(value, other, baseIsEqual, customizer, isWhere, stackA, stackB); } /** * A specialized version of `baseIsEqual` for arrays and objects which performs * deep comparisons and tracks traversed objects enabling objects with circular * references to be compared. * * @private * @param {Object} object The object to compare. * @param {Object} other The other object to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} [customizer] The function to customize comparing objects. * @param {boolean} [isWhere] Specify performing partial comparisons. * @param {Array} [stackA=[]] Tracks traversed `value` objects. * @param {Array} [stackB=[]] Tracks traversed `other` objects. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function baseIsEqualDeep(object, other, equalFunc, customizer, isWhere, stackA, stackB) { var objIsArr = isArray(object), othIsArr = isArray(other), objTag = arrayTag, othTag = arrayTag; if (!objIsArr) { objTag = objToString.call(object); if (objTag == argsTag) { objTag = objectTag; } else if (objTag != objectTag) { objIsArr = isTypedArray(object); } } if (!othIsArr) { othTag = objToString.call(other); if (othTag == argsTag) { othTag = objectTag; } else if (othTag != objectTag) { othIsArr = isTypedArray(other); } } var objIsObj = objTag == objectTag && !isHostObject(object), othIsObj = othTag == objectTag && !isHostObject(other), isSameTag = objTag == othTag; if (isSameTag && !(objIsArr || objIsObj)) { return equalByTag(object, other, objTag); } var valWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'), othWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__'); if (valWrapped || othWrapped) { return equalFunc(valWrapped ? object.value() : object, othWrapped ? other.value() : other, customizer, isWhere, stackA, stackB); } if (!isSameTag) { return false; } // Assume cyclic values are equal. // For more information on detecting circular references see https://es5.github.io/#JO. stackA || (stackA = []); stackB || (stackB = []); var length = stackA.length; while (length--) { if (stackA[length] == object) { return stackB[length] == other; } } // Add `object` and `other` to the stack of traversed objects. stackA.push(object); stackB.push(other); var result = (objIsArr ? equalArrays : equalObjects)(object, other, equalFunc, customizer, isWhere, stackA, stackB); stackA.pop(); stackB.pop(); return result; } /** * The base implementation of `_.isMatch` without support for callback * shorthands or `this` binding. * * @private * @param {Object} source The object to inspect. * @param {Array} props The source property names to match. * @param {Array} values The source values to match. * @param {Array} strictCompareFlags Strict comparison flags for source values. * @param {Function} [customizer] The function to customize comparing objects. * @returns {boolean} Returns `true` if `object` is a match, else `false`. */ function baseIsMatch(object, props, values, strictCompareFlags, customizer) { var length = props.length; if (object == null) { return !length; } var index = -1, noCustomizer = !customizer; while (++index < length) { if ((noCustomizer && strictCompareFlags[index]) ? values[index] !== object[props[index]] : !hasOwnProperty.call(object, props[index]) ) { return false; } } index = -1; while (++index < length) { var key = props[index]; if (noCustomizer && strictCompareFlags[index]) { var result = hasOwnProperty.call(object, key); } else { var objValue = object[key], srcValue = values[index]; result = customizer ? customizer(objValue, srcValue, key) : undefined; if (typeof result == 'undefined') { result = baseIsEqual(srcValue, objValue, customizer, true); } } if (!result) { return false; } } return true; } /** * The base implementation of `_.map` without support for callback shorthands * or `this` binding. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns the new mapped array. */ function baseMap(collection, iteratee) { var result = []; baseEach(collection, function(value, key, collection) { result.push(iteratee(value, key, collection)); }); return result; } /** * The base implementation of `_.matches` which supports specifying whether * `source` should be cloned. * * @private * @param {Object} source The object of property values to match. * @returns {Function} Returns the new function. */ function baseMatches(source) { var props = keys(source), length = props.length; if (length == 1) { var key = props[0], value = source[key]; if (isStrictComparable(value)) { return function(object) { return object != null && value === object[key] && hasOwnProperty.call(object, key); }; } } var values = Array(length), strictCompareFlags = Array(length); while (length--) { value = source[props[length]]; values[length] = value; strictCompareFlags[length] = isStrictComparable(value); } return function(object) { return baseIsMatch(object, props, values, strictCompareFlags); }; } /** * The base implementation of `_.merge` without support for argument juggling, * multiple sources, and `this` binding `customizer` functions. * * @private * @param {Object} object The destination object. * @param {Object} source The source object. * @param {Function} [customizer] The function to customize merging properties. * @param {Array} [stackA=[]] Tracks traversed source objects. * @param {Array} [stackB=[]] Associates values with source counterparts. * @returns {Object} Returns the destination object. */ function baseMerge(object, source, customizer, stackA, stackB) { var isSrcArr = isLength(source.length) && (isArray(source) || isTypedArray(source)); (isSrcArr ? arrayEach : baseForOwn)(source, function(srcValue, key, source) { if (isObjectLike(srcValue)) { stackA || (stackA = []); stackB || (stackB = []); return baseMergeDeep(object, source, key, baseMerge, customizer, stackA, stackB); } var value = object[key], result = customizer ? customizer(value, srcValue, key, object, source) : undefined, isCommon = typeof result == 'undefined'; if (isCommon) { result = srcValue; } if ((isSrcArr || typeof result != 'undefined') && (isCommon || (result === result ? result !== value : value === value))) { object[key] = result; } }); return object; } /** * A specialized version of `baseMerge` for arrays and objects which performs * deep merges and tracks traversed objects enabling objects with circular * references to be merged. * * @private * @param {Object} object The destination object. * @param {Object} source The source object. * @param {string} key The key of the value to merge. * @param {Function} mergeFunc The function to merge values. * @param {Function} [customizer] The function to customize merging properties. * @param {Array} [stackA=[]] Tracks traversed source objects. * @param {Array} [stackB=[]] Associates values with source counterparts. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function baseMergeDeep(object, source, key, mergeFunc, customizer, stackA, stackB) { var length = stackA.length, srcValue = source[key]; while (length--) { if (stackA[length] == srcValue) { object[key] = stackB[length]; return; } } var value = object[key], result = customizer ? customizer(value, srcValue, key, object, source) : undefined, isCommon = typeof result == 'undefined'; if (isCommon) { result = srcValue; if (isLength(srcValue.length) && (isArray(srcValue) || isTypedArray(srcValue))) { result = isArray(value) ? value : (value ? arrayCopy(value) : []); } else if (isPlainObject(srcValue) || isArguments(srcValue)) { result = isArguments(value) ? toPlainObject(value) : (isPlainObject(value) ? value : {}); } else { isCommon = false; } } // Add the source value to the stack of traversed objects and associate // it with its merged value. stackA.push(srcValue); stackB.push(result); if (isCommon) { // Recursively merge objects and arrays (susceptible to call stack limits). object[key] = mergeFunc(result, srcValue, customizer, stackA, stackB); } else if (result === result ? result !== value : value === value) { object[key] = result; } } /** * The base implementation of `_.property` which does not coerce `key` to a string. * * @private * @param {string} key The key of the property to get. * @returns {Function} Returns the new function. */ function baseProperty(key) { return function(object) { return object == null ? undefined : object[key]; }; } /** * The base implementation of `_.pullAt` without support for individual * index arguments. * * @private * @param {Array} array The array to modify. * @param {number[]} indexes The indexes of elements to remove. * @returns {Array} Returns the new array of removed elements. */ function basePullAt(array, indexes) { var length = indexes.length, result = baseAt(array, indexes); indexes.sort(baseCompareAscending); while (length--) { var index = parseFloat(indexes[length]); if (index != previous && isIndex(index)) { var previous = index; splice.call(array, index, 1); } } return result; } /** * The base implementation of `_.random` without support for argument juggling * and returning floating-point numbers. * * @private * @param {number} min The minimum possible value. * @param {number} max The maximum possible value. * @returns {number} Returns the random number. */ function baseRandom(min, max) { return min + floor(nativeRandom() * (max - min + 1)); } /** * The base implementation of `_.reduce` and `_.reduceRight` without support * for callback shorthands or `this` binding, which iterates over `collection` * using the provided `eachFunc`. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {*} accumulator The initial value. * @param {boolean} initFromCollection Specify using the first or last element * of `collection` as the initial value. * @param {Function} eachFunc The function to iterate over `collection`. * @returns {*} Returns the accumulated value. */ function baseReduce(collection, iteratee, accumulator, initFromCollection, eachFunc) { eachFunc(collection, function(value, index, collection) { accumulator = initFromCollection ? (initFromCollection = false, value) : iteratee(accumulator, value, index, collection) }); return accumulator; } /** * The base implementation of `setData` without support for hot loop detection. * * @private * @param {Function} func The function to associate metadata with. * @param {*} data The metadata. * @returns {Function} Returns `func`. */ var baseSetData = !metaMap ? identity : function(func, data) { metaMap.set(func, data); return func; }; /** * The base implementation of `_.slice` without an iteratee call guard. * * @private * @param {Array} array The array to slice. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns the slice of `array`. */ function baseSlice(array, start, end) { var index = -1, length = array.length; start = start == null ? 0 : (+start || 0); if (start < 0) { start = -start > length ? 0 : (length + start); } end = (typeof end == 'undefined' || end > length) ? length : (+end || 0); if (end < 0) { end += length; } length = start > end ? 0 : (end - start) >>> 0; start >>>= 0; var result = Array(length); while (++index < length) { result[index] = array[index + start]; } return result; } /** * The base implementation of `_.some` without support for callback shorthands * or `this` binding. * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. */ function baseSome(collection, predicate) { var result; baseEach(collection, function(value, index, collection) { result = predicate(value, index, collection); return !result; }); return !!result; } /** * The base implementation of `_.uniq` without support for callback shorthands * and `this` binding. * * @private * @param {Array} array The array to inspect. * @param {Function} [iteratee] The function invoked per iteration. * @returns {Array} Returns the new duplicate-value-free array. */ function baseUniq(array, iteratee) { var index = -1, indexOf = getIndexOf(), length = array.length, isCommon = indexOf == baseIndexOf, isLarge = isCommon && length >= 200, seen = isLarge && createCache(), result = []; if (seen) { indexOf = cacheIndexOf; isCommon = false; } else { isLarge = false; seen = iteratee ? [] : result; } outer: while (++index < length) { var value = array[index], computed = iteratee ? iteratee(value, index, array) : value; if (isCommon && value === value) { var seenIndex = seen.length; while (seenIndex--) { if (seen[seenIndex] === computed) { continue outer; } } if (iteratee) { seen.push(computed); } result.push(value); } else if (indexOf(seen, computed) < 0) { if (iteratee || isLarge) { seen.push(computed); } result.push(value); } } return result; } /** * The base implementation of `_.values` and `_.valuesIn` which creates an * array of `object` property values corresponding to the property names * returned by `keysFunc`. * * @private * @param {Object} object The object to query. * @param {Array} props The property names to get values for. * @returns {Object} Returns the array of property values. */ function baseValues(object, props) { var index = -1, length = props.length, result = Array(length); while (++index < length) { result[index] = object[props[index]]; } return result; } /** * The base implementation of `wrapperValue` which returns the result of * performing a sequence of actions on the unwrapped `value`, where each * successive action is supplied the return value of the previous. * * @private * @param {*} value The unwrapped value. * @param {Array} actions Actions to peform to resolve the unwrapped value. * @returns {*} Returns the resolved unwrapped value. */ function baseWrapperValue(value, actions) { var result = value; if (result instanceof LazyWrapper) { result = result.value(); } var index = -1, length = actions.length; while (++index < length) { var args = [result], action = actions[index]; push.apply(args, action.args); result = action.func.apply(action.thisArg, args); } return result; } /** * Performs a binary search of `array` to determine the index at which `value` * should be inserted into `array` in order to maintain its sort order. * * @private * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {boolean} [retHighest] Specify returning the highest, instead * of the lowest, index at which a value should be inserted into `array`. * @returns {number} Returns the index at which `value` should be inserted * into `array`. */ function binaryIndex(array, value, retHighest) { var low = 0, high = array ? array.length : low; if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) { while (low < high) { var mid = (low + high) >>> 1, computed = array[mid]; if (retHighest ? (computed <= value) : (computed < value)) { low = mid + 1; } else { high = mid; } } return high; } return binaryIndexBy(array, value, identity, retHighest); } /** * This function is like `binaryIndex` except that it invokes `iteratee` for * `value` and each element of `array` to compute their sort ranking. The * iteratee is invoked with one argument; (value). * * @private * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Function} iteratee The function invoked per iteration. * @param {boolean} [retHighest] Specify returning the highest, instead * of the lowest, index at which a value should be inserted into `array`. * @returns {number} Returns the index at which `value` should be inserted * into `array`. */ function binaryIndexBy(array, value, iteratee, retHighest) { value = iteratee(value); var low = 0, high = array ? array.length : 0, valIsNaN = value !== value, valIsUndef = typeof value == 'undefined'; while (low < high) { var mid = floor((low + high) / 2), computed = iteratee(array[mid]), isReflexive = computed === computed; if (valIsNaN) { var setLow = isReflexive || retHighest; } else if (valIsUndef) { setLow = isReflexive && (retHighest || typeof computed != 'undefined'); } else { setLow = retHighest ? (computed <= value) : (computed < value); } if (setLow) { low = mid + 1; } else { high = mid; } } return nativeMin(high, MAX_ARRAY_INDEX); } /** * A specialized version of `baseCallback` which only supports `this` binding * and specifying the number of arguments to provide to `func`. * * @private * @param {Function} func The function to bind. * @param {*} thisArg The `this` binding of `func`. * @param {number} [argCount] The number of arguments to provide to `func`. * @returns {Function} Returns the callback. */ function bindCallback(func, thisArg, argCount) { if (typeof func != 'function') { return identity; } if (typeof thisArg == 'undefined') { return func; } switch (argCount) { case 1: return function(value) { return func.call(thisArg, value); }; case 3: return function(value, index, collection) { return func.call(thisArg, value, index, collection); }; case 4: return function(accumulator, value, index, collection) { return func.call(thisArg, accumulator, value, index, collection); }; case 5: return function(value, other, key, object, source) { return func.call(thisArg, value, other, key, object, source); }; } return function() { return func.apply(thisArg, arguments); }; } /** * Creates a clone of the given array buffer. * * @private * @param {ArrayBuffer} buffer The array buffer to clone. * @returns {ArrayBuffer} Returns the cloned array buffer. */ function bufferClone(buffer) { return bufferSlice.call(buffer, 0); } if (!bufferSlice) { // PhantomJS has `ArrayBuffer` and `Uint8Array` but not `Float64Array`. bufferClone = !(ArrayBuffer && Uint8Array) ? constant(null) : function(buffer) { var byteLength = buffer.byteLength, floatLength = Float64Array ? floor(byteLength / FLOAT64_BYTES_PER_ELEMENT) : 0, offset = floatLength * FLOAT64_BYTES_PER_ELEMENT, result = new ArrayBuffer(byteLength); if (floatLength) { var view = new Float64Array(result, 0, floatLength); view.set(new Float64Array(buffer, 0, floatLength)); } if (byteLength != offset) { view = new Uint8Array(result, offset); view.set(new Uint8Array(buffer, offset)); } return result; }; } /** * Creates an array that is the composition of partially applied arguments, * placeholders, and provided arguments into a single array of arguments. * * @private * @param {Array|Object} args The provided arguments. * @param {Array} partials The arguments to prepend to those provided. * @param {Array} holders The `partials` placeholder indexes. * @returns {Array} Returns the new array of composed arguments. */ function composeArgs(args, partials, holders) { var holdersLength = holders.length, argsIndex = -1, argsLength = nativeMax(args.length - holdersLength, 0), leftIndex = -1, leftLength = partials.length, result = Array(argsLength + leftLength); while (++leftIndex < leftLength) { result[leftIndex] = partials[leftIndex]; } while (++argsIndex < holdersLength) { result[holders[argsIndex]] = args[argsIndex]; } while (argsLength--) { result[leftIndex++] = args[argsIndex++]; } return result; } /** * This function is like `composeArgs` except that the arguments composition * is tailored for `_.partialRight`. * * @private * @param {Array|Object} args The provided arguments. * @param {Array} partials The arguments to append to those provided. * @param {Array} holders The `partials` placeholder indexes. * @returns {Array} Returns the new array of composed arguments. */ function composeArgsRight(args, partials, holders) { var holdersIndex = -1, holdersLength = holders.length, argsIndex = -1, argsLength = nativeMax(args.length - holdersLength, 0), rightIndex = -1, rightLength = partials.length, result = Array(argsLength + rightLength); while (++argsIndex < argsLength) { result[argsIndex] = args[argsIndex]; } var pad = argsIndex; while (++rightIndex < rightLength) { result[pad + rightIndex] = partials[rightIndex]; } while (++holdersIndex < holdersLength) { result[pad + holders[holdersIndex]] = args[argsIndex++]; } return result; } /** * Creates a function that aggregates a collection, creating an accumulator * object composed from the results of running each element in the collection * through an iteratee. The `setter` sets the keys and values of the accumulator * object. If `initializer` is provided initializes the accumulator object. * * @private * @param {Function} setter The function to set keys and values of the accumulator object. * @param {Function} [initializer] The function to initialize the accumulator object. * @returns {Function} Returns the new aggregator function. */ function createAggregator(setter, initializer) { return function(collection, iteratee, thisArg) { var result = initializer ? initializer() : {}; iteratee = getCallback(iteratee, thisArg, 3); if (isArray(collection)) { var index = -1, length = collection.length; while (++index < length) { var value = collection[index]; setter(result, value, iteratee(value, index, collection), collection); } } else { baseEach(collection, function(value, key, collection) { setter(result, value, iteratee(value, key, collection), collection); }); } return result; }; } /** * Creates a function that assigns properties of source object(s) to a given * destination object. * * @private * @param {Function} assigner The function to assign values. * @returns {Function} Returns the new assigner function. */ function createAssigner(assigner) { return function() { var length = arguments.length, object = arguments[0]; if (length < 2 || object == null) { return object; } if (length > 3 && isIterateeCall(arguments[1], arguments[2], arguments[3])) { length = 2; } // Juggle arguments. if (length > 3 && typeof arguments[length - 2] == 'function') { var customizer = bindCallback(arguments[--length - 1], arguments[length--], 5); } else if (length > 2 && typeof arguments[length - 1] == 'function') { customizer = arguments[--length]; } var index = 0; while (++index < length) { var source = arguments[index]; if (source) { assigner(object, source, customizer); } } return object; }; } /** * Creates a function that wraps `func` and invokes it with the `this` * binding of `thisArg`. * * @private * @param {Function} func The function to bind. * @param {*} [thisArg] The `this` binding of `func`. * @returns {Function} Returns the new bound function. */ function createBindWrapper(func, thisArg) { var Ctor = createCtorWrapper(func); function wrapper() { return (this instanceof wrapper ? Ctor : func).apply(thisArg, arguments); } return wrapper; } /** * Creates a `Set` cache object to optimize linear searches of large arrays. * * @private * @param {Array} [values] The values to cache. * @returns {null|Object} Returns the new cache object if `Set` is supported, else `null`. */ var createCache = !(nativeCreate && Set) ? constant(null) : function(values) { return new SetCache(values); }; /** * Creates a function that produces compound words out of the words in a * given string. * * @private * @param {Function} callback The function to combine each word. * @returns {Function} Returns the new compounder function. */ function createCompounder(callback) { return function(string) { var index = -1, array = words(deburr(string)), length = array.length, result = ''; while (++index < length) { result = callback(result, array[index], index); } return result; }; } /** * Creates a function that produces an instance of `Ctor` regardless of * whether it was invoked as part of a `new` expression or by `call` or `apply`. * * @private * @param {Function} Ctor The constructor to wrap. * @returns {Function} Returns the new wrapped function. */ function createCtorWrapper(Ctor) { return function() { var thisBinding = baseCreate(Ctor.prototype), result = Ctor.apply(thisBinding, arguments); // Mimic the constructor's `return` behavior. // See https://es5.github.io/#x13.2.2 for more details. return isObject(result) ? result : thisBinding; }; } /** * Creates a function that gets the extremum value of a collection. * * @private * @param {Function} arrayFunc The function to get the extremum value from an array. * @param {boolean} [isMin] Specify returning the minimum, instead of the maximum, * extremum value. * @returns {Function} Returns the new extremum function. */ function createExtremum(arrayFunc, isMin) { return function(collection, iteratee, thisArg) { if (thisArg && isIterateeCall(collection, iteratee, thisArg)) { iteratee = null; } var func = getCallback(), noIteratee = iteratee == null; if (!(func === baseCallback && noIteratee)) { noIteratee = false; iteratee = func(iteratee, thisArg, 3); } if (noIteratee) { var isArr = isArray(collection); if (!isArr && isString(collection)) { iteratee = charAtCallback; } else { return arrayFunc(isArr ? collection : toIterable(collection)); } } return extremumBy(collection, iteratee, isMin); }; } /** * Creates a function that wraps `func` and invokes it with optional `this` * binding of, partial application, and currying. * * @private * @param {Function|string} func The function or method name to reference. * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details. * @param {*} [thisArg] The `this` binding of `func`. * @param {Array} [partials] The arguments to prepend to those provided to the new function. * @param {Array} [holders] The `partials` placeholder indexes. * @param {Array} [partialsRight] The arguments to append to those provided to the new function. * @param {Array} [holdersRight] The `partialsRight` placeholder indexes. * @param {Array} [argPos] The argument positions of the new function. * @param {number} [ary] The arity cap of `func`. * @param {number} [arity] The arity of `func`. * @returns {Function} Returns the new wrapped function. */ function createHybridWrapper(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) { var isAry = bitmask & ARY_FLAG, isBind = bitmask & BIND_FLAG, isBindKey = bitmask & BIND_KEY_FLAG, isCurry = bitmask & CURRY_FLAG, isCurryBound = bitmask & CURRY_BOUND_FLAG, isCurryRight = bitmask & CURRY_RIGHT_FLAG; var Ctor = !isBindKey && createCtorWrapper(func), key = func; function wrapper() { // Avoid `arguments` object use disqualifying optimizations by // converting it to an array before providing it to other functions. var length = arguments.length, index = length, args = Array(length); while (index--) { args[index] = arguments[index]; } if (partials) { args = composeArgs(args, partials, holders); } if (partialsRight) { args = composeArgsRight(args, partialsRight, holdersRight); } if (isCurry || isCurryRight) { var placeholder = wrapper.placeholder, argsHolders = replaceHolders(args, placeholder); length -= argsHolders.length; if (length < arity) { var newArgPos = argPos ? arrayCopy(argPos) : null, newArity = nativeMax(arity - length, 0), newsHolders = isCurry ? argsHolders : null, newHoldersRight = isCurry ? null : argsHolders, newPartials = isCurry ? args : null, newPartialsRight = isCurry ? null : args; bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG); bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG); if (!isCurryBound) { bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG); } var result = createHybridWrapper(func, bitmask, thisArg, newPartials, newsHolders, newPartialsRight, newHoldersRight, newArgPos, ary, newArity); result.placeholder = placeholder; return result; } } var thisBinding = isBind ? thisArg : this; if (isBindKey) { func = thisBinding[key]; } if (argPos) { args = reorder(args, argPos); } if (isAry && ary < args.length) { args.length = ary; } return (this instanceof wrapper ? (Ctor || createCtorWrapper(func)) : func).apply(thisBinding, args); } return wrapper; } /** * Creates the pad required for `string` based on the given padding length. * The `chars` string may be truncated if the number of padding characters * exceeds the padding length. * * @private * @param {string} string The string to create padding for. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the pad for `string`. */ function createPad(string, length, chars) { var strLength = string.length; length = +length; if (strLength >= length || !nativeIsFinite(length)) { return ''; } var padLength = length - strLength; chars = chars == null ? ' ' : (chars + ''); return repeat(chars, ceil(padLength / chars.length)).slice(0, padLength); } /** * Creates a function that wraps `func` and invokes it with the optional `this` * binding of `thisArg` and the `partials` prepended to those provided to * the wrapper. * * @private * @param {Function} func The function to partially apply arguments to. * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details. * @param {*} thisArg The `this` binding of `func`. * @param {Array} partials The arguments to prepend to those provided to the new function. * @returns {Function} Returns the new bound function. */ function createPartialWrapper(func, bitmask, thisArg, partials) { var isBind = bitmask & BIND_FLAG, Ctor = createCtorWrapper(func); function wrapper() { // Avoid `arguments` object use disqualifying optimizations by // converting it to an array before providing it `func`. var argsIndex = -1, argsLength = arguments.length, leftIndex = -1, leftLength = partials.length, args = Array(argsLength + leftLength); while (++leftIndex < leftLength) { args[leftIndex] = partials[leftIndex]; } while (argsLength--) { args[leftIndex++] = arguments[++argsIndex]; } return (this instanceof wrapper ? Ctor : func).apply(isBind ? thisArg : this, args); } return wrapper; } /** * Creates a function that either curries or invokes `func` with optional * `this` binding and partially applied arguments. * * @private * @param {Function|string} func The function or method name to reference. * @param {number} bitmask The bitmask of flags. * The bitmask may be composed of the following flags: * 1 - `_.bind` * 2 - `_.bindKey` * 4 - `_.curry` or `_.curryRight` of a bound function * 8 - `_.curry` * 16 - `_.curryRight` * 32 - `_.partial` * 64 - `_.partialRight` * 128 - `_.rearg` * 256 - `_.ary` * @param {*} [thisArg] The `this` binding of `func`. * @param {Array} [partials] The arguments to be partially applied. * @param {Array} [holders] The `partials` placeholder indexes. * @param {Array} [argPos] The argument positions of the new function. * @param {number} [ary] The arity cap of `func`. * @param {number} [arity] The arity of `func`. * @returns {Function} Returns the new wrapped function. */ function createWrapper(func, bitmask, thisArg, partials, holders, argPos, ary, arity) { var isBindKey = bitmask & BIND_KEY_FLAG; if (!isBindKey && !isFunction(func)) { throw new TypeError(FUNC_ERROR_TEXT); } var length = partials ? partials.length : 0; if (!length) { bitmask &= ~(PARTIAL_FLAG | PARTIAL_RIGHT_FLAG); partials = holders = null; } length -= (holders ? holders.length : 0); if (bitmask & PARTIAL_RIGHT_FLAG) { var partialsRight = partials, holdersRight = holders; partials = holders = null; } var data = !isBindKey && getData(func), newData = [func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity]; if (data && data !== true) { mergeData(newData, data); bitmask = newData[1]; arity = newData[9]; } newData[9] = arity == null ? (isBindKey ? 0 : func.length) : (nativeMax(arity - length, 0) || 0); if (bitmask == BIND_FLAG) { var result = createBindWrapper(newData[0], newData[2]); } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !newData[4].length) { result = createPartialWrapper.apply(null, newData); } else { result = createHybridWrapper.apply(null, newData); } var setter = data ? baseSetData : setData; return setter(result, newData); } /** * A specialized version of `baseIsEqualDeep` for arrays with support for * partial deep comparisons. * * @private * @param {Array} array The array to compare. * @param {Array} other The other array to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} [customizer] The function to customize comparing arrays. * @param {boolean} [isWhere] Specify performing partial comparisons. * @param {Array} [stackA] Tracks traversed `value` objects. * @param {Array} [stackB] Tracks traversed `other` objects. * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`. */ function equalArrays(array, other, equalFunc, customizer, isWhere, stackA, stackB) { var index = -1, arrLength = array.length, othLength = other.length, result = true; if (arrLength != othLength && !(isWhere && othLength > arrLength)) { return false; } // Deep compare the contents, ignoring non-numeric properties. while (result && ++index < arrLength) { var arrValue = array[index], othValue = other[index]; result = undefined; if (customizer) { result = isWhere ? customizer(othValue, arrValue, index) : customizer(arrValue, othValue, index); } if (typeof result == 'undefined') { // Recursively compare arrays (susceptible to call stack limits). if (isWhere) { var othIndex = othLength; while (othIndex--) { othValue = other[othIndex]; result = (arrValue && arrValue === othValue) || equalFunc(arrValue, othValue, customizer, isWhere, stackA, stackB); if (result) { break; } } } else { result = (arrValue && arrValue === othValue) || equalFunc(arrValue, othValue, customizer, isWhere, stackA, stackB); } } } return !!result; } /** * A specialized version of `baseIsEqualDeep` for comparing objects of * the same `toStringTag`. * * **Note:** This function only supports comparing values with tags of * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`. * * @private * @param {Object} value The object to compare. * @param {Object} other The other object to compare. * @param {string} tag The `toStringTag` of the objects to compare. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function equalByTag(object, other, tag) { switch (tag) { case boolTag: case dateTag: // Coerce dates and booleans to numbers, dates to milliseconds and booleans // to `1` or `0` treating invalid dates coerced to `NaN` as not equal. return +object == +other; case errorTag: return object.name == other.name && object.message == other.message; case numberTag: // Treat `NaN` vs. `NaN` as equal. return (object != +object) ? other != +other // But, treat `-0` vs. `+0` as not equal. : (object == 0 ? ((1 / object) == (1 / other)) : object == +other); case regexpTag: case stringTag: // Coerce regexes to strings and treat strings primitives and string // objects as equal. See https://es5.github.io/#x15.10.6.4 for more details. return object == (other + ''); } return false; } /** * A specialized version of `baseIsEqualDeep` for objects with support for * partial deep comparisons. * * @private * @param {Object} object The object to compare. * @param {Object} other The other object to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} [customizer] The function to customize comparing values. * @param {boolean} [isWhere] Specify performing partial comparisons. * @param {Array} [stackA] Tracks traversed `value` objects. * @param {Array} [stackB] Tracks traversed `other` objects. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function equalObjects(object, other, equalFunc, customizer, isWhere, stackA, stackB) { var objProps = keys(object), objLength = objProps.length, othProps = keys(other), othLength = othProps.length; if (objLength != othLength && !isWhere) { return false; } var hasCtor, index = -1; while (++index < objLength) { var key = objProps[index], result = hasOwnProperty.call(other, key); if (result) { var objValue = object[key], othValue = other[key]; result = undefined; if (customizer) { result = isWhere ? customizer(othValue, objValue, key) : customizer(objValue, othValue, key); } if (typeof result == 'undefined') { // Recursively compare objects (susceptible to call stack limits). result = (objValue && objValue === othValue) || equalFunc(objValue, othValue, customizer, isWhere, stackA, stackB); } } if (!result) { return false; } hasCtor || (hasCtor = key == 'constructor'); } if (!hasCtor) { var objCtor = object.constructor, othCtor = other.constructor; // Non `Object` object instances with different constructors are not equal. if (objCtor != othCtor && ('constructor' in object && 'constructor' in other) && !(typeof objCtor == 'function' && objCtor instanceof objCtor && typeof othCtor == 'function' && othCtor instanceof othCtor)) { return false; } } return true; } /** * Gets the extremum value of `collection` invoking `iteratee` for each value * in `collection` to generate the criterion by which the value is ranked. * The `iteratee` is invoked with three arguments; (value, index, collection). * * @private * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {boolean} [isMin] Specify returning the minimum, instead of the * maximum, extremum value. * @returns {*} Returns the extremum value. */ function extremumBy(collection, iteratee, isMin) { var exValue = isMin ? POSITIVE_INFINITY : NEGATIVE_INFINITY, computed = exValue, result = computed; baseEach(collection, function(value, index, collection) { var current = iteratee(value, index, collection); if ((isMin ? current < computed : current > computed) || (current === exValue && current === result)) { computed = current; result = value; } }); return result; } /** * Gets the appropriate "callback" function. If the `_.callback` method is * customized this function returns the custom method, otherwise it returns * the `baseCallback` function. If arguments are provided the chosen function * is invoked with them and its result is returned. * * @private * @returns {Function} Returns the chosen function or its result. */ function getCallback(func, thisArg, argCount) { var result = lodash.callback || callback; result = result === callback ? baseCallback : result; return argCount ? result(func, thisArg, argCount) : result; } /** * Gets metadata for `func`. * * @private * @param {Function} func The function to query. * @returns {*} Returns the metadata for `func`. */ var getData = !metaMap ? noop : function(func) { return metaMap.get(func); }; /** * Gets the appropriate "indexOf" function. If the `_.indexOf` method is * customized this function returns the custom method, otherwise it returns * the `baseIndexOf` function. If arguments are provided the chosen function * is invoked with them and its result is returned. * * @private * @returns {Function|number} Returns the chosen function or its result. */ function getIndexOf(collection, target, fromIndex) { var result = lodash.indexOf || indexOf; result = result === indexOf ? baseIndexOf : result; return collection ? result(collection, target, fromIndex) : result; } /** * Gets the view, applying any `transforms` to the `start` and `end` positions. * * @private * @param {number} start The start of the view. * @param {number} end The end of the view. * @param {Array} [transforms] The transformations to apply to the view. * @returns {Object} Returns an object containing the `start` and `end` * positions of the view. */ function getView(start, end, transforms) { var index = -1, length = transforms ? transforms.length : 0; while (++index < length) { var data = transforms[index], size = data.size; switch (data.type) { case 'drop': start += size; break; case 'dropRight': end -= size; break; case 'take': end = nativeMin(end, start + size); break; case 'takeRight': start = nativeMax(start, end - size); break; } } return { 'start': start, 'end': end }; } /** * Initializes an array clone. * * @private * @param {Array} array The array to clone. * @returns {Array} Returns the initialized clone. */ function initCloneArray(array) { var length = array.length, result = new array.constructor(length); // Add array properties assigned by `RegExp#exec`. if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) { result.index = array.index; result.input = array.input; } return result; } /** * Initializes an object clone. * * @private * @param {Object} object The object to clone. * @returns {Object} Returns the initialized clone. */ function initCloneObject(object) { var Ctor = object.constructor; if (!(typeof Ctor == 'function' && Ctor instanceof Ctor)) { Ctor = Object; } return new Ctor; } /** * Initializes an object clone based on its `toStringTag`. * * **Note:** This function only supports cloning values with tags of * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`. * * * @private * @param {Object} object The object to clone. * @param {string} tag The `toStringTag` of the object to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the initialized clone. */ function initCloneByTag(object, tag, isDeep) { var Ctor = object.constructor; switch (tag) { case arrayBufferTag: return bufferClone(object); case boolTag: case dateTag: return new Ctor(+object); case float32Tag: case float64Tag: case int8Tag: case int16Tag: case int32Tag: case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag: // Safari 5 mobile incorrectly has `Object` as the constructor of typed arrays. if (Ctor instanceof Ctor) { Ctor = ctorByTag[tag]; } var buffer = object.buffer; return new Ctor(isDeep ? bufferClone(buffer) : buffer, object.byteOffset, object.length); case numberTag: case stringTag: return new Ctor(object); case regexpTag: var result = new Ctor(object.source, reFlags.exec(object)); result.lastIndex = object.lastIndex; } return result; } /** * Checks if `func` is eligible for `this` binding. * * @private * @param {Function} func The function to check. * @returns {boolean} Returns `true` if `func` is eligible, else `false`. */ function isBindable(func) { var support = lodash.support, result = !(support.funcNames ? func.name : support.funcDecomp); if (!result) { var source = fnToString.call(func); if (!support.funcNames) { result = !reFuncName.test(source); } if (!result) { // Check if `func` references the `this` keyword and store the result. result = reThis.test(source) || isNative(func); baseSetData(func, result); } } return result; } /** * Checks if `value` is a valid array-like index. * * @private * @param {*} value The value to check. * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index. * @returns {boolean} Returns `true` if `value` is a valid index, else `false`. */ function isIndex(value, length) { value = +value; length = length == null ? MAX_SAFE_INTEGER : length; return value > -1 && value % 1 == 0 && value < length; } /** * Checks if the provided arguments are from an iteratee call. * * @private * @param {*} value The potential iteratee value argument. * @param {*} index The potential iteratee index or key argument. * @param {*} object The potential iteratee object argument. * @returns {boolean} Returns `true` if the arguments are from an iteratee call, else `false`. */ function isIterateeCall(value, index, object) { if (!isObject(object)) { return false; } var type = typeof index; if (type == 'number') { var length = object.length, prereq = isLength(length) && isIndex(index, length); } else { prereq = type == 'string' && index in object; } return prereq && object[index] === value; } /** * Checks if `value` is a valid array-like length. * * **Note:** This function is based on ES `ToLength`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength) * for more details. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a valid length, else `false`. */ function isLength(value) { return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER; } /** * Checks if `value` is suitable for strict equality comparisons, i.e. `===`. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` if suitable for strict * equality comparisons, else `false`. */ function isStrictComparable(value) { return value === value && (value === 0 ? ((1 / value) > 0) : !isObject(value)); } /** * Merges the function metadata of `source` into `data`. * * Merging metadata reduces the number of wrappers required to invoke a function. * This is possible because methods like `_.bind`, `_.curry`, and `_.partial` * may be applied regardless of execution order. Methods like `_.ary` and `_.rearg` * augment function arguments, making the order in which they are executed important, * preventing the merging of metadata. However, we make an exception for a safe * common case where curried functions have `_.ary` and or `_.rearg` applied. * * @private * @param {Array} data The destination metadata. * @param {Array} source The source metadata. * @returns {Array} Returns `data`. */ function mergeData(data, source) { var bitmask = data[1], srcBitmask = source[1], newBitmask = bitmask | srcBitmask; var arityFlags = ARY_FLAG | REARG_FLAG, bindFlags = BIND_FLAG | BIND_KEY_FLAG, comboFlags = arityFlags | bindFlags | CURRY_BOUND_FLAG | CURRY_RIGHT_FLAG; var isAry = bitmask & ARY_FLAG && !(srcBitmask & ARY_FLAG), isRearg = bitmask & REARG_FLAG && !(srcBitmask & REARG_FLAG), argPos = (isRearg ? data : source)[7], ary = (isAry ? data : source)[8]; var isCommon = !(bitmask >= REARG_FLAG && srcBitmask > bindFlags) && !(bitmask > bindFlags && srcBitmask >= REARG_FLAG); var isCombo = (newBitmask >= arityFlags && newBitmask <= comboFlags) && (bitmask < REARG_FLAG || ((isRearg || isAry) && argPos.length <= ary)); // Exit early if metadata can't be merged. if (!(isCommon || isCombo)) { return data; } // Use source `thisArg` if available. if (srcBitmask & BIND_FLAG) { data[2] = source[2]; // Set when currying a bound function. newBitmask |= (bitmask & BIND_FLAG) ? 0 : CURRY_BOUND_FLAG; } // Compose partial arguments. var value = source[3]; if (value) { var partials = data[3]; data[3] = partials ? composeArgs(partials, value, source[4]) : arrayCopy(value); data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : arrayCopy(source[4]); } // Compose partial right arguments. value = source[5]; if (value) { partials = data[5]; data[5] = partials ? composeArgsRight(partials, value, source[6]) : arrayCopy(value); data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : arrayCopy(source[6]); } // Use source `argPos` if available. value = source[7]; if (value) { data[7] = arrayCopy(value); } // Use source `ary` if it's smaller. if (srcBitmask & ARY_FLAG) { data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]); } // Use source `arity` if one is not provided. if (data[9] == null) { data[9] = source[9]; } // Use source `func` and merge bitmasks. data[0] = source[0]; data[1] = newBitmask; return data; } /** * A specialized version of `_.pick` that picks `object` properties specified * by the `props` array. * * @private * @param {Object} object The source object. * @param {string[]} props The property names to pick. * @returns {Object} Returns the new object. */ function pickByArray(object, props) { object = toObject(object); var index = -1, length = props.length, result = {}; while (++index < length) { var key = props[index]; if (key in object) { result[key] = object[key]; } } return result; } /** * A specialized version of `_.pick` that picks `object` properties `predicate` * returns truthy for. * * @private * @param {Object} object The source object. * @param {Function} predicate The function invoked per iteration. * @returns {Object} Returns the new object. */ function pickByCallback(object, predicate) { var result = {}; baseForIn(object, function(value, key, object) { if (predicate(value, key, object)) { result[key] = value; } }); return result; } /** * Reorder `array` according to the specified indexes where the element at * the first index is assigned as the first element, the element at * the second index is assigned as the second element, and so on. * * @private * @param {Array} array The array to reorder. * @param {Array} indexes The arranged array indexes. * @returns {Array} Returns `array`. */ function reorder(array, indexes) { var arrLength = array.length, length = nativeMin(indexes.length, arrLength), oldArray = arrayCopy(array); while (length--) { var index = indexes[length]; array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined; } return array; } /** * Sets metadata for `func`. * * **Note:** If this function becomes hot, i.e. is invoked a lot in a short * period of time, it will trip its breaker and transition to an identity function * to avoid garbage collection pauses in V8. See [V8 issue 2070](https://code.google.com/p/v8/issues/detail?id=2070) * for more details. * * @private * @param {Function} func The function to associate metadata with. * @param {*} data The metadata. * @returns {Function} Returns `func`. */ var setData = (function() { var count = 0, lastCalled = 0; return function(key, value) { var stamp = now(), remaining = HOT_SPAN - (stamp - lastCalled); lastCalled = stamp; if (remaining > 0) { if (++count >= HOT_COUNT) { return key; } } else { count = 0; } return baseSetData(key, value); }; }()); /** * A fallback implementation of `_.isPlainObject` which checks if `value` * is an object created by the `Object` constructor or has a `[[Prototype]]` * of `null`. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a plain object, else `false`. */ function shimIsPlainObject(value) { var Ctor, support = lodash.support; // Exit early for non `Object` objects. if (!(isObjectLike(value) && objToString.call(value) == objectTag && !isHostObject(value)) || (!hasOwnProperty.call(value, 'constructor') && (Ctor = value.constructor, typeof Ctor == 'function' && !(Ctor instanceof Ctor))) || (!support.argsTag && isArguments(value))) { return false; } // IE < 9 iterates inherited properties before own properties. If the first // iterated property is an object's own property then there are no inherited // enumerable properties. var result; if (support.ownLast) { baseForIn(value, function(subValue, key, object) { result = hasOwnProperty.call(object, key); return false; }); return result !== false; } // In most environments an object's own properties are iterated before // its inherited properties. If the last iterated property is an object's // own property then there are no inherited enumerable properties. baseForIn(value, function(subValue, key) { result = key; }); return typeof result == 'undefined' || hasOwnProperty.call(value, result); } /** * A fallback implementation of `Object.keys` which creates an array of the * own enumerable property names of `object`. * * @private * @param {Object} object The object to inspect. * @returns {Array} Returns the array of property names. */ function shimKeys(object) { var props = keysIn(object), propsLength = props.length, length = propsLength && object.length, support = lodash.support; var allowIndexes = length && isLength(length) && (isArray(object) || (support.nonEnumStrings && isString(object)) || (support.nonEnumArgs && isArguments(object))); var index = -1, result = []; while (++index < propsLength) { var key = props[index]; if ((allowIndexes && isIndex(key, length)) || hasOwnProperty.call(object, key)) { result.push(key); } } return result; } /** * Converts `value` to an array-like object if it is not one. * * @private * @param {*} value The value to process. * @returns {Array|Object} Returns the array-like object. */ function toIterable(value) { if (value == null) { return []; } if (!isLength(value.length)) { return values(value); } if (lodash.support.unindexedChars && isString(value)) { return value.split(''); } return isObject(value) ? value : Object(value); } /** * Converts `value` to an object if it is not one. * * @private * @param {*} value The value to process. * @returns {Object} Returns the object. */ function toObject(value) { if (lodash.support.unindexedChars && isString(value)) { var index = -1, length = value.length, result = Object(value); while (++index < length) { result[index] = value.charAt(index); } return result; } return isObject(value) ? value : Object(value); } /*------------------------------------------------------------------------*/ /** * Creates an array of elements split into groups the length of `size`. * If `collection` can't be split evenly, the final chunk will be the remaining * elements. * * @static * @memberOf _ * @category Array * @param {Array} array The array to process. * @param {numer} [size=1] The length of each chunk. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Array} Returns the new array containing chunks. * @example * * _.chunk(['a', 'b', 'c', 'd'], 2); * // => [['a', 'b'], ['c', 'd']] * * _.chunk(['a', 'b', 'c', 'd'], 3); * // => [['a', 'b', 'c'], ['d']] */ function chunk(array, size, guard) { if (guard ? isIterateeCall(array, size, guard) : size == null) { size = 1; } else { size = nativeMax(+size || 1, 1); } var index = 0, length = array ? array.length : 0, resIndex = -1, result = Array(ceil(length / size)); while (index < length) { result[++resIndex] = baseSlice(array, index, (index += size)); } return result; } /** * Creates an array with all falsey values removed. The values `false`, `null`, * `0`, `""`, `undefined`, and `NaN` are falsey. * * @static * @memberOf _ * @category Array * @param {Array} array The array to compact. * @returns {Array} Returns the new array of filtered values. * @example * * _.compact([0, 1, false, 2, '', 3]); * // => [1, 2, 3] */ function compact(array) { var index = -1, length = array ? array.length : 0, resIndex = -1, result = []; while (++index < length) { var value = array[index]; if (value) { result[++resIndex] = value; } } return result; } /** * Creates an array excluding all values of the provided arrays using * `SameValueZero` for equality comparisons. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The arrays of values to exclude. * @returns {Array} Returns the new array of filtered values. * @example * * _.difference([1, 2, 3], [5, 2, 10]); * // => [1, 3] */ function difference() { var index = -1, length = arguments.length; while (++index < length) { var value = arguments[index]; if (isArray(value) || isArguments(value)) { break; } } return baseDifference(value, baseFlatten(arguments, false, true, ++index)); } /** * Creates a slice of `array` with `n` elements dropped from the beginning. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to drop. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.drop([1, 2, 3]); * // => [2, 3] * * _.drop([1, 2, 3], 2); * // => [3] * * _.drop([1, 2, 3], 5); * // => [] * * _.drop([1, 2, 3], 0); * // => [1, 2, 3] */ function drop(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } if (guard ? isIterateeCall(array, n, guard) : n == null) { n = 1; } return baseSlice(array, n < 0 ? 0 : n); } /** * Creates a slice of `array` with `n` elements dropped from the end. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to drop. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.dropRight([1, 2, 3]); * // => [1, 2] * * _.dropRight([1, 2, 3], 2); * // => [1] * * _.dropRight([1, 2, 3], 5); * // => [] * * _.dropRight([1, 2, 3], 0); * // => [1, 2, 3] */ function dropRight(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } if (guard ? isIterateeCall(array, n, guard) : n == null) { n = 1; } n = length - (+n || 0); return baseSlice(array, 0, n < 0 ? 0 : n); } /** * Creates a slice of `array` excluding elements dropped from the end. * Elements are dropped until `predicate` returns falsey. The predicate is * bound to `thisArg` and invoked with three arguments; (value, index, array). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per element. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the slice of `array`. * @example * * _.dropRightWhile([1, 2, 3], function(n) { return n > 1; }); * // => [1] * * var users = [ * { 'user': 'barney', 'status': 'busy', 'active': false }, * { 'user': 'fred', 'status': 'busy', 'active': true }, * { 'user': 'pebbles', 'status': 'away', 'active': true } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.dropRightWhile(users, 'active'), 'user'); * // => ['barney'] * * // using the "_.matches" callback shorthand * _.pluck(_.dropRightWhile(users, { 'status': 'away' }), 'user'); * // => ['barney', 'fred'] */ function dropRightWhile(array, predicate, thisArg) { var length = array ? array.length : 0; if (!length) { return []; } predicate = getCallback(predicate, thisArg, 3); while (length-- && predicate(array[length], length, array)) {} return baseSlice(array, 0, length + 1); } /** * Creates a slice of `array` excluding elements dropped from the beginning. * Elements are dropped until `predicate` returns falsey. The predicate is * bound to `thisArg` and invoked with three arguments; (value, index, array). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per element. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the slice of `array`. * @example * * _.dropWhile([1, 2, 3], function(n) { return n < 3; }); * // => [3] * * var users = [ * { 'user': 'barney', 'status': 'busy', 'active': true }, * { 'user': 'fred', 'status': 'busy', 'active': false }, * { 'user': 'pebbles', 'status': 'away', 'active': true } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.dropWhile(users, 'active'), 'user'); * // => ['fred', 'pebbles'] * * // using the "_.matches" callback shorthand * _.pluck(_.dropWhile(users, { 'status': 'busy' }), 'user'); * // => ['pebbles'] */ function dropWhile(array, predicate, thisArg) { var length = array ? array.length : 0; if (!length) { return []; } var index = -1; predicate = getCallback(predicate, thisArg, 3); while (++index < length && predicate(array[index], index, array)) {} return baseSlice(array, index); } /** * This method is like `_.find` except that it returns the index of the first * element `predicate` returns truthy for, instead of the element itself. * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Array * @param {Array} array The array to search. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {number} Returns the index of the found element, else `-1`. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true }, * { 'user': 'pebbles', 'age': 1, 'active': false } * ]; * * _.findIndex(users, function(chr) { return chr.age < 40; }); * // => 0 * * // using the "_.matches" callback shorthand * _.findIndex(users, { 'age': 1 }); * // => 2 * * // using the "_.property" callback shorthand * _.findIndex(users, 'active'); * // => 1 */ function findIndex(array, predicate, thisArg) { var index = -1, length = array ? array.length : 0; predicate = getCallback(predicate, thisArg, 3); while (++index < length) { if (predicate(array[index], index, array)) { return index; } } return -1; } /** * This method is like `_.findIndex` except that it iterates over elements * of `collection` from right to left. * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Array * @param {Array} array The array to search. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {number} Returns the index of the found element, else `-1`. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': true }, * { 'user': 'fred', 'age': 40, 'active': false }, * { 'user': 'pebbles', 'age': 1, 'active': false } * ]; * * _.findLastIndex(users, function(chr) { return chr.age < 40; }); * // => 2 * * // using the "_.matches" callback shorthand * _.findLastIndex(users, { 'age': 40 }); * // => 1 * * // using the "_.property" callback shorthand * _.findLastIndex(users, 'active'); * // => 0 */ function findLastIndex(array, predicate, thisArg) { var length = array ? array.length : 0; predicate = getCallback(predicate, thisArg, 3); while (length--) { if (predicate(array[length], length, array)) { return length; } } return -1; } /** * Gets the first element of `array`. * * @static * @memberOf _ * @alias head * @category Array * @param {Array} array The array to query. * @returns {*} Returns the first element of `array`. * @example * * _.first([1, 2, 3]); * // => 1 * * _.first([]); * // => undefined */ function first(array) { return array ? array[0] : undefined; } /** * Flattens a nested array. If `isDeep` is `true` the array is recursively * flattened, otherwise it is only flattened a single level. * * @static * @memberOf _ * @category Array * @param {Array} array The array to flatten. * @param {boolean} [isDeep] Specify a deep flatten. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Array} Returns the new flattened array. * @example * * _.flatten([1, [2], [3, [[4]]]]); * // => [1, 2, 3, [[4]]]; * * // using `isDeep` * _.flatten([1, [2], [3, [[4]]]], true); * // => [1, 2, 3, 4]; */ function flatten(array, isDeep, guard) { var length = array ? array.length : 0; if (guard && isIterateeCall(array, isDeep, guard)) { isDeep = false; } return length ? baseFlatten(array, isDeep) : []; } /** * Recursively flattens a nested array. * * @static * @memberOf _ * @category Array * @param {Array} array The array to recursively flatten. * @returns {Array} Returns the new flattened array. * @example * * _.flattenDeep([1, [2], [3, [[4]]]]); * // => [1, 2, 3, 4]; */ function flattenDeep(array) { var length = array ? array.length : 0; return length ? baseFlatten(array, true) : []; } /** * Gets the index at which the first occurrence of `value` is found in `array` * using `SameValueZero` for equality comparisons. If `fromIndex` is negative, * it is used as the offset from the end of `array`. If `array` is sorted * providing `true` for `fromIndex` performs a faster binary search. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @category Array * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {boolean|number} [fromIndex=0] The index to search from or `true` * to perform a binary search on a sorted array. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.indexOf([1, 2, 3, 1, 2, 3], 2); * // => 1 * * // using `fromIndex` * _.indexOf([1, 2, 3, 1, 2, 3], 2, 3); * // => 4 * * // performing a binary search * _.indexOf([4, 4, 5, 5, 6, 6], 5, true); * // => 2 */ function indexOf(array, value, fromIndex) { var length = array ? array.length : 0; if (!length) { return -1; } if (typeof fromIndex == 'number') { fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0); } else if (fromIndex) { var index = binaryIndex(array, value), other = array[index]; return (value === value ? value === other : other !== other) ? index : -1; } return baseIndexOf(array, value, fromIndex); } /** * Gets all but the last element of `array`. * * @static * @memberOf _ * @category Array * @param {Array} array The array to query. * @returns {Array} Returns the slice of `array`. * @example * * _.initial([1, 2, 3]); * // => [1, 2] */ function initial(array) { return dropRight(array, 1); } /** * Creates an array of unique values in all provided arrays using `SameValueZero` * for equality comparisons. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of shared values. * @example * * _.intersection([1, 2, 3], [5, 2, 1, 4], [2, 1]); * // => [1, 2] */ function intersection() { var args = [], argsIndex = -1, argsLength = arguments.length, caches = [], indexOf = getIndexOf(), isCommon = indexOf == baseIndexOf; while (++argsIndex < argsLength) { var value = arguments[argsIndex]; if (isArray(value) || isArguments(value)) { args.push(value); caches.push(isCommon && value.length >= 120 && createCache(argsIndex && value)); } } argsLength = args.length; var array = args[0], index = -1, length = array ? array.length : 0, result = [], seen = caches[0]; outer: while (++index < length) { value = array[index]; if ((seen ? cacheIndexOf(seen, value) : indexOf(result, value)) < 0) { argsIndex = argsLength; while (--argsIndex) { var cache = caches[argsIndex]; if ((cache ? cacheIndexOf(cache, value) : indexOf(args[argsIndex], value)) < 0) { continue outer; } } if (seen) { seen.push(value); } result.push(value); } } return result; } /** * Gets the last element of `array`. * * @static * @memberOf _ * @category Array * @param {Array} array The array to query. * @returns {*} Returns the last element of `array`. * @example * * _.last([1, 2, 3]); * // => 3 */ function last(array) { var length = array ? array.length : 0; return length ? array[length - 1] : undefined; } /** * This method is like `_.indexOf` except that it iterates over elements of * `array` from right to left. * * @static * @memberOf _ * @category Array * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {boolean|number} [fromIndex=array.length-1] The index to search from * or `true` to perform a binary search on a sorted array. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.lastIndexOf([1, 2, 3, 1, 2, 3], 2); * // => 4 * * // using `fromIndex` * _.lastIndexOf([1, 2, 3, 1, 2, 3], 2, 3); * // => 1 * * // performing a binary search * _.lastIndexOf([4, 4, 5, 5, 6, 6], 5, true); * // => 3 */ function lastIndexOf(array, value, fromIndex) { var length = array ? array.length : 0; if (!length) { return -1; } var index = length; if (typeof fromIndex == 'number') { index = (fromIndex < 0 ? nativeMax(length + fromIndex, 0) : nativeMin(fromIndex || 0, length - 1)) + 1; } else if (fromIndex) { index = binaryIndex(array, value, true) - 1; var other = array[index]; return (value === value ? value === other : other !== other) ? index : -1; } if (value !== value) { return indexOfNaN(array, index, true); } while (index--) { if (array[index] === value) { return index; } } return -1; } /** * Removes all provided values from `array` using `SameValueZero` for equality * comparisons. * * **Notes:** * - Unlike `_.without`, this method mutates `array`. * - `SameValueZero` comparisons are like strict equality comparisons, e.g. `===`, * except that `NaN` matches `NaN`. See the [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @category Array * @param {Array} array The array to modify. * @param {...*} [values] The values to remove. * @returns {Array} Returns `array`. * @example * * var array = [1, 2, 3, 1, 2, 3]; * _.pull(array, 2, 3); * console.log(array); * // => [1, 1] */ function pull() { var array = arguments[0]; if (!(array && array.length)) { return array; } var index = 0, indexOf = getIndexOf(), length = arguments.length; while (++index < length) { var fromIndex = 0, value = arguments[index]; while ((fromIndex = indexOf(array, value, fromIndex)) > -1) { splice.call(array, fromIndex, 1); } } return array; } /** * Removes elements from `array` corresponding to the given indexes and returns * an array of the removed elements. Indexes may be specified as an array of * indexes or as individual arguments. * * **Note:** Unlike `_.at`, this method mutates `array`. * * @static * @memberOf _ * @category Array * @param {Array} array The array to modify. * @param {...(number|number[])} [indexes] The indexes of elements to remove, * specified as individual indexes or arrays of indexes. * @returns {Array} Returns the new array of removed elements. * @example * * var array = [5, 10, 15, 20]; * var evens = _.pullAt(array, [1, 3]); * * console.log(array); * // => [5, 15] * * console.log(evens); * // => [10, 20] */ function pullAt(array) { return basePullAt(array || [], baseFlatten(arguments, false, false, 1)); } /** * Removes all elements from `array` that `predicate` returns truthy for * and returns an array of the removed elements. The predicate is bound to * `thisArg` and invoked with three arguments; (value, index, array). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * **Note:** Unlike `_.filter`, this method mutates `array`. * * @static * @memberOf _ * @category Array * @param {Array} array The array to modify. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the new array of removed elements. * @example * * var array = [1, 2, 3, 4]; * var evens = _.remove(array, function(n) { return n % 2 == 0; }); * * console.log(array); * // => [1, 3] * * console.log(evens); * // => [2, 4] */ function remove(array, predicate, thisArg) { var index = -1, length = array ? array.length : 0, result = []; predicate = getCallback(predicate, thisArg, 3); while (++index < length) { var value = array[index]; if (predicate(value, index, array)) { result.push(value); splice.call(array, index--, 1); length--; } } return result; } /** * Gets all but the first element of `array`. * * @static * @memberOf _ * @alias tail * @category Array * @param {Array} array The array to query. * @returns {Array} Returns the slice of `array`. * @example * * _.rest([1, 2, 3]); * // => [2, 3] */ function rest(array) { return drop(array, 1); } /** * Creates a slice of `array` from `start` up to, but not including, `end`. * * **Note:** This function is used instead of `Array#slice` to support node * lists in IE < 9 and to ensure dense arrays are returned. * * @static * @memberOf _ * @category Array * @param {Array} array The array to slice. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns the slice of `array`. */ function slice(array, start, end) { var length = array ? array.length : 0; if (!length) { return []; } if (end && typeof end != 'number' && isIterateeCall(array, start, end)) { start = 0; end = length; } return baseSlice(array, start, end); } /** * Uses a binary search to determine the lowest index at which `value` should * be inserted into `array` in order to maintain its sort order. If an iteratee * function is provided it is invoked for `value` and each element of `array` * to compute their sort ranking. The iteratee is bound to `thisArg` and * invoked with one argument; (value). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * _.sortedIndex([30, 50], 40); * // => 1 * * _.sortedIndex([4, 4, 5, 5, 6, 6], 5); * // => 2 * * var dict = { 'data': { 'thirty': 30, 'forty': 40, 'fifty': 50 } }; * * // using an iteratee function * _.sortedIndex(['thirty', 'fifty'], 'forty', function(word) { * return this.data[word]; * }, dict); * // => 1 * * // using the "_.property" callback shorthand * _.sortedIndex([{ 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x'); * // => 1 */ function sortedIndex(array, value, iteratee, thisArg) { var func = getCallback(iteratee); return (func === baseCallback && iteratee == null) ? binaryIndex(array, value) : binaryIndexBy(array, value, func(iteratee, thisArg, 1)); } /** * This method is like `_.sortedIndex` except that it returns the highest * index at which `value` should be inserted into `array` in order to * maintain its sort order. * * @static * @memberOf _ * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * _.sortedLastIndex([4, 4, 5, 5, 6, 6], 5); * // => 4 */ function sortedLastIndex(array, value, iteratee, thisArg) { var func = getCallback(iteratee); return (func === baseCallback && iteratee == null) ? binaryIndex(array, value, true) : binaryIndexBy(array, value, func(iteratee, thisArg, 1), true); } /** * Creates a slice of `array` with `n` elements taken from the beginning. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to take. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.take([1, 2, 3]); * // => [1] * * _.take([1, 2, 3], 2); * // => [1, 2] * * _.take([1, 2, 3], 5); * // => [1, 2, 3] * * _.take([1, 2, 3], 0); * // => [] */ function take(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } if (guard ? isIterateeCall(array, n, guard) : n == null) { n = 1; } return baseSlice(array, 0, n < 0 ? 0 : n); } /** * Creates a slice of `array` with `n` elements taken from the end. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to take. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.takeRight([1, 2, 3]); * // => [3] * * _.takeRight([1, 2, 3], 2); * // => [2, 3] * * _.takeRight([1, 2, 3], 5); * // => [1, 2, 3] * * _.takeRight([1, 2, 3], 0); * // => [] */ function takeRight(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } if (guard ? isIterateeCall(array, n, guard) : n == null) { n = 1; } n = length - (+n || 0); return baseSlice(array, n < 0 ? 0 : n); } /** * Creates a slice of `array` with elements taken from the end. Elements are * taken until `predicate` returns falsey. The predicate is bound to `thisArg` * and invoked with three arguments; (value, index, array). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per element. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the slice of `array`. * @example * * _.takeRightWhile([1, 2, 3], function(n) { return n > 1; }); * // => [2, 3] * * var users = [ * { 'user': 'barney', 'status': 'busy', 'active': false }, * { 'user': 'fred', 'status': 'busy', 'active': true }, * { 'user': 'pebbles', 'status': 'away', 'active': true } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.takeRightWhile(users, 'active'), 'user'); * // => ['fred', 'pebbles'] * * // using the "_.matches" callback shorthand * _.pluck(_.takeRightWhile(users, { 'status': 'away' }), 'user'); * // => ['pebbles'] */ function takeRightWhile(array, predicate, thisArg) { var length = array ? array.length : 0; if (!length) { return []; } predicate = getCallback(predicate, thisArg, 3); while (length-- && predicate(array[length], length, array)) {} return baseSlice(array, length + 1); } /** * Creates a slice of `array` with elements taken from the beginning. Elements * are taken until `predicate` returns falsey. The predicate is bound to * `thisArg` and invoked with three arguments; (value, index, array). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @type Function * @category Array * @param {Array} array The array to query. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per element. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the slice of `array`. * @example * * _.takeWhile([1, 2, 3], function(n) { return n < 3; }); * // => [1, 2] * * var users = [ * { 'user': 'barney', 'status': 'busy', 'active': true }, * { 'user': 'fred', 'status': 'busy', 'active': false }, * { 'user': 'pebbles', 'status': 'away', 'active': true } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.takeWhile(users, 'active'), 'user'); * // => ['barney'] * * // using the "_.matches" callback shorthand * _.pluck(_.takeWhile(users, { 'status': 'busy' }), 'user'); * // => ['barney', 'fred'] */ function takeWhile(array, predicate, thisArg) { var length = array ? array.length : 0; if (!length) { return []; } var index = -1; predicate = getCallback(predicate, thisArg, 3); while (++index < length && predicate(array[index], index, array)) {} return baseSlice(array, 0, index); } /** * Creates an array of unique values, in order, of the provided arrays using * `SameValueZero` for equality comparisons. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of combined values. * @example * * _.union([1, 2, 3], [5, 2, 1, 4], [2, 1]); * // => [1, 2, 3, 5, 4] */ function union() { return baseUniq(baseFlatten(arguments, false, true)); } /** * Creates a duplicate-value-free version of an array using `SameValueZero` * for equality comparisons. Providing `true` for `isSorted` performs a faster * search algorithm for sorted arrays. If an iteratee function is provided it * is invoked for each value in the array to generate the criterion by which * uniqueness is computed. The `iteratee` is bound to `thisArg` and invoked * with three arguments; (value, index, array). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @alias unique * @category Array * @param {Array} array The array to inspect. * @param {boolean} [isSorted] Specify the array is sorted. * @param {Function|Object|string} [iteratee] The function invoked per iteration. * If a property name or object is provided it is used to create a "_.property" * or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Array} Returns the new duplicate-value-free array. * @example * * _.uniq([1, 2, 1]); * // => [1, 2] * * // using `isSorted` * _.uniq([1, 1, 2], true); * // => [1, 2] * * // using an iteratee function * _.uniq([1, 2.5, 1.5, 2], function(n) { return this.floor(n); }, Math); * // => [1, 2.5] * * // using the "_.property" callback shorthand * _.uniq([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }, { 'x': 2 }] */ function uniq(array, isSorted, iteratee, thisArg) { var length = array ? array.length : 0; if (!length) { return []; } // Juggle arguments. if (typeof isSorted != 'boolean' && isSorted != null) { thisArg = iteratee; iteratee = isIterateeCall(array, isSorted, thisArg) ? null : isSorted; isSorted = false; } var func = getCallback(); if (!(func === baseCallback && iteratee == null)) { iteratee = func(iteratee, thisArg, 3); } return (isSorted && getIndexOf() == baseIndexOf) ? sortedUniq(array, iteratee) : baseUniq(array, iteratee); } /** * This method is like `_.zip` except that it accepts an array of grouped * elements and creates an array regrouping the elements to their pre-`_.zip` * configuration. * * @static * @memberOf _ * @category Array * @param {Array} array The array of grouped elements to process. * @returns {Array} Returns the new array of regrouped elements. * @example * * var zipped = _.zip(['fred', 'barney'], [30, 40], [true, false]); * // => [['fred', 30, true], ['barney', 40, false]] * * _.unzip(zipped); * // => [['fred', 'barney'], [30, 40], [true, false]] */ function unzip(array) { var index = -1, length = (array && array.length && arrayMax(arrayMap(array, getLength))) >>> 0, result = Array(length); while (++index < length) { result[index] = arrayMap(array, baseProperty(index)); } return result; } /** * Creates an array excluding all provided values using `SameValueZero` for * equality comparisons. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @category Array * @param {Array} array The array to filter. * @param {...*} [values] The values to exclude. * @returns {Array} Returns the new array of filtered values. * @example * * _.without([1, 2, 1, 0, 3, 1, 4], 0, 1); * // => [2, 3, 4] */ function without(array) { return baseDifference(array, baseSlice(arguments, 1)); } /** * Creates an array that is the symmetric difference of the provided arrays. * See [Wikipedia](https://en.wikipedia.org/wiki/Symmetric_difference) for * more details. * * @static * @memberOf _ * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of values. * @example * * _.xor([1, 2, 3], [5, 2, 1, 4]); * // => [3, 5, 4] * * _.xor([1, 2, 5], [2, 3, 5], [3, 4, 5]); * // => [1, 4, 5] */ function xor() { var index = -1, length = arguments.length; while (++index < length) { var array = arguments[index]; if (isArray(array) || isArguments(array)) { var result = result ? baseDifference(result, array).concat(baseDifference(array, result)) : array; } } return result ? baseUniq(result) : []; } /** * Creates an array of grouped elements, the first of which contains the first * elements of the given arrays, the second of which contains the second elements * of the given arrays, and so on. * * @static * @memberOf _ * @category Array * @param {...Array} [arrays] The arrays to process. * @returns {Array} Returns the new array of grouped elements. * @example * * _.zip(['fred', 'barney'], [30, 40], [true, false]); * // => [['fred', 30, true], ['barney', 40, false]] */ function zip() { var length = arguments.length, array = Array(length); while (length--) { array[length] = arguments[length]; } return unzip(array); } /** * Creates an object composed from arrays of property names and values. Provide * either a single two dimensional array, e.g. `[[key1, value1], [key2, value2]]` * or two arrays, one of property names and one of corresponding values. * * @static * @memberOf _ * @alias object * @category Array * @param {Array} props The property names. * @param {Array} [values=[]] The property values. * @returns {Object} Returns the new object. * @example * * _.zipObject(['fred', 'barney'], [30, 40]); * // => { 'fred': 30, 'barney': 40 } */ function zipObject(props, values) { var index = -1, length = props ? props.length : 0, result = {}; if (length && !values && !isArray(props[0])) { values = []; } while (++index < length) { var key = props[index]; if (values) { result[key] = values[index]; } else if (key) { result[key[0]] = key[1]; } } return result; } /*------------------------------------------------------------------------*/ /** * Creates a `lodash` object that wraps `value` with explicit method * chaining enabled. * * @static * @memberOf _ * @category Chain * @param {*} value The value to wrap. * @returns {Object} Returns the new `lodash` object. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'pebbles', 'age': 1 } * ]; * * var youngest = _.chain(users) * .sortBy('age') * .map(function(chr) { return chr.user + ' is ' + chr.age; }) * .first() * .value(); * // => 'pebbles is 1' */ function chain(value) { var result = lodash(value); result.__chain__ = true; return result; } /** * This method invokes `interceptor` and returns `value`. The interceptor is * bound to `thisArg` and invoked with one argument; (value). The purpose of * this method is to "tap into" a method chain in order to perform operations * on intermediate results within the chain. * * @static * @memberOf _ * @category Chain * @param {*} value The value to provide to `interceptor`. * @param {Function} interceptor The function to invoke. * @param {*} [thisArg] The `this` binding of `interceptor`. * @returns {*} Returns `value`. * @example * * _([1, 2, 3]) * .tap(function(array) { array.pop(); }) * .reverse() * .value(); * // => [2, 1] */ function tap(value, interceptor, thisArg) { interceptor.call(thisArg, value); return value; } /** * This method is like `_.tap` except that it returns the result of `interceptor`. * * @static * @memberOf _ * @category Chain * @param {*} value The value to provide to `interceptor`. * @param {Function} interceptor The function to invoke. * @param {*} [thisArg] The `this` binding of `interceptor`. * @returns {*} Returns the result of `interceptor`. * @example * * _([1, 2, 3]) * .last() * .thru(function(value) { return [value]; }) * .value(); * // => [3] */ function thru(value, interceptor, thisArg) { return interceptor.call(thisArg, value); } /** * Enables explicit method chaining on the wrapper object. * * @name chain * @memberOf _ * @category Chain * @returns {*} Returns the `lodash` object. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * // without explicit chaining * _(users).first(); * // => { 'user': 'barney', 'age': 36 } * * // with explicit chaining * _(users).chain() * .first() * .pick('user') * .value(); * // => { 'user': 'barney' } */ function wrapperChain() { return chain(this); } /** * Reverses the wrapped array so the first element becomes the last, the * second element becomes the second to last, and so on. * * **Note:** This method mutates the wrapped array. * * @name reverse * @memberOf _ * @category Chain * @returns {Object} Returns the new reversed `lodash` object. * @example * * var array = [1, 2, 3]; * * _(array).reverse().value() * // => [3, 2, 1] * * console.log(array); * // => [3, 2, 1] */ function wrapperReverse() { var value = this.__wrapped__; if (value instanceof LazyWrapper) { if (this.__actions__.length) { value = new LazyWrapper(this); } return new LodashWrapper(value.reverse()); } return this.thru(function(value) { return value.reverse(); }); } /** * Produces the result of coercing the unwrapped value to a string. * * @name toString * @memberOf _ * @category Chain * @returns {string} Returns the coerced string value. * @example * * _([1, 2, 3]).toString(); * // => '1,2,3' */ function wrapperToString() { return (this.value() + ''); } /** * Executes the chained sequence to extract the unwrapped value. * * @name value * @memberOf _ * @alias toJSON, valueOf * @category Chain * @returns {*} Returns the resolved unwrapped value. * @example * * _([1, 2, 3]).value(); * // => [1, 2, 3] */ function wrapperValue() { return baseWrapperValue(this.__wrapped__, this.__actions__); } /*------------------------------------------------------------------------*/ /** * Creates an array of elements corresponding to the given keys, or indexes, * of `collection`. Keys may be specified as individual arguments or as arrays * of keys. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {...(number|number[]|string|string[])} [props] The property names * or indexes of elements to pick, specified individually or in arrays. * @returns {Array} Returns the new array of picked elements. * @example * * _.at(['a', 'b', 'c', 'd', 'e'], [0, 2, 4]); * // => ['a', 'c', 'e'] * * _.at(['fred', 'barney', 'pebbles'], 0, 2); * // => ['fred', 'pebbles'] */ function at(collection) { var length = collection ? collection.length : 0; if (isLength(length)) { collection = toIterable(collection); } return baseAt(collection, baseFlatten(arguments, false, false, 1)); } /** * Checks if `value` is in `collection` using `SameValueZero` for equality * comparisons. If `fromIndex` is negative, it is used as the offset from * the end of `collection`. * * **Note:** `SameValueZero` comparisons are like strict equality comparisons, * e.g. `===`, except that `NaN` matches `NaN`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero) * for more details. * * @static * @memberOf _ * @alias contains, include * @category Collection * @param {Array|Object|string} collection The collection to search. * @param {*} target The value to search for. * @param {number} [fromIndex=0] The index to search from. * @returns {boolean} Returns `true` if a matching element is found, else `false`. * @example * * _.includes([1, 2, 3], 1); * // => true * * _.includes([1, 2, 3], 1, 2); * // => false * * _.includes({ 'user': 'fred', 'age': 40 }, 'fred'); * // => true * * _.includes('pebbles', 'eb'); * // => true */ function includes(collection, target, fromIndex) { var length = collection ? collection.length : 0; if (!isLength(length)) { collection = values(collection); length = collection.length; } if (!length) { return false; } if (typeof fromIndex == 'number') { fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0); } else { fromIndex = 0; } return (typeof collection == 'string' || !isArray(collection) && isString(collection)) ? (fromIndex < length && collection.indexOf(target, fromIndex) > -1) : (getIndexOf(collection, target, fromIndex) > -1); } /** * Creates an object composed of keys generated from the results of running * each element of `collection` through `iteratee`. The corresponding value * of each key is the number of times the key was returned by `iteratee`. * The `iteratee` is bound to `thisArg` and invoked with three arguments; * (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns the composed aggregate object. * @example * * _.countBy([4.3, 6.1, 6.4], function(n) { return Math.floor(n); }); * // => { '4': 1, '6': 2 } * * _.countBy([4.3, 6.1, 6.4], function(n) { return this.floor(n); }, Math); * // => { '4': 1, '6': 2 } * * _.countBy(['one', 'two', 'three'], 'length'); * // => { '3': 2, '5': 1 } */ var countBy = createAggregator(function(result, value, key) { hasOwnProperty.call(result, key) ? ++result[key] : (result[key] = 1); }); /** * Checks if `predicate` returns truthy for **all** elements of `collection`. * The predicate is bound to `thisArg` and invoked with three arguments; * (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @alias all * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false`. * @example * * _.every([true, 1, null, 'yes']); * // => false * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * // using the "_.property" callback shorthand * _.every(users, 'age'); * // => true * * // using the "_.matches" callback shorthand * _.every(users, { 'age': 36 }); * // => false */ function every(collection, predicate, thisArg) { var func = isArray(collection) ? arrayEvery : baseEvery; if (typeof predicate != 'function' || typeof thisArg != 'undefined') { predicate = getCallback(predicate, thisArg, 3); } return func(collection, predicate); } /** * Iterates over elements of `collection`, returning an array of all elements * `predicate` returns truthy for. The predicate is bound to `thisArg` and * invoked with three arguments; (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @alias select * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the new filtered array. * @example * * var evens = _.filter([1, 2, 3, 4], function(n) { return n % 2 == 0; }); * // => [2, 4] * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.filter(users, 'active'), 'user'); * // => ['fred'] * * // using the "_.matches" callback shorthand * _.pluck(_.filter(users, { 'age': 36 }), 'user'); * // => ['barney'] */ function filter(collection, predicate, thisArg) { var func = isArray(collection) ? arrayFilter : baseFilter; predicate = getCallback(predicate, thisArg, 3); return func(collection, predicate); } /** * Iterates over elements of `collection`, returning the first element * `predicate` returns truthy for. The predicate is bound to `thisArg` and * invoked with three arguments; (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @alias detect * @category Collection * @param {Array|Object|string} collection The collection to search. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {*} Returns the matched element, else `undefined`. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true }, * { 'user': 'pebbles', 'age': 1, 'active': false } * ]; * * _.result(_.find(users, function(chr) { return chr.age < 40; }), 'user'); * // => 'barney' * * // using the "_.matches" callback shorthand * _.result(_.find(users, { 'age': 1 }), 'user'); * // => 'pebbles' * * // using the "_.property" callback shorthand * _.result(_.find(users, 'active'), 'user'); * // => 'fred' */ function find(collection, predicate, thisArg) { if (isArray(collection)) { var index = findIndex(collection, predicate, thisArg); return index > -1 ? collection[index] : undefined; } predicate = getCallback(predicate, thisArg, 3); return baseFind(collection, predicate, baseEach); } /** * This method is like `_.find` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to search. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {*} Returns the matched element, else `undefined`. * @example * * _.findLast([1, 2, 3, 4], function(n) { return n % 2 == 1; }); * // => 3 */ function findLast(collection, predicate, thisArg) { predicate = getCallback(predicate, thisArg, 3); return baseFind(collection, predicate, baseEachRight); } /** * Performs a deep comparison between each element in `collection` and the * source object, returning the first element that has equivalent property * values. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to search. * @param {Object} source The object of property values to match. * @returns {*} Returns the matched element, else `undefined`. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'status': 'busy' }, * { 'user': 'fred', 'age': 40, 'status': 'busy' } * ]; * * _.result(_.findWhere(users, { 'status': 'busy' }), 'user'); * // => 'barney' * * _.result(_.findWhere(users, { 'age': 40 }), 'user'); * // => 'fred' */ function findWhere(collection, source) { return find(collection, baseMatches(source)); } /** * Iterates over elements of `collection` invoking `iteratee` for each element. * The `iteratee` is bound to `thisArg` and invoked with three arguments; * (value, index|key, collection). Iterator functions may exit iteration early * by explicitly returning `false`. * * **Note:** As with other "Collections" methods, objects with a `length` property * are iterated like arrays. To avoid this behavior `_.forIn` or `_.forOwn` * may be used for object iteration. * * @static * @memberOf _ * @alias each * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Array|Object|string} Returns `collection`. * @example * * _([1, 2, 3]).forEach(function(n) { console.log(n); }).value(); * // => logs each value from left to right and returns the array * * _.forEach({ 'one': 1, 'two': 2, 'three': 3 }, function(n, key) { console.log(n, key); }); * // => logs each value-key pair and returns the object (iteration order is not guaranteed) */ function forEach(collection, iteratee, thisArg) { return (typeof iteratee == 'function' && typeof thisArg == 'undefined' && isArray(collection)) ? arrayEach(collection, iteratee) : baseEach(collection, bindCallback(iteratee, thisArg, 3)); } /** * This method is like `_.forEach` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @alias eachRight * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Array|Object|string} Returns `collection`. * @example * * _([1, 2, 3]).forEachRight(function(n) { console.log(n); }).join(','); * // => logs each value from right to left and returns the array */ function forEachRight(collection, iteratee, thisArg) { return (typeof iteratee == 'function' && typeof thisArg == 'undefined' && isArray(collection)) ? arrayEachRight(collection, iteratee) : baseEachRight(collection, bindCallback(iteratee, thisArg, 3)); } /** * Creates an object composed of keys generated from the results of running * each element of `collection` through `iteratee`. The corresponding value * of each key is an array of the elements responsible for generating the key. * The `iteratee` is bound to `thisArg` and invoked with three arguments; * (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns the composed aggregate object. * @example * * _.groupBy([4.2, 6.1, 6.4], function(n) { return Math.floor(n); }); * // => { '4': [4.2], '6': [6.1, 6.4] } * * _.groupBy([4.2, 6.1, 6.4], function(n) { return this.floor(n); }, Math); * // => { '4': [4.2], '6': [6.1, 6.4] } * * // using the "_.property" callback shorthand * _.groupBy(['one', 'two', 'three'], 'length'); * // => { '3': ['one', 'two'], '5': ['three'] } */ var groupBy = createAggregator(function(result, value, key) { if (hasOwnProperty.call(result, key)) { result[key].push(value); } else { result[key] = [value]; } }); /** * Creates an object composed of keys generated from the results of running * each element of `collection` through `iteratee`. The corresponding value * of each key is the last element responsible for generating the key. The * iteratee function is bound to `thisArg` and invoked with three arguments; * (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns the composed aggregate object. * @example * * var keyData = [ * { 'dir': 'left', 'code': 97 }, * { 'dir': 'right', 'code': 100 } * ]; * * _.indexBy(keyData, 'dir'); * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } } * * _.indexBy(keyData, function(object) { return String.fromCharCode(object.code); }); * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } } * * _.indexBy(keyData, function(object) { return this.fromCharCode(object.code); }, String); * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } } */ var indexBy = createAggregator(function(result, value, key) { result[key] = value; }); /** * Invokes the method named by `methodName` on each element in `collection`, * returning an array of the results of each invoked method. Any additional * arguments are provided to each invoked method. If `methodName` is a function * it is invoked for, and `this` bound to, each element in `collection`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|string} methodName The name of the method to invoke or * the function invoked per iteration. * @param {...*} [args] The arguments to invoke the method with. * @returns {Array} Returns the array of results. * @example * * _.invoke([[5, 1, 7], [3, 2, 1]], 'sort'); * // => [[1, 5, 7], [1, 2, 3]] * * _.invoke([123, 456], String.prototype.split, ''); * // => [['1', '2', '3'], ['4', '5', '6']] */ function invoke(collection, methodName) { return baseInvoke(collection, methodName, baseSlice(arguments, 2)); } /** * Creates an array of values by running each element in `collection` through * `iteratee`. The `iteratee` is bound to `thisArg` and invoked with three * arguments; (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @alias collect * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Array} Returns the new mapped array. * @example * * _.map([1, 2, 3], function(n) { return n * 3; }); * // => [3, 6, 9] * * _.map({ 'one': 1, 'two': 2, 'three': 3 }, function(n) { return n * 3; }); * // => [3, 6, 9] (iteration order is not guaranteed) * * var users = [ * { 'user': 'barney' }, * { 'user': 'fred' } * ]; * * // using the "_.property" callback shorthand * _.map(users, 'user'); * // => ['barney', 'fred'] */ function map(collection, iteratee, thisArg) { var func = isArray(collection) ? arrayMap : baseMap; iteratee = getCallback(iteratee, thisArg, 3); return func(collection, iteratee); } /** * Gets the maximum value of `collection`. If `collection` is empty or falsey * `-Infinity` is returned. If an iteratee function is provided it is invoked * for each value in `collection` to generate the criterion by which the value * is ranked. The `iteratee` is bound to `thisArg` and invoked with three * arguments; (value, index, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [iteratee] The function invoked per iteration. * If a property name or object is provided it is used to create a "_.property" * or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {*} Returns the maximum value. * @example * * _.max([4, 2, 8, 6]); * // => 8 * * _.max([]); * // => -Infinity * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * _.max(users, function(chr) { return chr.age; }); * // => { 'user': 'fred', 'age': 40 }; * * // using the "_.property" callback shorthand * _.max(users, 'age'); * // => { 'user': 'fred', 'age': 40 }; */ var max = createExtremum(arrayMax); /** * Gets the minimum value of `collection`. If `collection` is empty or falsey * `Infinity` is returned. If an iteratee function is provided it is invoked * for each value in `collection` to generate the criterion by which the value * is ranked. The `iteratee` is bound to `thisArg` and invoked with three * arguments; (value, index, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [iteratee] The function invoked per iteration. * If a property name or object is provided it is used to create a "_.property" * or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {*} Returns the minimum value. * @example * * _.min([4, 2, 8, 6]); * // => 2 * * _.min([]); * // => Infinity * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * _.min(users, function(chr) { return chr.age; }); * // => { 'user': 'barney', 'age': 36 }; * * // using the "_.property" callback shorthand * _.min(users, 'age'); * // => { 'user': 'barney', 'age': 36 }; */ var min = createExtremum(arrayMin, true); /** * Creates an array of elements split into two groups, the first of which * contains elements `predicate` returns truthy for, while the second of which * contains elements `predicate` returns falsey for. The predicate is bound * to `thisArg` and invoked with three arguments; (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the array of grouped elements. * @example * * _.partition([1, 2, 3], function(n) { return n % 2; }); * // => [[1, 3], [2]] * * _.partition([1.2, 2.3, 3.4], function(n) { return this.floor(n) % 2; }, Math); * // => [[1, 3], [2]] * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true }, * { 'user': 'pebbles', 'age': 1, 'active': false } * ]; * * // using the "_.matches" callback shorthand * _.map(_.partition(users, { 'age': 1 }), function(array) { return _.pluck(array, 'user'); }); * // => [['pebbles'], ['barney', 'fred']] * * // using the "_.property" callback shorthand * _.map(_.partition(users, 'active'), function(array) { return _.pluck(array, 'user'); }); * // => [['fred'], ['barney', 'pebbles']] */ var partition = createAggregator(function(result, value, key) { result[key ? 0 : 1].push(value); }, function() { return [[], []]; }); /** * Gets the value of `key` from all elements in `collection`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {string} key The key of the property to pluck. * @returns {Array} Returns the property values. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * _.pluck(users, 'user'); * // => ['barney', 'fred'] * * var userIndex = _.indexBy(users, 'user'); * _.pluck(userIndex, 'age'); * // => [36, 40] (iteration order is not guaranteed) */ function pluck(collection, key) { return map(collection, baseProperty(key + '')); } /** * Reduces `collection` to a value which is the accumulated result of running * each element in `collection` through `iteratee`, where each successive * invocation is supplied the return value of the previous. If `accumulator` * is not provided the first element of `collection` is used as the initial * value. The `iteratee` is bound to `thisArg`and invoked with four arguments; * (accumulator, value, index|key, collection). * * @static * @memberOf _ * @alias foldl, inject * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The initial value. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {*} Returns the accumulated value. * @example * * var sum = _.reduce([1, 2, 3], function(sum, n) { return sum + n; }); * // => 6 * * var mapped = _.reduce({ 'a': 1, 'b': 2, 'c': 3 }, function(result, n, key) { * result[key] = n * 3; * return result; * }, {}); * // => { 'a': 3, 'b': 6, 'c': 9 } (iteration order is not guaranteed) */ function reduce(collection, iteratee, accumulator, thisArg) { var func = isArray(collection) ? arrayReduce : baseReduce; return func(collection, getCallback(iteratee, thisArg, 4), accumulator, arguments.length < 3, baseEach); } /** * This method is like `_.reduce` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @alias foldr * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The initial value. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {*} Returns the accumulated value. * @example * * var array = [[0, 1], [2, 3], [4, 5]]; * _.reduceRight(array, function(flattened, other) { return flattened.concat(other); }, []); * // => [4, 5, 2, 3, 0, 1] */ function reduceRight(collection, iteratee, accumulator, thisArg) { var func = isArray(collection) ? arrayReduceRight : baseReduce; return func(collection, getCallback(iteratee, thisArg, 4), accumulator, arguments.length < 3, baseEachRight); } /** * The opposite of `_.filter`; this method returns the elements of `collection` * that `predicate` does **not** return truthy for. * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Array} Returns the new filtered array. * @example * * var odds = _.reject([1, 2, 3, 4], function(n) { return n % 2 == 0; }); * // => [1, 3] * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.reject(users, 'active'), 'user'); * // => ['barney'] * * // using the "_.matches" callback shorthand * _.pluck(_.reject(users, { 'age': 36 }), 'user'); * // => ['fred'] */ function reject(collection, predicate, thisArg) { var func = isArray(collection) ? arrayFilter : baseFilter; predicate = getCallback(predicate, thisArg, 3); return func(collection, function(value, index, collection) { return !predicate(value, index, collection); }); } /** * Gets a random element or `n` random elements from a collection. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to sample. * @param {number} [n] The number of elements to sample. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {*} Returns the random sample(s). * @example * * _.sample([1, 2, 3, 4]); * // => 2 * * _.sample([1, 2, 3, 4], 2); * // => [3, 1] */ function sample(collection, n, guard) { if (guard ? isIterateeCall(collection, n, guard) : n == null) { collection = toIterable(collection); var length = collection.length; return length > 0 ? collection[baseRandom(0, length - 1)] : undefined; } var result = shuffle(collection); result.length = nativeMin(n < 0 ? 0 : (+n || 0), result.length); return result; } /** * Creates an array of shuffled values, using a version of the Fisher-Yates * shuffle. See [Wikipedia](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle) * for more details. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to shuffle. * @returns {Array} Returns the new shuffled array. * @example * * _.shuffle([1, 2, 3, 4]); * // => [4, 1, 3, 2] */ function shuffle(collection) { collection = toIterable(collection); var index = -1, length = collection.length, result = Array(length); while (++index < length) { var rand = baseRandom(0, index); if (index != rand) { result[index] = result[rand]; } result[rand] = collection[index]; } return result; } /** * Gets the size of `collection` by returning `collection.length` for * array-like values or the number of own enumerable properties for objects. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to inspect. * @returns {number} Returns the size of `collection`. * @example * * _.size([1, 2]); * // => 2 * * _.size({ 'one': 1, 'two': 2, 'three': 3 }); * // => 3 * * _.size('pebbles'); * // => 7 */ function size(collection) { var length = collection ? collection.length : 0; return isLength(length) ? length : keys(collection).length; } /** * Checks if `predicate` returns truthy for **any** element of `collection`. * The function returns as soon as it finds a passing value and does not iterate * over the entire collection. The predicate is bound to `thisArg` and invoked * with three arguments; (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @alias any * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. * @example * * _.some([null, 0, 'yes', false], Boolean); * // => true * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true } * ]; * * // using the "_.property" callback shorthand * _.some(users, 'active'); * // => true * * // using the "_.matches" callback shorthand * _.some(users, { 'age': 1 }); * // => false */ function some(collection, predicate, thisArg) { var func = isArray(collection) ? arraySome : baseSome; if (typeof predicate != 'function' || typeof thisArg != 'undefined') { predicate = getCallback(predicate, thisArg, 3); } return func(collection, predicate); } /** * Creates an array of elements, sorted in ascending order by the results of * running each element in a collection through `iteratee`. This method performs * a stable sort, that is, it preserves the original sort order of equal elements. * The `iteratee` is bound to `thisArg` and invoked with three arguments; * (value, index|key, collection). * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] The function * invoked per iteration. If a property name or an object is provided it is * used to create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Array} Returns the new sorted array. * @example * * _.sortBy([1, 2, 3], function(n) { return Math.sin(n); }); * // => [3, 1, 2] * * _.sortBy([1, 2, 3], function(n) { return this.sin(n); }, Math); * // => [3, 1, 2] * * var users = [ * { 'user': 'fred' }, * { 'user': 'pebbles' }, * { 'user': 'barney' } * ]; * * // using the "_.property" callback shorthand * _.pluck(_.sortBy(users, 'user'), 'user'); * // => ['barney', 'fred', 'pebbles'] */ function sortBy(collection, iteratee, thisArg) { var index = -1, length = collection ? collection.length : 0, result = isLength(length) ? Array(length) : []; if (thisArg && isIterateeCall(collection, iteratee, thisArg)) { iteratee = null; } iteratee = getCallback(iteratee, thisArg, 3); baseEach(collection, function(value, key, collection) { result[++index] = { 'criteria': iteratee(value, key, collection), 'index': index, 'value': value }; }); return baseSortBy(result, compareAscending); } /** * This method is like `_.sortBy` except that it sorts by property names * instead of an iteratee function. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to iterate over. * @param {...(string|string[])} props The property names to sort by, * specified as individual property names or arrays of property names. * @returns {Array} Returns the new sorted array. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'barney', 'age': 26 }, * { 'user': 'fred', 'age': 30 } * ]; * * _.map(_.sortByAll(users, ['user', 'age']), _.values); * // => [['barney', 26], ['barney', 36], ['fred', 30], ['fred', 40]] */ function sortByAll(collection) { var args = arguments; if (args.length > 3 && isIterateeCall(args[1], args[2], args[3])) { args = [collection, args[1]]; } var index = -1, length = collection ? collection.length : 0, props = baseFlatten(args, false, false, 1), result = isLength(length) ? Array(length) : []; baseEach(collection, function(value, key, collection) { var length = props.length, criteria = Array(length); while (length--) { criteria[length] = value == null ? undefined : value[props[length]]; } result[++index] = { 'criteria': criteria, 'index': index, 'value': value }; }); return baseSortBy(result, compareMultipleAscending); } /** * Performs a deep comparison between each element in `collection` and the * source object, returning an array of all elements that have equivalent * property values. * * @static * @memberOf _ * @category Collection * @param {Array|Object|string} collection The collection to search. * @param {Object} source The object of property values to match. * @returns {Array} Returns the new filtered array. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'status': 'busy', 'pets': ['hoppy'] }, * { 'user': 'fred', 'age': 40, 'status': 'busy', 'pets': ['baby puss', 'dino'] } * ]; * * _.pluck(_.where(users, { 'age': 36 }), 'user'); * // => ['barney'] * * _.pluck(_.where(users, { 'pets': ['dino'] }), 'user'); * // => ['fred'] * * _.pluck(_.where(users, { 'status': 'busy' }), 'user'); * // => ['barney', 'fred'] */ function where(collection, source) { return filter(collection, baseMatches(source)); } /*------------------------------------------------------------------------*/ /** * Gets the number of milliseconds that have elapsed since the Unix epoch * (1 January 1970 00:00:00 UTC). * * @static * @memberOf _ * @category Date * @example * * _.defer(function(stamp) { console.log(_.now() - stamp); }, _.now()); * // => logs the number of milliseconds it took for the deferred function to be invoked */ var now = nativeNow || function() { return new Date().getTime(); }; /*------------------------------------------------------------------------*/ /** * The opposite of `_.before`; this method creates a function that invokes * `func` once it is called `n` or more times. * * @static * @memberOf _ * @category Function * @param {number} n The number of calls before `func` is invoked. * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * var saves = ['profile', 'settings']; * * var done = _.after(saves.length, function() { * console.log('done saving!'); * }); * * _.forEach(saves, function(type) { * asyncSave({ 'type': type, 'complete': done }); * }); * // => logs 'done saving!' after the two async saves have completed */ function after(n, func) { if (!isFunction(func)) { if (isFunction(n)) { var temp = n; n = func; func = temp; } else { throw new TypeError(FUNC_ERROR_TEXT); } } n = nativeIsFinite(n = +n) ? n : 0; return function() { if (--n < 1) { return func.apply(this, arguments); } }; } /** * Creates a function that accepts up to `n` arguments ignoring any * additional arguments. * * @static * @memberOf _ * @category Function * @param {Function} func The function to cap arguments for. * @param {number} [n=func.length] The arity cap. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Function} Returns the new function. * @example * * _.map(['6', '8', '10'], _.ary(parseInt, 1)); * // => [6, 8, 10] */ function ary(func, n, guard) { if (guard && isIterateeCall(func, n, guard)) { n = null; } n = (func && n == null) ? func.length : nativeMax(+n || 0, 0); return createWrapper(func, ARY_FLAG, null, null, null, null, n); } /** * Creates a function that invokes `func`, with the `this` binding and arguments * of the created function, while it is called less than `n` times. Subsequent * calls to the created function return the result of the last `func` invocation. * * @static * @memberOf _ * @category Function * @param {number} n The number of calls at which `func` is no longer invoked. * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * jQuery('#add').on('click', _.before(5, addContactToList)); * // => allows adding up to 4 contacts to the list */ function before(n, func) { var result; if (!isFunction(func)) { if (isFunction(n)) { var temp = n; n = func; func = temp; } else { throw new TypeError(FUNC_ERROR_TEXT); } } return function() { if (--n > 0) { result = func.apply(this, arguments); } else { func = null; } return result; }; } /** * Creates a function that invokes `func` with the `this` binding of `thisArg` * and prepends any additional `_.bind` arguments to those provided to the * bound function. * * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds, * may be used as a placeholder for partially applied arguments. * * **Note:** Unlike native `Function#bind` this method does not set the `length` * property of bound functions. * * @static * @memberOf _ * @category Function * @param {Function} func The function to bind. * @param {*} thisArg The `this` binding of `func`. * @param {...*} [args] The arguments to be partially applied. * @returns {Function} Returns the new bound function. * @example * * var greet = function(greeting, punctuation) { * return greeting + ' ' + this.user + punctuation; * }; * * var object = { 'user': 'fred' }; * * var bound = _.bind(greet, object, 'hi'); * bound('!'); * // => 'hi fred!' * * // using placeholders * var bound = _.bind(greet, object, _, '!'); * bound('hi'); * // => 'hi fred!' */ function bind(func, thisArg) { var bitmask = BIND_FLAG; if (arguments.length > 2) { var partials = baseSlice(arguments, 2), holders = replaceHolders(partials, bind.placeholder); bitmask |= PARTIAL_FLAG; } return createWrapper(func, bitmask, thisArg, partials, holders); } /** * Binds methods of an object to the object itself, overwriting the existing * method. Method names may be specified as individual arguments or as arrays * of method names. If no method names are provided all enumerable function * properties, own and inherited, of `object` are bound. * * **Note:** This method does not set the `length` property of bound functions. * * @static * @memberOf _ * @category Function * @param {Object} object The object to bind and assign the bound methods to. * @param {...(string|string[])} [methodNames] The object method names to bind, * specified as individual method names or arrays of method names. * @returns {Object} Returns `object`. * @example * * var view = { * 'label': 'docs', * 'onClick': function() { console.log('clicked ' + this.label); } * }; * * _.bindAll(view); * jQuery('#docs').on('click', view.onClick); * // => logs 'clicked docs' when the element is clicked */ function bindAll(object) { return baseBindAll(object, arguments.length > 1 ? baseFlatten(arguments, false, false, 1) : functions(object) ); } /** * Creates a function that invokes the method at `object[key]` and prepends * any additional `_.bindKey` arguments to those provided to the bound function. * * This method differs from `_.bind` by allowing bound functions to reference * methods that may be redefined or don't yet exist. * See [Peter Michaux's article](http://michaux.ca/articles/lazy-function-definition-pattern) * for more details. * * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * @static * @memberOf _ * @category Function * @param {Object} object The object the method belongs to. * @param {string} key The key of the method. * @param {...*} [args] The arguments to be partially applied. * @returns {Function} Returns the new bound function. * @example * * var object = { * 'user': 'fred', * 'greet': function(greeting, punctuation) { * return greeting + ' ' + this.user + punctuation; * } * }; * * var bound = _.bindKey(object, 'greet', 'hi'); * bound('!'); * // => 'hi fred!' * * object.greet = function(greeting, punctuation) { * return greeting + 'ya ' + this.user + punctuation; * }; * * bound('!'); * // => 'hiya fred!' * * // using placeholders * var bound = _.bindKey(object, 'greet', _, '!'); * bound('hi'); * // => 'hiya fred!' */ function bindKey(object, key) { var bitmask = BIND_FLAG | BIND_KEY_FLAG; if (arguments.length > 2) { var partials = baseSlice(arguments, 2), holders = replaceHolders(partials, bindKey.placeholder); bitmask |= PARTIAL_FLAG; } return createWrapper(key, bitmask, object, partials, holders); } /** * Creates a function that accepts one or more arguments of `func` that when * called either invokes `func` returning its result, if all `func` arguments * have been provided, or returns a function that accepts one or more of the * remaining `func` arguments, and so on. The arity of `func` may be specified * if `func.length` is not sufficient. * * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds, * may be used as a placeholder for provided arguments. * * **Note:** This method does not set the `length` property of curried functions. * * @static * @memberOf _ * @category Function * @param {Function} func The function to curry. * @param {number} [arity=func.length] The arity of `func`. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Function} Returns the new curried function. * @example * * var abc = function(a, b, c) { * return [a, b, c]; * }; * * var curried = _.curry(abc); * * curried(1)(2)(3); * // => [1, 2, 3] * * curried(1, 2)(3); * // => [1, 2, 3] * * curried(1, 2, 3); * // => [1, 2, 3] * * // using placeholders * curried(1)(_, 3)(2); * // => [1, 2, 3] */ function curry(func, arity, guard) { if (guard && isIterateeCall(func, arity, guard)) { arity = null; } var result = createWrapper(func, CURRY_FLAG, null, null, null, null, null, arity); result.placeholder = curry.placeholder; return result; } /** * This method is like `_.curry` except that arguments are applied to `func` * in the manner of `_.partialRight` instead of `_.partial`. * * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for provided arguments. * * **Note:** This method does not set the `length` property of curried functions. * * @static * @memberOf _ * @category Function * @param {Function} func The function to curry. * @param {number} [arity=func.length] The arity of `func`. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Function} Returns the new curried function. * @example * * var abc = function(a, b, c) { * return [a, b, c]; * }; * * var curried = _.curryRight(abc); * * curried(3)(2)(1); * // => [1, 2, 3] * * curried(2, 3)(1); * // => [1, 2, 3] * * curried(1, 2, 3); * // => [1, 2, 3] * * // using placeholders * curried(3)(1, _)(2); * // => [1, 2, 3] */ function curryRight(func, arity, guard) { if (guard && isIterateeCall(func, arity, guard)) { arity = null; } var result = createWrapper(func, CURRY_RIGHT_FLAG, null, null, null, null, null, arity); result.placeholder = curryRight.placeholder; return result; } /** * Creates a function that delays invoking `func` until after `wait` milliseconds * have elapsed since the last time it was invoked. The created function comes * with a `cancel` method to cancel delayed invocations. Provide an options * object to indicate that `func` should be invoked on the leading and/or * trailing edge of the `wait` timeout. Subsequent calls to the debounced * function return the result of the last `func` invocation. * * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked * on the trailing edge of the timeout only if the the debounced function is * invoked more than once during the `wait` timeout. * * See [David Corbacho's article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation) * for details over the differences between `_.debounce` and `_.throttle`. * * @static * @memberOf _ * @category Function * @param {Function} func The function to debounce. * @param {number} wait The number of milliseconds to delay. * @param {Object} [options] The options object. * @param {boolean} [options.leading=false] Specify invoking on the leading * edge of the timeout. * @param {number} [options.maxWait] The maximum time `func` is allowed to be * delayed before it is invoked. * @param {boolean} [options.trailing=true] Specify invoking on the trailing * edge of the timeout. * @returns {Function} Returns the new debounced function. * @example * * // avoid costly calculations while the window size is in flux * jQuery(window).on('resize', _.debounce(calculateLayout, 150)); * * // invoke `sendMail` when the click event is fired, debouncing subsequent calls * jQuery('#postbox').on('click', _.debounce(sendMail, 300, { * 'leading': true, * 'trailing': false * })); * * // ensure `batchLog` is invoked once after 1 second of debounced calls * var source = new EventSource('/stream'); * jQuery(source).on('message', _.debounce(batchLog, 250, { * 'maxWait': 1000 * })); * * // cancel a debounced call * var todoChanges = _.debounce(batchLog, 1000); * Object.observe(models.todo, todoChanges); * * Object.observe(models, function(changes) { * if (_.find(changes, { 'user': 'todo', 'type': 'delete'})) { * todoChanges.cancel(); * } * }, ['delete']); * * // ...at some point `models.todo` is changed * models.todo.completed = true; * * // ...before 1 second has passed `models.todo` is deleted * // which cancels the debounced `todoChanges` call * delete models.todo; */ function debounce(func, wait, options) { var args, maxTimeoutId, result, stamp, thisArg, timeoutId, trailingCall, lastCalled = 0, maxWait = false, trailing = true; if (!isFunction(func)) { throw new TypeError(FUNC_ERROR_TEXT); } wait = wait < 0 ? 0 : wait; if (options === true) { var leading = true; trailing = false; } else if (isObject(options)) { leading = options.leading; maxWait = 'maxWait' in options && nativeMax(+options.maxWait || 0, wait); trailing = 'trailing' in options ? options.trailing : trailing; } function cancel() { if (timeoutId) { clearTimeout(timeoutId); } if (maxTimeoutId) { clearTimeout(maxTimeoutId); } maxTimeoutId = timeoutId = trailingCall = undefined; } function delayed() { var remaining = wait - (now() - stamp); if (remaining <= 0 || remaining > wait) { if (maxTimeoutId) { clearTimeout(maxTimeoutId); } var isCalled = trailingCall; maxTimeoutId = timeoutId = trailingCall = undefined; if (isCalled) { lastCalled = now(); result = func.apply(thisArg, args); if (!timeoutId && !maxTimeoutId) { args = thisArg = null; } } } else { timeoutId = setTimeout(delayed, remaining); } } function maxDelayed() { if (timeoutId) { clearTimeout(timeoutId); } maxTimeoutId = timeoutId = trailingCall = undefined; if (trailing || (maxWait !== wait)) { lastCalled = now(); result = func.apply(thisArg, args); if (!timeoutId && !maxTimeoutId) { args = thisArg = null; } } } function debounced() { args = arguments; stamp = now(); thisArg = this; trailingCall = trailing && (timeoutId || !leading); if (maxWait === false) { var leadingCall = leading && !timeoutId; } else { if (!maxTimeoutId && !leading) { lastCalled = stamp; } var remaining = maxWait - (stamp - lastCalled), isCalled = remaining <= 0 || remaining > maxWait; if (isCalled) { if (maxTimeoutId) { maxTimeoutId = clearTimeout(maxTimeoutId); } lastCalled = stamp; result = func.apply(thisArg, args); } else if (!maxTimeoutId) { maxTimeoutId = setTimeout(maxDelayed, remaining); } } if (isCalled && timeoutId) { timeoutId = clearTimeout(timeoutId); } else if (!timeoutId && wait !== maxWait) { timeoutId = setTimeout(delayed, wait); } if (leadingCall) { isCalled = true; result = func.apply(thisArg, args); } if (isCalled && !timeoutId && !maxTimeoutId) { args = thisArg = null; } return result; } debounced.cancel = cancel; return debounced; } /** * Defers invoking the `func` until the current call stack has cleared. Any * additional arguments are provided to `func` when it is invoked. * * @static * @memberOf _ * @category Function * @param {Function} func The function to defer. * @param {...*} [args] The arguments to invoke the function with. * @returns {number} Returns the timer id. * @example * * _.defer(function(text) { console.log(text); }, 'deferred'); * // logs 'deferred' after one or more milliseconds */ function defer(func) { return baseDelay(func, 1, arguments, 1); } /** * Invokes `func` after `wait` milliseconds. Any additional arguments are * provided to `func` when it is invoked. * * @static * @memberOf _ * @category Function * @param {Function} func The function to delay. * @param {number} wait The number of milliseconds to delay invocation. * @param {...*} [args] The arguments to invoke the function with. * @returns {number} Returns the timer id. * @example * * _.delay(function(text) { console.log(text); }, 1000, 'later'); * // => logs 'later' after one second */ function delay(func, wait) { return baseDelay(func, wait, arguments, 2); } /** * Creates a function that returns the result of invoking the provided * functions with the `this` binding of the created function, where each * successive invocation is supplied the return value of the previous. * * @static * @memberOf _ * @category Function * @param {...Function} [funcs] Functions to invoke. * @returns {Function} Returns the new function. * @example * * function add(x, y) { * return x + y; * } * * function square(n) { * return n * n; * } * * var addSquare = _.flow(add, square); * addSquare(1, 2); * // => 9 */ function flow() { var funcs = arguments, length = funcs.length; if (!length) { return function() {}; } if (!arrayEvery(funcs, isFunction)) { throw new TypeError(FUNC_ERROR_TEXT); } return function() { var index = 0, result = funcs[index].apply(this, arguments); while (++index < length) { result = funcs[index].call(this, result); } return result; }; } /** * This method is like `_.flow` except that it creates a function that * invokes the provided functions from right to left. * * @static * @memberOf _ * @alias backflow, compose * @category Function * @param {...Function} [funcs] Functions to invoke. * @returns {Function} Returns the new function. * @example * * function add(x, y) { * return x + y; * } * * function square(n) { * return n * n; * } * * var addSquare = _.flowRight(square, add); * addSquare(1, 2); * // => 9 */ function flowRight() { var funcs = arguments, fromIndex = funcs.length - 1; if (fromIndex < 0) { return function() {}; } if (!arrayEvery(funcs, isFunction)) { throw new TypeError(FUNC_ERROR_TEXT); } return function() { var index = fromIndex, result = funcs[index].apply(this, arguments); while (index--) { result = funcs[index].call(this, result); } return result; }; } /** * Creates a function that memoizes the result of `func`. If `resolver` is * provided it determines the cache key for storing the result based on the * arguments provided to the memoized function. By default, the first argument * provided to the memoized function is coerced to a string and used as the * cache key. The `func` is invoked with the `this` binding of the memoized * function. * * **Note:** The cache is exposed as the `cache` property on the memoized * function. Its creation may be customized by replacing the `_.memoize.Cache` * constructor with one whose instances implement the ES `Map` method interface * of `get`, `has`, and `set`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-properties-of-the-map-prototype-object) * for more details. * * @static * @memberOf _ * @category Function * @param {Function} func The function to have its output memoized. * @param {Function} [resolver] The function to resolve the cache key. * @returns {Function} Returns the new memoizing function. * @example * * var upperCase = _.memoize(function(string) { * return string.toUpperCase(); * }); * * upperCase('fred'); * // => 'FRED' * * // modifying the result cache * upperCase.cache.set('fred', 'BARNEY'); * upperCase('fred'); * // => 'BARNEY' * * // replacing `_.memoize.Cache` * var object = { 'user': 'fred' }; * var other = { 'user': 'barney' }; * var identity = _.memoize(_.identity); * * identity(object); * // => { 'user': 'fred' } * identity(other); * // => { 'user': 'fred' } * * _.memoize.Cache = WeakMap; * var identity = _.memoize(_.identity); * * identity(object); * // => { 'user': 'fred' } * identity(other); * // => { 'user': 'barney' } */ function memoize(func, resolver) { if (!isFunction(func) || (resolver && !isFunction(resolver))) { throw new TypeError(FUNC_ERROR_TEXT); } var memoized = function() { var cache = memoized.cache, key = resolver ? resolver.apply(this, arguments) : arguments[0]; if (cache.has(key)) { return cache.get(key); } var result = func.apply(this, arguments); cache.set(key, result); return result; }; memoized.cache = new memoize.Cache; return memoized; } /** * Creates a function that negates the result of the predicate `func`. The * `func` predicate is invoked with the `this` binding and arguments of the * created function. * * @static * @memberOf _ * @category Function * @param {Function} predicate The predicate to negate. * @returns {Function} Returns the new function. * @example * * function isEven(n) { * return n % 2 == 0; * } * * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven)); * // => [1, 3, 5] */ function negate(predicate) { if (!isFunction(predicate)) { throw new TypeError(FUNC_ERROR_TEXT); } return function() { return !predicate.apply(this, arguments); }; } /** * Creates a function that is restricted to invoking `func` once. Repeat calls * to the function return the value of the first call. The `func` is invoked * with the `this` binding of the created function. * * @static * @memberOf _ * @type Function * @category Function * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * var initialize = _.once(createApplication); * initialize(); * initialize(); * // `initialize` invokes `createApplication` once */ function once(func) { return before(func, 2); } /** * Creates a function that invokes `func` with `partial` arguments prepended * to those provided to the new function. This method is like `_.bind` except * it does **not** alter the `this` binding. * * The `_.partial.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * **Note:** This method does not set the `length` property of partially * applied functions. * * @static * @memberOf _ * @category Function * @param {Function} func The function to partially apply arguments to. * @param {...*} [args] The arguments to be partially applied. * @returns {Function} Returns the new partially applied function. * @example * * var greet = function(greeting, name) { * return greeting + ' ' + name; * }; * * var sayHelloTo = _.partial(greet, 'hello'); * sayHelloTo('fred'); * // => 'hello fred' * * // using placeholders * var greetFred = _.partial(greet, _, 'fred'); * greetFred('hi'); * // => 'hi fred' */ function partial(func) { var partials = baseSlice(arguments, 1), holders = replaceHolders(partials, partial.placeholder); return createWrapper(func, PARTIAL_FLAG, null, partials, holders); } /** * This method is like `_.partial` except that partially applied arguments * are appended to those provided to the new function. * * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * **Note:** This method does not set the `length` property of partially * applied functions. * * @static * @memberOf _ * @category Function * @param {Function} func The function to partially apply arguments to. * @param {...*} [args] The arguments to be partially applied. * @returns {Function} Returns the new partially applied function. * @example * * var greet = function(greeting, name) { * return greeting + ' ' + name; * }; * * var greetFred = _.partialRight(greet, 'fred'); * greetFred('hi'); * // => 'hi fred' * * // using placeholders * var sayHelloTo = _.partialRight(greet, 'hello', _); * sayHelloTo('fred'); * // => 'hello fred' */ function partialRight(func) { var partials = baseSlice(arguments, 1), holders = replaceHolders(partials, partialRight.placeholder); return createWrapper(func, PARTIAL_RIGHT_FLAG, null, partials, holders); } /** * Creates a function that invokes `func` with arguments arranged according * to the specified indexes where the argument value at the first index is * provided as the first argument, the argument value at the second index is * provided as the second argument, and so on. * * @static * @memberOf _ * @category Function * @param {Function} func The function to rearrange arguments for. * @param {...(number|number[])} indexes The arranged argument indexes, * specified as individual indexes or arrays of indexes. * @returns {Function} Returns the new function. * @example * * var rearged = _.rearg(function(a, b, c) { * return [a, b, c]; * }, 2, 0, 1); * * rearged('b', 'c', 'a') * // => ['a', 'b', 'c'] * * var map = _.rearg(_.map, [1, 0]); * map(function(n) { return n * 3; }, [1, 2, 3]); * // => [3, 6, 9] */ function rearg(func) { var indexes = baseFlatten(arguments, false, false, 1); return createWrapper(func, REARG_FLAG, null, null, null, indexes); } /** * Creates a function that only invokes `func` at most once per every `wait` * milliseconds. The created function comes with a `cancel` method to cancel * delayed invocations. Provide an options object to indicate that `func` * should be invoked on the leading and/or trailing edge of the `wait` timeout. * Subsequent calls to the throttled function return the result of the last * `func` call. * * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked * on the trailing edge of the timeout only if the the throttled function is * invoked more than once during the `wait` timeout. * * See [David Corbacho's article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation) * for details over the differences between `_.throttle` and `_.debounce`. * * @static * @memberOf _ * @category Function * @param {Function} func The function to throttle. * @param {number} wait The number of milliseconds to throttle invocations to. * @param {Object} [options] The options object. * @param {boolean} [options.leading=true] Specify invoking on the leading * edge of the timeout. * @param {boolean} [options.trailing=true] Specify invoking on the trailing * edge of the timeout. * @returns {Function} Returns the new throttled function. * @example * * // avoid excessively updating the position while scrolling * jQuery(window).on('scroll', _.throttle(updatePosition, 100)); * * // invoke `renewToken` when the click event is fired, but not more than once every 5 minutes * var throttled = _.throttle(renewToken, 300000, { 'trailing': false }) * jQuery('.interactive').on('click', throttled); * * // cancel a trailing throttled call * jQuery(window).on('popstate', throttled.cancel); */ function throttle(func, wait, options) { var leading = true, trailing = true; if (!isFunction(func)) { throw new TypeError(FUNC_ERROR_TEXT); } if (options === false) { leading = false; } else if (isObject(options)) { leading = 'leading' in options ? !!options.leading : leading; trailing = 'trailing' in options ? !!options.trailing : trailing; } debounceOptions.leading = leading; debounceOptions.maxWait = +wait; debounceOptions.trailing = trailing; return debounce(func, wait, debounceOptions); } /** * Creates a function that provides `value` to the wrapper function as its * first argument. Any additional arguments provided to the function are * appended to those provided to the wrapper function. The wrapper is invoked * with the `this` binding of the created function. * * @static * @memberOf _ * @category Function * @param {*} value The value to wrap. * @param {Function} wrapper The wrapper function. * @returns {Function} Returns the new function. * @example * * var p = _.wrap(_.escape, function(func, text) { * return '

          ' + func(text) + '

          '; * }); * * p('fred, barney, & pebbles'); * // => '

          fred, barney, & pebbles

          ' */ function wrap(value, wrapper) { wrapper = wrapper == null ? identity : wrapper; return createWrapper(wrapper, PARTIAL_FLAG, null, [value], []); } /*------------------------------------------------------------------------*/ /** * Creates a clone of `value`. If `isDeep` is `true` nested objects are cloned, * otherwise they are assigned by reference. If `customizer` is provided it is * invoked to produce the cloned values. If `customizer` returns `undefined` * cloning is handled by the method instead. The `customizer` is bound to * `thisArg` and invoked with two argument; (value [, index|key, object]). * * **Note:** This method is loosely based on the structured clone algorithm. * The enumerable properties of `arguments` objects and objects created by * constructors other than `Object` are cloned to plain `Object` objects. An * empty object is returned for uncloneable values such as functions, DOM nodes, * Maps, Sets, and WeakMaps. See the [HTML5 specification](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm) * for more details. * * @static * @memberOf _ * @category Lang * @param {*} value The value to clone. * @param {boolean} [isDeep] Specify a deep clone. * @param {Function} [customizer] The function to customize cloning values. * @param {*} [thisArg] The `this` binding of `customizer`. * @returns {*} Returns the cloned value. * @example * * var users = [ * { 'user': 'barney' }, * { 'user': 'fred' } * ]; * * var shallow = _.clone(users); * shallow[0] === users[0]; * // => true * * var deep = _.clone(users, true); * deep[0] === users[0]; * // => false * * // using a customizer callback * var body = _.clone(document.body, function(value) { * return _.isElement(value) ? value.cloneNode(false) : undefined; * }); * * body === document.body * // => false * body.nodeName * // => BODY * body.childNodes.length; * // => 0 */ function clone(value, isDeep, customizer, thisArg) { // Juggle arguments. if (typeof isDeep != 'boolean' && isDeep != null) { thisArg = customizer; customizer = isIterateeCall(value, isDeep, thisArg) ? null : isDeep; isDeep = false; } customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 1); return baseClone(value, isDeep, customizer); } /** * Creates a deep clone of `value`. If `customizer` is provided it is invoked * to produce the cloned values. If `customizer` returns `undefined` cloning * is handled by the method instead. The `customizer` is bound to `thisArg` * and invoked with two argument; (value [, index|key, object]). * * **Note:** This method is loosely based on the structured clone algorithm. * The enumerable properties of `arguments` objects and objects created by * constructors other than `Object` are cloned to plain `Object` objects. An * empty object is returned for uncloneable values such as functions, DOM nodes, * Maps, Sets, and WeakMaps. See the [HTML5 specification](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm) * for more details. * * @static * @memberOf _ * @category Lang * @param {*} value The value to deep clone. * @param {Function} [customizer] The function to customize cloning values. * @param {*} [thisArg] The `this` binding of `customizer`. * @returns {*} Returns the deep cloned value. * @example * * var users = [ * { 'user': 'barney' }, * { 'user': 'fred' } * ]; * * var deep = _.cloneDeep(users); * deep[0] === users[0]; * // => false * * // using a customizer callback * var el = _.cloneDeep(document.body, function(value) { * return _.isElement(value) ? value.cloneNode(true) : undefined; * }); * * body === document.body * // => false * body.nodeName * // => BODY * body.childNodes.length; * // => 20 */ function cloneDeep(value, customizer, thisArg) { customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 1); return baseClone(value, true, customizer); } /** * Checks if `value` is classified as an `arguments` object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * (function() { return _.isArguments(arguments); })(); * // => true * * _.isArguments([1, 2, 3]); * // => false */ function isArguments(value) { var length = isObjectLike(value) ? value.length : undefined; return (isLength(length) && objToString.call(value) == argsTag) || false; } // Fallback for environments without a `toStringTag` for `arguments` objects. if (!support.argsTag) { isArguments = function(value) { var length = isObjectLike(value) ? value.length : undefined; return (isLength(length) && hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee')) || false; }; } /** * Checks if `value` is classified as an `Array` object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isArray([1, 2, 3]); * // => true * * (function() { return _.isArray(arguments); })(); * // => false */ var isArray = nativeIsArray || function(value) { return (isObjectLike(value) && isLength(value.length) && objToString.call(value) == arrayTag) || false; }; /** * Checks if `value` is classified as a boolean primitive or object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isBoolean(false); * // => true * * _.isBoolean(null); * // => false */ function isBoolean(value) { return (value === true || value === false || isObjectLike(value) && objToString.call(value) == boolTag) || false; } /** * Checks if `value` is classified as a `Date` object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isDate(new Date); * // => true * * _.isDate('Mon April 23 2012'); * // => false */ function isDate(value) { return (isObjectLike(value) && objToString.call(value) == dateTag) || false; } /** * Checks if `value` is a DOM element. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`. * @example * * _.isElement(document.body); * // => true * * _.isElement(''); * // => false */ function isElement(value) { return (value && value.nodeType === 1 && isObjectLike(value) && (lodash.support.nodeTag ? objToString.call(value).indexOf('Element') > -1 : isHostObject(value))) || false; } // Fallback for environments without DOM support. if (!support.dom) { isElement = function(value) { return (value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value)) || false; }; } /** * Checks if a value is empty. A value is considered empty unless it is an * `arguments` object, array, string, or jQuery-like collection with a length * greater than `0` or an object with own enumerable properties. * * @static * @memberOf _ * @category Lang * @param {Array|Object|string} value The value to inspect. * @returns {boolean} Returns `true` if `value` is empty, else `false`. * @example * * _.isEmpty(null); * // => true * * _.isEmpty(true); * // => true * * _.isEmpty(1); * // => true * * _.isEmpty([1, 2, 3]); * // => false * * _.isEmpty({ 'a': 1 }); * // => false */ function isEmpty(value) { if (value == null) { return true; } var length = value.length; if (isLength(length) && (isArray(value) || isString(value) || isArguments(value) || (isObjectLike(value) && isFunction(value.splice)))) { return !length; } return !keys(value).length; } /** * Performs a deep comparison between two values to determine if they are * equivalent. If `customizer` is provided it is invoked to compare values. * If `customizer` returns `undefined` comparisons are handled by the method * instead. The `customizer` is bound to `thisArg` and invoked with three * arguments; (value, other [, index|key]). * * **Note:** This method supports comparing arrays, booleans, `Date` objects, * numbers, `Object` objects, regexes, and strings. Functions and DOM nodes * are **not** supported. Provide a customizer function to extend support * for comparing other values. * * @static * @memberOf _ * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @param {Function} [customizer] The function to customize comparing values. * @param {*} [thisArg] The `this` binding of `customizer`. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. * @example * * var object = { 'user': 'fred' }; * var other = { 'user': 'fred' }; * * object == other; * // => false * * _.isEqual(object, other); * // => true * * // using a customizer callback * var array = ['hello', 'goodbye']; * var other = ['hi', 'goodbye']; * * _.isEqual(array, other, function(value, other) { * return _.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/) || undefined; * }); * // => true */ function isEqual(value, other, customizer, thisArg) { customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 3); if (!customizer && isStrictComparable(value) && isStrictComparable(other)) { return value === other; } var result = customizer ? customizer(value, other) : undefined; return typeof result == 'undefined' ? baseIsEqual(value, other, customizer) : !!result; } /** * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`, * `SyntaxError`, `TypeError`, or `URIError` object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an error object, else `false`. * @example * * _.isError(new Error); * // => true * * _.isError(Error); * // => false */ function isError(value) { return (isObjectLike(value) && typeof value.message == 'string' && objToString.call(value) == errorTag) || false; } /** * Checks if `value` is a finite primitive number. * * **Note:** This method is based on ES `Number.isFinite`. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-number.isfinite) * for more details. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a finite number, else `false`. * @example * * _.isFinite(10); * // => true * * _.isFinite('10'); * // => false * * _.isFinite(true); * // => false * * _.isFinite(Object(10)); * // => false * * _.isFinite(Infinity); * // => false */ var isFinite = nativeNumIsFinite || function(value) { return typeof value == 'number' && nativeIsFinite(value); }; /** * Checks if `value` is classified as a `Function` object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isFunction(_); * // => true * * _.isFunction(/abc/); * // => false */ function isFunction(value) { // Avoid a Chakra JIT bug in compatibility modes of IE 11. // See https://github.com/jashkenas/underscore/issues/1621 for more details. return typeof value == 'function' || false; } // Fallback for environments that return incorrect `typeof` operator results. if (isFunction(/x/) || (Uint8Array && !isFunction(Uint8Array))) { isFunction = function(value) { // The use of `Object#toString` avoids issues with the `typeof` operator // in older versions of Chrome and Safari which return 'function' for regexes // and Safari 8 equivalents which return 'object' for typed array constructors. return objToString.call(value) == funcTag; }; } /** * Checks if `value` is the language type of `Object`. * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`) * * **Note:** See the [ES5 spec](https://es5.github.io/#x8) for more details. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an object, else `false`. * @example * * _.isObject({}); * // => true * * _.isObject([1, 2, 3]); * // => true * * _.isObject(1); * // => false */ function isObject(value) { // Avoid a V8 JIT bug in Chrome 19-20. // See https://code.google.com/p/v8/issues/detail?id=2291 for more details. var type = typeof value; return type == 'function' || (value && type == 'object') || false; } /** * Performs a deep comparison between `object` and `source` to determine if * `object` contains equivalent property values. If `customizer` is provided * it is invoked to compare values. If `customizer` returns `undefined` * comparisons are handled by the method instead. The `customizer` is bound * to `thisArg` and invoked with three arguments; (value, other, index|key). * * **Note:** This method supports comparing properties of arrays, booleans, * `Date` objects, numbers, `Object` objects, regexes, and strings. Functions * and DOM nodes are **not** supported. Provide a customizer function to extend * support for comparing other values. * * @static * @memberOf _ * @category Lang * @param {Object} source The object to inspect. * @param {Object} source The object of property values to match. * @param {Function} [customizer] The function to customize comparing values. * @param {*} [thisArg] The `this` binding of `customizer`. * @returns {boolean} Returns `true` if `object` is a match, else `false`. * @example * * var object = { 'user': 'fred', 'age': 40 }; * * _.isMatch(object, { 'age': 40 }); * // => true * * _.isMatch(object, { 'age': 36 }); * // => false * * // using a customizer callback * var object = { 'greeting': 'hello' }; * var source = { 'greeting': 'hi' }; * * _.isMatch(object, source, function(value, other) { * return _.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/) || undefined; * }); * // => true */ function isMatch(object, source, customizer, thisArg) { var props = keys(source), length = props.length; customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 3); if (!customizer && length == 1) { var key = props[0], value = source[key]; if (isStrictComparable(value)) { return object != null && value === object[key] && hasOwnProperty.call(object, key); } } var values = Array(length), strictCompareFlags = Array(length); while (length--) { value = values[length] = source[props[length]]; strictCompareFlags[length] = isStrictComparable(value); } return baseIsMatch(object, props, values, strictCompareFlags, customizer); } /** * Checks if `value` is `NaN`. * * **Note:** This method is not the same as native `isNaN` which returns `true` * for `undefined` and other non-numeric values. See the [ES5 spec](https://es5.github.io/#x15.1.2.4) * for more details. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`. * @example * * _.isNaN(NaN); * // => true * * _.isNaN(new Number(NaN)); * // => true * * isNaN(undefined); * // => true * * _.isNaN(undefined); * // => false */ function isNaN(value) { // An `NaN` primitive is the only value that is not equal to itself. // Perform the `toStringTag` check first to avoid errors with some host objects in IE. return isNumber(value) && value != +value; } /** * Checks if `value` is a native function. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a native function, else `false`. * @example * * _.isNative(Array.prototype.push); * // => true * * _.isNative(_); * // => false */ function isNative(value) { if (value == null) { return false; } if (objToString.call(value) == funcTag) { return reNative.test(fnToString.call(value)); } return (isObjectLike(value) && (isHostObject(value) ? reNative : reHostCtor).test(value)) || false; } /** * Checks if `value` is `null`. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `null`, else `false`. * @example * * _.isNull(null); * // => true * * _.isNull(void 0); * // => false */ function isNull(value) { return value === null; } /** * Checks if `value` is classified as a `Number` primitive or object. * * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are classified * as numbers, use the `_.isFinite` method. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isNumber(8.4); * // => true * * _.isNumber(NaN); * // => true * * _.isNumber('8.4'); * // => false */ function isNumber(value) { return typeof value == 'number' || (isObjectLike(value) && objToString.call(value) == numberTag) || false; } /** * Checks if `value` is a plain object, that is, an object created by the * `Object` constructor or one with a `[[Prototype]]` of `null`. * * **Note:** This method assumes objects created by the `Object` constructor * have no inherited enumerable properties. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a plain object, else `false`. * @example * * function Foo() { * this.a = 1; * } * * _.isPlainObject(new Foo); * // => false * * _.isPlainObject([1, 2, 3]); * // => false * * _.isPlainObject({ 'x': 0, 'y': 0 }); * // => true * * _.isPlainObject(Object.create(null)); * // => true */ var isPlainObject = !getPrototypeOf ? shimIsPlainObject : function(value) { if (!(value && objToString.call(value) == objectTag) || (!lodash.support.argsTag && isArguments(value))) { return false; } var valueOf = value.valueOf, objProto = isNative(valueOf) && (objProto = getPrototypeOf(valueOf)) && getPrototypeOf(objProto); return objProto ? (value == objProto || getPrototypeOf(value) == objProto) : shimIsPlainObject(value); }; /** * Checks if `value` is classified as a `RegExp` object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isRegExp(/abc/); * // => true * * _.isRegExp('/abc/'); * // => false */ function isRegExp(value) { return (isObject(value) && objToString.call(value) == regexpTag) || false; } /** * Checks if `value` is classified as a `String` primitive or object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isString('abc'); * // => true * * _.isString(1); * // => false */ function isString(value) { return typeof value == 'string' || (isObjectLike(value) && objToString.call(value) == stringTag) || false; } /** * Checks if `value` is classified as a typed array. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`. * @example * * _.isTypedArray(new Uint8Array); * // => true * * _.isTypedArray([]); * // => false */ function isTypedArray(value) { return (isObjectLike(value) && isLength(value.length) && typedArrayTags[objToString.call(value)]) || false; } /** * Checks if `value` is `undefined`. * * @static * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`. * @example * * _.isUndefined(void 0); * // => true * * _.isUndefined(null); * // => false */ function isUndefined(value) { return typeof value == 'undefined'; } /** * Converts `value` to an array. * * @static * @memberOf _ * @category Lang * @param {*} value The value to convert. * @returns {Array} Returns the converted array. * @example * * (function() { return _.toArray(arguments).slice(1); })(1, 2, 3); * // => [2, 3] */ function toArray(value) { var length = value ? value.length : 0; if (!isLength(length)) { return values(value); } if (!length) { return []; } return (lodash.support.unindexedChars && isString(value)) ? value.split('') : arrayCopy(value); } /** * Converts `value` to a plain object flattening inherited enumerable * properties of `value` to own properties of the plain object. * * @static * @memberOf _ * @category Lang * @param {*} value The value to convert. * @returns {Object} Returns the converted plain object. * @example * * function Foo() { * this.b = 2; * } * * Foo.prototype.c = 3; * * _.assign({ 'a': 1 }, new Foo); * // => { 'a': 1, 'b': 2 } * * _.assign({ 'a': 1 }, _.toPlainObject(new Foo)); * // => { 'a': 1, 'b': 2, 'c': 3 } */ function toPlainObject(value) { return baseCopy(value, keysIn(value)); } /*------------------------------------------------------------------------*/ /** * Assigns own enumerable properties of source object(s) to the destination * object. Subsequent sources overwrite property assignments of previous sources. * If `customizer` is provided it is invoked to produce the assigned values. * The `customizer` is bound to `thisArg` and invoked with five arguments; * (objectValue, sourceValue, key, object, source). * * @static * @memberOf _ * @alias extend * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @param {Function} [customizer] The function to customize assigning values. * @param {*} [thisArg] The `this` binding of `customizer`. * @returns {Object} Returns `object`. * @example * * _.assign({ 'user': 'barney' }, { 'age': 40 }, { 'user': 'fred' }); * // => { 'user': 'fred', 'age': 40 } * * // using a customizer callback * var defaults = _.partialRight(_.assign, function(value, other) { * return typeof value == 'undefined' ? other : value; * }); * * defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' }); * // => { 'user': 'barney', 'age': 36 } */ var assign = createAssigner(baseAssign); /** * Creates an object that inherits from the given `prototype` object. If a * `properties` object is provided its own enumerable properties are assigned * to the created object. * * @static * @memberOf _ * @category Object * @param {Object} prototype The object to inherit from. * @param {Object} [properties] The properties to assign to the object. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Object} Returns the new object. * @example * * function Shape() { * this.x = 0; * this.y = 0; * } * * function Circle() { * Shape.call(this); * } * * Circle.prototype = _.create(Shape.prototype, { 'constructor': Circle }); * * var circle = new Circle; * circle instanceof Circle; * // => true * * circle instanceof Shape; * // => true */ function create(prototype, properties, guard) { var result = baseCreate(prototype); if (guard && isIterateeCall(prototype, properties, guard)) { properties = null; } return properties ? baseCopy(properties, result, keys(properties)) : result; } /** * Assigns own enumerable properties of source object(s) to the destination * object for all destination properties that resolve to `undefined`. Once a * property is set, additional defaults of the same property are ignored. * * @static * @memberOf _ * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * _.defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' }); * // => { 'user': 'barney', 'age': 36 } */ function defaults(object) { if (object == null) { return object; } var args = arrayCopy(arguments); args.push(assignDefaults); return assign.apply(undefined, args); } /** * This method is like `_.findIndex` except that it returns the key of the * first element `predicate` returns truthy for, instead of the element itself. * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to search. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {string|undefined} Returns the key of the matched element, else `undefined`. * @example * * var users = { * 'barney': { 'age': 36, 'active': true }, * 'fred': { 'age': 40, 'active': false }, * 'pebbles': { 'age': 1, 'active': true } * }; * * _.findKey(users, function(chr) { return chr.age < 40; }); * // => 'barney' (iteration order is not guaranteed) * * // using the "_.matches" callback shorthand * _.findKey(users, { 'age': 1 }); * // => 'pebbles' * * // using the "_.property" callback shorthand * _.findKey(users, 'active'); * // => 'barney' */ function findKey(object, predicate, thisArg) { predicate = getCallback(predicate, thisArg, 3); return baseFind(object, predicate, baseForOwn, true); } /** * This method is like `_.findKey` except that it iterates over elements of * a collection in the opposite order. * * If a property name is provided for `predicate` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `predicate` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to search. * @param {Function|Object|string} [predicate=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {string|undefined} Returns the key of the matched element, else `undefined`. * @example * * var users = { * 'barney': { 'age': 36, 'active': true }, * 'fred': { 'age': 40, 'active': false }, * 'pebbles': { 'age': 1, 'active': true } * }; * * _.findLastKey(users, function(chr) { return chr.age < 40; }); * // => returns `pebbles` assuming `_.findKey` returns `barney` * * // using the "_.matches" callback shorthand * _.findLastKey(users, { 'age': 36 }); * // => 'barney' * * // using the "_.property" callback shorthand * _.findLastKey(users, 'active'); * // => 'pebbles' */ function findLastKey(object, predicate, thisArg) { predicate = getCallback(predicate, thisArg, 3); return baseFind(object, predicate, baseForOwnRight, true); } /** * Iterates over own and inherited enumerable properties of an object invoking * `iteratee` for each property. The `iteratee` is bound to `thisArg` and invoked * with three arguments; (value, key, object). Iterator functions may exit * iteration early by explicitly returning `false`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forIn(new Foo, function(value, key) { * console.log(key); * }); * // => logs 'a', 'b', and 'c' (iteration order is not guaranteed) */ function forIn(object, iteratee, thisArg) { if (typeof iteratee != 'function' || typeof thisArg != 'undefined') { iteratee = bindCallback(iteratee, thisArg, 3); } return baseFor(object, iteratee, keysIn); } /** * This method is like `_.forIn` except that it iterates over properties of * `object` in the opposite order. * * @static * @memberOf _ * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forInRight(new Foo, function(value, key) { * console.log(key); * }); * // => logs 'c', 'b', and 'a' assuming `_.forIn ` logs 'a', 'b', and 'c' */ function forInRight(object, iteratee, thisArg) { iteratee = bindCallback(iteratee, thisArg, 3); return baseForRight(object, iteratee, keysIn); } /** * Iterates over own enumerable properties of an object invoking `iteratee` * for each property. The `iteratee` is bound to `thisArg` and invoked with * three arguments; (value, key, object). Iterator functions may exit iteration * early by explicitly returning `false`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns `object`. * @example * * _.forOwn({ '0': 'zero', '1': 'one', 'length': 2 }, function(n, key) { * console.log(key); * }); * // => logs '0', '1', and 'length' (iteration order is not guaranteed) */ function forOwn(object, iteratee, thisArg) { if (typeof iteratee != 'function' || typeof thisArg != 'undefined') { iteratee = bindCallback(iteratee, thisArg, 3); } return baseForOwn(object, iteratee); } /** * This method is like `_.forOwn` except that it iterates over properties of * `object` in the opposite order. * * @static * @memberOf _ * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns `object`. * @example * * _.forOwnRight({ '0': 'zero', '1': 'one', 'length': 2 }, function(n, key) { * console.log(key); * }); * // => logs 'length', '1', and '0' assuming `_.forOwn` logs '0', '1', and 'length' */ function forOwnRight(object, iteratee, thisArg) { iteratee = bindCallback(iteratee, thisArg, 3); return baseForRight(object, iteratee, keys); } /** * Creates an array of function property names from all enumerable properties, * own and inherited, of `object`. * * @static * @memberOf _ * @alias methods * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the new array of property names. * @example * * _.functions(_); * // => ['all', 'any', 'bind', ...] */ function functions(object) { return baseFunctions(object, keysIn(object)); } /** * Checks if `key` exists as a direct property of `object` instead of an * inherited property. * * @static * @memberOf _ * @category Object * @param {Object} object The object to inspect. * @param {string} key The key to check. * @returns {boolean} Returns `true` if `key` is a direct property, else `false`. * @example * * _.has({ 'a': 1, 'b': 2, 'c': 3 }, 'b'); * // => true */ function has(object, key) { return object ? hasOwnProperty.call(object, key) : false; } /** * Creates an object composed of the inverted keys and values of `object`. * If `object` contains duplicate values, subsequent values overwrite property * assignments of previous values unless `multiValue` is `true`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to invert. * @param {boolean} [multiValue] Allow multiple values per key. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {Object} Returns the new inverted object. * @example * * _.invert({ 'first': 'fred', 'second': 'barney' }); * // => { 'fred': 'first', 'barney': 'second' } * * // without `multiValue` * _.invert({ 'first': 'fred', 'second': 'barney', 'third': 'fred' }); * // => { 'fred': 'third', 'barney': 'second' } * * // with `multiValue` * _.invert({ 'first': 'fred', 'second': 'barney', 'third': 'fred' }, true); * // => { 'fred': ['first', 'third'], 'barney': ['second'] } */ function invert(object, multiValue, guard) { if (guard && isIterateeCall(object, multiValue, guard)) { multiValue = null; } var index = -1, props = keys(object), length = props.length, result = {}; while (++index < length) { var key = props[index], value = object[key]; if (multiValue) { if (hasOwnProperty.call(result, value)) { result[value].push(key); } else { result[value] = [key]; } } else { result[value] = key; } } return result; } /** * Creates an array of the own enumerable property names of `object`. * * **Note:** Non-object values are coerced to objects. See the * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.keys) * for more details. * * @static * @memberOf _ * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the array of property names. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.keys(new Foo); * // => ['a', 'b'] (iteration order is not guaranteed) * * _.keys('hi'); * // => ['0', '1'] */ var keys = !nativeKeys ? shimKeys : function(object) { if (object) { var Ctor = object.constructor, length = object.length; } if ((typeof Ctor == 'function' && Ctor.prototype === object) || (typeof object == 'function' ? lodash.support.enumPrototypes : (length && isLength(length)))) { return shimKeys(object); } return isObject(object) ? nativeKeys(object) : []; }; /** * Creates an array of the own and inherited enumerable property names of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the array of property names. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.keysIn(new Foo); * // => ['a', 'b', 'c'] (iteration order is not guaranteed) */ function keysIn(object) { if (object == null) { return []; } if (!isObject(object)) { object = Object(object); } var length = object.length, support = lodash.support; length = (length && isLength(length) && (isArray(object) || (support.nonEnumStrings && isString(object)) || (support.nonEnumArgs && isArguments(object))) && length) || 0; var Ctor = object.constructor, index = -1, proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto, isProto = proto === object, result = Array(length), skipIndexes = length > 0, skipErrorProps = support.enumErrorProps && (object === errorProto || object instanceof Error), skipProto = support.enumPrototypes && typeof object == 'function'; while (++index < length) { result[index] = (index + ''); } // lodash skips the `constructor` property when it infers it is iterating // over a `prototype` object because IE < 9 can't set the `[[Enumerable]]` // attribute of an existing property and the `constructor` property of a // prototype defaults to non-enumerable. for (var key in object) { if (!(skipProto && key == 'prototype') && !(skipErrorProps && (key == 'message' || key == 'name')) && !(skipIndexes && isIndex(key, length)) && !(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) { result.push(key); } } if (support.nonEnumShadows && object !== objectProto) { var tag = object === stringProto ? stringTag : object === errorProto ? errorTag : objToString.call(object), nonEnums = nonEnumProps[tag] || nonEnumProps[objectTag]; if (tag == objectTag) { proto = objectProto; } length = shadowProps.length; while (length--) { key = shadowProps[length]; var nonEnum = nonEnums[key]; if (!(isProto && nonEnum) && (nonEnum ? hasOwnProperty.call(object, key) : object[key] !== proto[key])) { result.push(key); } } } return result; } /** * Creates an object with the same keys as `object` and values generated by * running each own enumerable property of `object` through `iteratee`. The * iteratee function is bound to `thisArg` and invoked with three arguments; * (value, key, object). * * If a property name is provided for `iteratee` the created "_.property" * style callback returns the property value of the given element. * * If an object is provided for `iteratee` the created "_.matches" style * callback returns `true` for elements that have the properties of the given * object, else `false`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to iterate over. * @param {Function|Object|string} [iteratee=_.identity] The function invoked * per iteration. If a property name or object is provided it is used to * create a "_.property" or "_.matches" style callback respectively. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {Object} Returns the new mapped object. * @example * * _.mapValues({ 'a': 1, 'b': 2, 'c': 3} , function(n) { return n * 3; }); * // => { 'a': 3, 'b': 6, 'c': 9 } * * var users = { * 'fred': { 'user': 'fred', 'age': 40 }, * 'pebbles': { 'user': 'pebbles', 'age': 1 } * }; * * // using the "_.property" callback shorthand * _.mapValues(users, 'age'); * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) */ function mapValues(object, iteratee, thisArg) { var result = {}; iteratee = getCallback(iteratee, thisArg, 3); baseForOwn(object, function(value, key, object) { result[key] = iteratee(value, key, object); }); return result; } /** * Recursively merges own enumerable properties of the source object(s), that * don't resolve to `undefined` into the destination object. Subsequent sources * overwrite property assignments of previous sources. If `customizer` is * provided it is invoked to produce the merged values of the destination and * source properties. If `customizer` returns `undefined` merging is handled * by the method instead. The `customizer` is bound to `thisArg` and invoked * with five arguments; (objectValue, sourceValue, key, object, source). * * @static * @memberOf _ * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @param {Function} [customizer] The function to customize merging properties. * @param {*} [thisArg] The `this` binding of `customizer`. * @returns {Object} Returns `object`. * @example * * var users = { * 'data': [{ 'user': 'barney' }, { 'user': 'fred' }] * }; * * var ages = { * 'data': [{ 'age': 36 }, { 'age': 40 }] * }; * * _.merge(users, ages); * // => { 'data': [{ 'user': 'barney', 'age': 36 }, { 'user': 'fred', 'age': 40 }] } * * // using a customizer callback * var object = { * 'fruits': ['apple'], * 'vegetables': ['beet'] * }; * * var other = { * 'fruits': ['banana'], * 'vegetables': ['carrot'] * }; * * _.merge(object, other, function(a, b) { * return _.isArray(a) ? a.concat(b) : undefined; * }); * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] } */ var merge = createAssigner(baseMerge); /** * The opposite of `_.pick`; this method creates an object composed of the * own and inherited enumerable properties of `object` that are not omitted. * Property names may be specified as individual arguments or as arrays of * property names. If `predicate` is provided it is invoked for each property * of `object` omitting the properties `predicate` returns truthy for. The * predicate is bound to `thisArg` and invoked with three arguments; * (value, key, object). * * @static * @memberOf _ * @category Object * @param {Object} object The source object. * @param {Function|...(string|string[])} [predicate] The function invoked per * iteration or property names to omit, specified as individual property * names or arrays of property names. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Object} Returns the new object. * @example * * var object = { 'user': 'fred', 'age': 40 }; * * _.omit(object, 'age'); * // => { 'user': 'fred' } * * _.omit(object, _.isNumber); * // => { 'user': 'fred' } */ function omit(object, predicate, thisArg) { if (object == null) { return {}; } if (typeof predicate != 'function') { var props = arrayMap(baseFlatten(arguments, false, false, 1), String); return pickByArray(object, baseDifference(keysIn(object), props)); } predicate = bindCallback(predicate, thisArg, 3); return pickByCallback(object, function(value, key, object) { return !predicate(value, key, object); }); } /** * Creates a two dimensional array of the key-value pairs for `object`, * e.g. `[[key1, value1], [key2, value2]]`. * * @static * @memberOf _ * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the new array of key-value pairs. * @example * * _.pairs({ 'barney': 36, 'fred': 40 }); * // => [['barney', 36], ['fred', 40]] (iteration order is not guaranteed) */ function pairs(object) { var index = -1, props = keys(object), length = props.length, result = Array(length); while (++index < length) { var key = props[index]; result[index] = [key, object[key]]; } return result; } /** * Creates an object composed of the picked `object` properties. Property * names may be specified as individual arguments or as arrays of property * names. If `predicate` is provided it is invoked for each property of `object` * picking the properties `predicate` returns truthy for. The predicate is * bound to `thisArg` and invoked with three arguments; (value, key, object). * * @static * @memberOf _ * @category Object * @param {Object} object The source object. * @param {Function|...(string|string[])} [predicate] The function invoked per * iteration or property names to pick, specified as individual property * names or arrays of property names. * @param {*} [thisArg] The `this` binding of `predicate`. * @returns {Object} Returns the new object. * @example * * var object = { 'user': 'fred', 'age': 40 }; * * _.pick(object, 'user'); * // => { 'user': 'fred' } * * _.pick(object, _.isString); * // => { 'user': 'fred' } */ function pick(object, predicate, thisArg) { if (object == null) { return {}; } return typeof predicate == 'function' ? pickByCallback(object, bindCallback(predicate, thisArg, 3)) : pickByArray(object, baseFlatten(arguments, false, false, 1)); } /** * Resolves the value of property `key` on `object`. If the value of `key` is * a function it is invoked with the `this` binding of `object` and its result * is returned, else the property value is returned. If the property value is * `undefined` the `defaultValue` is used in its place. * * @static * @memberOf _ * @category Object * @param {Object} object The object to query. * @param {string} key The key of the property to resolve. * @param {*} [defaultValue] The value returned if the property value * resolves to `undefined`. * @returns {*} Returns the resolved value. * @example * * var object = { 'user': 'fred', 'age': _.constant(40) }; * * _.result(object, 'user'); * // => 'fred' * * _.result(object, 'age'); * // => 40 * * _.result(object, 'status', 'busy'); * // => 'busy' * * _.result(object, 'status', _.constant('busy')); * // => 'busy' */ function result(object, key, defaultValue) { var value = object == null ? undefined : object[key]; if (typeof value == 'undefined') { value = defaultValue; } return isFunction(value) ? value.call(object) : value; } /** * An alternative to `_.reduce`; this method transforms `object` to a new * `accumulator` object which is the result of running each of its own enumerable * properties through `iteratee`, with each invocation potentially mutating * the `accumulator` object. The `iteratee` is bound to `thisArg` and invoked * with four arguments; (accumulator, value, key, object). Iterator functions * may exit iteration early by explicitly returning `false`. * * @static * @memberOf _ * @category Object * @param {Array|Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The custom accumulator value. * @param {*} [thisArg] The `this` binding of `iteratee`. * @returns {*} Returns the accumulated value. * @example * * var squares = _.transform([1, 2, 3, 4, 5, 6], function(result, n) { * n *= n; * if (n % 2) { * return result.push(n) < 3; * } * }); * // => [1, 9, 25] * * var mapped = _.transform({ 'a': 1, 'b': 2, 'c': 3 }, function(result, n, key) { * result[key] = n * 3; * }); * // => { 'a': 3, 'b': 6, 'c': 9 } */ function transform(object, iteratee, accumulator, thisArg) { var isArr = isArray(object) || isTypedArray(object); iteratee = getCallback(iteratee, thisArg, 4); if (accumulator == null) { if (isArr || isObject(object)) { var Ctor = object.constructor; if (isArr) { accumulator = isArray(object) ? new Ctor : []; } else { accumulator = baseCreate(typeof Ctor == 'function' && Ctor.prototype); } } else { accumulator = {}; } } (isArr ? arrayEach : baseForOwn)(object, function(value, index, object) { return iteratee(accumulator, value, index, object); }); return accumulator; } /** * Creates an array of the own enumerable property values of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property values. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.values(new Foo); * // => [1, 2] (iteration order is not guaranteed) * * _.values('hi'); * // => ['h', 'i'] */ function values(object) { return baseValues(object, keys(object)); } /** * Creates an array of the own and inherited enumerable property values * of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property values. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.valuesIn(new Foo); * // => [1, 2, 3] (iteration order is not guaranteed) */ function valuesIn(object) { return baseValues(object, keysIn(object)); } /*------------------------------------------------------------------------*/ /** * Produces a random number between `min` and `max` (inclusive). If only one * argument is provided a number between `0` and the given number is returned. * If `floating` is `true`, or either `min` or `max` are floats, a floating-point * number is returned instead of an integer. * * @static * @memberOf _ * @category Number * @param {number} [min=0] The minimum possible value. * @param {number} [max=1] The maximum possible value. * @param {boolean} [floating] Specify returning a floating-point number. * @returns {number} Returns the random number. * @example * * _.random(0, 5); * // => an integer between 0 and 5 * * _.random(5); * // => also an integer between 0 and 5 * * _.random(5, true); * // => a floating-point number between 0 and 5 * * _.random(1.2, 5.2); * // => a floating-point number between 1.2 and 5.2 */ function random(min, max, floating) { if (floating && isIterateeCall(min, max, floating)) { max = floating = null; } var noMin = min == null, noMax = max == null; if (floating == null) { if (noMax && typeof min == 'boolean') { floating = min; min = 1; } else if (typeof max == 'boolean') { floating = max; noMax = true; } } if (noMin && noMax) { max = 1; noMax = false; } min = +min || 0; if (noMax) { max = min; min = 0; } else { max = +max || 0; } if (floating || min % 1 || max % 1) { var rand = nativeRandom(); return nativeMin(min + (rand * (max - min + parseFloat('1e-' + ((rand + '').length - 1)))), max); } return baseRandom(min, max); } /*------------------------------------------------------------------------*/ /** * Converts `string` to camel case. * See [Wikipedia](https://en.wikipedia.org/wiki/CamelCase) for more details. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the camel cased string. * @example * * _.camelCase('Foo Bar'); * // => 'fooBar' * * _.camelCase('--foo-bar'); * // => 'fooBar' * * _.camelCase('__foo_bar__'); * // => 'fooBar' */ var camelCase = createCompounder(function(result, word, index) { word = word.toLowerCase(); return result + (index ? (word.charAt(0).toUpperCase() + word.slice(1)) : word); }); /** * Capitalizes the first character of `string`. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to capitalize. * @returns {string} Returns the capitalized string. * @example * * _.capitalize('fred'); * // => 'Fred' */ function capitalize(string) { string = baseToString(string); return string && (string.charAt(0).toUpperCase() + string.slice(1)); } /** * Deburrs `string` by converting latin-1 supplementary letters to basic latin letters. * See [Wikipedia](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table) * for more details. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to deburr. * @returns {string} Returns the deburred string. * @example * * _.deburr('déjà vu'); * // => 'deja vu' */ function deburr(string) { string = baseToString(string); return string && string.replace(reLatin1, deburrLetter); } /** * Checks if `string` ends with the given target string. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to search. * @param {string} [target] The string to search for. * @param {number} [position=string.length] The position to search from. * @returns {boolean} Returns `true` if `string` ends with `target`, else `false`. * @example * * _.endsWith('abc', 'c'); * // => true * * _.endsWith('abc', 'b'); * // => false * * _.endsWith('abc', 'b', 2); * // => true */ function endsWith(string, target, position) { string = baseToString(string); target = (target + ''); var length = string.length; position = (typeof position == 'undefined' ? length : nativeMin(position < 0 ? 0 : (+position || 0), length)) - target.length; return position >= 0 && string.indexOf(target, position) == position; } /** * Converts the characters "&", "<", ">", '"', "'", and '`', in `string` to * their corresponding HTML entities. * * **Note:** No other characters are escaped. To escape additional characters * use a third-party library like [_he_](https://mths.be/he). * * Though the ">" character is escaped for symmetry, characters like * ">" and "/" don't require escaping in HTML and have no special meaning * unless they're part of a tag or unquoted attribute value. * See [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands) * (under "semi-related fun fact") for more details. * * Backticks are escaped because in Internet Explorer < 9, they can break out * of attribute values or HTML comments. See [#102](https://html5sec.org/#102), * [#108](https://html5sec.org/#108), and [#133](https://html5sec.org/#133) of * the [HTML5 Security Cheatsheet](https://html5sec.org/) for more details. * * When working with HTML you should always quote attribute values to reduce * XSS vectors. See [Ryan Grove's article](http://wonko.com/post/html-escaping) * for more details. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to escape. * @returns {string} Returns the escaped string. * @example * * _.escape('fred, barney, & pebbles'); * // => 'fred, barney, & pebbles' */ function escape(string) { // Reset `lastIndex` because in IE < 9 `String#replace` does not. string = baseToString(string); return (string && reHasUnescapedHtml.test(string)) ? string.replace(reUnescapedHtml, escapeHtmlChar) : string; } /** * Escapes the `RegExp` special characters "\", "^", "$", ".", "|", "?", "*", * "+", "(", ")", "[", "]", "{" and "}" in `string`. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to escape. * @returns {string} Returns the escaped string. * @example * * _.escapeRegExp('[lodash](https://lodash.com/)'); * // => '\[lodash\]\(https://lodash\.com/\)' */ function escapeRegExp(string) { string = baseToString(string); return (string && reHasRegExpChars.test(string)) ? string.replace(reRegExpChars, '\\$&') : string; } /** * Converts `string` to kebab case (a.k.a. spinal case). * See [Wikipedia](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles) for * more details. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the kebab cased string. * @example * * _.kebabCase('Foo Bar'); * // => 'foo-bar' * * _.kebabCase('fooBar'); * // => 'foo-bar' * * _.kebabCase('__foo_bar__'); * // => 'foo-bar' */ var kebabCase = createCompounder(function(result, word, index) { return result + (index ? '-' : '') + word.toLowerCase(); }); /** * Pads `string` on the left and right sides if it is shorter then the given * padding length. The `chars` string may be truncated if the number of padding * characters can't be evenly divided by the padding length. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.pad('abc', 8); * // => ' abc ' * * _.pad('abc', 8, '_-'); * // => '_-abc_-_' * * _.pad('abc', 3); * // => 'abc' */ function pad(string, length, chars) { string = baseToString(string); length = +length; var strLength = string.length; if (strLength >= length || !nativeIsFinite(length)) { return string; } var mid = (length - strLength) / 2, leftLength = floor(mid), rightLength = ceil(mid); chars = createPad('', rightLength, chars); return chars.slice(0, leftLength) + string + chars; } /** * Pads `string` on the left side if it is shorter then the given padding * length. The `chars` string may be truncated if the number of padding * characters exceeds the padding length. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.padLeft('abc', 6); * // => ' abc' * * _.padLeft('abc', 6, '_-'); * // => '_-_abc' * * _.padLeft('abc', 3); * // => 'abc' */ function padLeft(string, length, chars) { string = baseToString(string); return string && (createPad(string, length, chars) + string); } /** * Pads `string` on the right side if it is shorter then the given padding * length. The `chars` string may be truncated if the number of padding * characters exceeds the padding length. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.padRight('abc', 6); * // => 'abc ' * * _.padRight('abc', 6, '_-'); * // => 'abc_-_' * * _.padRight('abc', 3); * // => 'abc' */ function padRight(string, length, chars) { string = baseToString(string); return string && (string + createPad(string, length, chars)); } /** * Converts `string` to an integer of the specified radix. If `radix` is * `undefined` or `0`, a `radix` of `10` is used unless `value` is a hexadecimal, * in which case a `radix` of `16` is used. * * **Note:** This method aligns with the ES5 implementation of `parseInt`. * See the [ES5 spec](https://es5.github.io/#E) for more details. * * @static * @memberOf _ * @category String * @param {string} string The string to convert. * @param {number} [radix] The radix to interpret `value` by. * @param- {Object} [guard] Enables use as a callback for functions like `_.map`. * @returns {number} Returns the converted integer. * @example * * _.parseInt('08'); * // => 8 * * _.map(['6', '08', '10'], _.parseInt); * // => [6, 8, 10] */ function parseInt(string, radix, guard) { if (guard && isIterateeCall(string, radix, guard)) { radix = 0; } return nativeParseInt(string, radix); } // Fallback for environments with pre-ES5 implementations. if (nativeParseInt(whitespace + '08') != 8) { parseInt = function(string, radix, guard) { // Firefox < 21 and Opera < 15 follow ES3 for `parseInt`. // Chrome fails to trim leading whitespace characters. // See https://code.google.com/p/v8/issues/detail?id=3109 for more details. if (guard ? isIterateeCall(string, radix, guard) : radix == null) { radix = 0; } else if (radix) { radix = +radix; } string = trim(string); return nativeParseInt(string, radix || (reHexPrefix.test(string) ? 16 : 10)); }; } /** * Repeats the given string `n` times. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to repeat. * @param {number} [n=0] The number of times to repeat the string. * @returns {string} Returns the repeated string. * @example * * _.repeat('*', 3); * // => '***' * * _.repeat('abc', 2); * // => 'abcabc' * * _.repeat('abc', 0); * // => '' */ function repeat(string, n) { var result = ''; string = baseToString(string); n = +n; if (n < 1 || !string || !nativeIsFinite(n)) { return result; } // Leverage the exponentiation by squaring algorithm for a faster repeat. // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details. do { if (n % 2) { result += string; } n = floor(n / 2); string += string; } while (n); return result; } /** * Converts `string` to snake case. * See [Wikipedia](https://en.wikipedia.org/wiki/Snake_case) for more details. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the snake cased string. * @example * * _.snakeCase('Foo Bar'); * // => 'foo_bar' * * _.snakeCase('fooBar'); * // => 'foo_bar' * * _.snakeCase('--foo-bar'); * // => 'foo_bar' */ var snakeCase = createCompounder(function(result, word, index) { return result + (index ? '_' : '') + word.toLowerCase(); }); /** * Converts `string` to start case. * See [Wikipedia](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage) * for more details. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the start cased string. * @example * * _.startCase('--foo-bar'); * // => 'Foo Bar' * * _.startCase('fooBar'); * // => 'Foo Bar' * * _.startCase('__foo_bar__'); * // => 'Foo Bar' */ var startCase = createCompounder(function(result, word, index) { return result + (index ? ' ' : '') + (word.charAt(0).toUpperCase() + word.slice(1)); }); /** * Checks if `string` starts with the given target string. * * @static * @memberOf _ * @category String * @param {string} [string=''] The string to search. * @param {string} [target] The string to search for. * @param {number} [position=0] The position to search from. * @returns {boolean} Returns `true` if `string` starts with `target`, else `false`. * @example * * _.startsWith('abc', 'a'); * // => true * * _.startsWith('abc', 'b'); * // => false * * _.startsWith('abc', 'b', 1); * // => true */ function startsWith(string, target, position) { string = baseToString(string); position = position == null ? 0 : nativeMin(position < 0 ? 0 : (+position || 0), string.length); return string.lastIndexOf(target, position) == position; } /** * Creates a compiled template function that can interpolate data properties * in "interpolate" delimiters, HTML-escape interpolated data properties in * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data * properties may be accessed as free variables in the template. If a setting * object is provided it takes precedence over `_.templateSettings` values. * * **Note:** In the development build `_.template` utilizes sourceURLs for easier debugging. * See the [HTML5 Rocks article on sourcemaps](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl) * for more details. * * For more information on precompiling templates see * [lodash's custom builds documentation](https://lodash.com/custom-builds). * * For more information on Chrome extension sandboxes see * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval). * * @static * @memberOf _ * @category String * @param {string} [string=''] The template string. * @param {Object} [options] The options object. * @param {RegExp} [options.escape] The HTML "escape" delimiter. * @param {RegExp} [options.evaluate] The "evaluate" delimiter. * @param {Object} [options.imports] An object to import into the template as free variables. * @param {RegExp} [options.interpolate] The "interpolate" delimiter. * @param {string} [options.sourceURL] The sourceURL of the template's compiled source. * @param {string} [options.variable] The data object variable name. * @param- {Object} [otherOptions] Enables the legacy `options` param signature. * @returns {Function} Returns the compiled template function. * @example * * // using the "interpolate" delimiter to create a compiled template * var compiled = _.template('hello <%= user %>!'); * compiled({ 'user': 'fred' }); * // => 'hello fred!' * * // using the HTML "escape" delimiter to escape data property values * var compiled = _.template('<%- value %>'); * compiled({ 'value': '