docs: function normalise( n, c, e ) {
              var i = 1,
                  j = c.length;
  
               // Remove trailing zeros.
              for ( ; !c[--j]; c.pop() );
  
              // Calculate the base 10 exponent. First get the number of digits of c[0].
              for ( j = c[0]; j >= 10; j /= 10, i++ );
  
              // Overflow?
              if ( ( e = i + e * LOG_BASE - 1 ) > MAX_EXP ) {
  
                  // Infinity.
                  n.c = n.e = null;
  
              // Underflow?
              } else if ( e < MIN_EXP ) {
  
                  // Zero.
                  n.c = [ n.e = 0 ];
              } else {
                  n.e = e;
                  n.c = c;
              }
  
              return n;
          }