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

keycloakjar.com.github.benmanes.caffeine.cache.FSA Maven / Gradle / Ivy

There is a newer version: 7.22.0
Show 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: * *

    *
  • ExpireAccess *
  • WeakKeys (inherited) *
  • StrongValues (inherited) *
* * @author [email protected] (Ben Manes) */ @SuppressWarnings({"unchecked", "PMD.UnusedFormalParameter", "MissingOverride", "NullAway"}) class FSA extends FS { protected static final long ACCESS_TIME_OFFSET = UnsafeAccess.objectFieldOffset( FSA.class, com.github.benmanes.caffeine.cache.LocalCacheFactory.ACCESS_TIME); volatile long accessTime; Node previousInAccessOrder; Node nextInAccessOrder; FSA() {} FSA( K key, ReferenceQueue keyReferenceQueue, V value, ReferenceQueue valueReferenceQueue, int weight, long now) { super(key, keyReferenceQueue, value, valueReferenceQueue, weight, now); UnsafeAccess.UNSAFE.putLong(this, ACCESS_TIME_OFFSET, now); } FSA(Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) { super(keyReference, value, valueReferenceQueue, weight, now); UnsafeAccess.UNSAFE.putLong(this, ACCESS_TIME_OFFSET, now); } public Node getPreviousInVariableOrder() { return previousInAccessOrder; } public void setPreviousInVariableOrder(Node previousInAccessOrder) { this.previousInAccessOrder = previousInAccessOrder; } public Node getNextInVariableOrder() { return nextInAccessOrder; } public void setNextInVariableOrder(Node nextInAccessOrder) { this.nextInAccessOrder = nextInAccessOrder; } public long getVariableTime() { return UnsafeAccess.UNSAFE.getLong(this, ACCESS_TIME_OFFSET); } public void setVariableTime(long accessTime) { UnsafeAccess.UNSAFE.putLong(this, ACCESS_TIME_OFFSET, accessTime); } public boolean casVariableTime(long expect, long update) { return (accessTime == expect) && UnsafeAccess.UNSAFE.compareAndSwapLong(this, ACCESS_TIME_OFFSET, expect, update); } public final long getAccessTime() { return UnsafeAccess.UNSAFE.getLong(this, ACCESS_TIME_OFFSET); } public final void setAccessTime(long accessTime) { UnsafeAccess.UNSAFE.putLong(this, ACCESS_TIME_OFFSET, accessTime); } public final Node getPreviousInAccessOrder() { return previousInAccessOrder; } public final void setPreviousInAccessOrder(Node previousInAccessOrder) { this.previousInAccessOrder = previousInAccessOrder; } public final Node getNextInAccessOrder() { return nextInAccessOrder; } public final void setNextInAccessOrder(Node nextInAccessOrder) { this.nextInAccessOrder = nextInAccessOrder; } public Node newNode( K key, ReferenceQueue keyReferenceQueue, V value, ReferenceQueue valueReferenceQueue, int weight, long now) { return new FSA<>(key, keyReferenceQueue, value, valueReferenceQueue, weight, now); } public Node newNode( Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) { return new FSA<>(keyReference, value, valueReferenceQueue, weight, now); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy