2.0 KiB
2.0 KiB
tags
| tags | |
|---|---|
|
Schedule Split
Documentation
- Class name:
SaltScheduleSplit - Category:
SALT/Scheduling - Output node:
False
The SaltScheduleSplit node is designed to divide a given schedule list into two parts based on a specified index. This functionality is essential for segmenting schedules into manageable sections for further processing or analysis.
Input types
Required
schedule_list- The list of scheduled items to be split. This parameter is crucial as it defines the sequence of items that will be divided into two parts.
- Comfy dtype:
LIST - Python dtype:
List[Any]
split_index- The index at which the schedule list is split. This parameter determines the point of division, affecting how the list is segmented.
- Comfy dtype:
INT - Python dtype:
int
Output types
schedule_list_a- Comfy dtype:
LIST - The first part of the schedule list, containing items before the split index.
- Python dtype:
List[Any]
- Comfy dtype:
schedule_list_b- Comfy dtype:
LIST - The second part of the schedule list, containing items from the split index onwards.
- Python dtype:
List[Any]
- Comfy dtype:
Usage tips
- Infra type:
CPU - Common nodes: unknown
Source code
class SaltScheduleSplit:
@classmethod
def INPUT_TYPES(cls):
return {
"required": {
"schedule_list": ("LIST", ),
"split_index": ("INT", {"min": 0}),
},
}
RETURN_TYPES = ("LIST", "LIST")
RETURN_NAMES = ("schedule_list_a", "schedule_list_b")
FUNCTION = "split"
CATEGORY = "SALT/Scheduling"
def split(self, schedule_list, split_index):
if split_index >= len(schedule_list) or split_index < 0:
raise ValueError("Schedule split_index must be within the range of the schedule_list.")
first_part = schedule_list[:split_index]
second_part = schedule_list[split_index:]
return (first_part, second_part)