LAE

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: Azad Thalor

Hi Team,

Please suggest if coding in Hash split node possible.

If Possible, kindly upload any example graph.

Thanks and regards,
Azad Thalor

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: rpigneri

Hello, Azad,

Could you describe in a little more detail what you would like to accomplish? That way, we can provide an answer that gets you where you need to go faster.

Thank you,

Rocco

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: Azad Thalor

Hi Rocco / Team,

When I am using Hash split node, order of rows changes in output. For example, row at top most in input does not remain at top most in output. Is it possible that order of rows remain same from top to bottom?

Thanks and regards,
Azad Thalor

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: stonysmith

How many output pins do you have on the node?

It MUST be a prime number... 2,3,5,7,11,13,17,19,23 .. etc.

The only other reason the records will change from one pin to another is if the number of input records changed.

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: ejones

Hi Azad,

I'm still not sure what you are asking. But an example of how it works might be helpful.

In the attached graph the hashsplit is being done on the type field of the Static Data node. You can see that the records seem to each go to a random output pin. The output pin they go to is calculated from the value you split it on. The formula used for this calculation will always be consistent in taking the data to the values to the pin. It will likely spread the data out more or less equally among all the pins and it will generally do better at this if the number of pins is a prime number.

This is different from what the "Deal Out the Records" node is doing. It deals the input records to the output pins in the same way a card dealer deals out the cards to the players in a game of poker.
Attachments:
hashsplit_example.brg