Java data structure question

Question

I was wondering what would be the best data structure(s) to use for the following scenario:

I have 2 object types A and B

A may contain many instances of B

A.name is unique. B.name is unique within it's instance of A (though not globally unique)

I would like to be able to provide accessor methods such as getA(String aName) returns a; getB(String aName, bName) returns b;

All help is much appreciated,

Chris

Answer 1

It sounds like you need something like this (except with better names, initialization, error handling etc - this is just a skeleton):

public class AContainer
{
    private Map<String, A> map;

    public A getA(String name)
    {
        return map.get(name);
    }

    public B getB(String nameA, String nameB)
    {
        return getA(nameA).getB(nameB);
    }
}

public class A
{
    private Map<String, B> map;

    public B getB(String name)
    {
        return map.get(name);
    }
}

Answer 2

public class DataStructure{
      private Map<String, A> aMap = new HashMap<String, A>();
      public getA(String name){
          return aMap.get(name);
      }
      public getB(String aName, String bName){
          A anA = getA(aName);
          if(null != anA){
              return anA.getB(bName);
          }else{ 
              return null;
          }
    }
}
public class A{
    String name;
    Map<String, B> myBs = new HashMap<String, B>();
    public A(String name){
        this.name = name;
    }
    public void putB(B foo){
        myBs.put(foo.getName(), foo);
    }
    public B getB(String bName){
        return myBs.get(bName);
    }

 }


public class B{
    String name;
    public B(String name){
        this.name=name;
    }
}