KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > go > trove > classfile > LocationRangeSet


1 /* ====================================================================
2  * Trove - Copyright (c) 1997-2000 Walt Disney Internet Group
3  * ====================================================================
4  * The Tea Software License, Version 1.1
5  *
6  * Copyright (c) 2000 Walt Disney Internet Group. All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * 1. Redistributions of source code must retain the above copyright
13  * notice, this list of conditions and the following disclaimer.
14  *
15  * 2. Redistributions in binary form must reproduce the above copyright
16  * notice, this list of conditions and the following disclaimer in
17  * the documentation and/or other materials provided with the
18  * distribution.
19  *
20  * 3. The end-user documentation included with the redistribution,
21  * if any, must include the following acknowledgment:
22  * "This product includes software developed by the
23  * Walt Disney Internet Group (http://opensource.go.com/)."
24  * Alternately, this acknowledgment may appear in the software itself,
25  * if and wherever such third-party acknowledgments normally appear.
26  *
27  * 4. The names "Tea", "TeaServlet", "Kettle", "Trove" and "BeanDoc" must
28  * not be used to endorse or promote products derived from this
29  * software without prior written permission. For written
30  * permission, please contact opensource@dig.com.
31  *
32  * 5. Products derived from this software may not be called "Tea",
33  * "TeaServlet", "Kettle" or "Trove", nor may "Tea", "TeaServlet",
34  * "Kettle", "Trove" or "BeanDoc" appear in their name, without prior
35  * written permission of the Walt Disney Internet Group.
36  *
37  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
38  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
39  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
40  * DISCLAIMED. IN NO EVENT SHALL THE WALT DISNEY INTERNET GROUP OR ITS
41  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
42  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
43  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
44  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
45  * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
46  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
47  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
48  * ====================================================================
49  *
50  * For more information about Tea, please see http://opensource.go.com/.
51  */
52
53 package com.go.trove.classfile;
54
55 import java.util.*;
56
57 /******************************************************************************
58  * Produces a reduced sorted set of non-overlapping {@link LocationRange}
59  * objects.
60  *
61  * @author Brian S O'Neill
62  * @version
63  * <!--$$Revision:--> 2 <!-- $-->, <!--$$JustDate:--> 9/07/00 <!-- $-->
64  */
65 class LocationRangeSet {
66     /**
67      * Reduces a set of LocationRange objects.
68      */
69     public static SortedSet reduce(SortedSet locations) {
70         SortedSet newSet = new TreeSet();
71         Iterator it = locations.iterator();
72
73         while (it.hasNext()) {
74             LocationRange next = (LocationRange)it.next();
75
76             if (newSet.size() == 0) {
77                 newSet.add(next);
78                 continue;
79             }
80
81             if (next.getStartLocation().compareTo
82                 (next.getEndLocation()) >= 0) {
83                 continue;
84             }
85
86             // Try to reduce the set by joining adjacent ranges or eliminating
87 // overlap.
88
89             LocationRange last = (LocationRange)newSet.last();
90
91             if (next.getStartLocation().compareTo
92                 (last.getEndLocation()) <= 0) {
93
94                 if (last.getEndLocation().compareTo
95                     (next.getEndLocation()) <= 0) {
96
97                     newSet.remove(last);
98                     newSet.add(new LocationRangeImpl(last, next));
99                 }
100                 continue;
101             }
102
103             newSet.add(next);
104         }
105
106         return newSet;
107     }
108 }
109
Popular Tags