Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender-addons.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorNathan Lovato <nathan@gdquest.com>2019-09-05 18:22:37 +0300
committerNathan Lovato <nathan@gdquest.com>2019-09-05 18:22:52 +0300
commit61d48c0a4be0ab8f71e6e1d35f0aa99c77fcfd33 (patch)
treef64d0ea88789184f45112b489598990d549788f2 /power_sequencer/operators/expand_to_surrounding_cuts.py
parentda5a1175e30c347fbce05e49e2f5f895be30bd5b (diff)
Add the VSE addon Power Sequencer
Diffstat (limited to 'power_sequencer/operators/expand_to_surrounding_cuts.py')
-rw-r--r--power_sequencer/operators/expand_to_surrounding_cuts.py104
1 files changed, 104 insertions, 0 deletions
diff --git a/power_sequencer/operators/expand_to_surrounding_cuts.py b/power_sequencer/operators/expand_to_surrounding_cuts.py
new file mode 100644
index 00000000..34507da8
--- /dev/null
+++ b/power_sequencer/operators/expand_to_surrounding_cuts.py
@@ -0,0 +1,104 @@
+#
+# Copyright (C) 2016-2019 by Nathan Lovato, Daniel Oakey, Razvan Radulescu, and contributors
+#
+# This file is part of Power Sequencer.
+#
+# Power Sequencer is free software: you can redistribute it and/or modify it under the terms of the
+# GNU General Public License as published by the Free Software Foundation, either version 3 of the
+# License, or (at your option) any later version.
+#
+# Power Sequencer is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+# without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License along with Power Sequencer. If
+# not, see <https://www.gnu.org/licenses/>.
+#
+import bpy
+from math import floor
+
+from .utils.functions import convert_duration_to_frames
+from .utils.doc import doc_name, doc_idname, doc_brief, doc_description
+from .utils.functions import slice_selection
+
+
+class POWER_SEQUENCER_OT_expand_to_surrounding_cuts(bpy.types.Operator):
+ """
+ *Brief* Expand selected strips to surrounding cuts
+
+ Finds potential gaps surrounding each block of selected sequences and extends the corresponding
+ sequence handle to it.
+ """
+
+ doc = {
+ "name": doc_name(__qualname__),
+ "demo": "",
+ "description": doc_description(__doc__),
+ "shortcuts": [
+ ({"type": "E", "value": "PRESS", "ctrl": True}, {}, "Expand to Surrounding Cuts")
+ ],
+ "keymap": "Sequencer",
+ }
+ bl_idname = doc_idname(__qualname__)
+ bl_label = doc["name"]
+ bl_description = doc_brief(doc["description"])
+ bl_options = {"REGISTER", "UNDO"}
+
+ margin: bpy.props.FloatProperty(
+ name="Trim margin",
+ description="Margin to leave on either sides of the trim in seconds",
+ default=0.2,
+ min=0,
+ )
+ gap_remove: bpy.props.BoolProperty(
+ name="Remove gaps",
+ description="When trimming the sequences, remove gaps automatically",
+ default=True,
+ )
+
+ @classmethod
+ def poll(cls, context):
+ return context.selected_sequences
+
+ def invoke(self, context, event):
+ sequence_blocks = slice_selection(context, context.selected_sequences)
+ for sequences in sequence_blocks:
+ sequences_frame_start = min(sequences, key=lambda s: s.frame_final_start).frame_final_start
+ sequences_frame_end = max(sequences, key=lambda s: s.frame_final_end).frame_final_end
+
+ frame_left, frame_right = find_closest_cuts(
+ context, sequences_frame_start, sequences_frame_end
+ )
+ if (
+ sequences_frame_start == frame_left
+ and sequences_frame_end == frame_right
+ ):
+ continue
+
+ to_extend_left = [s for s in sequences if s.frame_final_start == sequences_frame_start]
+ to_extend_right = [s for s in sequences if s.frame_final_end == sequences_frame_end]
+
+ for s in to_extend_left:
+ s.frame_final_start = (
+ frame_left
+ if frame_left < sequences_frame_start
+ else sequences_frame_start
+ )
+ for s in to_extend_right:
+ s.frame_final_end = (
+ frame_right
+ if frame_right > sequences_frame_end
+ else sequences_frame_end
+ )
+ return {"FINISHED"}
+
+
+def find_closest_cuts(context, frame_min, frame_max):
+ frame_left = max(
+ context.sequences, key=lambda s: s.frame_final_end if s.frame_final_end <= frame_min else -1
+ ).frame_final_end
+ frame_right = min(
+ context.sequences,
+ key=lambda s: s.frame_final_start if s.frame_final_start >= frame_max else 1000000,
+ ).frame_final_start
+ return frame_left, frame_right