content: /*
   * Copyright 2016 HuntBugs contributors
   * 
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   * 
   *     http://www.apache.org/licenses/LICENSE-2.0
   * 
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  package one.util.huntbugs.testdata;
  
  import one.util.huntbugs.registry.anno.AssertNoWarning;
  import one.util.huntbugs.registry.anno.AssertWarning;
  
  /**
   * @author Tagir Valeev
   *
   */
  public class TestAverageComputation {
      @AssertWarning("AverageComputationCouldOverflow")
      static int bsearch(int[] a, int low, int high, int key) {
          while (low <= high) {
              int mid = (low + high) >> 1;
              int midVal = a[mid];
  
              if (midVal < key)
                  low = mid + 1;
              else if (midVal > key)
                  high = mid - 1;
              else
                  return mid;
          }
          return -1;
      }
  
      @AssertWarning("AverageComputationCouldOverflow")
      static int bsearch2(int[] a, int low, int high, int key) {
          while (low <= high) {
              int mid = (low + high) / 2;
              int midVal = a[mid];
  
              if (midVal < key)
                  low = mid + 1;
              else if (midVal > key)
                  high = mid - 1;
              else
                  return mid;
          }
          return -1;
      }
  
      @AssertNoWarning("AverageComputationCouldOverflow")
      static int bsearchOk(int[] a, int low, int high, int key) {
          while (low <= high) {
              int mid = (low + high) >>> 1;
              int midVal = a[mid];
  
              if (midVal < key)
                  low = mid + 1;
              else if (midVal > key)
                  high = mid - 1;
              else
                  return mid;
          }
          return -1;
      }
  
  }
  