Help with Java function

[Former Member]

Hi all,

I am suppose to write a java function for the following source and target structure:

<u>Source Structure</u>

Root A (0..unbounded)

|_ A

Root B (0..unbounded)

|_ B

Root C (0..unbounded)

|_ C

<u>Target Structure</u>

Root_target (0..unbounded)

|_ T

Based upon every occurrence of A, B and C, i have to first compare their values and for every unique value i have to create a separate instance of 'T'

i.e. if all the three A, B and C are different the output should be:

Root_target (0..unbounded)

|_ T (for A)

Root_target (0..unbounded)

|_ T (for B)

Root_target (0..unbounded)

|_ T (for C)

I am writing a java function in the graphical mapping for it, but i am stuck with the code to create target segments dynamically.

Any help in this regards is appreciated.

Regards,

Varun

[Former Member]

Done

[former_member214364]

Hi,

i am not clear with your requirement.Could you please send me the source and target structures.

i have small doubt in your question i.e

if A Root A occurs 3 times, even B and C nodes will occur 3 times or is there no such contrains?

please let's know as soon as possible.

Cheers,

Jag

[Former Member]

Hi Varun,

I understood unique values form A,B,C need to map to T.

In this case change the context of all these A,B,C to their respective parent node.

write a user define function to accept these 3 queues , write a java logic to fiund uniqueness among all the records, add the resulkt to Resultset , which is output map to T.

Thanks,

venu.

[Former Member]

Thanks for guiding me Venu,

but am looking for that small piece of code that would generate the dynamic T segments.

Regards,

Varun