summaryrefslogtreecommitdiff
path: root/java/common/src/main/java/org/apache/qpid/transport/Binary.java
blob: e6dedc536f95b791183cf8fcb116a4a8e2e2398f (plain)
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
121
122
123
124
125
126
127
128
129
/*
 *
 * 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.qpid.transport;


/**
 * Binary
 *
 */

public final class Binary
{

    private byte[] bytes;
    private int offset;
    private int size;
    private int hash = 0;

    public Binary(byte[] bytes, int offset, int size)
    {
        if (offset + size > bytes.length)
        {
            throw new ArrayIndexOutOfBoundsException();
        }

        this.bytes = bytes;
        this.offset = offset;
        this.size = size;
    }

    public Binary(byte[] bytes)
    {
        this(bytes, 0, bytes.length);
    }

    public final byte[] array()
    {
        return bytes;
    }

    public final int offset()
    {
        return offset;
    }

    public final int size()
    {
        return size;
    }

    public final Binary slice(int low, int high)
    {
        int sz;

        if (high < 0)
        {
            sz = size + high;
        }
        else
        {
            sz = high - low;
        }

        if (sz < 0)
        {
            sz = 0;
        }

        return new Binary(bytes, offset + low, sz);
    }

    public final int hashCode()
    {
        if (hash == 0)
        {
            int hc = 0;
            for (int i = 0; i < size; i++)
            {
                hc = 31*hc + (0xFF & bytes[offset + i]);
            }
            hash = hc;
        }

        return hash;
    }

    public final boolean equals(Object o)
    {
        if (!(o instanceof Binary))
        {
            return false;
        }

        Binary buf = (Binary) o;
        if (this.size != buf.size)
        {
            return false;
        }

        for (int i = 0; i < size; i++)
        {
            if (bytes[offset + i] != buf.bytes[buf.offset + i])
            {
                return false;
            }
        }

        return true;
    }

}