Count all occurences of a number in ascending array of integers

binArrSearch.js

var binarysearch = function(number, ascendingIntegers) {
  var current, end = ascendingIntegers.length, middle, count = 0;  
  for(current = 0; current < end; current++) {
      middle = (current + end) / 2 | 0;
      if(ascendingIntegers[middle] < number) 
        current = middle;
      else if(ascendingIntegers[middle] > number) 
        end = middle;
      if(ascendingIntegers[current] === number) 
        count++;
  }
  return count;
};