diff options
| author | Anwarul Islam <anwaarulislaam@gmail.com> | 2025-07-16 03:51:31 +0600 |
|---|---|---|
| committer | Anwarul Islam <anwaarulislaam@gmail.com> | 2025-07-18 16:43:50 +0600 |
| commit | d440280f9781ce4255b8424afce821b4b326199c (patch) | |
| tree | 10307295c334961396bd9026b04db1cfe13bc781 /apps/web/src/lib/timeline.ts | |
| parent | 63e07dc9ffde903bb30a78f4e3c8d3e9c3800a28 (diff) | |
| download | opencut-d440280f9781ce4255b8424afce821b4b326199c.tar.gz | |
feat: add overlap checking and resolution functions for timeline elements
Diffstat (limited to 'apps/web/src/lib/timeline.ts')
| -rw-r--r-- | apps/web/src/lib/timeline.ts | 54 |
1 files changed, 54 insertions, 0 deletions
diff --git a/apps/web/src/lib/timeline.ts b/apps/web/src/lib/timeline.ts new file mode 100644 index 00000000..85fcabe6 --- /dev/null +++ b/apps/web/src/lib/timeline.ts @@ -0,0 +1,54 @@ +import { TimelineElement } from "@/types/timeline"; + +// Helper function to check for element overlaps and prevent invalid timeline states +export const checkElementOverlaps = (elements: TimelineElement[]): boolean => { + // Sort elements by start time + const sortedElements = [...elements].sort( + (a, b) => a.startTime - b.startTime + ); + + for (let i = 0; i < sortedElements.length - 1; i++) { + const current = sortedElements[i]; + const next = sortedElements[i + 1]; + + const currentEnd = + current.startTime + + (current.duration - current.trimStart - current.trimEnd); + + // Check if current element overlaps with next element + if (currentEnd > next.startTime) return true; // Overlap detected + } + + return false; // No overlaps +}; + +// Helper function to resolve overlaps by adjusting element positions +export const resolveElementOverlaps = ( + elements: TimelineElement[] +): TimelineElement[] => { + // Sort elements by start time + const sortedElements = [...elements].sort( + (a, b) => a.startTime - b.startTime + ); + const resolvedElements: TimelineElement[] = []; + + for (let i = 0; i < sortedElements.length; i++) { + const current = { ...sortedElements[i] }; + + if (resolvedElements.length > 0) { + const previous = resolvedElements[resolvedElements.length - 1]; + const previousEnd = + previous.startTime + + (previous.duration - previous.trimStart - previous.trimEnd); + + // If current element would overlap with previous, push it after previous ends + if (current.startTime < previousEnd) { + current.startTime = previousEnd; + } + } + + resolvedElements.push(current); + } + + return resolvedElements; +}; |
