issrg.test.ds.TestDS.testIssuing
| IntersectionSubtree | Line # 54 | 3 | 1 | 83.3% |
0.8333333
|
| (1) | |||
| Result | |||
|
0.8333333
|
issrg.test.ds.TestDS.testIssuing
issrg.test.ds.TestDS.testIssuing
|
1 PASS | |
| 1 | /* | |
| 2 | * Copyright (c) 2006, University of Kent | |
| 3 | * All rights reserved. | |
| 4 | * | |
| 5 | * Redistribution and use in source and binary forms, with or without | |
| 6 | * modification, are permitted provided that the following conditions are met: | |
| 7 | * | |
| 8 | * Redistributions of source code must retain the above copyright notice, this | |
| 9 | * list of conditions and the following disclaimer. | |
| 10 | * | |
| 11 | * Redistributions in binary form must reproduce the above copyright notice, | |
| 12 | * this list of conditions and the following disclaimer in the documentation | |
| 13 | * and/or other materials provided with the distribution. | |
| 14 | * | |
| 15 | * 1. Neither the name of the University of Kent nor the names of its | |
| 16 | * contributors may be used to endorse or promote products derived from this | |
| 17 | * software without specific prior written permission. | |
| 18 | * | |
| 19 | * 2. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS | |
| 20 | * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, | |
| 21 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
| 22 | * PURPOSE ARE DISCLAIMED. | |
| 23 | * | |
| 24 | * 3. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
| 25 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
| 26 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
| 27 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
| 28 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
| 29 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
| 30 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
| 31 | * POSSIBILITY OF SUCH DAMAGE. | |
| 32 | * | |
| 33 | * 4. YOU AGREE THAT THE EXCLUSIONS IN PARAGRAPHS 2 AND 3 ABOVE ARE REASONABLE | |
| 34 | * IN THE CIRCUMSTANCES. IN PARTICULAR, YOU ACKNOWLEDGE (1) THAT THIS | |
| 35 | * SOFTWARE HAS BEEN MADE AVAILABLE TO YOU FREE OF CHARGE, (2) THAT THIS | |
| 36 | * SOFTWARE IS NOT "PRODUCT" QUALITY, BUT HAS BEEN PRODUCED BY A RESEARCH | |
| 37 | * GROUP WHO DESIRE TO MAKE THIS SOFTWARE FREELY AVAILABLE TO PEOPLE WHO WISH | |
| 38 | * TO USE IT, AND (3) THAT BECAUSE THIS SOFTWARE IS NOT OF "PRODUCT" QUALITY | |
| 39 | * IT IS INEVITABLE THAT THERE WILL BE BUGS AND ERRORS, AND POSSIBLY MORE | |
| 40 | * SERIOUS FAULTS, IN THIS SOFTWARE. | |
| 41 | * | |
| 42 | * 5. This license is governed, except to the extent that local laws | |
| 43 | * necessarily apply, by the laws of England and Wales. | |
| 44 | */ | |
| 45 | package issrg.pba.rbac.policies; | |
| 46 | ||
| 47 | import issrg.utils.repository.Entry; | |
| 48 | ||
| 49 | /** | |
| 50 | * This class is an intersection of two subtrees. An entry is contained | |
| 51 | * in the IntersectionSubtree, if it is contained in all the subtrees that | |
| 52 | * it is an intersection of. | |
| 53 | */ | |
| 54 | public class IntersectionSubtree implements Subtree { | |
| 55 | protected Subtree tree1; | |
| 56 | protected Subtree tree2; | |
| 57 | ||
| 58 | 0 |
 protected IntersectionSubtree(){} |
| 59 | ||
| 60 | /** | |
| 61 | * This constructor builds an IntersectionSubtree, given two Subtrees. Both | |
| 62 | * of the subtrees are treated equally. | |
| 63 | * | |
| 64 | * @param t1 - one Subtree | |
| 65 | * @param t2 - another Subtree | |
| 66 | */ | |
| 67 | 1187 |
public IntersectionSubtree(Subtree t1, Subtree t2){ |
| 68 | 1187 | tree1=t1; |
| 69 | 1187 | tree2=t2; |
| 70 | } | |
| 71 | ||
| 72 | /** | |
| 73 | * This method tells whether the given Entry is contained in the Intersection | |
| 74 | * of the two Subtrees passed to the constructor. | |
| 75 | * | |
| 76 | * @param e - the Entry to test | |
| 77 | * | |
| 78 | * @return true, if and only if the Entry is contained in both Subtrees; | |
| 79 | * otherwise false | |
| 80 | */ | |
| 81 | 927 |
public boolean contains(Entry e){ |
| 82 | 927 | return tree1.contains(e) && tree2.contains(e); |
| 83 | } | |
| 84 | } | |
|
||||||||||
