Skip to content

dr_py
dr_py

yq0110 / dr_py
落后 Fork 源项目 1 个版本

Fork自 晚风拂柳颜 / dr_py

通知 1
Star 0
Fork 0
dr_py
dr_py

前往新版Gitcode，体验更适合开发者的 AI 搜索 >>

提交 c5326d5f 编写于 作者: H hjdhnx
浏览文件
操作

提交lib

上级 582ccb6e
展开全部 隐藏空白更改
内联 并排
Showing with 443 addition and 107 deletion
libs/alist.js
浏览文件 @ c5326d5f
// import _ from 'https://underscorejs.org/underscore-esm-min.js'
import { distance } from 'https://unpkg.com/fastest-levenshtein@1.0.16/esm/mod.js'
import {getFirstLetterList } from 'https://gitcode.net/qq_32394351/dr_py/-/raw/master/libs/pinyin_getFirstLetterList.js'
import {distance} from 'https://unpkg.com/fastest-levenshtein@1.0.16/esm/mod.js'
import {sortListByCN} from 'https://unpkg.com/fastest-levenshtein@1.0.16/esm/mod.js'
/**
* alist js
......@@ -440,7 +440,7 @@ function search(wd, quick) {
if(vhref){
vhref = unescape(vhref);
}
// print(vhref);
print(vhref);
if(excludeReg.test(vhref)){
return; //跳过本次循环
}
......@@ -499,124 +499,95 @@ function levenshteinDistance(str1, str2) {
return 100 - 100 * distance(str1, str2) / Math.max(str1.length, str2.length);
}
// 首字母开头排序
const sortListByFirst = (vodList,key) => {
key = key||'vod_name';
// 名字以特殊符号开头的应用列表
const symbol_list = [];
// 名字以中文开头的应用列表
const cn_list = [];
// 名字以英文开头的应用列表
const en_list = [];
// 名字以数字开头的应用列表
const num_list = [];
vodList.forEach((vod) => {
const { vod_name } = vod;
//通过正则进行数据分类
if (/[\u4e00-\u9fa5]/.test(vod_name[0])) {
cn_list.push(vod);
} else if (/[a-zA-Z]/.test(vod_name[0])) {
en_list.push(vod);
} else if (/[\d]/.test(vod_name[0])) {
num_list.push(vod);
} else {
symbol_list.push(vod);
}
});
//按照要求的方式进行数据排序重组
const newList = [
...cn_list.sort((a, b) => a.vod_name[0]?.localeCompare(b.vod_name[0])),
...en_list.sort((a, b) => a.vod_name[0].localeCompare(b.vod_name[0])),//localeCompare可以不区分大小写的进行排序
...num_list.sort((a, b) => a.vod_name[0] - b.vod_name[0]),
...symbol_list.sort((a, b) => a.vod_name[0] - b.vod_name[0])
];
return newList
};
// 判断字符串是否全是中文
function isAllChinese(str) {
return /^[\u4E00-\u9FA5]+$/.test(str);
}
// 判断字符是否为中文
function isChinese(char) {
return /^[\u4E00-\u9FA5]$/.test(char);
}
// 完整名称排序
const sortListByName = (vodList,key,order) => {
if(!key){
return vodList
/**
* 自然排序
* ["第1集","第10集","第20集","第2集","1","2","10","12","23","01","02"].sort(naturalSort())
* @param options {{key,caseSensitive, order: string}}
*/
function naturalSort(options) {
if (!options) {
options = {};
}
order = order||'asc'; // 默认正序
let ASCarr = vodList.sort((a, b) => {
a = a[key];
b = b[key];
// 数字排在字符串前面
if (typeof a === 'number' && typeof b === 'string') {
return -1;
}
if (typeof a === 'string' && typeof b === 'number') {
return 1;
return function (a, b) {
if(options.key){
a = a[options.key];
b = b[options.key];
}
var EQUAL = 0;
var GREATER = (options.order === 'desc' ?
-1 :
1
);
var SMALLER = -GREATER;
var re = /(^-?[0-9]+(\.?[0-9]*)[df]?e?[0-9]?$|^0x[0-9a-f]+$|[0-9]+)/gi;
var sre = /(^[ ]*|[ ]*$)/g;
var dre = /(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/;
var hre = /^0x[0-9a-f]+$/i;
var ore = /^0/;
var normalize = function normalize(value) {
var string = '' + value;
return (options.caseSensitive ?
string :
string.toLowerCase()
);
};
// 当存在非数字时
if (isNaN(a) || isNaN(b)) {
// 全汉字的排在非全汉字的后面
if (isAllChinese(a) && !isAllChinese(b)) {
return 1;
}
// Normalize values to strings
var x = normalize(a).replace(sre, '') || '';
var y = normalize(b).replace(sre, '') || '';
if (!isAllChinese(a) && isAllChinese(b)) {
return -1;
}
// chunk/tokenize
var xN = x.replace(re, '\0$1\0').replace(/\0$/, '').replace(/^\0/, '').split('\0');
var yN = y.replace(re, '\0$1\0').replace(/\0$/, '').replace(/^\0/, '').split('\0');
// 存在非数字的数据时，都转为字符串进行比较
a = a.toString();
b = b.toString();
// Return immediately if at least one of the values is empty.
if (!x && !y) return EQUAL;
if (!x && y) return GREATER;
if (x && !y) return SMALLER;
let result = 0;
// numeric, hex or date detection
var xD = parseInt(x.match(hre)) || (xN.length != 1 && x.match(dre) && Date.parse(x));
var yD = parseInt(y.match(hre)) || xD && y.match(dre) && Date.parse(y) || null;
var oFxNcL, oFyNcL;
// 依次比较两个字符串的各项字符
for (let index = 0; index < ((a.length - b.length) ? b.length : a.length); index++) {
// first try and sort Hex codes or Dates
if (yD) {
if (xD < yD) return SMALLER;
else if (xD > yD) return GREATER;
}
// 汉字排在非汉字的后面
if (!isChinese(a[index]) && isChinese(b[index])) {
result = -1;
}
// natural sorting through split numeric strings and default strings
for (var cLoc = 0, numS = Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {
if (isChinese(a[index]) && !isChinese(b[index])) {
result = 1;
}
// find floats not starting with '0', string or 0 if not defined (Clint Priest)
oFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;
oFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;
// 若两个汉字进行比较，则比较他们的拼音首字母
if (isChinese(a[index]) && isChinese(b[index])) {
let pinyinA = getFirstLetterList(a[index]).toString();
let pinyinB = getFirstLetterList(b[index]).toString();
// handle numeric vs string comparison - number < string - (Kyle Adams)
if (isNaN(oFxNcL) !== isNaN(oFyNcL)) return (isNaN(oFxNcL)) ? GREATER : SMALLER;
result = pinyinA.localeCompare(pinyinB, 'zh-Hans-CN', { sensitivity: 'accent' });
}
// 若已经比较出结果，则跳出循环，不再继续比较剩余字符
if (result !== 0) {
break
}
// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'
else if (typeof oFxNcL !== typeof oFyNcL) {
oFxNcL += '';
oFyNcL += '';
}
// 只要有一个无法转换为数字——转换为字符串进行比较——先按字符排序，然后按照数字排序
return result || a.toString().localeCompare(b.toString(), 'zh-Hans-CN', { sensitivity: 'accent' });
} else {
// 都能转换为数字——转换为数字进行比较——从小到大排序
return Number(a) - Number(b);
if (oFxNcL < oFyNcL) return SMALLER;
if (oFxNcL > oFyNcL) return GREATER;
}
});
if(order==='desc'){
ASCarr.reverse();
return EQUAL;
};
}
// 完整名称排序
const sortListByName = (vodList,key,order) => {
if(!key){
return vodList
}
return ASCarr
order = order||'asc'; // 默认正序
// 排序键,顺序,区分大小写
return vodList.sort(naturalSort({key: key, order: order,caseSensitive:true}))
};
const getTimeInt = (timeStr) => {
......
libs/alist.min.js
浏览文件 @ c5326d5f
此差异已折叠。
libs/nameOrder.js 0 → 100644
浏览文件 @ c5326d5f
/**
* 比较字符串
* @param str1
* @param str2
*/
function strCompare(str1, str2) {
// 处理数据为null的情况
if (str1 == undefined && str2 == undefined) {
return 0;
}
if (str1 == undefined) {
return -1;
}
if (str2 == undefined) {
return 1;
}
// 比较字符串中的每个字符
let c1;
let c2;
let regexArr = ['-', '_', '—', '~', '·'], canRegex = /[^0-9\.]/g;
// 如果都不是数字格式（含有其它内容）
if (canRegex.test(str1) && canRegex.test(str2)) {
for (let i = 0; i < regexArr.length; i++) {
let regex = eval('(/[^0-9\\' + regexArr[i] + '\\.]/g)');
// 去除后缀
let tps1 = str1.replace(/\.[0-9a-zA-Z]+$/, '');
let tps2 = str2.replace(/\.[0-9a-zA-Z]+$/, '');
// 如果在名字正则要求范围内（没有正则以外的值）
if (!regex.test(tps1) && !regex.test(tps2)) {
// 转换为字符串数组
let numberArray1 = tps1.split(regexArr[i]);
let numberArray2 = tps2.split(regexArr[i]);
return compareNumberArray(numberArray1, numberArray2);
}
}
}
// 逐字比较返回结果
for (let i = 0; i < str1.length; i++) {
c1 = str1[i];
if (i > str2.length - 1) { // 如果在该字符前，两个串都一样，str2更短，则str1较大
return 1;
}
c2 = str2[i];
// 如果都是数字的话，则需要考虑多位数的情况，取出完整的数字字符串，转化为数字再进行比较
if (isNumber(c1) && isNumber(c2)) {
let numStr1 = "";
let numStr2 = "";
// 获取数字部分字符串
for (let j = i; j < str1.length; j++) {
c1 = str1[j];
if (!isNumber(c1) && c1 !== '.') { // 不是数字则直接退出循环
break;
}
numStr1 += c1;
}
for (let j = i; j < str2.length; j++) {
c2 = str2[j];
if (!isNumber(c2) && c2 !== '.') {
break;
}
numStr2 += c2;
}
// 将带小数点的数字转换为数字字符串数组
let numberArray1 = numStr1.split('.');
let numberArray2 = numStr2.split('.');
return compareNumberArray(numberArray1, numberArray2);
}
// 不是数字的比较方式
if (c1 != c2) {
return c1 - c2;
}
}
return 0;
}
/**
* 判断是否为数字
* @param obj
* @returns
*/
function isNumber(obj) {
if (parseFloat(obj).toString() == "NaN") {
return false;
}
return true;
}
/**
* 比较两个数字数组
*
* @param numberArray1
* @param numberArray2
*/
export function compareNumberArray(numberArray1, numberArray2) {
for (let i = 0; i < numberArray1.length; i++) {
if (numberArray2.length < i + 1) { // 此时数字数组2比1短，直接返回
return 1;
}
let compareResult = parseInt(numberArray1[i]) - parseInt(numberArray2[i]);
if (compareResult !== 0) {
return compareResult;
}
}
// 说明数组1比数组2短，返回小于
return -1;
}
/**
* 自然排序
* ["第1集","第10集","第20集","第2集","1","2","10","12","23","01","02"].sort(naturalSort())
* @param options { direction: 'desc', caseSensitive: true }
*/
export function naturalSort(options) {
if (!options) options = {};
return function (a, b) {
var EQUAL = 0;
var GREATER = (options.direction == 'desc' ?
-1 :
1
);
var SMALLER = -GREATER;
var re = /(^-?[0-9]+(\.?[0-9]*)[df]?e?[0-9]?$|^0x[0-9a-f]+$|[0-9]+)/gi;
var sre = /(^[ ]*|[ ]*$)/g;
var dre = /(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/;
var hre = /^0x[0-9a-f]+$/i;
var ore = /^0/;
var normalize = function normalize(value) {
var string = '' + value;
return (options.caseSensitive ?
string :
string.toLowerCase()
);
};
// Normalize values to strings
var x = normalize(a).replace(sre, '') || '';
var y = normalize(b).replace(sre, '') || '';
// chunk/tokenize
var xN = x.replace(re, '\0$1\0').replace(/\0$/, '').replace(/^\0/, '').split('\0');
var yN = y.replace(re, '\0$1\0').replace(/\0$/, '').replace(/^\0/, '').split('\0');
// Return immediately if at least one of the values is empty.
if (!x && !y) return EQUAL;
if (!x && y) return GREATER;
if (x && !y) return SMALLER;
// numeric, hex or date detection
var xD = parseInt(x.match(hre)) || (xN.length != 1 && x.match(dre) && Date.parse(x));
var yD = parseInt(y.match(hre)) || xD && y.match(dre) && Date.parse(y) || null;
var oFxNcL, oFyNcL;
// first try and sort Hex codes or Dates
if (yD) {
if (xD < yD) return SMALLER;
else if (xD > yD) return GREATER;
}
// natural sorting through split numeric strings and default strings
for (var cLoc = 0, numS = Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {
// find floats not starting with '0', string or 0 if not defined (Clint Priest)
oFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;
oFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;
// handle numeric vs string comparison - number < string - (Kyle Adams)
if (isNaN(oFxNcL) !== isNaN(oFyNcL)) return (isNaN(oFxNcL)) ? GREATER : SMALLER;
// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'
else if (typeof oFxNcL !== typeof oFyNcL) {
oFxNcL += '';
oFyNcL += '';
}
if (oFxNcL < oFyNcL) return SMALLER;
if (oFxNcL > oFyNcL) return GREATER;
}
return EQUAL;
};
}
\ No newline at end of file
libs/sortName.js 0 → 100644
浏览文件 @ c5326d5f
此差异已折叠。
Markdown is supported
0% 或 .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑！
想要评论请 注册 或