/** * 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 . */ package algorithms.bits; /** * Power of 2 interger operations */ public class Powers { £>for T in char byte short int long; do /** * 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; /* Or alternatively: (value & -value) == value */ } £>done }