lib/render.js
function( nspath ) {
		var found = true,
			nsparts = nspath.split( rpathsplit ),
			focus = render.options.focus;

		// Allow single path string
		if ( munit.isString( focus ) ) {
			focus = [ focus ];
		}

		// If set, only add modules that belong on the focus path(s)
		if ( munit.isArray( focus ) && focus.length ) {
			found = false;

			focus.forEach(function( fpath ) {
				var fparts = fpath.split( rpathsplit ),
					i = -1, l = Math.min( fparts.length, nsparts.length );

				// Check that each namespace of the focus path
				// exists inside the modules path
				for ( ; ++i < l; ) {
					if ( fparts[ i ] !== nsparts[ i ] ) {
						return;
					}
				}

				// Paths line up
				found = true;
			});
		}

		return found;
	}
function( nspath ) {
		var found = true,
			nsparts = nspath.split( rpathsplit ),
			focus = render.options.focus;

		// Allow single path string
		if ( munit.isString( focus ) ) {
			focus = [ focus ];
		}

		// If set, only add modules that belong on the focus path(s)
		if ( munit.isArray( focus ) && focus.length ) {
			found = false;

			focus.forEach(function( fpath ) {
				var fparts = fpath.split( rpathsplit ),
					i = -1, l = Math.min( fparts.length, nsparts.length );

				// Check that each namespace of the focus path
				// exists inside the modules path
				for ( ; ++i < l; ) {
					if ( fparts[ i ] !== nsparts[ i ] ) {
						return;
					}
				}

				// Paths line up
				found = true;
			});
		}

		return found;
	}
function ( nspath ) { var found = true , nsparts = nspath . split ( rpathsplit ) , focus = render . options . focus ; // Allow single path string if ( munit . isString ( focus ) ) { focus = [ focus ] ; } // If set, only add modules that belong on the focus path(s) if ( munit . isArray ( focus ) && focus . length ) { found = false ; focus . forEach ( function ( fpath ) { var fparts = fpath . split ( rpathsplit ) , i = - 1 , l = Math . min ( fparts . length , nsparts . length ) ; // Check that each namespace of the focus path // exists inside the modules path for ( ; ++ i < l ; ) { if ( fparts [ i ] !== nsparts [ i ] ) { return ; } } // Paths line up found = true ; } ) ; } return found ; }
Testing path to see if it exists in the focus option
Testing path to see if it exists in the focus option