mirror of
https://github.com/OPM/ResInsight.git
synced 2026-10-24 22:27:55 -05:00
Kristian Bendiksen
f9030a3e1f
Build, copy and edit taskmaestro workflows in ResInsight and save them as standard workflow.yaml + input.yaml. - Python helper: catalog, load, save and export-registered subcommands, and run --registered for installed workflows - C++ definition model with pure edit operations, port type checks, config field derivation, static validation and undo/redo - Installed folder listing registered workflows (read-only, runnable, can be duplicated) - Graph editor dock with task palette, drag-to-connect, context menus, automatic layout and debounced live validation - New/Duplicate/Save/Save As/Rescan commands; unsaved edits run from a temporary folder and prompt before being discarded - Update the design document and the user README
45 lines
1.7 KiB
C++
45 lines
1.7 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) 2026- Equinor ASA
|
|
//
|
|
// ResInsight 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.
|
|
//
|
|
// ResInsight 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 at <http://www.gnu.org/licenses/gpl.html>
|
|
// for more details.
|
|
//
|
|
/////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#pragma once
|
|
|
|
#include <QMap>
|
|
#include <QString>
|
|
#include <QStringList>
|
|
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
//==================================================================================================
|
|
/// Column assignment and ordering of workflow tasks for the graph view. Pure; positions in pixels
|
|
/// are left to the view, which knows the node sizes.
|
|
//==================================================================================================
|
|
namespace RiuWorkflowGraphLayout
|
|
{
|
|
struct Layout
|
|
{
|
|
QMap<QString, int> ranks;
|
|
std::vector<QStringList> layers;
|
|
};
|
|
|
|
// Longest-path ranks from a topological sort (Kahn), so the input does not need to be in
|
|
// topological order. Nodes on cycles are placed after their resolved predecessors. Within a
|
|
// column the nodes are ordered by the mean position of their predecessors, then by name.
|
|
Layout computeLayers( const QStringList& nodes, const std::vector<std::pair<QString, QString>>& edges );
|
|
} // namespace RiuWorkflowGraphLayout
|