aboutsummaryrefslogtreecommitdiffstats
path: root/src/algorithms/bits/Powers.java
blob: 2238bcdd9015c64fecb084b5eb80730073a916c1 (plain) (blame)
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
/**
 * Copyright © 2014  Mattias Andrée (maandree@member.fsf.org)
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package algorithms.bits;


/**
 * Power of 2 interger operations
 */
public class Powers
{
£<for T_S in char_2 byte_1 short_2 int_4 long_8; do
  T=${T_S%_*}
£>S=${T_S#*_}
    /**
     * Compute whether an integer is a power of two,
     * note that zero is indeed not a power of two
     * 
     * @param   value  The integer
     * @return         Whether the integer is a power of two
     */
    public static boolean isPowerOf2(£{T} value)
    {
	return (value & (value - 1)) == 0; /* The left hand side clears the least significant bit set */
	/* Or alternatively: (value & -value) == value */
    }
    
    /**
     * Computes the nearest, but higher, power of two,
     * independently of whether the current value is
     * a power of two or not
     * 
     * @param   value  The current value
     * @return         The next power of two
     */
    public static £{T} nextPowerOf2(£{T} value)
    {
	value |= value >> 1;
	value |= value >> 2;
	value |= value >> 4;
£>(( S > 1)) &&
	value |= value >> 8;
£>(( S > 2)) &&
	value |= value >> 16;
£>(( S > 4)) &&
	value |= value >> 32;
	return (£{T})(value + 1);
    }
    
    /**
     * Computes the nearest, but higher, power of two,
     * but only if the current value is not a power of two
     * 
     * @param   value  The current value
     * @return         The next power of two
     */
    public static £{T} toPowerOf2(£{T} value)
    {
	value -= 1;
	value |= value >>> 1;
	value |= value >>> 2;
	value |= value >>> 4;
£>(( S > 1)) &&
	value |= value >>> 8;
£>(( S > 2)) &&
	value |= value >>> 16;
£>(( S > 4)) &&
	value |= value >>> 32;
	return (£{T})(value + 1);
    }
£>done
}