Files
adif-api-reverse-engineering/apk_decompiled/sources/dagger/internal/MapFactory.java

73 lines
2.6 KiB
Java

package dagger.internal;
import dagger.internal.AbstractMapFactory;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.Map;
/* loaded from: classes3.dex */
public final class MapFactory<K, V> extends AbstractMapFactory<K, V, V> {
private static final Provider<Map<Object, Object>> EMPTY = InstanceFactory.create(Collections.EMPTY_MAP);
/* loaded from: classes3.dex */
public static final class Builder<K, V> extends AbstractMapFactory.Builder<K, V, V> {
public MapFactory<K, V> build() {
return new MapFactory<>(this.map);
}
/* JADX WARN: Multi-variable type inference failed */
@Override // dagger.internal.AbstractMapFactory.Builder
public /* bridge */ /* synthetic */ AbstractMapFactory.Builder put(Object obj, Provider provider) {
return put((Builder<K, V>) obj, provider);
}
private Builder(int i) {
super(i);
}
@Override // dagger.internal.AbstractMapFactory.Builder
public Builder<K, V> put(K k4, Provider<V> provider) {
super.put((Builder<K, V>) k4, (Provider) provider);
return this;
}
/* JADX WARN: Multi-variable type inference failed */
@Override // dagger.internal.AbstractMapFactory.Builder
public Builder<K, V> putAll(Provider<Map<K, V>> provider) {
super.putAll((Provider) provider);
return this;
}
@Deprecated
public Builder<K, V> put(K k4, javax.inject.Provider<V> provider) {
return put((Builder<K, V>) k4, (Provider) Providers.asDaggerProvider(provider));
}
@Deprecated
public Builder<K, V> putAll(javax.inject.Provider<Map<K, V>> provider) {
return putAll((Provider) Providers.asDaggerProvider(provider));
}
}
public static <K, V> Builder<K, V> builder(int i) {
return new Builder<>(i);
}
public static <K, V> Provider<Map<K, V>> emptyMapProvider() {
return (Provider<Map<K, V>>) EMPTY;
}
private MapFactory(Map<K, Provider<V>> map) {
super(map);
}
@Override // javax.inject.Provider
public Map<K, V> get() {
LinkedHashMap newLinkedHashMapWithExpectedSize = DaggerCollections.newLinkedHashMapWithExpectedSize(contributingMap().size());
for (Map.Entry<K, Provider<V>> entry : contributingMap().entrySet()) {
newLinkedHashMapWithExpectedSize.put(entry.getKey(), entry.getValue().get());
}
return Collections.unmodifiableMap(newLinkedHashMapWithExpectedSize);
}
}