The Sorcerer's Cave game Java

Posted on 2014-04-15
Last Modified: 2014-04-22
I am working on a program for one of my courses and am having difficulty with certain parts.  The Sorcerer’s Cave game:  Our goal with this project is to… First, implement a solid GUI interface to control and display the results of this program.  Read a text data file, instantiate appropriate classes, create an internal data structure (multi-tree), display the structure in a convincing way using a JTextArea, and finally to search the structure (by index name and type).
                I am having issues determining how to search my program.  I have my information stored in ArrayLists.  The point of this project is not to do the best possible way, but to build this program over the course of the semester.  In this project we are supposed to iterate through the arraylist to find the required information, a slow but effective method.  
What is the best way to implement this type of searching into my program?  Will I store the search text as a string and compare that string to each element of the array list(s)?  Would something like myList.indexOf(string) work for these purposes?  Where string is the user input search term.  Then I can use that index generated by indexOf to generate the searched items?  Any help will be greatly appreciated.
Question by:Autkast
  • 4
  • 2
  • 2
  • +2
LVL 75

Expert Comment

by:käµfm³d 👽
ID: 40002036
What is the best way to implement this type of searching into my program?
"Best" is subjective. What do *you* mean by "best"?

Author Comment

ID: 40002060
Ah good point.  The simplest method of implementing a search into this program using ArrayList would be a better description of what I'm asking.
LVL 75

Expert Comment

by:käµfm³d 👽
ID: 40002076
So are you maintaining multiple ArrayLists, one for each kind of datum? If so, are you correlating each element to its related information by way of its index within each ArrayList?
Industry Leaders: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

LVL 37

Accepted Solution

bbao earned 250 total points
ID: 40002090
What is the best way to implement this type of searching into my program?

> Read a text data file, instantiate appropriate classes, create an internal data structure (multi-tree)

i guess you actually already give the answer. :-)

if the data entries are only required to be searched in memory, you no need to worry about how to to store them in an external file. however, you do need to find a way to store data in a multi-tree. commonly this can be done by a modified Binary Tree though sometimes additional structure members are required for best describing the parents, brothers and children nodes.

Will I store the search text as a string and compare that string to each element of the array list(s)?

a tree can be stored in an array list, only if necessary.
LVL 27

Expert Comment

ID: 40002956
If you know what you want to search for (index name and type) then the fastest solution would be to build a HashMap as you build the multi-tree.

You'd have something like:

// A class I assume you'll create
MultiTree myMultiTree = new MultiTree() ;

Map<String, Object> mapByName = new HashMap<String, Object>() ;
Map<String, Object> mapByType = new HashMap<String, Object>() ;

Everytime you add a node to the tree, also add it to the HashMaps as well:

public void addToTree(Object node, String name, String type) {
   myMultiTree.add(node) ;
   mapByName.put(name, node) ;
   mapByType.put(type, node) ;

Then you can search by name or type:

public Object findByName(String name) {
   return mapByName.get(name) ;

public Object findByType(String name) {
   return mapByType.get(name) ;

If name and type aren't unique, then rather than storing a single value, you should store a list of values with that name or type.  Then to search you'd retrieve the list of matches.

A lookup from a HashMap is constant time - i.e. much faster than anything you'd write to search the multi tree.


Author Comment

ID: 40003062
Yes, I am maintaining multiple ArrayLists, party, members, treasure, and artifacts.  In my program to this point they are used very simply.  The data is read from the text file, based off a switch, the text line will be stored in a new ArrayList.  This information is then split inside of the method it calls into various information (index, name, etc.).  I am attaching some example code:

switch(line.charAt(0)) {
                        case 'P':
                        case 'p':

Open in new window

// adding parties
    void addParty(Scanner input) {
        String st = input.nextLine();
        cave.parties.add(new Party(st));
        jta.append(st + "\n");
    }  // end addParty

Open in new window

//  party constructor to use specified variables
    public Party(String input) {
        String newLine[] = input.split("\\s*:\\s*");
        // assign information to variable name and index
        index = Integer.parseInt(newLine[1]);
        name = newLine[2];
    }  // end party constructor

Open in new window


Author Comment

ID: 40003065
Unfortunately using a HashMap is in the next project.  This project uses ArrayLists, however once I complete this part this information will be invaluable, thank you.
LVL 35

Assisted Solution

mccarl earned 250 total points
ID: 40003187
Ok, so since your ArrayList is store a custom object (Party in the above code), then you won't be able to use indexOf() to search through the List. So the alternative is a little bit more manual work, something like this...
String searchTerm = "blah";
Party locatedParty = null;
for (Party party : cave.parties) {
    if (searchTerm.equals(party.getName()) {
        locatedParty = party;
if (locatedParty != null) {
    // It was found, do something with it

Open in new window

(Note: a few assumptions have been made about details that I was NOT able to get from your examples above, but it should give you the idea)

Author Closing Comment

ID: 40009066
Thank all of you for the assistance.  While reviewing the comments I had an epiphany that I was not using the ArrayLists to their fullest potential.  Once I redesigned how I was reading in the provided data the search solution became much more simple.  Basically I was not properly adding the creatures to the party or treasures/artifacts to the creatures.  I knew it was something obvious and right under my nose.
LVL 35

Expert Comment

ID: 40016479
Glad that you were able to get a solution! :)

Featured Post

Free Tool: IP Lookup

Get more info about an IP address or domain name, such as organization, abuse contacts and geolocation.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
Bot application - advice 3 58
VB.NET String Settings and Temp Folder Question 3 68
AvlTree-Node Data type 4 22
junit example issue 2 22
Since upgrading to Office 2013 or higher installing the Smart Indenter addin will fail. This article will explain how to install it so it will work regardless of the Office version installed.
In this post we will learn different types of Android Layout and some basics of an Android App.
In this fifth video of the Xpdf series, we discuss and demonstrate the PDFdetach utility, which is able to list and, more importantly, extract attachments that are embedded in PDF files. It does this via a command line interface, making it suitable …
With the power of JIRA, there's an unlimited number of ways you can customize it, use it and benefit from it. With that in mind, there's bound to be things that I wasn't able to cover in this course. With this summary we'll look at some places to go…

685 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question