使用正则表达式,我如何才能找到一个字符串是否包含一个特定序列中所有字符的正确序列顺序?

let reg = /.*T.*E.*S.*T.*/

let check = reg.test('sbvykkjwkkkTjSwbpvkoSbjpobvvwwEjknbnjsksbwybwSojoybryrbevvydTeydk')
console.log(check)

const testSequence = pattern => str => new RegExp(pattern.split('').join('.*')).test(str);

const tester1 = testSequence('TEST');
const tester2 = testSequence('HELLO');

console.log(tester1('sbvykkjwkkkTjSwbpvkoSbjpobvvwwEjknbnjsksbwybwSojoybryrbevvydTeydk'));
console.log(tester1('TEST'));
console.log(tester1('TNT'));
console.log(tester2('HhEeLlLlOo'));

const positiveString = 'sbvykkjwkkkTjwbpvkobjpobvvwwEjknbnjsksbwybwSojoybryrbevvydTeydk';
const negativeString1 = 'sbvykkjwkkkTjwbpvkobSjpobvvwwEjknbnjsksbSwybwSojoybryrSbevvydTeydk';
const negativeString2 = 'asdfasdfasdfTasfasfdasfdSasfasfasdfasdfasfdEasdfaTsdfasdf';

const regex = /T[^TEST]*?E[^TEST]*?S[^TEST]*?T/;

const match = positiveString.match(regex);
const noMatch1 = negativeString1.match(regex);
const noMatch2 = negativeString2.match(regex);

console.log('Match: ', match, '\nNo-match: ', noMatch1, '\nAlso No-match: ', noMatch2);