title: Next Power Of 2
signature: function nextPowerOf2($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        74, 
        128));
      
      printf("TEST-1...%s\n",driver(
        70, 
        128));
      
      printf("TEST-2...%s\n",driver(
        85, 
        128));
      
      printf("TEST-3...%s\n",driver(
        78, 
        128));
      
      printf("TEST-4...%s\n",driver(
        71, 
        128));
      
      printf("TEST-5...%s\n",driver(
        32, 
        32));
      
      printf("TEST-6...%s\n",driver(
        97, 
        128));
      
      printf("TEST-7...%s\n",driver(
        90, 
        128));
      
      printf("TEST-8...%s\n",driver(
        64, 
        64));
      
      printf("TEST-9...%s\n",driver(
        48, 
        64));
      
  }
  
  main();
  ?>
source_py: def next_power_of_2(n):
      count = 0
      if (n and (not (n & (n - 1)))):
          return n
      while (n != 0):
          n >>= 1
          count += 1
      return (1 << count)
source_cpp: unsigned int next_power_of_2(unsigned int n) {
    unsigned count = 0;
    if ( n && ! ( n & ( n - 1 ) ) ) return n;
    while ( n != 0 ) {
      n >>= 1;
      count += 1;
    }
    return 1 << count;
  }