paipan.gx.js

"use strict";
var GX = Array(//刑冲合害关系: [0针对天干1针对地支, 关系类型, [发起者...], 形成者, 文字描述]
[0, 0, [0, 6], -1, '甲庚冲'],
[0, 0, [1, 7], -1, '乙辛冲'],
[0, 0, [2, 8], -1, '丙壬冲'],
[0, 0, [3, 9], -1, '丁癸冲'],
[0, 1, [0, 5], 4, '甲己合化土'],
[0, 1, [1, 6], 0, '乙庚合化金'],
[0, 1, [2, 7], 1, '丙辛合化水'],
[0, 1, [3, 8], 2, '丁壬合化木'],
[0, 1, [4, 9], 3, '戊癸合化火'],
[1, 2, [0, 6], -1, '子午冲'],
[1, 2, [1, 7], -1, '丑未冲'],
[1, 2, [2, 8], -1, '寅申冲'],
[1, 2, [3, 9], -1, '卯酉冲'],
[1, 2, [4, 10], -1, '辰戌冲'],
[1, 2, [5, 11], -1, '巳亥冲'],
[1, 3, [2, 5, 8], -1, '寅巳申三刑'],
[1, 3, [1, 10, 7], -1, '丑戌未三刑'],
[1, 4, [2, 5], -1, '寅巳相刑'],
[1, 4, [5, 8], -1, '巳申相刑'],
[1, 4, [1, 10], -1, '丑戌相刑'],
[1, 4, [10, 7], -1, '戌未相刑'],
[1, 4, [0, 3], -1, '子卯相刑'],
[1, 5, [9, 9], -1, '酉酉自刑'],
[1, 5, [11, 11], -1, '亥亥自刑'],
[1, 5, [6, 6], -1, '午午自刑'],
[1, 5, [4, 4], -1, '辰辰自刑'],
[1, 6, [0, 1], 4, '子丑合化土'],
[1, 6, [2, 11], 2, '寅亥合化木'],
[1, 6, [3, 10], 3, '卯戌合化火'],
[1, 6, [4, 9], 0, '辰酉合化金'],
[1, 6, [5, 8], 1, '巳申合化水'],
[1, 6, [6, 7], 3, '午未合化火'],
[1, 7, [2, 6, 10], 3, '寅午戌三合火'],
[1, 7, [8, 0, 4], 1, '申子辰三合水'],
[1, 7, [5, 9, 1], 0, '巳酉丑三合金'],
[1, 7, [11, 3, 7], 2, '亥卯未三合木'],
[1, 8, [8, 0], 1, '申子半合水'],
[1, 8, [0, 4], 1, '子辰半合水'],
[1, 8, [11, 3], 2, '亥卯半合木'],
[1, 8, [3, 7], 2, '卯未半合木'],
[1, 8, [2, 6], 3, '寅午半合火'],
[1, 8, [6, 10], 3, '午戌半合火'],
[1, 8, [5, 9], 0, '巳酉半合金'],
[1, 8, [9, 1], 0, '酉丑半合金'],
[1, 9, [8, 4], 0, '申辰拱合子'],
[1, 9, [11, 7], 3, '亥未拱合卯'],
[1, 9, [2, 10], 6, '寅戌拱合午'],
[1, 9, [5, 1], 9, '巳丑拱合酉'],
[1, 10, [2, 3, 4], 2, '寅卯辰会木'],
[1, 10, [5, 6, 7], 3, '巳午未会火'],
[1, 10, [8, 9, 10], 0, '申酉戌会金'],
[1, 10, [11, 0, 1], 1, '亥子丑会水'],
[1, 11, [2, 4], 3, '寅辰拱会卯'],
[1, 11, [5, 7], 6, '巳未拱会午'],
[1, 11, [8, 10], 9, '申戌拱会酉'],
[1, 11, [11, 1], 0, '亥丑拱会子'],
[1, 12, [3, 8], -1, '卯申暗合'],
[1, 12, [6, 11], -1, '午亥暗合'],
[1, 12, [1, 2], -1, '丑寅暗合'],
[1, 12, [2, 7], -1, '寅未暗合'],
[1, 12, [0, 10], -1, '子戌暗合'],
[1, 12, [0, 4], -1, '子辰暗合'],
[1, 12, [5, 9], -1, '巳酉暗合'],
[1, 13, [0, 7], -1, '子未害'],
[1, 13, [1, 6], -1, '丑午害'],
[1, 13, [2, 5], -1, '寅巳害'],
[1, 13, [3, 4], -1, '卯辰害'],
[1, 13, [8, 11], -1, '申亥害'],
[1, 13, [9, 10], -1, '酉戌害']
);

