findBitStep function

int findBitStep(
  1. int value,
  2. List<int> bitSteps
)

Implementation

int findBitStep(int value, List<int> bitSteps) {
  int step = -1;
  for (int i = 0; i < bitSteps.length; i++) {
    if (getBitsNeeded(value.abs()) <= bitSteps[i]) {
      step = i;
      break;
    }
  }

  return step;
}