资 源 简 介
J-Tree is a directory type structure for data, where you can list the keys and content of each "directory" by keys.
In project one find a lot of container classes with no logic beside getters and setters. All these different container classes could be replaced with one map to avoid OverClassification. This mostly lead to a situation, where one can"t see the wood for the trees.
Since one class can replace a lot of classes, this save a lot of coding and could be especially useful in prototyping.
Originally inspired by the hashes of hashes in perl (the logo with the duke with branches) I think the directory analogy is a simpler approach to show how JTreeMap works.
The actual version now has some unix style methods for getting, setting and structure the data map.
ls
cd
rm
read
insert
mkdir
rmdir
find
...
I pers
