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 [2019/08/26 09:37] admin |
jvx:common:util:classes [2020/07/28 09:51] (current) cduncan [Hashtable With Automatic List Management] |
||
|---|---|---|---|
| Line 9: | Line 9: | ||
| An XML parser is required to read XML files. Various frameworks exist that allow reading and saving of XML files. However, accessing the individual elements is often solved tediously using object trees. | An XML parser is required to read XML files. Various frameworks exist that allow reading and saving of XML files. However, accessing the individual elements is often solved tediously using object trees. | ||
| - | JVx contains the classes XmlWorker and XmlNode which allow direct access to tags. In addition, attributes can be accessed like sub tags. Performance and memory use are also very low. | + | JVx contains the classes XmlWorker and XmlNode, which allow direct access to tags. In addition, attributes can be accessed like sub tags. Performance and memory use are also very low. |
| - | In the following example we read an XML file, change a Sub Tag and save the result as a new XML file: | + | In the following example, we read an XML file, change a sub tag, and save the result as a new XML file: |
| <file java> | <file java> | ||
| 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 ==== |
| - | Array operations are always tedious coding work, and every developer could easily do without it. Removing a single element from an array is not rocket science, but there is no standard function available for this task. And who would not like to search an array for an element without coding a loop? | + | Array operations are always tedious coding work, and every developer could easily do without. Removing a single element from an array is not rocket science, but there is no standard function available for this task. And who would not like to search an array for an element without coding a loop? |
| With ArrayUtil significant array operations were implemented, which also fully include the list interface. We gain performance compared to standard lists as an added benefit. | With ArrayUtil significant array operations were implemented, which also fully include the list interface. We gain performance compared to standard lists as an added benefit. | ||
| 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 ==== | ||
| - | The Standard Hashtable manages its keys in an undefined order. Sometimes it can be useful to keep the order in which the data was added. | + | The standard hashtable manages its keys in an undefined order. Sometimes it can be useful to keep the order in which the data was added. |
| This is handled by the OrderedHashtable. | This is handled by the OrderedHashtable. | ||
| - | ==== 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 52: | Line 52: | ||
| ==== Reflective === | ==== Reflective === | ||
| - | 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 ==== |
| There are many other interesting utility classes, such as StringUtil, BeanUtil, DateUtil, FileUtil, ImageUtil, ... | There are many other interesting utility classes, such as StringUtil, BeanUtil, DateUtil, FileUtil, ImageUtil, ... | ||
| Additional information can be found in [[https://www.sibvisions.com/files/jvx/current/api/|javadoc]]. | Additional information can be found in [[https://www.sibvisions.com/files/jvx/current/api/|javadoc]]. | ||