forked from kitian616/jekyll-TeXt-theme
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
chore: add _sass/additional & lazyload, throttle to lib & update giti…
…gnore
- Loading branch information
Showing
11 changed files
with
199 additions
and
5,364 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,143 @@ | ||
(function() { | ||
var Set = (function() { | ||
var add = function(item) { | ||
var i, data = this._data; | ||
for (i = 0; i < data.length; i++) { | ||
if (data[i] === item) { | ||
return; | ||
} | ||
} | ||
this.size ++; | ||
data.push(item); | ||
return data; | ||
}; | ||
|
||
var Set = function(data) { | ||
this.size = 0; | ||
this._data = []; | ||
var i; | ||
if (data.length > 0) { | ||
for (i = 0; i < data.length; i++) { | ||
add.call(this, data[i]); | ||
} | ||
} | ||
}; | ||
Set.prototype.add = add; | ||
Set.prototype.get = function(index) { return this._data[index]; }; | ||
Set.prototype.has = function(item) { | ||
var i, data = this._data; | ||
for (i = 0; i < data.length; i++) { | ||
if (this.get(i) === item) { | ||
return true; | ||
} | ||
} | ||
return false; | ||
}; | ||
Set.prototype.is = function(map) { | ||
if (map._data.length !== this._data.length) { return false; } | ||
var i, j, flag, tData = this._data, mData = map._data; | ||
for (i = 0; i < tData.length; i++) { | ||
for (flag = false, j = 0; j < mData.length; j++) { | ||
if (tData[i] === mData[j]) { | ||
flag = true; | ||
break; | ||
} | ||
} | ||
if (!flag) { return false; } | ||
} | ||
return true; | ||
}; | ||
Set.prototype.values = function() { | ||
return this._data; | ||
}; | ||
return Set; | ||
})(); | ||
|
||
window.Lazyload = (function(doc) { | ||
var queue = {js: [], css: []}, sources = {js: {}, css: {}}, context = this; | ||
var createNode = function(name, attrs) { | ||
var node = doc.createElement(name), attr; | ||
for (attr in attrs) { | ||
if (attrs.hasOwnProperty(attr)) { | ||
node.setAttribute(attr, attrs[attr]); | ||
} | ||
} | ||
return node; | ||
}; | ||
var end = function(type, url) { | ||
var s, q, qi, cbs, i, j, cur, val, flag; | ||
if (type === 'js' || type ==='css') { | ||
s = sources[type], q = queue[type]; | ||
s[url] = true; | ||
for (i = 0; i < q.length; i++) { | ||
cur = q[i]; | ||
if (cur.urls.has(url)) { | ||
qi = cur, val = qi.urls.values(); | ||
qi && (cbs = qi.callbacks); | ||
for (flag = true, j = 0; j < val.length; j++) { | ||
cur = val[j]; | ||
if (!s[cur]) { | ||
flag = false; | ||
} | ||
} | ||
if (flag && cbs && cbs.length > 0) { | ||
for (j = 0; j < cbs.length; j++) { | ||
cbs[j].call(context); | ||
} | ||
qi.load = true; | ||
} | ||
} | ||
} | ||
} | ||
}; | ||
var load = function(type, urls, callback) { | ||
var s, q, qi, node, i, cur, | ||
_urls = typeof urls === 'string' ? new Set([urls]) : new Set(urls), val, url; | ||
if (type === 'js' || type ==='css') { | ||
s = sources[type], q = queue[type]; | ||
for (i = 0; i < q.length; i++) { | ||
cur = q[i]; | ||
if (_urls.is(cur.urls)) { | ||
qi = cur; | ||
break; | ||
} | ||
} | ||
val = _urls.values(); | ||
if (qi) { | ||
callback && (qi.load || qi.callbacks.push(callback)); | ||
callback && (qi.load && callback()); | ||
} else { | ||
q.push({ | ||
urls: _urls, | ||
callbacks: callback ? [callback] : [], | ||
load: false | ||
}); | ||
for (i = 0; i < val.length; i++) { | ||
node = null, url = val[i]; | ||
if (s[url] === undefined) { | ||
(type === 'js' ) && (node = createNode('script', { src: url })); | ||
(type === 'css') && (node = createNode('link', { rel: 'stylesheet', href: url })); | ||
if (node) { | ||
node.onload = (function(type, url) { | ||
return function() { | ||
end(type, url); | ||
}; | ||
})(type, url); | ||
(doc.head || doc.body).appendChild(node); | ||
s[url] = false; | ||
} | ||
} | ||
} | ||
} | ||
} | ||
}; | ||
return { | ||
js: function(url, callback) { | ||
load('js', url, callback); | ||
}, | ||
css: function(url, callback) { | ||
load('css', url, callback); | ||
} | ||
}; | ||
})(this.document); | ||
})(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
(function() { | ||
window.throttle = function(func, wait) { | ||
var args, result, thisArg, timeoutId, lastCalled = 0; | ||
|
||
function trailingCall() { | ||
lastCalled = new Date; | ||
timeoutId = null; | ||
result = func.apply(thisArg, args); | ||
} | ||
return function() { | ||
var now = new Date, | ||
remaining = wait - (now - lastCalled); | ||
|
||
args = arguments; | ||
thisArg = this; | ||
|
||
if (remaining <= 0) { | ||
clearTimeout(timeoutId); | ||
timeoutId = null; | ||
lastCalled = now; | ||
result = func.apply(thisArg, args); | ||
} else if (!timeoutId) { | ||
timeoutId = setTimeout(trailingCall, remaining); | ||
} | ||
return result; | ||
}; | ||
}; | ||
})(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.