title: Next Power Of 2
signature: func nextPowerOf2(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(74, 128)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(70, 128)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(85, 128)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(78, 128)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(71, 128)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(32, 32)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(97, 128)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(90, 128)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(64, 64)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(48, 64)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }