comefrom: <awangdev>[lint]. Heapify_2.java
code: public void heapify(int[] A) {
      	if (A == null || A.length == 0) {
      		return;
      	}
      	int child = 0;
      	int currId = 0;
      	int leftId = 0;
      	int rightId = 0;
      	int n = A.length;
      	for (int i = n/2 - 1; i >= 0; i--) {
      		currId = i;
      		while (currId * 2 + 1 < n) {
      			leftId = currId * 2 + 1;
      			rightId = currId * 2 + 2;
      			if (rightId >= n || A[leftId] <= A[rightId]) {
      				child = leftId;
      			} else {
      				child = rightId;
      			}
      			if (A[currId] <= A[child]) {
      				break;
      			} else {
      				int temp = A[currId];
      				A[currId] = A[child];
      				A[child] = temp;
      			}
      			currId = child;
      		}
  
      	}
      }
masked: public void var_0 ( int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return ;
    }
    int var_2 = 0 ;
    int var_3 = 0 ;
    int var_4 = 0 ;
    int var_5 = 0 ;
    int var_6 = var_1 . length ;
    for ( int var_7 = var_6 / 2 - 1 ;
    var_7 >= 0 ;
    var_7 -- ) {
      var_3 = var_7 ;
      while ( var_3 * 2 + 1 < var_6 ) {
        var_4 = var_3 * 2 + 1 ;
        var_5 = var_3 * 2 + 2 ;
        if ( var_5 >= var_6 || var_1 [ var_4 ] <= var_1 [ var_5 ] ) {
          var_2 = var_4 ;
        }
        else {
          var_2 = var_5 ;
        }
        if ( var_1 [ var_3 ] <= var_1 [ var_2 ] ) {
          break ;
        }
        else {
          int var_8 = var_1 [ var_3 ] ;
          var_1 [ var_3 ] = var_1 [ var_2 ] ;
          var_1 [ var_2 ] = var_8 ;
        }
        var_3 = var_2 ;
      }
    }
  }
  