| 限定符和类型 | 接口和说明 |
|---|---|
interface |
Factory<I,O> |
interface |
Provider<I,O> |
| 限定符和类型 | 类和说明 |
|---|---|
class |
ThreadLocalFactory<I,E> |
| 限定符和类型 | 接口和说明 |
|---|---|
interface |
ProxyFactory<I,O> |
| 限定符和类型 | 类和说明 |
|---|---|
class |
SimpleProxyFactory |
| 限定符和类型 | 接口和说明 |
|---|---|
interface |
MethodInterceptorChainProvider |
| 限定符和类型 | 类和说明 |
|---|---|
class |
AopProxyFactory |
| 限定符和类型 | 接口和说明 |
|---|---|
interface |
TargetDelegateProvider |
| 限定符和类型 | 方法和说明 |
|---|---|
static <E> E[] |
Arrs.createArray(Class<E> componentType,
int length,
Supplier<Integer,E> initSupplier)
Create an array with the specified length and every element's value is supplied by the specified initSupplier
|
static <K,V> NonAbsentHashMap<K,V> |
Collects.emptyNonAbsentHashMap(Supplier<K,V> supplier) |
V |
WrappedNonAbsentMap.get(Object key,
Supplier<K,V> supplier) |
V |
NonAbsentHashMap.get(Object key,
Supplier<K,V> supplier) |
static <E> void |
Arrs.initArray(E[] array,
Supplier<Integer,E> initSupplier) |
static <K,V> WrappedNonAbsentMap<K,V> |
WrappedNonAbsentMap.wrap(Map<K,V> map,
Supplier<K,V> supplier) |
static <K,V> WrappedNonAbsentMap<K,V> |
Collects.wrapAsNonAbsentMap(Map<K,V> map,
Supplier<K,V> supplier) |
| 构造器和说明 |
|---|
NonAbsentHashMap(int initialCapacity,
float loadFactor,
Supplier<K,V> supplier) |
NonAbsentHashMap(int initialCapacity,
Supplier<K,V> supplier) |
NonAbsentHashMap(Map<? extends K,? extends V> m,
Supplier<K,V> supplier) |
NonAbsentHashMap(Supplier<K,V> supplier) |
WrappedNonAbsentMap(Map<K,V> map,
Supplier<K,V> supplier) |
| 限定符和类型 | 类和说明 |
|---|---|
class |
CommonThreadFactory |
| 限定符和类型 | 方法和说明 |
|---|---|
static <K,V> Supplier<K,List<V>> |
Functions.emptyArrayListSupplier()
Supplier
|
static <I,E> Supplier<I,HashSet<E>> |
Functions.emptyHashSetSupplier() |
static <I,E> Supplier<I,LinkedHashSet<E>> |
Functions.emptyLinkedHashSetSupplier() |
static <K,V> Supplier<K,List<V>> |
Functions.emptyLinkedListSupplier() |
static <I,V> Supplier<I,Set<V>> |
Functions.emptyTreeSetSupplier(Comparator<V> comparator) |
Copyright © 2019. All rights reserved.