Java NullListener.INSTANCE属性代码示例

本文整理汇总了Java中com.google.common.cache.CacheBuilder.NullListener.INSTANCE属性的典型用法代码示例。如果您正苦于以下问题：Java NullListener.INSTANCE属性的具体用法？Java NullListener.INSTANCE怎么用？Java NullListener.INSTANCE使用的例子？那么恭喜您, 这里精选的属性代码示例或许可以为您提供帮助。您也可以进一步了解该属性所在类com.google.common.cache.CacheBuilder.NullListener的用法示例。

在下文中一共展示了NullListener.INSTANCE属性的7个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: LocalCache

/**
 * Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
 */
LocalCache(
    CacheBuilder<? super K, ? super V> builder, @Nullable CacheLoader<? super K, V> loader) {
  concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);

  keyStrength = builder.getKeyStrength();
  valueStrength = builder.getValueStrength();

  keyEquivalence = builder.getKeyEquivalence();
  valueEquivalence = builder.getValueEquivalence();

  maxWeight = builder.getMaximumWeight();
  weigher = builder.getWeigher();
  expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
  expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
  refreshNanos = builder.getRefreshNanos();

  removalListener = builder.getRemovalListener();
  removalNotificationQueue =
      (removalListener == NullListener.INSTANCE)
          ? LocalCache.<RemovalNotification<K, V>>discardingQueue()
          : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();

  ticker = builder.getTicker(recordsTime());
  entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
  globalStatsCounter = builder.getStatsCounterSupplier().get();
  defaultLoader = loader;

  int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
  if (evictsBySize() && !customWeigher()) {
    initialCapacity = Math.min(initialCapacity, (int) maxWeight);
  }

  // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
  // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
  // entries. The special casing for size-based eviction is only necessary because that eviction
  // happens per segment instead of globally, so too many segments compared to the maximum size
  // will result in random eviction behavior.
  int segmentShift = 0;
  int segmentCount = 1;
  while (segmentCount < concurrencyLevel && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
    ++segmentShift;
    segmentCount <<= 1;
  }
  this.segmentShift = 32 - segmentShift;
  segmentMask = segmentCount - 1;

  this.segments = newSegmentArray(segmentCount);

  int segmentCapacity = initialCapacity / segmentCount;
  if (segmentCapacity * segmentCount < initialCapacity) {
    ++segmentCapacity;
  }

  int segmentSize = 1;
  while (segmentSize < segmentCapacity) {
    segmentSize <<= 1;
  }

  if (evictsBySize()) {
    // Ensure sum of segment max weights = overall max weights
    long maxSegmentWeight = maxWeight / segmentCount + 1;
    long remainder = maxWeight % segmentCount;
    for (int i = 0; i < this.segments.length; ++i) {
      if (i == remainder) {
        maxSegmentWeight--;
      }
      this.segments[i] =
          createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
    }
  } else {
    for (int i = 0; i < this.segments.length; ++i) {
      this.segments[i] =
          createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
    }
  }
}

开发者ID:zugzug90，项目名称:guava-mock，代码行数:79，代码来源:LocalCache.java

示例2: LocalCache

/**
 * Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
 */

LocalCache(CacheBuilder<? super K, ? super V> builder, @Nullable CacheLoader<? super K, V> loader) {
  concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);
  keyStrength = builder.getKeyStrength();
  valueStrength = builder.getValueStrength();
  keyEquivalence = builder.getKeyEquivalence();
  valueEquivalence = builder.getValueEquivalence();
  maxWeight = builder.getMaximumWeight();
  weigher = builder.getWeigher();
  expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
  expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
  refreshNanos = builder.getRefreshNanos();
  removalListener = builder.getRemovalListener();
  removalNotificationQueue = (removalListener == NullListener.INSTANCE)
    ? LocalCache.<RemovalNotification<K, V>>discardingQueue()
    : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();
  ticker = builder.getTicker(recordsTime());
  entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
  globalStatsCounter = builder.getStatsCounterSupplier().get();
  defaultLoader = loader;
  int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
  if (evictsBySize() && !customWeigher()) {
    initialCapacity = Math.min(initialCapacity, (int) maxWeight);
  }

  // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
  // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
  // entries. The special casing for size-based eviction is only necessary because that eviction
  // happens per segment instead of globally, so too many segments compared to the maximum size
  // will result in random eviction behavior.

  int segmentShift = 0;
  int segmentCount = 1;
  while (segmentCount < concurrencyLevel
         && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
    ++segmentShift;
    segmentCount <<= 1;
  }
  this.segmentShift = 32 - segmentShift;
  segmentMask = segmentCount - 1;
  this.segments = newSegmentArray(segmentCount);
  int segmentCapacity = initialCapacity / segmentCount;
  if (segmentCapacity * segmentCount < initialCapacity) {
    ++segmentCapacity;
  }

  int segmentSize = 1;
  while (segmentSize < segmentCapacity) {
    segmentSize <<= 1;
  }
  if (evictsBySize()) {
    // Ensure sum of segment max weights = overall max weights
    long maxSegmentWeight = maxWeight / segmentCount + 1;
    long remainder = maxWeight % segmentCount;
    for (int i = 0; i < this.segments.length; ++i) {
      if (i == remainder) {
        maxSegmentWeight--;
      }
      this.segments[i] =
  createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
    }
  } else {
    for (int i = 0; i < this.segments.length; ++i) {
      this.segments[i] =
  createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
    }
  }
}

