Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Implement a MyArrayList method named contains(). The contains method should take an argument of AnyType, and return an integer indicating whether or not the argument

Implement a MyArrayList method named contains(). The contains method should take an argument of AnyType, and return an integer indicating whether or not the argument is contained in the array field of the MyArrayList.

If the item is not found in the array, return -1. If it is, return the index of the element within the array.

package javaapplication1;

public class MyArrayList implements Iterable { private static final int DEFAULT_CAPACITY = 10; private int theSize; private AnyType [ ] theItems; public MyArrayList() { doClear( ); } public void clear( ) { doClear( ); } public void doClear( ) { theSize = 0; ensureCapacity( DEFAULT_CAPACITY ); } public int size( ) { return theSize; } public boolean isEmpty( ) { return size( ) == 0; } public void trimToSize( ) { ensureCapacity( size( )); } public AnyType get( int idx ) { if( idx < 0 || idx >= size( )) throw new ArrayIndexOutOfBoundsException( ); return theItems[ idx ]; }

public AnyType set( int idx, AnyType newVal ) { if( idx < 0 || idx >= size( )) throw new ArrayIndexOutOfBoundsException( ); AnyType old = theItems[ idx ]; theItems[ idx ] = newVal; return old; } public void ensureCapacity( int newCapacity ) { if( newCapacity < theSize ) return; AnyType [ ] old = theItems; theItems = (AnyType[ ]) new Object[ newCapacity ]; for(int i = 0; i < size( ); i++ ) theItems[ i ] = old[ i ]; } public boolean add( AnyType x ) { add( size( ), x ); return true; } public void add( int idx, AnyType x ) { if( theItems.length == size( )) ensureCapacity( size( ) * 2 + 1 ); for( int i = theSize; i > idx; i-- ) theItems[ i ] = theItems[ i - 1 ]; theItems[ idx ] = x; theSize++; } public AnyType remove( int idx ) { AnyType removedItem = theItems[ idx ]; for( int i = idx; i < size( ) -1; i++ ) theItems[ i ] = theItems[ i + 1 ]; theSize--; return removedItem; } public java.util.Iterator iterator( ) { return new ArrayListIterator( ); } private class ArrayListIterator implements java.util.Iterator { private int current = 0; public boolean hasNext( ) { return current < size( ); } public AnyType next( ) { if( !hasNext( )) throw new java.util.NoSuchElementException( ); return theItems[ current++ ]; } public void remove( ) { MyArrayList.this.remove( --current ); } } public int contains(AnyType x){ } }

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Professional Microsoft SQL Server 2014 Integration Services

Authors: Brian Knight, Devin Knight

1st Edition

1118850904, 9781118850909

More Books

Students also viewed these Databases questions

Question

Has the priority order been provided by someone else?

Answered: 1 week ago

Question

Compare the current team to the ideal team.

Answered: 1 week ago

Question

Are the rules readily available?

Answered: 1 week ago