Hashed tables - This is the most appropriate type for any table where the main operation is KEY access. You cannot access a hashed table USING its index. The response time for key access remains constant, regardless of the number of table entries. LIKE database tables, hashed tables always have a unique key. Hashed tables are useful if you want to construct and use an internal table, which resembles a database table or for processing large amounts of data.
SAMPLE PROG: THIS DOES NOTHING.
REPORT Z_1 .
TABLES: MARA.
DATA: I TYPE HASHED TABLE OF MARA WITH UNIQUE KEY MATNR.

Hashed tables - This is the most appropriate type for any table where the main operation is key access. You cannot access a hashed table using its index. The response time for key access remains constant, regardless of the number of table entries. Like database tables, hashed tables always have a unique key. Hashed tables are useful if you want to construct and use an internal table, which resembles a database table or for processing large amounts of data.
SAMPLE PROG: THIS DOES NOTHING.
REPORT Z_1 .
TABLES: MARA.
DATA: I TYPE HASHED TABLE OF MARA WITH UNIQUE KEY MATNR.