Merge pull request #177 from code0-tech/feat/#101

Introduce new design choice option for Nodes

Author: nicosammito

src/packages/ce/src/flow/components/builder/FlowBuilderComponent.tsx

@@ -30,6 +30,7 @@ import {FlowPanelControlComponent} from "@edition/flow/components/panels/FlowPan
 import {FlowPanelUpdateComponent} from "@edition/flow/components/panels/FlowPanelUpdateComponent";
 import {FileTabsService} from "@code0-tech/pictor/dist/components/file-tabs/FileTabs.service";
 import {FlowPanelExportComponent} from "@edition/flow/components/panels/FlowPanelExportComponent";
+import {FunctionNodeSquareComponent} from "@edition/function/components/nodes/FunctionNodeSquareComponent";
 
 /**
  * Dynamically layouts a tree of nodes and their parameter nodes for a flow-based editor.
@@ -622,6 +623,7 @@ const InternalFlowBuilder: React.FC<FlowBuilderProps> = (props) => {
 
     const nodeTypes = React.useMemo(() => ({
         default: FunctionNodeDefaultComponent,
+        square: FunctionNodeSquareComponent,
         group: FunctionNodeGroupComponent,
         trigger: FunctionNodeTriggerComponent,
     }), [])

src/packages/ce/src/flow/hooks/Flow.nodes.hook.ts

@@ -8,92 +8,7 @@ import {DatatypeService} from "@edition/datatype/services/Datatype.service";
 import {FunctionNodeComponentProps} from "@edition/function/components/nodes/FunctionNodeComponent";
 import {DataTypeVariant, getTypesFromFunction, getTypesFromNode, getTypeVariant} from "@code0-tech/triangulum";
 
-const packageNodes = new Map<string, string>([
-    ['std', 'default'],
-]);
-
-/**
- * Returns the value of the best-matching key from a Map<string, string>.
- *
- * Matching priority:
- *   1) Exact match
- *   2) Longest prefix match (with bonus if the prefix ends at a token boundary)
- *   3) Largest common prefix length (with small boundary bonus)
- *
- * Token boundaries are characters in /[:._\-\/\s]+/ (e.g., "::", ".", "_", "-", "/", whitespace).
- *
- * Performance:
- *   - O(N * M), where N = number of keys, M = average key length (string comparisons only).
- *
- */
-const bestMatchValue = (map: Map<string, string>, input: string): string => {
-    if (!input || map.size === 0) return ""
-
-    const SEP = /[:._\-\/\s]+/;
-    const normInput = input.trim().toLowerCase();
-
-    let bestKey: string | null = null;
-    let bestScore = -Infinity;
-
-    for (const [key, value] of map.entries()) {
-        const normKey = key.trim().toLowerCase();
-
-        // (1) Exact match → immediately return (strongest possible score)
-        if (normInput === normKey) {
-            return value;
-        }
-
-        let score = 0;
-
-        // (2) Prefix match
-        if (normInput.startsWith(normKey)) {
-            score = 2000 + normKey.length * 2;
-
-            // Bonus if the prefix ends at a clean token boundary (or equals the whole input)
-            const boundaryChar = normInput.charAt(normKey.length); // '' if out of range
-            if (boundaryChar === "" || SEP.test(boundaryChar)) {
-                score += 200;
-            }
-        } else {
-            // (3) Largest common prefix (LCP)
-            const max = Math.min(normInput.length, normKey.length);
-            let lcp = 0;
-            while (lcp < max && normInput.charCodeAt(lcp) === normKey.charCodeAt(lcp)) {
-                lcp++;
-            }
-            if (lcp > 0) {
-                score = 1000 + lcp;
-
-                // Small bonus if LCP ends at a boundary on either side
-                const inBoundaryChar = normInput.charAt(lcp);
-                const keyBoundaryChar = normKey.charAt(lcp);
-                if (
-                    inBoundaryChar === "" ||
-                    SEP.test(inBoundaryChar) ||
-                    keyBoundaryChar === "" ||
-                    SEP.test(keyBoundaryChar)
-                ) {
-                    score += 50;
-                }
-            }
-        }
-
-        // Best candidate so far? Tie-breaker favors longer key (more specific)
-        if (score > bestScore) {
-            bestScore = score;
-            bestKey = key;
-        } else if (score === bestScore && bestKey !== null && key.length > bestKey.length) {
-            bestKey = key;
-        } else if (score === bestScore && bestKey === null) {
-            bestKey = key;
-        }
-    }
-
-    return bestKey !== null ? map.get(bestKey)! : "";
-};
-
-// @ts-ignore
-export const useFlowNodes = (flowId: Flow["id"], namespaceId?: Namespace["id"], projectId?: NamespaceProject["id"]): Node<DFlowNodeProps>[] => {
+export const useFlowNodes = (flowId: Flow["id"], namespaceId?: Namespace["id"], projectId?: NamespaceProject["id"]): Node<FunctionNodeComponentProps>[] => {
 
     const flowService = useService(FlowService)
     const flowStore = useStore(FlowService)
@@ -136,14 +51,15 @@ export const useFlowNodes = (flowId: Flow["id"], namespaceId?: Namespace["id"],
         ) => {
             if (!node?.id) return;
 
+            const functionDefinition = functionService.getById(node.functionDefinition?.id)
             const nodeId = node.id;
 
             if (!visited.has(nodeId)) {
                 visited.add(nodeId);
 
                 nodes.push({
                     id: nodeId,
-                    type: bestMatchValue(packageNodes, node.functionDefinition?.identifier ?? ""),
+                    type: functionDefinition && "design" in functionDefinition ? functionDefinition?.design as string : "default",
                     position: {x: 0, y: 0},
                     draggable: false,
                     parentId: parentGroup,
@@ -159,7 +75,7 @@ export const useFlowNodes = (flowId: Flow["id"], namespaceId?: Namespace["id"],
                 });
             }
 
-            const types = getTypesFromFunction(functionService.getById(node.functionDefinition?.id)!);
+            const types = getTypesFromFunction(functionDefinition!);
 
             node.parameters?.nodes?.forEach((param, index) => {
                 const value = param?.value;