private int findInsertionPoint(SortedListEntry entry){
  int insertionPoint=sortedModel.size();
  if (sortOrder != SortOrder.UNORDERED) {
    insertionPoint=Collections.binarySearch((List)sortedModel,entry);
    if (insertionPoint < 0) {
      insertionPoint=-(insertionPoint + 1);
    }
  }
  return insertionPoint;
}

private int findInsertionPoint ( SortedListEntry entry ) { int insertionPoint = sortedModel . size ( ) ; if ( sortOrder != SortOrder . UNORDERED ) { insertionPoint = Collections . binarySearch ( ( List ) sortedModel , entry ) ; if ( insertionPoint < 0 ) { insertionPoint = - ( insertionPoint + 1 ) ; } } return insertionPoint ; }
internal helper method to find the insertion point for a new entry in the sorted model .
