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

com.hazelcast.hibernate.shaded.caffeine.cache.FS Maven / Gradle / Ivy

There is a newer version: 5.2.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.hazelcast.hibernate.shaded.caffeine.cache;

import com.hazelcast.hibernate.shaded.caffeine.cache.References.LookupKeyReference;
import com.hazelcast.hibernate.shaded.caffeine.cache.References.WeakKeyReference;
import java.lang.ref.Reference;
import java.lang.ref.ReferenceQueue;
import java.util.Objects;

/**
 * WARNING: GENERATED CODE
 *
 * 

A cache entry that provides the following features: * *

    *
  • WeakKeys *
  • StrongValues *
* * @author [email protected] (Ben Manes) */ @SuppressWarnings({"unchecked", "PMD.UnusedFormalParameter", "MissingOverride", "NullAway"}) class FS extends Node implements NodeFactory { protected static final long KEY_OFFSET = UnsafeAccess.objectFieldOffset( FS.class, com.github.benmanes.caffeine.cache.LocalCacheFactory.KEY); protected static final long VALUE_OFFSET = UnsafeAccess.objectFieldOffset( FS.class, com.github.benmanes.caffeine.cache.LocalCacheFactory.VALUE); volatile WeakKeyReference key; volatile V value; FS() {} FS( K key, ReferenceQueue keyReferenceQueue, V value, ReferenceQueue valueReferenceQueue, int weight, long now) { this(new WeakKeyReference(key, keyReferenceQueue), value, valueReferenceQueue, weight, now); } FS(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 ((Reference) UnsafeAccess.UNSAFE.getObject(this, KEY_OFFSET)).get(); } 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 FS<>(key, keyReferenceQueue, value, valueReferenceQueue, weight, now); } public Node newNode( Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) { return new FS<>(keyReference, value, valueReferenceQueue, weight, now); } public Object newLookupKey(Object key) { return new LookupKeyReference<>(key); } public Object newReferenceKey(K key, ReferenceQueue referenceQueue) { return new WeakKeyReference(key, referenceQueue); } public final boolean isAlive() { Object key = getKeyReference(); return (key != RETIRED_WEAK_KEY) && (key != DEAD_WEAK_KEY); } public final boolean isRetired() { return (getKeyReference() == RETIRED_WEAK_KEY); } public final void retire() { UnsafeAccess.UNSAFE.putObject(this, KEY_OFFSET, RETIRED_WEAK_KEY); } public final boolean isDead() { return (getKeyReference() == DEAD_WEAK_KEY); } public final void die() { UnsafeAccess.UNSAFE.putObject(this, VALUE_OFFSET, null); UnsafeAccess.UNSAFE.putObject(this, KEY_OFFSET, DEAD_WEAK_KEY); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy