1 /**
2 * This file Copyright (c) 2017-2018 Magnolia International
3 * Ltd. (http://www.magnolia-cms.com). All rights reserved.
4 *
5 *
6 * This file is dual-licensed under both the Magnolia
7 * Network Agreement and the GNU General Public License.
8 * You may elect to use one or the other of these licenses.
9 *
10 * This file is distributed in the hope that it will be
11 * useful, but AS-IS and WITHOUT ANY WARRANTY; without even the
12 * implied warranty of MERCHANTABILITY or FITNESS FOR A
13 * PARTICULAR PURPOSE, TITLE, or NONINFRINGEMENT.
14 * Redistribution, except as permitted by whichever of the GPL
15 * or MNA you select, is prohibited.
16 *
17 * 1. For the GPL license (GPL), you can redistribute and/or
18 * modify this file under the terms of the GNU General
19 * Public License, Version 3, as published by the Free Software
20 * Foundation. You should have received a copy of the GNU
21 * General Public License, Version 3 along with this program;
22 * if not, write to the Free Software Foundation, Inc., 51
23 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
24 *
25 * 2. For the Magnolia Network Agreement (MNA), this file
26 * and the accompanying materials are made available under the
27 * terms of the MNA which accompanies this distribution, and
28 * is available at http://www.magnolia-cms.com/mna.html
29 *
30 * Any modifications to this file must keep this entire header
31 * intact.
32 *
33 */
34 package info.magnolia.ui.framework.ioc;
35
36 import java.util.HashMap;
37 import java.util.Map;
38 import java.util.Optional;
39 import java.util.function.BiConsumer;
40
41 import com.google.inject.Key;
42
43 /**
44 * Key-value storage capable of keeping objects of arbitrary type
45 * mapped to a {@link Key}. Such storages are used to emulate the
46 * the scopes of apps and sub-apps.
47 *
48 * @see SessionStore
49 * @see UiScopes
50 */
51 public final class BeanStore {
52
53 private final Map<Key, Object> storage = new HashMap<>();
54
55 BeanStore() {
56 }
57
58 public void put(Key<?> key, Object bean) {
59 this.storage.put(key, bean);
60 }
61
62 public void put(Class<?> key, Object bean) {
63 this.put(Key.get(key), bean);
64 }
65
66 public <T> T get(Class<? extends T> key) {
67 //noinspection unchecked
68 return (T) this.storage.get(Key.get(key));
69 }
70
71 public <T> T get(Key<? extends T> key) {
72 //noinspection unchecked
73 return (T) this.storage.get(key);
74 }
75
76 public <T> Optional<T> getInstance(Class<? extends T> type) {
77 //noinspection unchecked
78 return this.storage.entrySet().stream()
79 .filter(entry -> type.isInstance(entry.getValue()))
80 .map(entry -> (T) entry.getValue())
81 .findFirst();
82 }
83
84 public <T> T getClosestInstance(Class<? extends T> type) {
85 return getInstance(type).orElse(null);
86 }
87
88 public <T> boolean hasInstanceOf(Class<T> type) {
89 return storage.containsKey(Key.get(type));
90 }
91
92 public void clear() {
93 this.storage.forEach((key, instance) -> {
94 if (instance instanceof Destructible) {
95 ((Destructible) instance).destroy();
96 }
97 });
98 this.storage.clear();
99 }
100
101 public void forEach(BiConsumer<? super Key, ? super Object> handler) {
102 storage.forEach(handler);
103 }
104
105 public boolean contains(Object instance) {
106 return storage.values().contains(instance);
107 }
108 }