The problem/use-case that the feature addresses
It would be great if it were possible to work with a hash fields in the same way as with a set.
Description of the feature
hdiff key [key ...]
key — key of the hash.
hdiff — Returns the fields and values of the hash resulting from the difference between the first fields of the hash and all the successive fields of hashes.
hdiffstore destination key [key ...]
key — key of the hash.
destination — key where the resulting hash will be stored.
hdiffstore — This command is equal to hdiff, but instead of returning the resulting hash, it is stored in destination. If destination already exists, it is overwritten.
Additional information
sdiff key [key ...]
sdiff — Returns the members of the set resulting from the difference between the first set and all the successive sets.
sdiffstore destination key [key ...]
sdiffstore — This command is equal to sdiff, but instead of returning the resulting set, it is stored in destination. If destination already exists, it is overwritten.
I would also like to add hunion, hunionstore, but I'm not yet ready to precisely define their behavior when the same fields already exist in two hashes. For this reason, a separate issue will be created when there is understanding.
Comment From: zuiderkwast
It looks like a logical addition. It can also be compared to ZDIFF and ZDIFFSTORE.
May I ask what specific use case you have for these commands?
Comment From: SGmuwa
When I wrote the use-case, it turned out that even if this redis command existed, I still would not be able to solve my goal. I will open the issue again if I understand that this is not so.