keycloakjar.com.github.benmanes.caffeine.cache.PDMS Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of camunda-bpm-identity-keycloak-all Show documentation
Show all versions of camunda-bpm-identity-keycloak-all Show documentation
Camunda Keycloak Identity Provider Plugin including all transitive dependencies
The newest version!
// Copyright 2021 Ben Manes. All Rights Reserved.
//
// 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.github.benmanes.caffeine.cache;
import java.lang.ref.ReferenceQueue;
/**
* WARNING: GENERATED CODE
*
* A cache entry that provides the following features:
*
*
* - MaximumSize
*
- StrongKeys (inherited)
*
- SoftValues (inherited)
*
*
* @author [email protected] (Ben Manes)
*/
@SuppressWarnings({"unchecked", "PMD.UnusedFormalParameter", "MissingOverride", "NullAway"})
final class PDMS extends PD {
int queueType;
Node previousInAccessOrder;
Node nextInAccessOrder;
PDMS() {}
PDMS(
K key,
ReferenceQueue keyReferenceQueue,
V value,
ReferenceQueue valueReferenceQueue,
int weight,
long now) {
super(key, keyReferenceQueue, value, valueReferenceQueue, weight, now);
}
PDMS(Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) {
super(keyReference, value, valueReferenceQueue, weight, now);
}
public int getQueueType() {
return queueType;
}
public void setQueueType(int queueType) {
this.queueType = queueType;
}
public Node getPreviousInAccessOrder() {
return previousInAccessOrder;
}
public void setPreviousInAccessOrder(Node previousInAccessOrder) {
this.previousInAccessOrder = previousInAccessOrder;
}
public Node getNextInAccessOrder() {
return nextInAccessOrder;
}
public void setNextInAccessOrder(Node nextInAccessOrder) {
this.nextInAccessOrder = nextInAccessOrder;
}
public Node newNode(
K key,
ReferenceQueue keyReferenceQueue,
V value,
ReferenceQueue valueReferenceQueue,
int weight,
long now) {
return new PDMS<>(key, keyReferenceQueue, value, valueReferenceQueue, weight, now);
}
public Node newNode(
Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) {
return new PDMS<>(keyReference, value, valueReferenceQueue, weight, now);
}
}