开发者ID:antlr，项目名称:codebuff，代码行数:71，代码来源:LocalCache.java

示例3: LocalCache

/**
 * Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
 */

LocalCache(CacheBuilder<? super K, ? super V> builder, @Nullable CacheLoader<? super K, V> loader) {
  concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);
  keyStrength = builder.getKeyStrength();
  valueStrength = builder.getValueStrength();
  keyEquivalence = builder.getKeyEquivalence();
  valueEquivalence = builder.getValueEquivalence();
  maxWeight = builder.getMaximumWeight();
  weigher = builder.getWeigher();
  expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
  expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
  refreshNanos = builder.getRefreshNanos();
  removalListener = builder.getRemovalListener();
  removalNotificationQueue = (removalListener == NullListener.INSTANCE)
    ? LocalCache.<RemovalNotification<K, V>>discardingQueue()
    : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();
  ticker = builder.getTicker(recordsTime());
  entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
  globalStatsCounter = builder.getStatsCounterSupplier().get();
  defaultLoader = loader;
  int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
  if (evictsBySize() && !customWeigher()) {
    initialCapacity = Math.min(initialCapacity, (int) maxWeight);
  }

  // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
  // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
  // entries. The special casing for size-based eviction is only necessary because that eviction
  // happens per segment instead of globally, so too many segments compared to the maximum size
  // will result in random eviction behavior.

  int segmentShift = 0;
  int segmentCount = 1;
  while (segmentCount < concurrencyLevel
         && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
    ++segmentShift;
    segmentCount <<= 1;
  }
  this.segmentShift = 32 - segmentShift;
  segmentMask = segmentCount - 1;
  this.segments = newSegmentArray(segmentCount);
  int segmentCapacity = initialCapacity / segmentCount;
  if (segmentCapacity * segmentCount < initialCapacity) {
    ++segmentCapacity;
  }

  int segmentSize = 1;
  while (segmentSize < segmentCapacity) {
    segmentSize <<= 1;
  }
  if (evictsBySize()) {
    // Ensure sum of segment max weights = overall max weights
    long maxSegmentWeight = maxWeight / segmentCount + 1;
    long remainder = maxWeight % segmentCount;
    for (int i = 0; i < this.segments.length; ++i) {
      if (i == remainder) {
        maxSegmentWeight--;
      }
      this.segments[i] =
        createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
    }
  } else {
    for (int i = 0; i < this.segments.length; ++i) {
      this.segments[i] =
  createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
    }
  }
}

开发者ID:antlr，项目名称:codebuff，代码行数:71，代码来源:LocalCache.java

示例4: LocalCache

/**
* Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
*/

     LocalCache(CacheBuilder<? super K, ? super V> builder, @Nullable CacheLoader<? super K, V> loader) {
 concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);
 keyStrength = builder.getKeyStrength();
 valueStrength = builder.getValueStrength();
 keyEquivalence = builder.getKeyEquivalence();
 valueEquivalence = builder.getValueEquivalence();
 maxWeight = builder.getMaximumWeight();
 weigher = builder.getWeigher();
 expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
 expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
 refreshNanos = builder.getRefreshNanos();
 removalListener = builder.getRemovalListener();
 removalNotificationQueue = (removalListener == NullListener.INSTANCE)
                                ? LocalCache.<RemovalNotification<K, V>>discardingQueue()
                                : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();
 ticker = builder.getTicker(recordsTime());
 entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
 globalStatsCounter = builder.getStatsCounterSupplier().get();
 defaultLoader = loader;
 int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
 if (evictsBySize() && !customWeigher()) {
         initialCapacity = Math.min(initialCapacity, (int) maxWeight);
 }

 // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
 // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
 // entries. The special casing for size-based eviction is only necessary because that eviction
 // happens per segment instead of globally, so too many segments compared to the maximum size
 // will result in random eviction behavior.
 int segmentShift = 0;
 int segmentCount = 1;
 while (segmentCount < concurrencyLevel
        && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
         ++segmentShift;
         segmentCount <<= 1;
 }
 this.segmentShift = 32 - segmentShift;
 segmentMask = segmentCount - 1;
 this.segments = newSegmentArray(segmentCount);
 int segmentCapacity = initialCapacity / segmentCount;
 if (segmentCapacity * segmentCount < initialCapacity) {
         ++segmentCapacity;
 }
 int segmentSize = 1;
 while (segmentSize < segmentCapacity) {
         segmentSize <<= 1;
 }
 if (evictsBySize()) {
   // Ensure sum of segment max weights = overall max weights
         long maxSegmentWeight = maxWeight / segmentCount + 1;
         long remainder = maxWeight % segmentCount;
         for (int i = 0; i < this.segments.length; ++i) {
                                                                                                            if (i == remainder) {
             maxSegmentWeight--;
                                                                                                            }
                                                                                                            this.segments[i] = createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
         }
 } else {
   for (int i = 0; i < this.segments.length; ++i) {
     this.segments[i] = createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
   }
 }
     }

