N-ary Tree with K-ary nodes
I have a tree structure representing several nodes with different types -
Here B and C - Object Type A
Children of B are B1, B2 and B3 - Object Type B
Children of C are C1, C2 and C3 - Object Type C
Children of B1 are B11, B22 and B33 - Object Type D
Similar I have N objects at each level representing a certain Object Type.
If I were push these nodes into a tree structure, because my objects are of different type, how I can sure, I push them in right sequence ?
I currently have my root class with a List of List of List of N List objects.
A
B C
B1 B2 B3 C1 C2 C3
B11 B22 B33
Here B and C - Object Type A
Children of B are B1, B2 and B3 - Object Type B
Children of C are C1, C2 and C3 - Object Type C
Children of B1 are B11, B22 and B33 - Object Type D
Similar I have N objects at each level representing a certain Object Type.
If I were push these nodes into a tree structure, because my objects are of different type, how I can sure, I push them in right sequence ?
I currently have my root class with a List of List of List of N List objects.
Do more with
EXPERT OFFICE® is a registered trademark of EXPERTS EXCHANGE®
Here B and C - Object Type A
Children of B are B1, B2 and B3 - Object Type B
Children of C are C1, C2 and C3 - Object Type C
So a type A object can have children of type B or type C
Can a type A object have children of both types?
how I can sure, I push them in right sequence ?
What makes a sequence right or not right?
Children of B are B1, B2 and B3 - Object Type B
Children of C are C1, C2 and C3 - Object Type C
So a type A object can have children of type B or type C
Can a type A object have children of both types?
how I can sure, I push them in right sequence ?
What makes a sequence right or not right?
Can a type A object have children of both types?
Yes
What makes a sequence right or not right?
It is just that I have to push them in the same order I mentioned above. Meaning, Root of my tree is of Type A and then push Type B and C and then D etc.
Yes
What makes a sequence right or not right?
It is just that I have to push them in the same order I mentioned above. Meaning, Root of my tree is of Type A and then push Type B and C and then D etc.
If I understand correctly what you're trying to do then I think you could use a class like this:
The idea is that this CheckedList takes a list of types that it will accept. So for the A list you could create a CheckedList with the classes B and C.
Then if you try to add something (like D) to a list that can't accept it (like A) it will throw an exception. Other than the add method, it will work just like an ordinary list.
You can build up the full tree using these CheckedLsts - initializing each layer with the appropriate types that layer would accept.
Doug
private static class CheckedList extends ArrayList<Object> {
private final List<Class> m_T ;
public CheckedList(List<Class> t) {
m_T = t ;
}
@Override
public boolean add(Object o) {
boolean isAllowed = false ;
for (Class c : m_T) {
if (c.isInstance(o))
isAllowed = true ;
}
if (!isAllowed)
throw new IllegalArgumentException("Object " + o + " is not of a valid type for this list") ;
return super.add(o) ;
}
}
The idea is that this CheckedList takes a list of types that it will accept. So for the A list you could create a CheckedList with the classes B and C.
Then if you try to add something (like D) to a list that can't accept it (like A) it will throw an exception. Other than the add method, it will work just like an ordinary list.
You can build up the full tree using these CheckedLsts - initializing each layer with the appropriate types that layer would accept.
Doug
Premium Content
You need an Expert Office subscription to comment.Start Free Trial