PageSourceSearch

https://vegasviplimo.com/assets/js/parallax.js

js vegasviplimo.com collected 2026-10-03 00:04:56 UTC 1,784 bytes, 1 lines download raw bytes

1/*Plugin: jQuery ParallaxVersion 1.1.3Author: Ian LunnTwitter: @IanLunnAuthor URL: http://www.ianlunn.co.uk/Plugin URL: http://www.ianlunn.co.uk/plugins/jquery-parallax/Dual licensed under the MIT and GPL licenses:http://www.opensource.org/licenses/mit-license.phphttp://www.gnu.org/licenses/gpl.html*/(function( jQuery ){	var jQuerywindow = jQuery(window);	var windowHeight = jQuerywindow.height();	jQuerywindow.resize(function () {		windowHeight = jQuerywindow.height();	});	jQuery.fn.parallax = function(xpos, speedFactor, outerHeight) {		var jQuerythis = jQuery(this);		var getHeight;		var firstTop;		var paddingTop = 0;		//get the starting position of each element to have parallax applied to it				jQuerythis.each(function(){		    firstTop = jQuerythis.offset().top;		});		if (outerHeight) {			getHeight = function(jqo) {				return jqo.outerHeight(true);			};		} else {			getHeight = function(jqo) {				return jqo.height();			};		}		// setup defaults if arguments aren't specified		if (arguments.length < 1 || xpos === null) xpos = "50%";		if (arguments.length < 2 || speedFactor === null) speedFactor = 0.1;		if (arguments.length < 3 || outerHeight === null) outerHeight = true;		// function to be called whenever the window is scrolled or resized		function update(){			var pos = jQuerywindow.scrollTop();							jQuerythis.each(function(){				var jQueryelement = jQuery(this);				var top = jQueryelement.offset().top;				var height = getHeight(jQueryelement);				// Check if totally above or totally below viewport				if (top + height < pos || top > pos + windowHeight) {					return;				}				jQuerythis.css('backgroundPosition', xpos + " " + Math.round((top - pos) * speedFactor) + "px");			});		}				jQuerywindow.bind('scroll', update).resize(update);		update();	};})(jQuery);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.