gpt4 book ai didi

org.apache.lucene.util.WeakIdentityMap.()方法的使用及代码示例

转载 作者:知者 更新时间:2024-03-22 06:39:05 27 4
gpt4 key购买 nike

本文整理了Java中org.apache.lucene.util.WeakIdentityMap.<init>()方法的一些代码示例,展示了WeakIdentityMap.<init>()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。WeakIdentityMap.<init>()方法的具体详情如下:
包路径:org.apache.lucene.util.WeakIdentityMap
类名称:WeakIdentityMap
方法名:<init>

WeakIdentityMap.<init>介绍

[英]Private only constructor, to create use the static factory methods.
[中]专用构造函数,使用静态工厂方法创建。

代码示例

代码示例来源:origin: org.apache.lucene/lucene-core

/**
 * Creates a new {@code WeakIdentityMap} based on a {@link ConcurrentHashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newConcurrentHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new ConcurrentHashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: org.apache.lucene/lucene-core

/**
 * Creates a new {@code WeakIdentityMap} based on a non-synchronized {@link HashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new HashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

/**
 * Creates a new {@code WeakIdentityMap} based on a {@link ConcurrentHashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newConcurrentHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new ConcurrentHashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: org.infinispan/infinispan-embedded-query

/**
 * Creates a new {@code WeakIdentityMap} based on a non-synchronized {@link HashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new HashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: gncloud/fastcatsearch

/** Creates a new {@code WeakIdentityMap} based on a {@link ConcurrentHashMap}. */
public static final <K,V> WeakIdentityMap<K,V> newConcurrentHashMap() {
 return new WeakIdentityMap<K,V>(new ConcurrentHashMap<IdentityWeakReference,V>());
}

代码示例来源:origin: harbby/presto-connectors

/**
 * Creates a new {@code WeakIdentityMap} based on a non-synchronized {@link HashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new HashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: org.infinispan/infinispan-embedded-query

/**
 * Creates a new {@code WeakIdentityMap} based on a {@link ConcurrentHashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newConcurrentHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new ConcurrentHashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

/**
 * Creates a new {@code WeakIdentityMap} based on a non-synchronized {@link HashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new HashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: harbby/presto-connectors

/**
 * Creates a new {@code WeakIdentityMap} based on a {@link ConcurrentHashMap}.
 * @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
 */
public static <K,V> WeakIdentityMap<K,V> newConcurrentHashMap(boolean reapOnRead) {
 return new WeakIdentityMap<>(new ConcurrentHashMap<IdentityWeakReference,V>(), reapOnRead);
}

代码示例来源:origin: gncloud/fastcatsearch

/** Creates a new {@code WeakIdentityMap} based on a non-synchronized {@link HashMap}. */
public static final <K,V> WeakIdentityMap<K,V> newHashMap() {
 return new WeakIdentityMap<K,V>(new HashMap<IdentityWeakReference,V>());
}

27 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com