Make pow call unambiguous.

runtime/vm/bigint_operations.cc

 // Copyright 2012 Google Inc. All Rights Reserved.
 
 #include "vm/bigint_operations.h"
 
 #include "platform/utils.h"
 
 #include "vm/double_internals.h"
 #include "vm/exceptions.h"
 #include "vm/object_store.h"
 #include "vm/zone.h"
@@ skipping 361 matching lines @@
   // We will fill the result in the inverse order and then exchange at the end.
   char* result =
       reinterpret_cast<char*>(allocator(static_cast<intptr_t>(required_size)));
   ASSERT(result != NULL);
   int result_pos = 0;
 
   // We divide the input into pieces of ~27 bits which can be efficiently
   // handled.
   const intptr_t kDivisorValue = 100000000;
   const int kPowerOfTen = 8;
-  ASSERT(pow(10, kPowerOfTen) == kDivisorValue);
+  ASSERT(pow(10.0, kPowerOfTen) == kDivisorValue);
   ASSERT(static_cast<Chunk>(kDivisorValue) < kDigitMaxValue);
   ASSERT(Smi::IsValid(kDivisorValue));
   const Bigint& divisor = Bigint::Handle(NewFromInt64(kDivisorValue));
 
   // Rest contains the remaining bigint that needs to be printed.
   Bigint& rest = Bigint::Handle(bigint.raw());
   Bigint& quotient = Bigint::Handle();
   Bigint& remainder = Bigint::Handle();
   while (!rest.IsZero()) {
     DivideRemainder(rest, divisor, &quotient, &remainder);
@@ skipping 1109 matching lines @@
 int BigintOperations::CountBits(Chunk digit) {
   int result = 0;
   while (digit != 0) {
     digit >>= 1;
     result++;
   }
   return result;
 }
 
 }  // namespace dart