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
|
/*
D-Bus Java Implementation
Copyright (c) 2005-2006 Matthew Johnson
This program is free software; you can redistribute it and/or modify it
under the terms of either the GNU Lesser General Public License Version 2 or the
Academic Free Licence Version 2.1.
Full licence texts are included in the COPYING file with this program.
*/
package org.freedesktop.dbus.bin;
import java.lang.reflect.Type;
import java.util.Map;
import java.util.HashMap;
class StructStruct
{
public static Map<StructStruct, Type[]> fillPackages(Map<StructStruct, Type[]> structs, String pack)
{
Map<StructStruct, Type[]> newmap = new HashMap<StructStruct, Type[]>();
for (StructStruct ss: structs.keySet()) {
Type[] type = structs.get(ss);
if (null == ss.pack) ss.pack = pack;
newmap.put(ss, type);
}
return newmap;
}
public String name;
public String pack;
public StructStruct(String name)
{
this.name = name;
}
public StructStruct(String name, String pack)
{
this.name = name;
this.pack = pack;
}
public int hashCode()
{
return name.hashCode();
}
public boolean equals(Object o)
{
if (!(o instanceof StructStruct)) return false;
if (!name.equals(((StructStruct) o).name)) return false;
return true;
}
public String toString()
{
return "<"+name+", "+pack+">";
}
}
|