function pc_array_power_set(arr) {
    var results = [
        []
    ];
    for (var i in arr) {
        for (var j in results) {
            array_push(results, array_merge([arr[i]], results[j]));
        }
    }
    return results;
}

function array_merge() {
    var args = Array.prototype.slice.call(arguments);
    var argl = args.length;
    var arg;
    var retObj = {};
    var k = '';
    var argil = 0;
    var j = 0;
    var i = 0;
    var ct = 0;
    var toStr = Object.prototype.toString;
    var retArr = true;
    for (i = 0; i < argl; i++) {
        if (toStr.call(args[i]) !== '[object Array]') {
            retArr = false;
            break;
        }
    }
    if (retArr) {
        retArr = [];
        for (i = 0; i < argl; i++) {
            retArr = retArr.concat(args[i]);
        }
        return retArr;
    }
    for (i = 0, ct = 0; i < argl; i++) {
        arg = args[i];
        if (toStr.call(arg) === '[object Array]') {
            for (j = 0, argil = arg.length; j < argil; j++) {
                retObj[ct++] = arg[j];
            }
        } else {
            for (k in arg) {
                if (arg.hasOwnProperty(k)) {
                    if (parseInt(k, 10) + '' === k) {
                        retObj[ct++] = arg[k];
                    } else {
                        retObj[k] = arg[k];
                    }
                }
            }
        }
    }
    return retObj;
}

function array_keys(input, searchValue, argStrict) {
    var search = typeof searchValue !== 'undefined';
    var tmpArr = [];
    var strict = !!argStrict;
    var include = true;
    var key = '';

    for (key in input) {
        if (input.hasOwnProperty(key)) {
            include = true;
            if (search) {
                if (strict && input[key] !== searchValue) {
                    include = false;
                } else if (input[key] !== searchValue) {
                    include = false;
                }
            }

            if (include) {
                tmpArr[tmpArr.length] = key;
            }
        }
    }
    return tmpArr;
}

function array_push(inputArr) {
    var i = 0;
    var pr = '';
    var argv = arguments;
    var argc = argv.length;
    var allDigits = /^\d$/;
    var size = 0;
    var highestIdx = 0;
    var len = 0;

    if (inputArr.hasOwnProperty('length')) {
        for (i = 1; i < argc; i++) {
            inputArr[inputArr.length] = argv[i];
        }
        return inputArr.length;
    }
    for (pr in inputArr) {
        if (inputArr.hasOwnProperty(pr)) {
            ++len;
            if (pr.search(allDigits) !== -1) {
                size = parseInt(pr, 10);
                highestIdx = size > highestIdx ? size : highestIdx;
            }
        }
    }
    for (i = 1; i < argc; i++) {
        inputArr[++highestIdx] = argv[i];
    }

    return len + i - 1;
}

function array_diff(arr1) {
    var retArr = {};
    var argl = arguments.length;
    var k1 = '';
    var i = 1;
    var k = '';
    var arr = {};

    arr1keys: for (k1 in arr1) {
        for (i = 1; i < argl; i++) {
            arr = arguments[i]
            for (k in arr) {
                if (arr[k] === arr1[k1]) {
                    continue arr1keys;
                }
            }
            retArr[k1] = arr1[k1];
        }
    }
    return retArr;
}

function array_intersect(arr1) {
    var retArr = {};
    var argl = arguments.length;
    var arglm1 = argl - 1;
    var k1 = '';
    var arr = {};
    var i = 0;
    var k = '';

    arr1keys: for (k1 in arr1) {
        arrs: for (i = 1; i < argl; i++) {
            arr = arguments[i];
            for (k in arr) {
                if (arr[k] === arr1[k1]) {
                    if (i === arglm1) {
                        retArr[k1] = arr1[k1];
                    }
                    continue arrs;
                }
            }
            continue arr1keys;
        }
    }
    return retArr;
}

