File: AbsoluteOrder.java

package info (click to toggle)
tomcat10 10.1.52-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 47,900 kB
  • sloc: java: 375,756; xml: 59,410; jsp: 4,741; sh: 1,381; perl: 324; makefile: 25; ansic: 14
file content (120 lines) | stat: -rw-r--r-- 3,809 bytes parent folder | download | duplicates (6)
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.catalina.tribes.group;

import java.io.Serializable;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;

import org.apache.catalina.tribes.Member;

/**
 * <p>
 * Title: Membership - Absolute Order
 * </p>
 * <p>
 * Description: A simple, yet agreeable and efficient way of ordering members
 * </p>
 * <p>
 * Ordering members can serve as a basis for electing a leader or coordinating efforts.<br>
 * This is stinky simple, it works on the basis of the <code>Member</code> interface and orders members in the following
 * format:
 * </p>
 * <ol>
 * <li>IP comparison - byte by byte, lower byte higher rank</li>
 * <li>IPv4 addresses rank higher than IPv6, ie the lesser number of bytes, the higher rank</li>
 * <li>Port comparison - lower port, higher rank</li>
 * <li>UniqueId comparison- byte by byte, lower byte higher rank</li>
 * </ol>
 *
 * @see org.apache.catalina.tribes.Member
 */
public class AbsoluteOrder {
    public static final AbsoluteComparator comp = new AbsoluteComparator();

    protected AbsoluteOrder() {
        super();
    }


    public static void absoluteOrder(Member[] members) {
        if (members == null || members.length <= 1) {
            return;
        }
        Arrays.sort(members, comp);
    }

    public static void absoluteOrder(List<Member> members) {
        if (members == null || members.size() <= 1) {
            return;
        }
        members.sort(comp);
    }

    public static class AbsoluteComparator implements Comparator<Member>, Serializable {

        private static final long serialVersionUID = 1L;

        @Override
        public int compare(Member m1, Member m2) {
            int result = compareIps(m1, m2);
            if (result == 0) {
                result = comparePorts(m1, m2);
            }
            if (result == 0) {
                result = compareIds(m1, m2);
            }
            return result;
        }

        public int compareIps(Member m1, Member m2) {
            return compareBytes(m1.getHost(), m2.getHost());
        }

        public int comparePorts(Member m1, Member m2) {
            return compareInts(m1.getPort(), m2.getPort());
        }

        public int compareIds(Member m1, Member m2) {
            return compareBytes(m1.getUniqueId(), m2.getUniqueId());
        }

        protected int compareBytes(byte[] d1, byte[] d2) {
            int result = 0;
            if (d1.length == d2.length) {
                for (int i = 0; (result == 0) && (i < d1.length); i++) {
                    result = compareBytes(d1[i], d2[i]);
                }
            } else if (d1.length < d2.length) {
                result = -1;
            } else {
                result = 1;
            }
            return result;
        }

        protected int compareBytes(byte b1, byte b2) {
            return compareInts(b1, b2);
        }

        protected int compareInts(int b1, int b2) {
            return Integer.compare(b1, b2);
        }
    }

}