add: } return h; }else{ for(var i=n;i<arr.length&&arr[i]<str;i++){ } } return i; } 
context: function AMposition(arr, str, n) { // return position >=n where str appears or would be inserted// assumes arr is sorted  if (n==0) {    var h,m;    n = -1;    h = arr.length;    while (n+1<h) {      m = (n+h) >> 1;      if (arr[m]<str) n = m; else h = m;    }    return h;  } else    for (var i=n; i<arr.length && arr[i]<str; i++);  return i; // i=arr.length || arr[i]>=str}
meta: 6015	/local1/tlutelli/issta_data/temp/all_js/javascript/2007_temp/2007/6015/d8776708e0e10dfa0ab6ee1d0fa9e512d8d16348/ASCIIMathML.js/clean/packages/acs-templating/www/resources/xinha-nightly/plugins/Equation/ASCIIMathML.js