com.helger.graph.impl.DirectedGraphNodeFast Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of ph-graph Show documentation
Show all versions of ph-graph Show documentation
Java library with basic graph implementations
The newest version!
/*
* Copyright (C) 2014-2024 Philip Helger (www.helger.com)
* philip[at]helger[dot]com
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.helger.graph.impl;
import javax.annotation.Nullable;
import javax.annotation.concurrent.NotThreadSafe;
import com.helger.commons.hashcode.HashCodeGenerator;
import com.helger.commons.hashcode.IHashCodeGenerator;
/**
* Implementation of {@link com.helger.graph.IMutableDirectedGraphNode}
* interface with quick and dirty equals and hashCode (on ID only)
*
* @author Philip Helger
*/
@NotThreadSafe
public class DirectedGraphNodeFast extends DirectedGraphNode
{
// Status vars
private int m_nHashCode = IHashCodeGenerator.ILLEGAL_HASHCODE;
public DirectedGraphNodeFast ()
{
super ();
}
public DirectedGraphNodeFast (@Nullable final String sID)
{
super (sID);
}
@Override
public boolean equals (final Object o)
{
if (o == this)
return true;
if (o == null || !getClass ().equals (o.getClass ()))
return false;
final DirectedGraphNodeFast rhs = (DirectedGraphNodeFast) o;
return getID ().equals (rhs.getID ());
}
@Override
public int hashCode ()
{
int ret = m_nHashCode;
if (ret == IHashCodeGenerator.ILLEGAL_HASHCODE)
ret = m_nHashCode = new HashCodeGenerator (this).append (getID ()).getHashCode ();
return ret;
}
}