开发者ID:antlr，项目名称:codebuff，代码行数:67，代码来源:LocalCache.java

示例5: LocalCache

/**
 * Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
 */
LocalCache(
    CacheBuilder<? super K, ? super V> builder, @Nullable CacheLoader<? super K, V> loader) {
  concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);

  keyStrength = builder.getKeyStrength();
  valueStrength = builder.getValueStrength();

  keyEquivalence = builder.getKeyEquivalence();
  valueEquivalence = builder.getValueEquivalence();

  maxWeight = builder.getMaximumWeight();
  weigher = builder.getWeigher();
  expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
  expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
  refreshNanos = builder.getRefreshNanos();

  removalListener = builder.getRemovalListener();
  removalNotificationQueue = (removalListener == NullListener.INSTANCE)
      ? LocalCache.<RemovalNotification<K, V>>discardingQueue()
      : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();

  ticker = builder.getTicker(recordsTime());
  entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
  globalStatsCounter = builder.getStatsCounterSupplier().get();
  defaultLoader = loader;

  int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
  if (evictsBySize() && !customWeigher()) {
    initialCapacity = Math.min(initialCapacity, (int) maxWeight);
  }

  // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
  // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
  // entries. The special casing for size-based eviction is only necessary because that eviction
  // happens per segment instead of globally, so too many segments compared to the maximum size
  // will result in random eviction behavior.
  int segmentShift = 0;
  int segmentCount = 1;
  while (segmentCount < concurrencyLevel
         && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
    ++segmentShift;
    segmentCount <<= 1;
  }
  this.segmentShift = 32 - segmentShift;
  segmentMask = segmentCount - 1;

  this.segments = newSegmentArray(segmentCount);

  int segmentCapacity = initialCapacity / segmentCount;
  if (segmentCapacity * segmentCount < initialCapacity) {
    ++segmentCapacity;
  }

  int segmentSize = 1;
  while (segmentSize < segmentCapacity) {
    segmentSize <<= 1;
  }

  if (evictsBySize()) {
    // Ensure sum of segment max weights = overall max weights
    long maxSegmentWeight = maxWeight / segmentCount + 1;
    long remainder = maxWeight % segmentCount;
    for (int i = 0; i < this.segments.length; ++i) {
      if (i == remainder) {
        maxSegmentWeight--;
      }
      this.segments[i] =
          createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
    }
  } else {
    for (int i = 0; i < this.segments.length; ++i) {
      this.segments[i] =
          createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
    }
  }
}

开发者ID:cplutte，项目名称:bts，代码行数:79，代码来源:LocalCache.java

示例6: LocalCache

/**
 * Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
 */
LocalCache(
    CacheBuilder<? super K, ? super V> builder, @NullableDecl CacheLoader<? super K, V> loader) {
  concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);

  keyStrength = builder.getKeyStrength();
  valueStrength = builder.getValueStrength();

  keyEquivalence = builder.getKeyEquivalence();
  valueEquivalence = builder.getValueEquivalence();

  maxWeight = builder.getMaximumWeight();
  weigher = builder.getWeigher();
  expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
  expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
  refreshNanos = builder.getRefreshNanos();

  removalListener = builder.getRemovalListener();
  removalNotificationQueue =
      (removalListener == NullListener.INSTANCE)
          ? LocalCache.<RemovalNotification<K, V>>discardingQueue()
          : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();

  ticker = builder.getTicker(recordsTime());
  entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
  globalStatsCounter = builder.getStatsCounterSupplier().get();
  defaultLoader = loader;

  int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
  if (evictsBySize() && !customWeigher()) {
    initialCapacity = Math.min(initialCapacity, (int) maxWeight);
  }

  // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
  // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
  // entries. The special casing for size-based eviction is only necessary because that eviction
  // happens per segment instead of globally, so too many segments compared to the maximum size
  // will result in random eviction behavior.
  int segmentShift = 0;
  int segmentCount = 1;
  while (segmentCount < concurrencyLevel && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
    ++segmentShift;
    segmentCount <<= 1;
  }
  this.segmentShift = 32 - segmentShift;
  segmentMask = segmentCount - 1;

  this.segments = newSegmentArray(segmentCount);

  int segmentCapacity = initialCapacity / segmentCount;
  if (segmentCapacity * segmentCount < initialCapacity) {
    ++segmentCapacity;
  }

  int segmentSize = 1;
  while (segmentSize < segmentCapacity) {
    segmentSize <<= 1;
  }

  if (evictsBySize()) {
    // Ensure sum of segment max weights = overall max weights
    long maxSegmentWeight = maxWeight / segmentCount + 1;
    long remainder = maxWeight % segmentCount;
    for (int i = 0; i < this.segments.length; ++i) {
      if (i == remainder) {
        maxSegmentWeight--;
      }
      this.segments[i] =
          createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
    }
  } else {
    for (int i = 0; i < this.segments.length; ++i) {
      this.segments[i] =
          createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
    }
  }
}

