Go Premium for a chance to win a PS4. Enter to Win

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 1122
  • Last Modified:

The Sorcerer's Cave game Java

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.
0
Autkast
Asked:
Autkast
  • 4
  • 2
  • 2
  • +2
2 Solutions
 
käµfm³d 👽Commented:
What is the best way to implement this type of searching into my program?
"Best" is subjective. What do *you* mean by "best"?
0
 
AutkastAuthor Commented:
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.
0
 
käµfm³d 👽Commented:
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?
0
Concerto Cloud for Software Providers & ISVs

Can Concerto Cloud Services help you focus on evolving your application offerings, while delivering the best cloud experience to your customers? From DevOps to revenue models and customer support, the answer is yes!

Learn how Concerto can help you.

 
bbaoIT ConsultantCommented:
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.
0
 
dpearsonCommented:
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.

Doug
0
 
AutkastAuthor Commented:
@kaufmed:
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':
                            addParty(sLine);
                            break;

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];
        
        System.out.println(toString());
    }  // end party constructor

Open in new window

0
 
AutkastAuthor Commented:
@dpearson:
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.
0
 
mccarlIT Business Systems Analyst / Software DeveloperCommented:
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;
        break;
    }
}
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)
0
 
AutkastAuthor Commented:
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.
0
 
mccarlIT Business Systems Analyst / Software DeveloperCommented:
Glad that you were able to get a solution! :)
0

Featured Post

Concerto Cloud for Software Providers & ISVs

Can Concerto Cloud Services help you focus on evolving your application offerings, while delivering the best cloud experience to your customers? From DevOps to revenue models and customer support, the answer is yes!

Learn how Concerto can help you.

  • 4
  • 2
  • 2
  • +2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now