# US 2020/0403859 A1 · Determine valid drop targets for nodes from mapping

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0403859 A1
- Document ID: US20200403859A1
- Status: Published application
- Kind: A1
- Application number: 16/449,869
- Filed: 2019-06-24
- Published: 2020-12-24
- Earliest claimed: 2019-06-24
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Vlad Balanescu; Doina Liliana Klinger; Ashley Donald Harrison
- Web page: https://patentgrep.com/patent/US20200403859A1

## CPC

- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06F 3/0486: Drag-and-drop
- G06F 16/168: {Details of user interfaces specifically adapted to file systems, e.g. browsing and visualisation, 2d or 3d GUIs (query results presentation G06F16/156)}
- G06F 30/12: characterised by design entry means specially adapted for CAD, e.g. graphical user interfaces [GUI] specially adapted for CAD
- H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play
- H04L 41/0816: the condition being an adaptation, e.g. in response to network events
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method, system, and computer program product for determining valid drop targets for nodes within an integration flow using mapping that includes: identifying a first node, identifying one or more input nodes, where the one or more input nodes are nodes within an integration flow of the first node, analyzing a mapping of the first node, where the analyzing includes determining whether the mapping contains one or more inputs from the one or more input nodes, and in response to determining that the mapping contains one or more inputs from an input node of the one or more input nodes, identifying valid drop points for the first node using the input node.

## Claims

### Claim 1

A computer-implemented method comprising:
identifying a first node;
identifying one or more input nodes, wherein the one or more input nodes are nodes within an integration flow of the first node;
analyzing a mapping of the first node, wherein the analyzing comprises:
determining whether the mapping contains one or more inputs from the one or more input nodes; and
in response to determining that the mapping contains one or more inputs from an input node of the one or more input nodes, identifying valid drop points for the first node using the input node.

### Claim 2 (depends on 1)

The method of claim 1, wherein identifying the one or more input nodes comprises:
analyzing a configuration of the first node, wherein the configuration includes at least a structure of the integration flow of the first node; and
identifying one or more nodes preceding the first node within the integration flow of the first node.

### Claim 3 (depends on 2)

The method of claim 2, wherein identifying the one or more nodes preceding the first node comprises:
determining that there is a first one or more nodes on a same first execution branch as the first node;
selecting the first one or more nodes as nodes that precede the first node;
determining whether the first one or more nodes have a first parent node; and
in response to determining that the first one or more nodes have a first parent node, selecting the first parent node and any first corresponding nodes as nodes that precede the first node, wherein the first corresponding nodes are one or more nodes on a same parent execution branch as the first parent node.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
determining that the first parent node has a second parent node; and
selecting the second parent node and any second corresponding nodes as nodes that precede the first node, wherein the second corresponding nodes are on a same second parent execution branch as the second parent node.

### Claim 5 (depends on 1)

The method of claim 1, wherein determining whether the mapping contains one or more inputs from the one or more input nodes comprises:
determining an input array for the first node from the mapping;
identifying a first input from the one or more inputs; and
determining whether the first input is included in the input array.

### Claim 6 (depends on 5)

The method of claim 5, wherein the first input corresponds with an input node of the one or more input nodes that is a first preceding node of the first node.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
in response to determining that the first input is not included in the input array, identifying a second input from the one or more inputs; and
determining whether the second input is included in the input array, wherein the second input corresponds with an input node of the one or more input nodes that is a second preceding node of the first node.

### Claim 8 (depends on 1)

The method of claim 1, wherein identifying valid drop points comprises:
invalidating all drop points that are prior to the input node.

### Claim 9 (depends on 8)

The method of claim 8, wherein the input node is a nearest input node.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
outputting a visual representation of the valid drop points.

### Claim 11 (depends on 1)

The method of claim 1, wherein the first node has been selected for a drag and drop operation.

### Claim 12

A system having one or more computer processors, the system configured to:
identify a first node;
identify one or more input nodes, wherein the one or more input nodes are nodes within an integration flow of the first node;
analyze a mapping of the first node, wherein the analyzing comprises:
determine whether the mapping contains one or more inputs from the one or more input nodes; and
in response to determining that the mapping contains one or more input from an input node of the one or more input nodes, identify valid drop points for the first node using the input node.

### Claim 13 (depends on 12)

The system of claim 12, wherein identifying the one or more input nodes comprises:
analyzing a configuration of the first node, wherein the configuration includes at least a structure of the integration flow of the first node; and
identifying one or more nodes preceding the first node within the integration flow of the first node.

### Claim 14 (depends on 13)

The system of claim 13, wherein identifying the one or more nodes preceding the first node comprises:
determining that there is a first one or more nodes on a same first execution branch as the first node;
selecting the first one or more nodes as nodes that precede the first node;
determining whether the first one or more nodes have a first parent node; and
in response to determining that the first one or more nodes have a first parent node, selecting the first parent node and any first corresponding nodes as nodes that precede the first node, wherein the first corresponding nodes are one or more nodes on a same parent execution branch as the first parent node.

### Claim 15 (depends on 14)

The system of claim 14, further comprising:
determining that the first parent node has a second parent node; and
selecting the second parent node and any second corresponding nodes as nodes that precede the first node, wherein the second corresponding nodes are on a same second parent execution branch as the second parent node.

### Claim 16 (depends on 12)

The system of claim 12, wherein determining whether the mapping contains one or more inputs from the one or more input nodes comprises:
determining an input array for the first node from the mapping;
identifying a first input from the one or more inputs; and
determining whether the first input is included in the input array.

### Claim 17

A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a server to cause the server to perform a method, the method comprising:
identifying a first node;
identifying one or more input nodes, wherein the one or more input nodes are nodes within an integration flow of the first node;
analyzing a mapping of the first node, wherein the analyzing comprises:
determining whether the mapping contains one or more inputs from the one or more input nodes; and
in response to determining that the mapping contains one or more inputs from an input node of the one or more input nodes, identifying valid drop points for the first node using the input node.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein identifying the one or more input nodes comprises:
analyzing a configuration of the first node, wherein the configuration includes at least a structure of the integration flow of the first node; and
identifying one or more nodes preceding the first node within the integration flow of the first node.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein determining whether the mapping contains one or more inputs from the one or more input nodes comprises:
determining an input array for the first node from the mapping;
identifying a first input from the one or more inputs; and
determining whether the first input is included in the input array.

### Claim 20 (depends on 17)

The computer program product of claim 17, wherein identifying valid drop points comprises:
invalidating all drop points that are prior to the input node.
