1 |
771 |
jeremybenn |
/* IntersectingDomainCombiner.java --
|
2 |
|
|
Copyright (C) 2004 Free Software Foundation, Inc.
|
3 |
|
|
|
4 |
|
|
This file is part of GNU Classpath.
|
5 |
|
|
|
6 |
|
|
GNU Classpath is free software; you can redistribute it and/or modify
|
7 |
|
|
it under the terms of the GNU General Public License as published by
|
8 |
|
|
the Free Software Foundation; either version 2, or (at your option)
|
9 |
|
|
any later version.
|
10 |
|
|
|
11 |
|
|
GNU Classpath is distributed in the hope that it will be useful, but
|
12 |
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
13 |
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
14 |
|
|
General Public License for more details.
|
15 |
|
|
|
16 |
|
|
You should have received a copy of the GNU General Public License
|
17 |
|
|
along with GNU Classpath; see the file COPYING. If not, write to the
|
18 |
|
|
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
19 |
|
|
02110-1301 USA.
|
20 |
|
|
|
21 |
|
|
Linking this library statically or dynamically with other modules is
|
22 |
|
|
making a combined work based on this library. Thus, the terms and
|
23 |
|
|
conditions of the GNU General Public License cover the whole
|
24 |
|
|
combination.
|
25 |
|
|
|
26 |
|
|
As a special exception, the copyright holders of this library give you
|
27 |
|
|
permission to link this library with independent modules to produce an
|
28 |
|
|
executable, regardless of the license terms of these independent
|
29 |
|
|
modules, and to copy and distribute the resulting executable under
|
30 |
|
|
terms of your choice, provided that you also meet, for each linked
|
31 |
|
|
independent module, the terms and conditions of the license of that
|
32 |
|
|
module. An independent module is a module which is not derived from
|
33 |
|
|
or based on this library. If you modify this library, you may extend
|
34 |
|
|
this exception to your version of the library, but you are not
|
35 |
|
|
obligated to do so. If you do not wish to do so, delete this
|
36 |
|
|
exception statement from your version. */
|
37 |
|
|
|
38 |
|
|
|
39 |
|
|
package java.security;
|
40 |
|
|
|
41 |
|
|
import java.util.HashSet;
|
42 |
|
|
|
43 |
|
|
/**
|
44 |
|
|
* A trivial implementation of {@link DomainCombiner} that produces the
|
45 |
|
|
* intersection of the supplied {@link ProtectionDomain} objects.
|
46 |
|
|
*/
|
47 |
|
|
final class IntersectingDomainCombiner implements DomainCombiner
|
48 |
|
|
{
|
49 |
|
|
|
50 |
|
|
// Contstant.
|
51 |
|
|
// -------------------------------------------------------------------------
|
52 |
|
|
|
53 |
|
|
static final IntersectingDomainCombiner SINGLETON = new IntersectingDomainCombiner();
|
54 |
|
|
|
55 |
|
|
// Constructor.
|
56 |
|
|
// -------------------------------------------------------------------------
|
57 |
|
|
|
58 |
|
|
private IntersectingDomainCombiner()
|
59 |
|
|
{
|
60 |
|
|
}
|
61 |
|
|
|
62 |
|
|
// Methods.
|
63 |
|
|
// -------------------------------------------------------------------------
|
64 |
|
|
|
65 |
|
|
public ProtectionDomain[] combine (ProtectionDomain[] currentDomains,
|
66 |
|
|
ProtectionDomain[] assignedDomains)
|
67 |
|
|
{
|
68 |
|
|
HashSet newDomains = new HashSet ();
|
69 |
|
|
for (int i = 0; i < currentDomains.length; i++)
|
70 |
|
|
{
|
71 |
|
|
if (currentDomains[i] == null)
|
72 |
|
|
continue;
|
73 |
|
|
for (int j = 0; j < assignedDomains.length; j++)
|
74 |
|
|
{
|
75 |
|
|
if (currentDomains[i].equals (assignedDomains[j]))
|
76 |
|
|
newDomains.add (currentDomains[i]);
|
77 |
|
|
}
|
78 |
|
|
}
|
79 |
|
|
return (ProtectionDomain[])
|
80 |
|
|
newDomains.toArray(new ProtectionDomain[newDomains.size()]);
|
81 |
|
|
}
|
82 |
|
|
}
|