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
|
/**
* This file is part of the CRISTAL-iSE kernel.
* Copyright (c) 2001-2014 The CRISTAL Consortium. All rights reserved.
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation; either version 3 of the License, or (at
* your option) any later version.
*
* This library is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; with out even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*
* http://www.fsf.org/licensing/licenses/lgpl.html
*/
package org.cristalise.kernel.utils;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
// This subclass of hashtable can be marshalled
// and unmarshalled with Castor
public class CastorHashMap extends HashMap<String,Object>
{
public CastorHashMap()
{
clear();
}
ArrayList<String> abstractPropNames = new ArrayList<String>();
public KeyValuePair[] getKeyValuePairs()
{
int numKeys = size();
KeyValuePair[] keyValuePairs = new KeyValuePair[numKeys];
Iterator<String> keyIter = keySet().iterator();
int i = 0;
for(i=0; i<numKeys; i++)
if (keyIter.hasNext())
{
String name = keyIter.next();
keyValuePairs[i] = new KeyValuePair(name ,get(name), abstractPropNames.contains(name));
}
return keyValuePairs;
}
public void setKeyValuePairs(KeyValuePair[] keyValuePairs)
{
int i = 0;
// Clears this hashtable so that it contains no keys
clear();
// Put each key value pair into this hashtable
for(i=0; i<keyValuePairs.length; i++)
{
setKeyValuePair(keyValuePairs[i]);
}
}
@Override
public void clear() {
super.clear();
abstractPropNames = new ArrayList<String>();
}
public void setKeyValuePair(KeyValuePair keyValuePair)
{
put(keyValuePair.getKey(), keyValuePair.getValue());
if (keyValuePair.isAbstract())
abstractPropNames.add(keyValuePair.getKey());
else
abstractPropNames.remove(keyValuePair.getKey());
}
public ArrayList<String> getAbstract() {
return abstractPropNames;
}
public void put(String key, Object value, boolean isAbstract) {
super.put(key, value);
if (isAbstract)
abstractPropNames.add(key);
else
abstractPropNames.remove(key);
}
}
|
