Sorting method of administrative route code letter + number

The first one is ：

// lxbm: G1,G4,SL3596,H89...
const array = []
array.map(item => {
    
	const tmpArr = item.lxbm.split('')
	const reg = /[a-z,A-Z]/g
	item.sortLetter = '' //  The result of converting letters to numbers 
	item.sortNum = '' //  The result of pure numbers 
	tmpArr.map(it => {
    
	  if (reg.test(it)) {
    
	    item.sortLetter += it.charCodeAt(0).toString() //  Converting letters into numbers 
	  } else {
    
	    item.sortNum += it.toString()
	  }
	})
	return item
})
// sort Sort 
array.sort((a, b) => {
    
	return this.sortLxbm(a, b)
})
//  Sort rule 
sortLxbm(a, b) {
    
	//  When the letters are the same , Sort by route number 
	if (Number(a.sortLetter) === Number(b.sortLetter)) {
    
    	return Number(a.sortNum) - Number(b.sortNum)
    }
    //  Alphabetical order 
    return Number(a.sortLetter) - Number(b.sortLetter)
}

The second kind ：

// lxbm: G1,G4,SL3596,H89...
// lxmc： Jingha , Jingguang , Jingzang ...
const array = []
const nameArr = []
array.map(item => {
    
	item.lxmcn = item.lxbm + '-' + item.lxmc
	nameArr.push(item.lxmcn)
	return item
})
nameArr.sort() //  Use the spliced name directly sort Sort ,sort Will automatically process the order of letters and numbers （ Maybe the end result is not what you want , At this time, you need to customize and adjust the logic ...）

//  The resulting array is then sorted by a specific array of names , Refer to the following ：
/** *  Arrays are sorted in a specific order  *  such as ： Existing arrays are arranged in the following order ： Blizzard 、 Rain and dew 、 The thunder 、 Heavy rains 、 Sandwind 、 Flying fog  *  The core is to use free sort Method  * @param now  The current array to be sorted  * @param mirror  Specified collation  */
 let now = [' Rain and dew ',' White frost ',' Flying fog ',' Heavy rains ',' Blizzard ',' The thunder ',' Sandwind ']; 
 let mirror = [' Blizzard ',' Rain and dew ',' The thunder ',' Heavy rains ',' Sandwind ',' Flying fog ']; 
 let val = now.sort(function(a, b) {
    
 	 //  Those that don't correspond to the top of the list will go to the back 
     if (mirror.indexOf(a) == -1 || mirror.indexOf(b) == -1) {
    
     	return mirror.indexOf(b) - mirror.indexOf(a);
     } else {
    
        return mirror.indexOf(a) - mirror.indexOf(b);
     }
 })