/*
 * Copyright (c) 1998-2011 Caucho Technology -- all rights reserved
 *
 * This file is part of Resin(R) Open Source
 *
 * Each copy or derived work must preserve the copyright notice and this
 * notice unmodified.
 *
 * Resin Open Source is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * Resin Open Source is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE, or any warranty
 * of NON-INFRINGEMENT.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Resin Open Source; if not, write to the
 *
 *   Free Software Foundation, Inc.
 *   59 Temple Place, Suite 330
 *   Boston, MA 02111-1307  USA
 *
 * @author Scott Ferguson
 */

package com.caucho.loader.enhancer;

import com.caucho.inject.Module;

/**
 * Interface for a scanned class.
 */
@Module
public class AbstractScanClass implements ScanClass {
  /**
   * Adds the superclass information to the scan class.
   */
  @Override
  public void addSuperClass(char[] buffer, int offset, int length)
  {
  }

  /**
   * Adds interface information to the scan class.
   */
  @Override
  public void addInterface(char[] buffer, int offset, int length)
  {
  }
  
  /**
   * Adds a class annotation
   */
  @Override
  public void addClassAnnotation(char [] buffer, int offset, int length)
  {
  }
  
  /**
   * Adds a pool string of the form "L...;" to test for annotations.
   */
  @Override
  public void addPoolString(char []buffer, int offset, int length)
  {
  }

  /**
   * Complete scan processing.
   */
  @Override
  public boolean finishScan()
  {
    return false;
  }
  
  protected final boolean isMatch(char []bufferA, int offset, int length,
                                  char []bufferB)
  {
    if (length != bufferB.length)
      return false;
    
    for (length--; length >= 0; length--) {
      if (bufferA[offset + length] != bufferB[length])
        return false;
    }
    
    return true;
  }
  
}