Hi. How to implement properly `equals` and `hashco...

# announcements

[iex]

Hi. How to implement properly equals and hashcode for a data class that contains a ByteArray?

[Shawn]

IntelliJ will generate one for you if you tell it to through the intentions menu, but for the specialized arrays you should just be able to use .contentEquals() and .contentHashCode() for equals and hashcode, respectively

[Shawn]

though I wonder, if the solution is that easy/literally able to be generated by the IDE, why isn’t that just part of the standard data class codegen rules? Maybe there are cases where you wouldn’t want that and we’re given the option to just suppress the inspection if that’s the case? Couldn’t begin to speculate what kind of scenarios that’d be useful in though

[alex]

it depends, if you need reference equality, then it's one thing, if deep equality, then you have to do your own logic.

[Dico]

But you don't have to do your own logic for deep equality when you nest other data classes

[alex]

Kotlin doesn't do deep equals for arrays

[alex]

it uses reference equality

[iex]

thanks! And what's an efficient way to do deep equals for byte arrays? Probably an index based for loop comparing the bytes?

[Dico]

Call array.contentEquals(otherArray) @iex

[iex]

thanks @Dico