x15904151985/ArtPlayer
1
0 Fork 0
mirror of https://github.com/zhw2590582/ArtPlayer.git synced 2026-10-30 03:51:25 -08:00
Code Issues Packages Projects Releases Wiki Activity

add worker to danmuku

Browse Source
This commit is contained in:
Harvey Zack committed 2022-05-02 00:14:46 +08:00
1 parent 5ff4a8f70b
commit 7bcc296fc2
7 files changed
+206 -283
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

packages/artplayer-plugin-danmuku/src/getDanmuTop.js
-137
View File
@@ -1,137 +0,0 @@
function getData(ins, clientLeft, clientWidth, item) {
const top = item.$ref.offsetTop;
const left = ins.getLeft(item.$ref) - clientLeft;
const height = item.$ref.clientHeight;
const width = item.$ref.clientWidth;
const distance = left + width;
const right = clientWidth - distance;
const speed = distance / item.$restTime;
const mode = item.mode;
const time = item.$restTime;
const $ref = item.$ref;
return {
$ref,
mode,
time,
top,
left,
height,
width,
right,
speed,
distance,
};
}
export default function getDanmuTop(ins, danmu) {
const clientLeft = ins.getLeft(ins.$player);
const { clientWidth, clientHeight } = ins.$player;
const { antiOverlap } = ins.option;
const { marginBottom, marginTop } = ins;
const target = getData(ins, clientLeft, clientWidth, danmu);
const danmus = ins.queue
.filter((item) => {
return (
item.$ref &&
item.$state === 'emit' &&
item.mode === target.mode &&
item.$ref.offsetTop <= clientHeight - marginBottom
);
})
.map((item) => getData(ins, clientLeft, clientWidth, item))
.sort((prev, next) => prev.top - next.top);
if (danmus.length === 0) {
return marginTop;
}
danmus.unshift({
top: 0,
left: 0,
right: 0,
height: marginTop,
width: clientWidth,
speed: 0,
distance: clientWidth,
});
danmus.push({
top: clientHeight - marginBottom,
left: 0,
right: 0,
height: marginBottom,
width: clientWidth,
speed: 0,
distance: clientWidth,
});
for (let index = 1; index < danmus.length; index += 1) {
const item = danmus[index];
const prev = danmus[index - 1];
const prevBottom = prev.top + prev.height;
const diff = item.top - prevBottom;
if (diff >= target.height) {
return prevBottom;
}
}
const topMap = [];
for (let index = 1; index < danmus.length - 1; index += 1) {
const item = danmus[index];
if (topMap.length) {
const last = topMap[topMap.length - 1];
if (last[0].top === item.top) {
last.push(item);
} else {
topMap.push([item]);
}
} else {
topMap.push([item]);
}
}
if (antiOverlap) {
switch (target.mode) {
case 0: {
const result = topMap.find((list) => {
return list.every((danmu) => {
if (clientWidth < danmu.distance) return false;
if (target.speed < danmu.speed) return true;
const overlapTime = danmu.right / (target.speed - danmu.speed);
if (overlapTime > danmu.time) return true;
return false;
});
});
return result && result[0] ? result[0].top : undefined;
}
case 1:
return undefined;
default:
break;
}
} else {
switch (target.mode) {
case 0:
topMap.sort((prev, next) => {
const nextMinRight = Math.min(...next.map((item) => item.right));
const prevMinRight = Math.min(...prev.map((item) => item.right));
return nextMinRight * next.length - prevMinRight * prev.length;
});
break;
case 1:
topMap.sort((prev, next) => {
const nextMaxWidth = Math.max(...next.map((item) => item.width));
const prevMaxWidth = Math.max(...prev.map((item) => item.width));
return prevMaxWidth * prev.length - nextMaxWidth * next.length;
});
break;
default:
break;
}
return topMap[0][0].top;
}
}