Avoid narrowing warnings via explicit cast

Author: eddelbuettel

inst/include/RcppArmadillo/rng/Alt_R_RNG.h

@@ -1,13 +1,12 @@
-// -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; indent-tabs-mode: nil; -*-
-//
+
 // Copyright (C) 2013-2014 Conrad Sanderson
 // Copyright (C) 2013-2014 NICTA (www.nicta.com.au)
-// 
+//
 // This Source Code Form is subject to the terms of the Mozilla Public
 // License, v. 2.0. If a copy of the MPL was not distributed with this
 // file, You can obtain one at http://mozilla.org/MPL/2.0/.
 //
-// This file is based on Conrad's default generators and as such licensed under both 
+// This file is based on Conrad's default generators and as such licensed under both
 // the MPL 2.0 for his as well as the GNU GPL 2.0 or later for my modification to it.
 
 // Copyright (C)  2014  Dirk Eddelbuettel
@@ -28,7 +27,7 @@
 // along with RcppArmadillo.  If not, see <http://www.gnu.org/licenses/>.
 
 
-// NB This files use R's uniform generator and can be compiled only when the R 
+// NB This files use R's uniform generator and can be compiled only when the R
 //    headers are available as is the case for RcppArmadillo.
 //
 //    Also note that you MUST set / reset the R RNG state.  When using RcppArmadillo
@@ -40,21 +39,21 @@
 
 class arma_rng_alt {
 public:
-  
+
     typedef unsigned int seed_type;
-  
+
     inline static void set_seed(const seed_type val);
-  
+
     arma_inline static int    randi_val();
     arma_inline static double randu_val();
          inline static double randn_val();
-    
+
     template<typename eT>
     inline static void randn_dual_val(eT& out1, eT& out2);
-  
+
     template<typename eT>
     inline static void randi_fill(eT* mem, const uword N, const int a, const int b);
-  
+
     inline static int randi_max_val();
 };
 
@@ -72,7 +71,7 @@ inline void arma_rng_alt::set_seed(const arma_rng_alt::seed_type val) {
 }
 
 arma_inline int arma_rng_alt::randi_val() {
-    return ::Rf_runif(0, RAND_MAX);  //std::rand();
+    return static_cast<int>(::Rf_runif(0, RAND_MAX));  //std::rand();
 }
 
 arma_inline double arma_rng_alt::randu_val() {
@@ -84,43 +83,43 @@ inline double arma_rng_alt::randn_val() {
     // polar form of the Box-Muller transformation:
     // http://en.wikipedia.org/wiki/Box-Muller_transformation
     // http://en.wikipedia.org/wiki/Marsaglia_polar_method
-  
+
     double tmp1;
     double tmp2;
     double w;
-  
+
     do {
         tmp1 = double(2) * double(::Rf_runif(0, 1)) - double(1);
         tmp2 = double(2) * double(::Rf_runif(0, 1)) - double(1);
         //tmp1 = double(2) * double(std::rand()) * (double(1) / double(RAND_MAX)) - double(1);
         //tmp2 = double(2) * double(std::rand()) * (double(1) / double(RAND_MAX)) - double(1);
-    
+
         w = tmp1*tmp1 + tmp2*tmp2;
     } while ( w >= double(1) );
-  
+
     return double( tmp1 * std::sqrt( (double(-2) * std::log(w)) / w) );
 }
 
-template<typename eT> 
+template<typename eT>
 inline void arma_rng_alt::randn_dual_val(eT& out1, eT& out2) {
     // make sure we are internally using at least floats
     typedef typename promote_type<eT,float>::result eTp;
-  
+
     eTp tmp1;
     eTp tmp2;
     eTp w;
-  
+
     do {
         tmp1 = eTp(2) * eTp(::Rf_runif(0, RAND_MAX)) * (eTp(1) / eTp(RAND_MAX)) - eTp(1);
         tmp2 = eTp(2) * eTp(::Rf_runif(0, RAND_MAX)) * (eTp(1) / eTp(RAND_MAX)) - eTp(1);
         //tmp1 = eTp(2) * eTp(std::rand()) * (eTp(1) / eTp(RAND_MAX)) - eTp(1);
         //tmp2 = eTp(2) * eTp(std::rand()) * (eTp(1) / eTp(RAND_MAX)) - eTp(1);
-    
+
         w = tmp1*tmp1 + tmp2*tmp2;
     } while ( w >= eTp(1) );
-  
+
     const eTp k = std::sqrt( (eTp(-2) * std::log(w)) / w);
-    
+
     out1 = eT(tmp1*k);
     out2 = eT(tmp2*k);
 }
@@ -131,14 +130,14 @@ template<typename eT>
 inline void arma_rng_alt::randi_fill(eT* mem, const uword N, const int a, const int b) {
     if( (a == 0) && (b == RAND_MAX) ) {
         for(uword i=0; i<N; ++i) {
-            mem[i] = ::Rf_runif(0, RAND_MAX);
+            mem[i] = static_cast<eT>(::Rf_runif(0, RAND_MAX));  //std::rand();
             //mem[i] = std::rand();
         }
     } else {
         const uword length = b - a + 1;
-    
+
         const double scale = double(length) / double(RAND_MAX);
-    
+
         for(uword i=0; i<N; ++i) {
             mem[i] = (std::min)( b, (int( double(::Rf_runif(0,RAND_MAX)) * scale ) + a) );
             //mem[i] = (std::min)( b, (int( double(std::rand()) * scale ) + a) );