fix: ensure field resolution is preserved after sorting

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: passed
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: passed
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: passed
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: kgryte

lib/node_modules/@stdlib/dstructs/named-typed-tuple/README.md

@@ -1888,7 +1888,7 @@ var y = tuple[ 0 ];
 
 // Tuple field assignments do NOT change:
 x = tuple.x;
-// returns 0.0
+// returns 2.0
 ```
 
 By default, the method sorts tuple elements in ascending order. To impose a custom order, provide a `compareFunction`.

lib/node_modules/@stdlib/dstructs/named-typed-tuple/lib/main.js

@@ -33,9 +33,10 @@ var isCollection = require( '@stdlib/assert/is-collection' );
 var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 var hasIteratorSymbolSupport = require( '@stdlib/assert/has-iterator-symbol-support' );
 var propertiesIn = require( '@stdlib/utils/properties-in' );
+var copy = require( '@stdlib/array/base/copy' );
 var typedarray = require( '@stdlib/array/typed' );
 var Int8Array = require( '@stdlib/array/int8' );
-var getDtype = require( '@stdlib/array/dtype' );
+var getDType = require( '@stdlib/array/dtype' );
 var defineProperty = require( '@stdlib/utils/define-property' );
 var setNonEnumerableProperty = require( '@stdlib/utils/define-nonenumerable-property' );
 var setNonEnumerableReadOnlyAccessor = require( '@stdlib/utils/define-nonenumerable-read-only-accessor' ); // eslint-disable-line id-length
@@ -102,7 +103,7 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 	if ( !hasDistinctElements( names ) ) {
 		throw new TypeError( format( 'invalid argument. Field names must be distinct. Value: `%s`.', names ) );
 	}
-	fields = names.slice();
+	fields = copy( names );
 	nfields = fields.length;
 	for ( i = 0; i < nfields; i++ ) {
 		if ( contains( RESERVED_PROPS, fields[ i ] ) ) {
@@ -172,7 +173,7 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 		if ( tuple.length !== nfields ) {
 			throw new RangeError( format( 'invalid arguments. Arguments are incompatible with the number of tuple fields. Number of fields: `%u`. Number of data elements: `%u`.', nfields, tuple.length ) );
 		}
-		dtype = getDtype( tuple );
+		dtype = getDType( tuple );
 
 		indices = []; // indirect index look-up table
 		for ( i = 0; i < nfields; i++ ) {
@@ -227,7 +228,7 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 			* @returns {number} tuple value
 			*/
 			function get() {
-				return tuple[ indices[ i ] ];
+				return tuple[ indices.indexOf( i ) ];
 			}
 		}
 
@@ -248,7 +249,7 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 			* @param {number} v - value to set
 			*/
 			function set( v ) {
-				tuple[ indices[ i ] ] = v;
+				tuple[ indices.indexOf( i ) ] = v;
 			}
 		}
 
@@ -1040,6 +1041,7 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 		*/
 		function sort( compareFunction ) {
 			var clbk;
+			var idx;
 			var tmp;
 			var i;
 			var j;
@@ -1056,6 +1058,10 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 			} else {
 				clbk = ascending;
 			}
+			// Create a copy of the list of indices so that we can access the original sort order when invoking the comparison function:
+			idx = indices.slice();
+
+			// Sort the list of indices:
 			indices.sort( wrapper );
 
 			// Create a temporary indices array which we'll reorder as we rearrange the tuple elements:
@@ -1091,8 +1097,8 @@ function factory( names, options ) { // eslint-disable-line max-lines-per-functi
 			* @returns {*} value specifying the sort order
 			*/
 			function wrapper( ia, ib ) {
-				var a = tuple[ indices[ ia ] ];
-				var b = tuple[ indices[ ib ] ];
+				var a = tuple[ idx[ ia ] ];
+				var b = tuple[ idx[ ib ] ];
 				return clbk( a, b );
 			}
 		}