/*
 * The Apache Software License, Version 1.1
 *
 * Copyright (c) 2001 The Apache Software Foundation.  All rights
 * reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 *
 * 3. The end-user documentation included with the redistribution, if
 *    any, must include the following acknowlegement:
 *       "This product includes software developed by the
 *        Apache Software Foundation (http://www.apache.org/)."
 *    Alternately, this acknowlegement may appear in the software itself,
 *    if and wherever such third-party acknowlegements normally appear.
 *
 * 4. The names "The Jakarta Project", "Ant", and "Apache Software
 *    Foundation" must not be used to endorse or promote products derived
 *    from this software without prior written permission. For written
 *    permission, please contact apache@apache.org.
 *
 * 5. Products derived from this software may not be called "Apache"
 *    nor may "Apache" appear in their names without prior written
 *    permission of the Apache Group.
 *
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * ====================================================================
 *
 * This software consists of voluntary contributions made by many
 * individuals on behalf of the Apache Software Foundation.  For more
 * information on the Apache Software Foundation, please see
 * <http://www.apache.org/>.
 */
package org.apache.tools.ant.taskdefs.optional.sitraka.bytecode;

import java.io.*;

import org.apache.tools.ant.taskdefs.optional.depend.constantpool.ConstantPool;
import org.apache.tools.ant.taskdefs.optional.depend.constantpool.Utf8CPInfo;

/**
 * A list of method_info structures.
 *
 * @author <a href="sbailliez@imediation.com">Stephane Bailliez</a>
 */
public class MethodInfoList {
	/** pool containing all the information */
	protected ConstantPool constantPool;
	
	/** methods in this list */
	protected MethodInfo[] methods;
	
	
	public MethodInfoList(ConstantPool pool){
		constantPool = pool;
	}
	
	/** read the bytecode from the stream */
	public void read(DataInputStream dis) throws IOException {
		int count = dis.readShort();
		methods = new MethodInfo[count];
		for (int i = 0; i < count; i++){
			methods[i] = new MethodInfo(constantPool);
			methods[i].read(dis);
		}
	}
	
	/** the size of the list */
	public int length(){
		return methods.length;
	}
	
	/**
	 * get a method in the list.
	 * @param i the index of the method to retrieve
	 * @return the method matching the index.
	 */
	public MethodInfo getMethod(int i){
		return methods[i];
	}
	
	/**
	 * return the set of methods in this list. Mostly as a debugging purpose.
	 */
	public String toString(){
		StringBuffer sb = new StringBuffer();
		sb.append("Methods: ").append(methods.length).append("\n");
		for (int i = 0; i < methods.length; i++){
			sb.append("\t");
			sb.append(getMethod(i).toString());
			sb.append("\n");
		}
		return sb.toString();
	}
	
}