Back
unique ID generation
Hello, I have a question, person 1 and 2 has uids.
I want to generate a third uid from the first two ids. This new ID should always be the same for only these two id combo and not any other combo.
Any ideas?
TL;DR
The user is looking for a way to generate a unique ID from two existing IDs, where the order of the IDs does not matter. They suggest using XOR or a hashing algorithm. One person suggests concatenating the IDs with a separator in between. The user thanks them but mentions that they want the third ID to be order independent. Another person suggests doing an XOR on both values. The user seems happy with this suggestion.
TypeScript
thirdUid = firstUid + '|' + secondUid;
π
Or doing an XOR on both values
Thankyou @Steven.... But I require the third uid to be order independent from the first two
First+sec , sec+first should yeild the same unique result
Xor should work then
What is xor?
Exclusive or.
You can probably search online for stuff like this. You're looking for a hashing algorithm where order doesn't matter
I can do that with two, appwrite unique.IDs ?
Yes
