mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-06 00:54:32 +08:00
style: enable OverrideBothEqualsAndHashcode
like checks (#5159)
This commit is contained in:
@ -25,7 +25,6 @@ com.thealgorithms.datastructures.queues.PriorityQueue=UselessParentheses
|
|||||||
com.thealgorithms.datastructures.stacks.NodeStack=UnnecessaryFullyQualifiedName,UnusedFormalParameter
|
com.thealgorithms.datastructures.stacks.NodeStack=UnnecessaryFullyQualifiedName,UnusedFormalParameter
|
||||||
com.thealgorithms.datastructures.stacks.StackArray=UselessParentheses
|
com.thealgorithms.datastructures.stacks.StackArray=UselessParentheses
|
||||||
com.thealgorithms.datastructures.trees.CheckBinaryTreeIsValidBST=UselessParentheses
|
com.thealgorithms.datastructures.trees.CheckBinaryTreeIsValidBST=UselessParentheses
|
||||||
com.thealgorithms.datastructures.trees.Point=OverrideBothEqualsAndHashcode
|
|
||||||
com.thealgorithms.datastructures.trees.SegmentTree=UselessParentheses
|
com.thealgorithms.datastructures.trees.SegmentTree=UselessParentheses
|
||||||
com.thealgorithms.devutils.nodes.LargeTreeNode=UselessParentheses
|
com.thealgorithms.devutils.nodes.LargeTreeNode=UselessParentheses
|
||||||
com.thealgorithms.devutils.nodes.SimpleNode=UselessParentheses
|
com.thealgorithms.devutils.nodes.SimpleNode=UselessParentheses
|
||||||
|
@ -80,9 +80,6 @@
|
|||||||
<Match>
|
<Match>
|
||||||
<Bug pattern="SS_SHOULD_BE_STATIC" />
|
<Bug pattern="SS_SHOULD_BE_STATIC" />
|
||||||
</Match>
|
</Match>
|
||||||
<Match>
|
|
||||||
<Bug pattern="HE_EQUALS_USE_HASHCODE" />
|
|
||||||
</Match>
|
|
||||||
<Match>
|
<Match>
|
||||||
<Bug pattern="IT_NO_SUCH_ELEMENT" />
|
<Bug pattern="IT_NO_SUCH_ELEMENT" />
|
||||||
</Match>
|
</Match>
|
||||||
|
Reference in New Issue
Block a user