Trace:
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
jvx:common:util:classes [2020/06/29 13:56] cduncan [Working With Arrays] |
jvx:common:util:classes [2020/07/28 09:51] (current) cduncan [Hashtable With Automatic List Management] |
||
|---|---|---|---|
| Line 23: | Line 23: | ||
| </file> | </file> | ||
| - | More details about [[jvx:common:util:xml|XML Handling]]. | + | Find more details about [[jvx:common:util:xml|XML Handling]]. |
| ==== Working With Arrays ==== | ==== Working With Arrays ==== | ||
| Line 34: | Line 34: | ||
| From time to time objects have to be cached and exchanged between various instances. Parameters and public methods are very useful for this purpose, but we do not always want to pass an object on across countless instances to the target. Also, the required objects are not always located in the same scope. | From time to time objects have to be cached and exchanged between various instances. Parameters and public methods are very useful for this purpose, but we do not always want to pass an object on across countless instances to the target. Also, the required objects are not always located in the same scope. | ||
| - | This is what the ObjectCache is for, which handles objects statically, for certain time periods or permanently, within a VM. | + | This is what the ObjectCache is for: to handle objects statically, for certain time periods or permanently, within a VM. |
| - | This can be compared to a static hash table, complement by a timeout. | + | This can be compared to a static hash table complemented by a timeout. |
| ==== Ordered Hashtable ==== | ==== Ordered Hashtable ==== | ||
| Line 46: | Line 46: | ||
| ==== Hashtable With Automatic List Management ==== | ==== Hashtable With Automatic List Management ==== | ||
| - | The standard hashtable manages exactly one value per key. However, often more than one value per key has to be stored. In this case, a list has to be used as a value, in which a number of individual values are saved. This is not particularly difficult but a tedious and boring task. | + | The standard hashtable manages exactly one value per key. However, often more than one value per key has to be stored. In this case, a list has to be used as a value in which a number of individual values are saved. This is not particularly difficult but a tedious and boring task nonetheless. |
| The KeyValueList handles the administration of lists and leaves the developer time for more important tasks. | The KeyValueList handles the administration of lists and leaves the developer time for more important tasks. | ||
| Line 54: | Line 54: | ||
| The reflective class allows you to create class instances or call methods via reflection but without directly using ''java.lang.reflect''. | The reflective class allows you to create class instances or call methods via reflection but without directly using ''java.lang.reflect''. | ||
| - | More details, see [[jvx:common:util:reflective|here]]. | + | For more details, look [[jvx:common:util:reflective|here]]. |
| ==== More Classes ==== | ==== More Classes ==== | ||