keycloakjar.com.github.benmanes.caffeine.cache.PS 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;
import java.util.Objects;
/**
* WARNING: GENERATED CODE
*
* A cache entry that provides the following features:
*
*
* - StrongKeys
*
- StrongValues
*
*
* @author [email protected] (Ben Manes)
*/
@SuppressWarnings({"unchecked", "PMD.UnusedFormalParameter", "MissingOverride", "NullAway"})
class PS extends Node implements NodeFactory {
protected static final long KEY_OFFSET =
UnsafeAccess.objectFieldOffset(
PS.class, com.github.benmanes.caffeine.cache.LocalCacheFactory.KEY);
protected static final long VALUE_OFFSET =
UnsafeAccess.objectFieldOffset(
PS.class, com.github.benmanes.caffeine.cache.LocalCacheFactory.VALUE);
volatile K key;
volatile V value;
PS() {}
PS(
K key,
ReferenceQueue keyReferenceQueue,
V value,
ReferenceQueue valueReferenceQueue,
int weight,
long now) {
this(key, value, valueReferenceQueue, weight, now);
}
PS(Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) {
UnsafeAccess.UNSAFE.putObject(this, KEY_OFFSET, keyReference);
UnsafeAccess.UNSAFE.putObject(this, VALUE_OFFSET, value);
}
public final K getKey() {
return (K) UnsafeAccess.UNSAFE.getObject(this, KEY_OFFSET);
}
public final Object getKeyReference() {
return UnsafeAccess.UNSAFE.getObject(this, KEY_OFFSET);
}
public final V getValue() {
return value;
}
public final Object getValueReference() {
return UnsafeAccess.UNSAFE.getObject(this, VALUE_OFFSET);
}
public final void setValue(V value, ReferenceQueue referenceQueue) {
UnsafeAccess.UNSAFE.putObject(this, VALUE_OFFSET, value);
}
public final boolean containsValue(Object value) {
return Objects.equals(value, getValue());
}
public Node newNode(
K key,
ReferenceQueue keyReferenceQueue,
V value,
ReferenceQueue valueReferenceQueue,
int weight,
long now) {
return new PS<>(key, keyReferenceQueue, value, valueReferenceQueue, weight, now);
}
public Node newNode(
Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) {
return new PS<>(keyReference, value, valueReferenceQueue, weight, now);
}
public final boolean isAlive() {
Object key = getKeyReference();
return (key != RETIRED_STRONG_KEY) && (key != DEAD_STRONG_KEY);
}
public final boolean isRetired() {
return (getKeyReference() == RETIRED_STRONG_KEY);
}
public final void retire() {
UnsafeAccess.UNSAFE.putObject(this, KEY_OFFSET, RETIRED_STRONG_KEY);
}
public final boolean isDead() {
return (getKeyReference() == DEAD_STRONG_KEY);
}
public final void die() {
UnsafeAccess.UNSAFE.putObject(this, VALUE_OFFSET, null);
UnsafeAccess.UNSAFE.putObject(this, KEY_OFFSET, DEAD_STRONG_KEY);
}
}