/
NikolayIvkin
/
tutorials1
Обзор
Документация
Войти
/
NikolayIvkin
/
tutorials1
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
data-structures/src/main/java/com/baeldung/lrucache/Node.java
71 строка
1 KB
Arash Ariani
BAEL-4464 : how to implement LRU-Cache in java codes added (#11036)
17 июл 2021, 12:41
17 июл 2021, 12:41
17814a1
Код
Авторство
О чём код?
package com.baeldung.lrucache; /** * Created by arash on 09.07.21. */ public class Node<T> implements LinkedListNode<T> { private T value; private DoublyLinkedList<T> list; private LinkedListNode next; private LinkedListNode prev; public Node(T value, LinkedListNode<T> next, DoublyLinkedList<T> list) { this.value = value; this.next = next; this.setPrev(next.getPrev()); this.prev.setNext(this); this.next.setPrev(this); this.list = list; } @Override public boolean hasElement() { return true; } @Override public boolean isEmpty() { return false; } public T getElement() { return value; } public void detach() { this.prev.setNext(this.getNext()); this.next.setPrev(this.getPrev()); } @Override public DoublyLinkedList<T> getListReference() { return this.list; } @Override public LinkedListNode<T> setPrev(LinkedListNode<T> prev) { this.prev = prev; return this; } @Override public LinkedListNode<T> setNext(LinkedListNode<T> next) { this.next = next; return this; } @Override public LinkedListNode<T> getPrev() { return this.prev; } @Override public LinkedListNode<T> getNext() { return this.next; } @Override public LinkedListNode<T> search(T value) { return this.getElement() == value ? this : this.getNext().search(value); } }