rem: while (m<fcl.length && fh_IsMatch(m,pr)) res.push(fcl[m++]); 
add: while (m<fcl.length && fh_IsMatch(m,pr)) res[res.length]=fcl[m++]; 
context: function fh_FindMatches(pr){    f=0;    l=fcl.length-1;    m=(f+l)>>1;    while(f<l) {        if (fcl[m]==pr) break;        if (fcl[m]<pr) f=m; else l=m;        nm=(f+l+1)>>1;        if (m==nm) break;        m=nm;    }    if (m&&fh_IsMatch(m-1,pr)) m--;    if (!fh_IsMatch(m,pr) && m<(fcl.length-1) && fh_IsMatch(m+1,pr)) m++;    res=new Array;    while (m<fcl.length && fh_IsMatch(m,pr)) res.push(fcl[m++]);    return res;}
meta: 8251	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/8251/9e35e26bb143f1f5499afec8dfadebb62d1d8ae8/originalafter.js/buggy/scripts/quickref/originalafter.js