| Summary: | Change hashCode() and equals() implementation of Node | ||
|---|---|---|---|
| Product: | [Tools] GEF | Reporter: | Arne Adams <arne.adams> |
| Component: | GEF Graph | Assignee: | gef-inbox <gef-inbox> |
| Status: | RESOLVED WONTFIX | QA Contact: | |
| Severity: | normal | ||
| Priority: | P3 | CC: | nyssen |
| Version: | unspecified | ||
| Target Milestone: | --- | ||
| Hardware: | PC | ||
| OS: | Linux | ||
| Whiteboard: | |||
|
Description
Arne Adams
The equals() implementation would have to be adjusted as well to satisfy your use case. As Node should be unaware of ZestProperties this is not going to work. We would either have to fall back to Object equality (i.e. not overwrite hashCode() and equals() at all), or point out a specific attribute (or a set of attributes) that is used to determine equality. I see your point - I'll use a hashmap from id to node for my use case (In reply to Arne Adams from comment #2) > I see your point - I'll use a hashmap from id to node for my use case OK, resolving this as WONTFIX then. |