DO

DON’T

Additional Info

Standard and Hashed internal table types.

Sorted internal table type.

Use a hashed table whenever many single record accesses are required for an internal table via a fully specified key.

READ on sorted standard table using ‘BINARY SEARCH’.

READ without BINARY SEARCH on a standard table forces sequential read.

Addition TRANSPORTING on READ and MODIFY

Reduces unwanted copy overheads.

Parallel Cursor

Nested Loop

Use Parallel cursor technique when implementing nested loops.

WHERE clause on internal table operations e.g.

LOOP, MODIFY, etc.

Use index operations like LOOP AT …FROM …TO and MODIFY …FROM …TO

DELETE WHERE in a LOOP.

Instead, mark for deletion using MODIFY in a LOOP. Perform mass delete using DELETE WHERE after the loop.

SORT inside a LOOP

Sort is an expensive ABAP statement. It should be use outside of a loop.

DELETE or SORT on a hashed table

Memory needed to maintain a hashed index increases.

Table pointers for MOVE, COMPARE and mass internal table operations

Operations such as itab1[] = itab2[]

Addition ASSIGNING for internal table modification and processing.

Use of ASSIGNING eliminates copy overhead.

Pass internal tables into subroutines by reference

Passing by value results in data and memory duplication.

Free internal tables

Free internal tables when they are not needed in the subsequent program steps.

Use assignment operator

Move Corresponding

Typed field symbols.

The runtime of a typed ASSIGN statement is around 40% less than that required for an equivalent untyped ASSIGN statement.