aboutsummaryrefslogtreecommitdiff
path: root/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ObjectExtensions.cs
blob: fe6a274c1ed6a27b226f132f5772e33ef30ff652 (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
/*
 * [The "BSD licence"]
 * Copyright (c) 2005-2008 Terence Parr
 * All rights reserved.
 *
 * Conversion to C#:
 * Copyright (c) 2008 Sam Harwell, Pixel Mine, Inc.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

using System;

namespace Antlr.Runtime.JavaExtensions
{
    public static class ObjectExtensions
    {
#if DEBUG
        [Obsolete]
        public static bool booleanValue( this bool value )
        {
            return value;
        }

        [Obsolete]
        public static Type getClass( this object o )
        {
            return o.GetType();
        }
#endif

        public static int ShiftPrimeXOR( int a, int b )
        {
            int hash = 23;
            hash = ( ( hash << 5 ) * 37 ) ^ a;
            hash = ( ( hash << 5 ) * 37 ) ^ b;
            return hash;
        }

        public static int ShiftPrimeXOR( int a, int b, int c )
        {
            int hash = 23;
            hash = ( ( hash << 5 ) * 37 ) ^ a;
            hash = ( ( hash << 5 ) * 37 ) ^ b;
            hash = ( ( hash << 5 ) * 37 ) ^ c;
            return hash;
        }

        public static int ShiftPrimeXOR( int a, int b, int c, int d )
        {
            int hash = 23;
            hash = ( ( hash << 5 ) * 37 ) ^ a;
            hash = ( ( hash << 5 ) * 37 ) ^ b;
            hash = ( ( hash << 5 ) * 37 ) ^ c;
            hash = ( ( hash << 5 ) * 37 ) ^ d;
            return hash;
        }

        public static int ShiftPrimeXOR( params int[] a )
        {
            int hash = 23;
            foreach ( int i in a )
                hash = ( ( hash << 5 ) * 37 ) ^ i;
            return hash;
        }

        public static int ShiftPrimeAdd( int a, int b )
        {
            int hash = 23;
            hash = ( ( hash << 5 ) * 37 ) + a;
            hash = ( ( hash << 5 ) * 37 ) + b;
            return hash;
        }

        public static int ShiftPrimeAdd( int a, int b, int c )
        {
            int hash = 23;
            hash = ( ( hash << 5 ) * 37 ) + a;
            hash = ( ( hash << 5 ) * 37 ) + b;
            hash = ( ( hash << 5 ) * 37 ) + c;
            return hash;
        }

        public static int ShiftPrimeAdd( int a, int b, int c, int d )
        {
            int hash = 23;
            hash = ( ( hash << 5 ) * 37 ) + a;
            hash = ( ( hash << 5 ) * 37 ) + b;
            hash = ( ( hash << 5 ) * 37 ) + c;
            hash = ( ( hash << 5 ) * 37 ) + d;
            return hash;
        }

        public static int ShiftPrimeAdd( params int[] a )
        {
            int hash = 23;
            foreach ( int i in a )
                hash = ( ( hash << 5 ) * 37 ) + i;
            return hash;
        }
    }
}