text: /**
  * @license Apache-2.0
  *
  * Copyright (c) 2020 The Stdlib Authors.
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
  * You may obtain a copy of the License at
  *
  *    http://www.apache.org/licenses/LICENSE-2.0
  *
  * Unless required by applicable law or agreed to in writing, software
  * distributed under the License is distributed on an "AS IS" BASIS,
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
  
  'use strict';
  
  // MODULES //
  
  var isnan = require( '@stdlib/math-base-assert-is-nan' );
  var isPositiveZero = require( '@stdlib/math-base-assert-is-positive-zero' );
  
  
  // MAIN //
  
  /**
  * Computes the maximum value of a sorted double-precision floating-point strided array.
  *
  * @param {PositiveInteger} N - number of indexed elements
  * @param {Float64Array} x - sorted input array
  * @param {integer} stride - stride length
  * @param {NonNegativeInteger} offset - starting index
  * @returns {number} maximum value
  *
  * @example
  * var Float64Array = require( '@stdlib/array-float64' );
  * var floor = require( '@stdlib/math-base-special-floor' );
  *
  * var x = new Float64Array( [ 2.0, -3.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
  * var N = floor( x.length / 2 );
  *
  * var v = dmaxsorted( N, x, 2, 1 );
  * // returns 4.0
  */
  function dmaxsorted( N, x, stride, offset ) {
  	var v1;
  	var v2;
  
  	if ( N <= 0 ) {
  		return NaN;
  	}
  	if ( N === 1 || stride === 0 ) {
  		return x[ 0 ];
  	}
  	v1 = x[ offset ];
  	v2 = x[ offset + ((N-1)*stride) ];
  	if ( isnan( v1 ) || isnan( v2 ) ) {
  		return NaN;
  	}
  	if ( v1 === v2 ) {
  		if ( isPositiveZero( v1 ) || isPositiveZero( v2 ) ) {
  			return 0.0;
  		}
  		return v1;
  	}
  	if ( v1 > v2 ) {
  		return v1;
  	}
  	return v2;
  }
  
  
  // EXPORTS //
  
  module.exports = dmaxsorted;
  