Sorted Table
These tables are sorted by specific non-unique keys.If these keys are used, the read from the tables are faster.
Sample Declaration:
TYPES:
BEGIN OF IT_VBRK,
VBELN LIKE VBRK-VBELN,
FKART LIKE VBRK-FKART,
END OF IT_VBRK.
DATA : IT_SORTED_VBRK TYPE SORTED TABLE OF IT_VBRK
WITH NON-UNIQUE KEY FKART.
Hashed Table
These tables are very useful for programming exits in BI.It is managed with an internal hash procedure. You can imagine a hashed table as a set, whose elements you can address using their unique key. Unlike standard and sorted tables, you cannot access hash tables using an index. All entries in the table must have a unique key which is stores in the table definition.
Sample Declaration:
TYPES:
BEGIN OF IT_VBRK,
VBELN LIKE VBRK-VBELN,
FKART LIKE VBRK-FKART,
END OF IT_VBRK.
DATA : IT_HASHED_VBRK TYPE HASHED TABLE OF IT_VBRK
WITH UNIQUE KEY VBELN.
Standard Tables
These tables are not restricted with respect to sorting or reading access with respect to keys.
Sample Declaration:
TYPES:
BEGIN OF IT_VBRK,
VBELN LIKE VBRK-VBELN,
FKART LIKE VBRK-FKART,
END OF IT_VBRK.
DATA : IT_STANDARD_VBRK TYPE STANDARD TABLE OF IT_VBRK.
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/768773/viewspace-624407/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/768773/viewspace-624407/