function empty(mixedVar) {
    var undef;
    var key;
    var i;
    var len;
    var emptyValues = [undef, null, false, 0, '', '0'];
    for (i = 0, len = emptyValues.length; i < len; i++) {
        if (mixedVar === emptyValues[i]) {
            return true;
        }
    }
    if (typeof mixedVar === 'object') {
        for (key in mixedVar) {
            if (mixedVar.hasOwnProperty(key)) {
                return false;
            }
        }
        return true;
    }
    return false;
}

function count(mixedVar, mode) {
    var key;
    var cnt = 0;

    if (mixedVar === null || typeof mixedVar === 'undefined') {
        return 0;
    } else if (mixedVar.constructor !== Array && mixedVar.constructor !== Object) {
        return 1;
    }
    if (mode === 'COUNT_RECURSIVE') {
        mode = 1;
    }
    if (mode !== 1) {
        mode = 0;
    }
    for (key in mixedVar) {
        if (mixedVar.hasOwnProperty(key)) {
            cnt++;
            if (mode === 1 && mixedVar[key] &&
                (mixedVar[key].constructor === Array || mixedVar[key].constructor === Object)) {
                cnt += count(mixedVar[key], 1);
            }
        }
    }
    return cnt;
}

function implode(glue, pieces) {
    var i = '';
    var retVal = '';
    var tGlue = '';

    if (arguments.length === 1) {
        pieces = glue;
        glue = '';
    }
    if (typeof pieces === 'object') {
        if (Object.prototype.toString.call(pieces) === '[object Array]') {
            return pieces.join(glue);
        }
        for (i in pieces) {
            retVal += tGlue + pieces[i];
            tGlue = glue;
        }
        return retVal;
    }

    return pieces;
}
/**
 * 从天干地支数组查出所有刑冲合害关系
 * @param array tg 天干数组
 * @param array dz 地支数组
 * @return array [[], []]
 */
function GetGX(tg, dz) {
    var list = new Array([], []); //两个列表:0位是天干关系列表,1位是地支关系列表
	var excludes = {
		4 : 3, //相刑要把三刑(3)排除
		8 : 7, //半合要把三合(7)排除
		9 : 7, //拱合要把三合(7)排除
		11 : 10 //拱会要把三会(10)排除
	};
    for (var i in GX) { //[0针对天干1针对地支, 关系类型, [发起者...], 形成者, 文字描述]
        var gx = GX[i];

        var to = (gx[0] == 0) ? tg : dz; //要匹配的类型

        var fd = array_intersect(to, gx[2]); //求交集,返回的键名与to是一致的
        if (empty(array_diff(gx[2], fd))) { //说明存在此关系

            var c1 = count(fd);
            var c2 = count(gx[2]);

            var fds = new Array(); //最终关联的
            if (c1 < c2) { //比如亥亥自刑,在只有一个亥的时候也会来这里

            }
            if (c1 == c2) { //有且只有一个此类关系
                array_push(fds, fd);
            }
            if (c1 > c2) { //存在多个此类关系,先算出所有可能的组合,再匹配判断以精确指定是哪一个位置
                var set = pc_array_power_set(array_keys(fd));
                for (var ii in set) {
                    var keys = set[ii];
                    if (count(keys) != c2) {
                        continue;
                    }
                    var fd = new Array();
                    for (var iii in keys) {
                        fd[keys[iii]] = to[keys[iii]];
                    }
                    if (empty(array_diff(gx[2], fd))) {
                        array_push(fds, fd);
                    }
                }
            }
            b1:for (var j in fds) { //组合成期望的返回
				b2:for (var expect in excludes){
					if(gx[1] == expect){
						b3:for (var jj in list[gx[0]]){ //其实仅针对地支有这种情况
							var [fd2, gx2] = list[gx[0]][jj];
							if(gx2[1] == excludes[expect]){
								if(array_intersect(gx[2], gx2[2])){
									break b1;
								}
							}
						}
						break;
					}
				}
                array_push(list[gx[0]], [fds[j], gx]);
            }
        }
    }
    return list;
}