net.automatalib.commons.smartcollections.IntrusiveLinkedList Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of automata-commons-smartcollections Show documentation
Show all versions of automata-commons-smartcollections Show documentation
This artifact provides efficient implementations for various collection data structures
(esp. linked lists and priority queues), which have very insufficient implementation in
the Java Collections Framework that makes it hard or even impossible to exploit their
efficiencies.
/* Copyright (C) 2013-2018 TU Dortmund
* This file is part of AutomataLib, http://www.automatalib.net/.
*
* 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 net.automatalib.commons.smartcollections;
/**
* An intrusive version of a linked list. When using this linked list implementation, the elements themselve have to
* store the reference to their successors and predecessors, i.e., must implement the {@link LinkedListEntry}
* interface.
*
* Note that this furthermore implies that each such element can only be stored in at most one {@link
* IntrusiveLinkedList}.
*
* @param
* element class, must implement {@link LinkedListEntry}.
*
* @author Malte Isberner
*/
public class IntrusiveLinkedList> extends AbstractLinkedList {
@Override
protected T makeEntry(T element) {
return element;
}
}