bartleby

Concept explainers

bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 7, Problem 14E

Explanation of Solution

Modified class for “OneWayNoRepeatsList.java”

//Define "OneWayNoRepeatsList" class

public class OneWayNoRepeatsList

{

  //Declare required variables

  public static int START_POSITION = 1;

  public static int DEFAULT_SIZE = 50;

//entry.length is the total number of items you have room

//for on the list (its capacity); countOfEntries is the number of 

  //items currently on the list.

private int countOfEntries; //can be less than entry.length.

    private String[] entry;

  /**

    Creates an empty list with a given capacity

    */

    public OneWayNoRepeatsList(int maximumNumberOfEntries)

    {

        //Add "1" to the maximum number of entries

        entry = new String[maximumNumberOfEntries + 1];

        //Assign count of entries to "0"

        countOfEntries = 0;

    }

    /**

    Creates an empty list with a capacity of DEFAULT_SIZE.

    */

    public OneWayNoRepeatsList()

    {

        //Add "1" to "DEFAULT_SIZE"

        entry = new String[DEFAULT_SIZE + 1];

        countOfEntries = 0;

// or replace these two statements with this(DEFAULT_SIZE);

    }

    //Method definition for "isFull"

    public boolean isFull()

    {

/* Returns "true" if the total number of entries equal to one less than the size of entry. Otherwise, returns "false". */

        return countOfEntries == entry.length - 1;

    }

    //Method definition for "isEmpty"

    public boolean isEmpty()

    {

        return countOfEntries == 0;

    }

    /**

    Precondition: List is not full.

    Postcondition: If item was not on the list,

    it has been added to the list.

    */

    public void addItem(String item)

    {

        if (!isOnList(item))

        {

            if (countOfEntries == entry.length - 1)

            {

System.out.println("Attempt to add to a full list!");

                System.exit(0);

            }

            else

            {

/* Here the value of entry start from 1 that is entry[1]. Hence it ignores entry[0] */

                entry[countOfEntries + 1] = item;

                //Increment the count of entries value

                countOfEntries++;

            }

        }

        //else do nothing. Item is already on the list.

    }

    /**

    If the argument indicates a position on the list,

    the entry at that specified position is returned;

    otherwise, null is returned.

    */

    public String getEntryAt(int position)

    {

        String result = null;

        /* Here the index of position start from "1".

If the value of "position" satisfy the given condition, then returns the value at given index. Otherwise returns "null" */

if ((1 <= position) && (position <= countOfEntries))

            result = entry[position];

        return result;

    }

    /**

    Returns true if position indicates the last item

    on the list; otherwise, returns false...

Blurred answer
Students have asked these similar questions
2. Perform resource allocation for the following project. Resource limits are 6 labors and 2 helpers. Legend: Activity Dur Resources G H 2 3 2L 1H 2L OH A 1 3L 1H + B D F J K 3 4 6 2 4 4L 2H 3L OH 4L 1H 2L 2H 4L 2H C E 2 2 I 1 2L 1H 3L 1H 5L 1H
Need Java method please. Thank you.
Need Java method please. Thank you.

Chapter 7 Solutions

Java: An Introduction To Problem Solving And Programming Plus Mylab Programming With Pearson Etext -- Access Card Package (8th Edition)

Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
9.1: What is an Array? - Processing Tutorial; Author: The Coding Train;https://www.youtube.com/watch?v=NptnmWvkbTw;License: Standard Youtube License