code: function( array, nBlocks, blockSize ) {
  
  			var firstElem = array[ 0 ];
  
  			if ( firstElem <= 0 || firstElem > 0 ) return array;
  			// unoptimized: ! isNaN( firstElem )
  			// see http://jacksondunstan.com/articles/983
  
  			var n = nBlocks * blockSize,
  				r = arrayCacheF32[ n ];
  
  			if ( r === undefined ) {
  
  				r = new Float32Array( n );
  				arrayCacheF32[ n ] = r;
  
  			}
  
  			if ( nBlocks !== 0 ) {
  
  				firstElem.toArray( r, 0 );
  
  				for ( var i = 1, offset = 0; i !== nBlocks; ++ i ) {
  
  					offset += blockSize;
  					array[ i ].toArray( r, offset );
  
  				}
  
  			}
  
  			return r;
  
  		}
docs: --- Base for inner nodes (including the root) ---