18395337. Space- And Time-Efficient Enumerations simplified abstract (Oracle International Corporation)
Contents
- 1 Space- And Time-Efficient Enumerations
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 Space- And Time-Efficient Enumerations - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
Space- And Time-Efficient Enumerations
Organization Name
Oracle International Corporation
Inventor(s)
Mario Wolczko of San Jose CA (US)
Space- And Time-Efficient Enumerations - A simplified explanation of the abstract
This abstract first appeared for US patent application 18395337 titled 'Space- And Time-Efficient Enumerations
Simplified Explanation
The abstract describes a system for implementing space- and time-efficient enumerations in computer programs. Here is a simplified explanation of the abstract:
- An enumeration class with multiple constant values can be created.
- Objects corresponding to each enumeration value are stored in memory.
- A lookup table indexed by ordinal values of the enumerations is used to store references to the objects.
- Ordinal values of enumerations can be stored in memory locations.
- When needed, the ordinal value can be converted to a reference to the corresponding object by using the lookup table.
Potential Applications
This technology could be applied in various software systems where efficient enumeration handling is required, such as in programming languages, database systems, and game development.
Problems Solved
1. Efficient storage and retrieval of enumeration values and corresponding objects. 2. Simplifying the process of converting ordinal values to object references.
Benefits
1. Reduced memory usage. 2. Faster retrieval of object references. 3. Improved code readability and maintainability.
Potential Commercial Applications
"Efficient Enumeration Implementation in Software Systems" could find applications in industries such as software development, data management, and gaming, where optimized memory usage and fast data retrieval are crucial for performance.
Possible Prior Art
One possible prior art could be the use of hash tables or arrays to store enumeration values and corresponding objects in software systems. However, the specific approach described in the patent application may offer improvements in terms of efficiency and speed.
Unanswered Questions
How does this technology compare to existing methods of handling enumerations in terms of performance and memory usage?
This article provides an overview of the technology for implementing efficient enumerations but does not directly compare it to existing methods.
Are there any potential drawbacks or limitations to using this system for handling enumerations in software development?
While the benefits of this technology are highlighted, it would be useful to explore any potential drawbacks or limitations that users may encounter when implementing this system.
Original Abstract Submitted
Systems, computer instructions and computer-implemented methods are disclosed for implementing space- and time-efficient enumerations. An instance of an enumeration class may be created with a constant, plurality of enumerations. A plurality of objects corresponding to the respective enumerations may be stored in memory along with a lookup table indexed by respective ordinal values of the plurality of enumerations, the lookup table including respective references to the stored objects of the instantiated enumeration class. A reference to an enumeration may be stored in a memory location by storing an ordinal value of the enumeration. A determination may then be made to convert a stored ordinal value to a reference to an object, and responsive to the determination, the ordinal value may be loaded and used as an index into the lookup table to obtain the reference to the object corresponding to the enumeration.
