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

Show more of this group Show more artifacts with this name
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:
 *
 * 

 *   ExpireWrite
 *   
WeakKeys (inherited)
 *   
SoftValues (inherited)
 * 
 *
 * @author [email protected] (Ben Manes)
 */
@SuppressWarnings({"unchecked", "PMD.UnusedFormalParameter", "MissingOverride", "NullAway"})
class FDW extends FD {
  protected static final long WRITE_TIME_OFFSET =
      UnsafeAccess.objectFieldOffset(
          FDW.class, com.github.benmanes.caffeine.cache.LocalCacheFactory.WRITE_TIME);

  volatile long writeTime;

  Node previousInWriteOrder;

  Node nextInWriteOrder;

  FDW() {}

  FDW(
      K key,
      ReferenceQueue keyReferenceQueue,
      V value,
      ReferenceQueue valueReferenceQueue,
      int weight,
      long now) {
    super(key, keyReferenceQueue, value, valueReferenceQueue, weight, now);
    UnsafeAccess.UNSAFE.putLong(this, WRITE_TIME_OFFSET, now);
  }

  FDW(Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) {
    super(keyReference, value, valueReferenceQueue, weight, now);
    UnsafeAccess.UNSAFE.putLong(this, WRITE_TIME_OFFSET, now);
  }

  public Node getPreviousInVariableOrder() {
    return previousInWriteOrder;
  }

  public void setPreviousInVariableOrder(Node previousInWriteOrder) {
    this.previousInWriteOrder = previousInWriteOrder;
  }

  public Node getNextInVariableOrder() {
    return nextInWriteOrder;
  }

  public void setNextInVariableOrder(Node nextInWriteOrder) {
    this.nextInWriteOrder = nextInWriteOrder;
  }

  public long getVariableTime() {
    return UnsafeAccess.UNSAFE.getLong(this, WRITE_TIME_OFFSET);
  }

  public void setVariableTime(long writeTime) {
    UnsafeAccess.UNSAFE.putLong(this, WRITE_TIME_OFFSET, writeTime);
  }

  public boolean casVariableTime(long expect, long update) {
    return (writeTime == expect)
        && UnsafeAccess.UNSAFE.compareAndSwapLong(this, WRITE_TIME_OFFSET, expect, update);
  }

  public final long getWriteTime() {
    return UnsafeAccess.UNSAFE.getLong(this, WRITE_TIME_OFFSET);
  }

  public final void setWriteTime(long writeTime) {
    UnsafeAccess.UNSAFE.putLong(this, WRITE_TIME_OFFSET, writeTime);
  }

  public final Node getPreviousInWriteOrder() {
    return previousInWriteOrder;
  }

  public final void setPreviousInWriteOrder(Node previousInWriteOrder) {
    this.previousInWriteOrder = previousInWriteOrder;
  }

  public final Node getNextInWriteOrder() {
    return nextInWriteOrder;
  }

  public final void setNextInWriteOrder(Node nextInWriteOrder) {
    this.nextInWriteOrder = nextInWriteOrder;
  }

  public Node newNode(
      K key,
      ReferenceQueue keyReferenceQueue,
      V value,
      ReferenceQueue valueReferenceQueue,
      int weight,
      long now) {
    return new FDW<>(key, keyReferenceQueue, value, valueReferenceQueue, weight, now);
  }

  public Node newNode(
      Object keyReference, V value, ReferenceQueue valueReferenceQueue, int weight, long now) {
    return new FDW<>(keyReference, value, valueReferenceQueue, weight, now);
  }
}