CloneSet551

plugins/org.eclipse.jdt.apt.core/src/org/eclipse/jdt/apt/core/internal/env/EnvUtil.java

plugins/org.eclipse.jdt.apt.core/src/org/eclipse/jdt/apt/core/internal/util/Visitors.java

        public void preVisit(ASTNode node)
        {
                final int startingOffset = node.getStartPosition();
                final int endingOffset = startingOffset + node.getLength();
                // starting offset is inclusive
                int startIndex = Arrays.binarySearch(_sortedStartingOffset, startingOffset);
                // ending offset is exclusive
                int endIndex = Arrays.binarySearch(_sortedStartingOffset, endingOffset);
                if (startIndex < 0)
                        startIndex = - startIndex - 1;
                if (endIndex < 0)
                        endIndex = - endIndex - 1;
                else
                        // endIndex needs to be exclusive and we want to 
                        // include the 'endIndex'th entry in our computation.
                        endIndex++;
                if (startIndex >= _sortedStartingOffset.length)
                        return;

                for (int i = startIndex; i < endIndex; i++) {
                        if (_endingOffsets[i] == 0)
                                _endingOffsets[i] = endingOffset;
                        else if (endingOffset < _endingOffsets[i])
                                _endingOffsets[i] = endingOffset;
                }
        }


        public int getEndingOffset( final int startingOffset)
        {
                int index = Arrays.binarySearch(_sortedStartingOffset, startingOffset);
                if (index == -1)  return 0;
                return _endingOffsets[index];
        }

        public void preVisit(ASTNode node)
        {
                final int startingOffset = node.getStartPosition();
                final int endingOffset = startingOffset + node.getLength();
                // starting offset is inclusive
                int startIndex = Arrays.binarySearch(_sortedStartingOffset, startingOffset);
                // ending offset is exclusive
                int endIndex = Arrays.binarySearch(_sortedStartingOffset, endingOffset);
                if (startIndex < 0)
                        startIndex = - startIndex - 1;
                if (endIndex < 0)
                        endIndex = - endIndex - 1;
                else
                        // endIndex needs to be exclusive and we want to 
                        // include the 'endIndex'th entry in our computation.
                        endIndex++;
                if (startIndex >= _sortedStartingOffset.length)
                        return;

                for (int i = startIndex; i < endIndex; i++) {
                        if (_endingOffsets[i] == 0)
                                _endingOffsets[i] = endingOffset;
                        else if (endingOffset < _endingOffsets[i])
                                _endingOffsets[i] = endingOffset;
                }
        }


        public int getEndingOffset( final int startingOffset)
        {
                int index = Arrays.binarySearch(_sortedStartingOffset, startingOffset);
                if (index == -1)  return 0;
                return _endingOffsets[index];
        }

public void preVisit(ASTNode node) {
  final int startingOffset = node.getStartPosition();
  final int endingOffset = startingOffset + node.getLength();
  // starting offset is inclusive
  int startIndex = Arrays.binarySearch(_sortedStartingOffset, startingOffset);
  // ending offset is exclusive
  int endIndex = Arrays.binarySearch(_sortedStartingOffset, endingOffset);
  if (startIndex < 0)
    startIndex = -startIndex - 1;
  if (endIndex < 0)
    endIndex = -endIndex - 1;
  else
    // endIndex needs to be exclusive and we want to 
    // include the 'endIndex'th entry in our computation.
    endIndex++;
  if (startIndex >= _sortedStartingOffset.length)
    return;
  for (int i = startIndex; i < endIndex; i++) {
    if (_endingOffsets[i] == 0)
      _endingOffsets[i] = endingOffset;
    else
      if (endingOffset < _endingOffsets[i])
        _endingOffsets[i] = endingOffset;
  }
}

public int getEndingOffset( final int startingOffset) {
  int index = Arrays.binarySearch(_sortedStartingOffset, startingOffset);
  if (index == -1)
    return 0;
  return _endingOffsets[index];
}