KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > caucho > tools > profiler > ProfilerNodeComparator


1 /*
2  * Copyright (c) 1998-2005 Caucho Technology -- all rights reserved
3  *
4  * This file is part of Resin(R) Open Source
5  *
6  * Each copy or derived work must preserve the copyright notice and this
7  * notice unmodified.
8  *
9  * Resin Open Source is free software; you can redistribute it and/or modify
10  * it under the terms of the GNU General Public License as published by
11  * the Free Software Foundation; either version 2 of the License, or
12  * (at your option) any later version.
13  *
14  * Resin Open Source is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE, or any warranty
17  * of NON-INFRINGEMENT. See the GNU General Public License for more
18  * details.
19  *
20  * You should have received a copy of the GNU General Public License
21  * along with Resin Open Source; if not, write to the
22  * Free SoftwareFoundation, Inc.
23  * 59 Temple Place, Suite 330
24  * Boston, MA 02111-1307 USA
25  *
26  * @author Sam
27  */
28
29
30 package com.caucho.tools.profiler;
31
32 import java.util.Comparator JavaDoc;
33
34 abstract class ProfilerNodeComparator
35   implements Comparator JavaDoc<ProfilerNode>
36 {
37   private boolean isDescendingName;
38   private boolean _isDescending;
39
40   public void setDescendingName(boolean isDescendingName)
41   {
42     this.isDescendingName = isDescendingName;
43   }
44
45   public void setDescending(boolean isDescending)
46   {
47     _isDescending = isDescending;
48   }
49
50   abstract protected int compareImpl(ProfilerNode o1, ProfilerNode o2);
51
52   protected int compareLong(long l1, long l2)
53   {
54     if (l1 < l2)
55       return -1;
56     else if (l1 == l2)
57       return 0;
58     else
59       return 1;
60   }
61
62   public int compare(ProfilerNode o1, ProfilerNode o2)
63   {
64     int cmp;
65
66     if (_isDescending)
67       cmp = compareImpl(o2, o1);
68     else
69       cmp = compareImpl(o1, o2);
70
71     if (cmp == 0) {
72       if (isDescendingName)
73         cmp = o2.getName().compareTo(o1.getName());
74       else
75         cmp = o1.getName().compareTo(o2.getName());
76     }
77
78     if (cmp == 0) {
79       if (!o1.equals(o2))
80         cmp = -1;
81     }
82
83     return cmp;
84   }
85 }
86
Popular Tags