开发者ID:google，项目名称:guava，代码行数:79，代码来源:LocalCache.java

示例7: LocalCache

/**
 * 从builder中获取相应的配置参数。 Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
 */
LocalCache(CacheBuilder<? super K, ? super V> builder, @Nullable CacheLoader<? super K, V> loader) {
    concurrencyLevel = Math.min(builder.getConcurrencyLevel(), MAX_SEGMENTS);

    keyStrength = builder.getKeyStrength();
    valueStrength = builder.getValueStrength();

    keyEquivalence = builder.getKeyEquivalence();
    valueEquivalence = builder.getValueEquivalence();

    maxWeight = builder.getMaximumWeight();
    weigher = builder.getWeigher();
    expireAfterAccessNanos = builder.getExpireAfterAccessNanos();
    expireAfterWriteNanos = builder.getExpireAfterWriteNanos();
    refreshNanos = builder.getRefreshNanos();

    removalListener = builder.getRemovalListener();
    removalNotificationQueue = (removalListener == NullListener.INSTANCE) ? LocalCache
            .<RemovalNotification<K, V>> discardingQueue() : new ConcurrentLinkedQueue<RemovalNotification<K, V>>();

    ticker = builder.getTicker(recordsTime());
    entryFactory = EntryFactory.getFactory(keyStrength, usesAccessEntries(), usesWriteEntries());
    globalStatsCounter = builder.getStatsCounterSupplier().get();
    defaultLoader = loader;

    int initialCapacity = Math.min(builder.getInitialCapacity(), MAXIMUM_CAPACITY);
    if (evictsBySize() && !customWeigher()) {
        initialCapacity = Math.min(initialCapacity, (int) maxWeight);
    }

    // 找到最小2的次数的段数量，
    // Find the lowest power-of-two segmentCount that exceeds concurrencyLevel, unless
    // maximumSize/Weight is specified in which case ensure that each segment gets at least 10
    // entries. The special casing for size-based eviction is only necessary because that eviction
    // happens per segment instead of globally, so too many segments compared to the maximum size
    // will result in random eviction behavior.
    int segmentShift = 0;
    int segmentCount = 1;
    while (segmentCount < concurrencyLevel && (!evictsBySize() || segmentCount * 20 <= maxWeight)) {
        ++segmentShift;
        segmentCount <<= 1;
    }
    this.segmentShift = 32 - segmentShift;
    segmentMask = segmentCount - 1;

    this.segments = newSegmentArray(segmentCount);

    int segmentCapacity = initialCapacity / segmentCount;
    if (segmentCapacity * segmentCount < initialCapacity) {
        ++segmentCapacity;
    }

    int segmentSize = 1;
    while (segmentSize < segmentCapacity) {
        segmentSize <<= 1;
    }

    if (evictsBySize()) {
        // Ensure sum of segment max weights = overall max weights
        long maxSegmentWeight = maxWeight / segmentCount + 1;
        long remainder = maxWeight % segmentCount;
        for (int i = 0; i < this.segments.length; ++i) {
            if (i == remainder) {
                maxSegmentWeight--;
            }
            this.segments[i] = createSegment(segmentSize, maxSegmentWeight, builder.getStatsCounterSupplier().get());
        }
    } else {
        for (int i = 0; i < this.segments.length; ++i) {
            this.segments[i] = createSegment(segmentSize, UNSET_INT, builder.getStatsCounterSupplier().get());
        }
    }
}

开发者ID:ketao1989，项目名称:cnGuava，代码行数:75，代码来源:LocalCache.java

注：本文中的com.google.common.cache.CacheBuilder.NullListener.INSTANCE属性示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。