title: Smallest Power Of 2 Greater Than Or Equal To N 1
signature: function smallestPowerOf2GreaterThanOrEqualToN1($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(
        31, 
        32));
      
      printf("TEST-1...%s\n",driver(
        89, 
        128));
      
      printf("TEST-2...%s\n",driver(
        92, 
        128));
      
      printf("TEST-3...%s\n",driver(
        66, 
        128));
      
      printf("TEST-4...%s\n",driver(
        38, 
        64));
      
      printf("TEST-5...%s\n",driver(
        34, 
        64));
      
      printf("TEST-6...%s\n",driver(
        17, 
        32));
      
      printf("TEST-7...%s\n",driver(
        24, 
        32));
      
      printf("TEST-8...%s\n",driver(
        54, 
        64));
      
      printf("TEST-9...%s\n",driver(
        20, 
        32));
      
  }
  
  main();
  ?>
source_py: def smallest_power_of_2_greater_than_or_equal_to_n_1(n):
      p = 1
      if (n and (not (n & (n - 1)))):
          return n
      while (p < n):
          p <<= 1
      return p
source_cpp: unsigned int smallest_power_of_2_greater_than_or_equal_to_n_1(unsigned int n) {
    unsigned int p = 1;
    if ( n && ! ( n & ( n - 1 ) ) ) return n;
    while ( p < n ) p <<= 1;
    return p;
  }