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

com.facebook.presto.jdbc.internal.guava.cache.ReferenceEntry Maven / Gradle / Ivy

There is a newer version: 0.289
Show newest version
/*
 * Copyright (C) 2009 The Guava Authors
 *
 * 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.facebook.presto.jdbc.internal.guava.cache;

import com.facebook.presto.jdbc.internal.guava.annotations.GwtIncompatible;
import com.facebook.presto.jdbc.internal.guava.cache.LocalCache.ValueReference;
import org.checkerframework.checker.nullness.qual.Nullable;

/**
 * An entry in a reference map.
 *
 * 

Entries in the map can be in the following states: * *

Valid: * *

    *
  • Live: valid key/value are set *
  • Loading: loading is pending *
* *

Invalid: * *

    *
  • Expired: time expired (key/value may still be set) *
  • Collected: key/value was partially collected, but not yet cleaned up *
  • Unset: marked as unset, awaiting cleanup or reuse *
*/ @GwtIncompatible interface ReferenceEntry { /** Returns the value reference from this entry. */ ValueReference getValueReference(); /** Sets the value reference for this entry. */ void setValueReference(ValueReference valueReference); /** Returns the next entry in the chain. */ @Nullable ReferenceEntry getNext(); /** Returns the entry's hash. */ int getHash(); /** Returns the key for this entry. */ @Nullable K getKey(); /* * Used by entries that use access order. Access entries are maintained in a doubly-linked list. * New entries are added at the tail of the list at write time; stale entries are expired from * the head of the list. */ /** Returns the time that this entry was last accessed, in ns. */ long getAccessTime(); /** Sets the entry access time in ns. */ void setAccessTime(long time); /** Returns the next entry in the access queue. */ ReferenceEntry getNextInAccessQueue(); /** Sets the next entry in the access queue. */ void setNextInAccessQueue(ReferenceEntry next); /** Returns the previous entry in the access queue. */ ReferenceEntry getPreviousInAccessQueue(); /** Sets the previous entry in the access queue. */ void setPreviousInAccessQueue(ReferenceEntry previous); /* * Implemented by entries that use write order. Write entries are maintained in a doubly-linked * list. New entries are added at the tail of the list at write time and stale entries are * expired from the head of the list. */ /** Returns the time that this entry was last written, in ns. */ long getWriteTime(); /** Sets the entry write time in ns. */ void setWriteTime(long time); /** Returns the next entry in the write queue. */ ReferenceEntry getNextInWriteQueue(); /** Sets the next entry in the write queue. */ void setNextInWriteQueue(ReferenceEntry next); /** Returns the previous entry in the write queue. */ ReferenceEntry getPreviousInWriteQueue(); /** Sets the previous entry in the write queue. */ void setPreviousInWriteQueue(ReferenceEntry previous); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy