File: LinkStore.java

package info (click to toggle)
libsis-jhdf5-java 19.04.0%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 8,668 kB
  • sloc: java: 79,644; ansic: 18,986; sh: 309; makefile: 49; xml: 12
file content (192 lines) | stat: -rw-r--r-- 5,106 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
/*
 * Copyright 2007 - 2018 ETH Zuerich, CISD and SIS.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package ch.systemsx.cisd.hdf5.h5ar;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;

import ch.systemsx.cisd.hdf5.IHDF5Reader;

/**
 * A store for {@link LinkRecord}s.
 * 
 * @author Bernd Rinn
 */
final class LinkStore implements Iterable<LinkRecord>
{
    private Map<String, LinkRecord> linkMap;

    private LinkRecord[] sortedArrayOrNull;
    
    private boolean linkMapPopulated = false;

    /**
     * Creates a new empty link list.
     */
    LinkStore()
    {
        this(new LinkRecord[0]);
    }

    /**
     * Creates a new link store and populates it with <var>entries</var>.
     * 
     * @param sortedEntries The links to populate the store with initially. The links are expected to be
     *            sorted.
     */
    LinkStore(LinkRecord[] sortedEntries)
    {
        this.sortedArrayOrNull = sortedEntries;
    }

    private Map<String, LinkRecord> getLinkMap()
    {
        if (linkMapPopulated == false && sortedArrayOrNull != null)
        {
            linkMap = new HashMap<String, LinkRecord>(sortedArrayOrNull.length);
            // Build the map lazily.
            for (LinkRecord entry : sortedArrayOrNull)
            {
                linkMap.put(entry.getLinkName(), entry);
            }
            linkMapPopulated = true;
        }
        return linkMap;
    }

    /**
     * Returns an array of the links in this store, in the order defined by
     * {@link LinkRecord#compareTo(LinkRecord)}.
     */
    public synchronized LinkRecord[] getLinkArray()
    {
        if (sortedArrayOrNull == null)
        {
            sortedArrayOrNull = getLinkMap().values().toArray(new LinkRecord[getLinkMap().size()]);
            Arrays.sort(sortedArrayOrNull);
        }
        return sortedArrayOrNull;
    }

    public synchronized void amendLinkTargets(IHDF5Reader reader, String groupPath)
    {
        for (LinkRecord link : getLinkMap().values())
        {
            link.addLinkTarget(reader, groupPath);
        }
    }

    /**
     * Returns the link with {@link LinkRecord#getLinkName()} equal to <var>name</var>, or
     * <code>null</code>, if there is no such link in the directory index.
     */
    public synchronized LinkRecord tryGetLink(String name)
    {
        return getLinkMap().get(name);
    }

    public boolean exists(String name)
    {
        return tryGetLink(name) != null;
    }

    /**
     * Returns <code>true</code> if this list is empty.
     */
    public synchronized boolean isEmpty()
    {
        return getLinkMap().isEmpty();
    }

    //
    // Iterable<Link>
    //

    /**
     * Returns an iterator over all links in the list, in the order defined by
     * {@link LinkRecord#compareTo(LinkRecord)}.
     */
    @Override
    public synchronized Iterator<LinkRecord> iterator()
    {
        final LinkRecord[] list = getLinkArray();
        for (LinkRecord link : list)
        {
            link.resetVerification();
        }
        return new ArrayList<LinkRecord>(Arrays.asList(list)).iterator();
    }

    /**
     * Updates the <var>entries</var> in the store.
     */
    public synchronized void update(LinkRecord entry)
    {
        getLinkMap().put(entry.getLinkName(), entry);
        sortedArrayOrNull = null;
    }

    /**
     * Updates the <var>entries</var> in the store.
     */
    public synchronized void update(LinkRecord[] entries)
    {
        for (LinkRecord entry : entries)
        {
            getLinkMap().put(entry.getLinkName(), entry);
        }
        if (entries.length > 0)
        {
            sortedArrayOrNull = null;
        }
    }

    /**
     * Updates the <var>entries</var> in the store.
     */
    public synchronized void update(Collection<LinkRecord> entries)
    {
        for (LinkRecord entry : entries)
        {
            getLinkMap().put(entry.getLinkName(), entry);
        }
        if (entries.size() > 0)
        {
            sortedArrayOrNull = null;
        }
    }

    /**
     * Removes <var>linkName</var> from the store.
     * 
     * @return <code>true</code>, if it was removed, <code>false</code>, if it couldn't be found.
     */
    public synchronized boolean remove(String linkName)
    {
        final boolean storeChanged = (getLinkMap().remove(linkName) != null);
        if (storeChanged)
        {
            sortedArrayOrNull = null;
        }
        return storeChanged;
    }

}