Skip to content

Instantly share code, notes, and snippets.

function isEqualObject(obj1, obj2) {
if ( (!obj1 && obj1 !== 0) || (!obj2 && obj2 !== 0) || (typeof obj1 !== 'object') || (typeof obj2 !== 'object')) {
return false
}
let attrArray1 = Object.keys(obj1),
attrArray2 = Object.keys(obj2)
if (attrArray1.length !== attrArray2.length) {
return false
:root {
--width-base: 800px;
--font-size-base: 14px;
--color-gray: #d0d0d0;
--color-title: color(var(--color-gray) blackness(80%));
--color-content: color(var(--color-gray) blackness(70%));
--color-link: color(blue blackness(60%));
<!DOCTYPE html>
<html>
<head>
<title>Flash test</title>
<!-- <script type="text/javascript" src="http://s7.qhimg.com/!e3780b03/swfobject-2.3.js"></script> -->
<script type="text/javascript" src="http://ajax.googleapis.com/ajax/libs/swfobject/2.2/swfobject.js"></script>
<script type="text/javascript">
swfobject.embedSWF("/LPlayer.swf", 'video-player', "800", "500", "9", null, null, {allowScriptAccess: 'always'}, null, function(e) {
@zhangyihua
zhangyihua / 冒泡排序
Created July 27, 2016 11:24
双向冒泡排序
function bubbleSort(arr) {
var temp, j,
low = 0,
heigh = arr.length - 1;
while (low < heigh) {
for (j = low; j < heigh; ++j) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
function defineOverload(obj, funcName, fun) {
var old = obj[funcName];
obj[funcName] = function() {
if (arguments.length == fun.length) {
return fun.apply(obj, arguments)
} else if (typeof old == "function"){
return old.apply(obj, arguments);
}
}
}
@zhangyihua
zhangyihua / 直接插入排序
Last active July 26, 2016 10:28
直接插入排序升序排序的 JavaScript 实现。这里没有做类型检测,默认数组成员都为同一类型,且类型范围为数字或字符串。
function directInsertSort(arr) {
var sentinel;
for (var i = 1; i<arr.length; i++) {
// 如果当前的成员比前一个大,则保持不变,
// 将与前面有序序列成员进行对比
if (arr[i]<arr[i-1]) {
sentinel = arr[i];
arr[i] = arr[i-1];
var j = i-1;