All Downloads are FREE. Search and download functionalities are using the official Maven repository.

uk.org.retep.util.collections.set.LinkedHashOrderedSet Maven / Gradle / Ivy

The newest version!
/*
 * 

Copyright (c) 1998-2010, Peter T Mount
* All rights reserved.

* *

Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met:

* *
    *
  • Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer.
  • * *
  • Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution.
  • * *
  • Neither the name of the retep.org.uk nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission.
  • * *
* *

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

*/ package uk.org.retep.util.collections.set; import java.util.HashMap; import java.util.Map; import javax.annotation.concurrent.NotThreadSafe; /** * * @param * @param * @author peter */ @NotThreadSafe public class LinkedHashOrderedSet extends LinkedOrderedSet { private Map> map; public LinkedHashOrderedSet() { map = new HashMap>(); } @Override protected OSEntry findEntryImpl( K key ) { if( key == null ) { return null; } return map.get( key ); } @Override protected void entryInserted( OSEntry entry ) { super.entryInserted( entry ); map.put( entry.getKey(), entry ); } @Override protected void entryRemoved( OSEntry entry ) { super.entryRemoved( entry ); map.remove( entry.getKey() ); } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy