/*
 * Copyright (c) 2018 - present Facebook, Inc.
 * All rights reserved.
 *
 * This source code is licensed under the BSD style license found in the
 * LICENSE file in the root directory of this source tree. An additional grant
 * of patent rights can be found in the PATENTS file in the same directory.
 */
public class ArrayCost {

    private void ArrayCost_FP(int signum, int[] mag) {
        if (mag.length > 0) {

            int i = 0;

            while (i < mag.length && mag[i] == 0) {
                i++;
            }

        }
    }

    private static boolean isPowOfTwo_FP(int value) {
        int ones = 0;
        int v = value;

        for (int shifts = 0; shifts < 31 && ones <= 1; shifts++) {
            if ((v & 1) == 1) {
                ones++;
            }

            v >>= 1;
        }

        return ones == 1;
    }


}