Learn about Redwood and be one of the first to join the conversation

Visit Redwood Community
Groovy Code to Determine Valid Intersections — Cloud Customer Connect
You're almost there! Please answer a few more questions for access to the Applications content. Complete registration
Interested in joining? Complete your registration by providing Areas of Interest here. Register

Groovy Code to Determine Valid Intersections

Accepted answer
41
Views
9
Comments

Summary:

We have a valid intersection to define the business unit for each department (every department belongs to only one BU). To make business rules more efficient, we want to determine those relationships, so data grids can focus on the BU for the specific department being calculated.

Content (required):

Currently, we use a separate grid to pull departments for all BUs and use the method isValidIntersection() to create a map. But this grid must be run department by department (to prevent cell limit error) and takes considerable time for upper-level department nodes. Ideally, we would be able to access the VI directly to make the map. Has anyone come up with a clever solution for this?

Howdy, Stranger!

Log In

To view full details, sign in.

Register

Don't have an account? Click here to get started!