title: Next Power Of 2 1
signature: function nextPowerOf21($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(
        8, 
        8));
      
      printf("TEST-1...%s\n",driver(
        79, 
        128));
      
      printf("TEST-2...%s\n",driver(
        31, 
        32));
      
      printf("TEST-3...%s\n",driver(
        63, 
        64));
      
      printf("TEST-4...%s\n",driver(
        18, 
        32));
      
      printf("TEST-5...%s\n",driver(
        2, 
        2));
      
      printf("TEST-6...%s\n",driver(
        6, 
        8));
      
      printf("TEST-7...%s\n",driver(
        85, 
        128));
      
      printf("TEST-8...%s\n",driver(
        29, 
        32));
      
      printf("TEST-9...%s\n",driver(
        8, 
        8));
      
  }
  
  main();
  ?>
source_py: def next_power_of_2_1(n):
      p = 1
      if (n and (not (n & (n - 1)))):
          return n
      while (p < n):
          p <<= 1
      return p
source_cpp: unsigned int next_power_of_2_1(unsigned int n) {
    unsigned int p = 1;
    if ( n && ! ( n & ( n - 1 ) ) ) return n;
    while ( p < n ) p <<= 1;
    return p;
  }