function makeJSDTStyleRegExp(term) {

		var l = term.length,
			s1 = '',
			s2 = '',
			i,c;

		for ( i = 0; i < l; i++ ) {
			c = term[i];
			if ( c >= 'A' && c <= 'Z' && i > 0 ) {
				s1 += "[a-z]*";
			}
			s1 += escapeRegExp(c);
			if ( c.toUpperCase() !== c.toLowerCase() ) {
				s2 += '[' + escapeRegExp(c.toUpperCase() + c.toLowerCase()) + ']';
			} else {
				s2 += escapeRegExp(c);
			}
		}

		Log.debug("converted '" + term + "' to /" + s1 + '|' + s2 + "/");

		return new RegExp(s1 + '|' + s2);
	}
/**
	 * Converts a simple string (search term) into a RegExp that behaves like Eclipse class search:
	 * - camel case words are matched by any search term consisting of prefixes of each word in the same order as in the word
	 *   e.g.
	 *      CB   matches: CheckBox, ComboBox
	 *      CoB  only matches ComboBox
	 * - additionally, each term is added "as is" (case insensitive) so
	 *      cb   also matches   MacBook
	 *
	 * @param {string} term Term to convert
	 * @returns {RegExp} Regular Expression created from term
	 * @private
	 */
Converts a simple string (search term) into a RegExp that behaves like Eclipse class search:
- camel case words are matched by any search term consisting of prefixes of each word in the same order as in the word
e.g.
CB   matches: CheckBox, ComboBox
CoB  only matches ComboBox
- additionally, each term is added "as is" (case insensitive) so
cb   also matches   MacBook

@param {string} term Term to convert
@returns {RegExp} Regular Expression created from term
@private
Converts a simple string ( search term ) into a RegExp that behaves like Eclipse class search : - camel case words are matched by any search term consisting of prefixes of each word in the same order as in the word e . g . CB matches : CheckBox ComboBox CoB only matches ComboBox - additionally each term is added " as is " ( case insensitive ) so cb also matches MacBook @param { string } term Term to convert @returns { RegExp } Regular Expression created from term @private
function makeJSDTStyleRegExp(term) {
		var l = term.length,
			s1 = '',
			s2 = '',
			i,c;
		for ( i = 0; i < l; i++ ) {
			c = term[i];
			if ( c >= 'A' && c <= 'Z' && i > 0 ) {
				s1 += "[a-z]*";
			}
			s1 += escapeRegExp(c);
			if ( c.toUpperCase() !== c.toLowerCase() ) {
				s2 += '[' + escapeRegExp(c.toUpperCase() + c.toLowerCase()) + ']';
			} else {
				s2 += escapeRegExp(c);
			}
		}
		Log.debug("converted '" + term + "' to /" + s1 + '|' + s2 + "/");
		return new RegExp(s1 + '|' + s2);
	}
function makeJSDTStyleRegExp ( term ) { var l = term . length , s1 = '' , s2 = '' , i , c ; for ( i = 0 ; i < l ; i ++ ) { c = term [ i ] ; if ( c >= 'A' && c <= 'Z' && i > 0 ) { s1 += "[a-z]*" ; } s1 += escapeRegExp ( c ) ; if ( c . toUpperCase ( ) !== c . toLowerCase ( ) ) { s2 += '[' + escapeRegExp ( c . toUpperCase ( ) + c . toLowerCase ( ) ) + ']' ; } else { s2 += escapeRegExp ( c ) ; } } Log . debug ( "converted '" + term + "' to /" + s1 + '|' + s2 + "/" ) ; return new RegExp ( s1 + '|' + s2 ) ; }
Converts a simple string (search term) into a RegExp that behaves like Eclipse class search:
 - camel case words are matched by any search term consisting of prefixes of each word in the same order as in the word
   e.g.
Converts a simple string ( search term ) into a RegExp that behaves like Eclipse class search : - camel case words are matched by any search term consisting of prefixes of each word in the same order as in the word e . g .