Diference between DATA: and TYPES: on internal tables

Hi people,
Can somebody help me. I wanna know whats the diference between DATA: and TYPES: on internal tables
and whitch has the best performance, here is a eg:
DATA: BEGIN OF ti_sbook occurs 0,
          carrid   LIKE sbook-carrid,
          fldate   LIKE sbook-fldate,
          customid LIKE sbook-customid,
          loccuram LIKE sbook-loccuram,
       END OF ti_sbook.
AND
TYPES: BEGIN OF ti_sbook ,
          carrid   LIKE sbook-carrid,
          fldate   LIKE sbook-fldate,
          customid LIKE sbook-customid,
          loccuram LIKE sbook-loccuram,
       END OF ti_sbook.
DATA: gw_sbook       TYPE TABLE OF ti_sbook,
gs_sbook       TYPE ti_sbook.
witch of both types is better?
thanks.

Hi Marcelo,
For compatibility matters is better to create internal tables with a work area separately. So yes it's better to use types. When you work with Object Oriented coding you will need to use internal tables defined with types. Also when defining tables with types is the new way of coding, the another coding is getting obsolete defined by SAP. That's why when working in ABAP with OO (Object Oriented) code you'll have to define tables with types and not the other way.
Hope it helps.
Regards,
Gilberto Li

Similar Messages

Whats basic difference between data and types while declearing the itab

whats basic difference between data and types while declearing the internal tables...
DATA : BEGIN OF t_vbap OCCURS 0,
vbeln1 LIKE vbap-vbeln,
posnr LIKE vbap-posnr,
kwmeng LIKE vbap-kwmeng,
netpr LIKE vbap-netpr,
netwr LIKE vbap-netwr,
werks LIKE vbap-werks,
matnr LIKE vbap-matnr,
arktx LIKE vbap-arktx,
   END OF t_vbap.
vs
   TYPES : BEGIN OF t_vbap,
vbeln1 LIKE vbap-vbeln,
posnr LIKE vbap-posnr,
kwmeng LIKE vbap-kwmeng,
netpr LIKE vbap-netpr,
netwr LIKE vbap-netwr,
werks LIKE vbap-werks,
matnr LIKE vbap-matnr,
arktx LIKE vbap-arktx,
   END OF t_vbap.
and vs
TYPES : BEGIN OF t_vbap,
vbeln1 LIKE vbeln,
posnr LIKE posnr,
kwmeng LIKE kwmeng,
netpr LIKE netpr,
netwr LIKE netwr,
werks LIKE werks,
matnr LIKE matnr,
arktx LIKE arktx,
   END OF t_vbap.

hi,
like -> used for refering existing data elements in data dictionary or in sap
type -> used for refering existing data types in sap.
types: used for creating used defined structure of tables which has fields from more tahn one table.
diff b/w types and type in creation of internal tables is that when u create a table with types then u can use same for work area creation also.
ex:
TYPES : BEGIN OF t_vbap,
vbeln1 LIKE vbeln,
posnr LIKE posnr,
kwmeng LIKE kwmeng,
netpr LIKE netpr,
netwr LIKE netwr,
werks LIKE werks,
matnr LIKE matnr,
arktx LIKE arktx,
END OF t_vbap.
data: itab1 type t_vbap
        wa_itab1 type t_vbap.
when type is used then u have to create a defintion of work area for another time when internal table doesnt have headr line as
ex:
DATA : BEGIN OF t_vbap OCCURS 0,
vbeln1 LIKE vbap-vbeln,
posnr LIKE vbap-posnr,
kwmeng LIKE vbap-kwmeng,
netpr LIKE vbap-netpr,
netwr LIKE vbap-netwr,
werks LIKE vbap-werks,
matnr LIKE vbap-matnr,
arktx LIKE vbap-arktx,
END OF t_vbap.
DATA : BEGIN OF wa_vbap,
vbeln1 LIKE vbap-vbeln,
posnr LIKE vbap-posnr,
kwmeng LIKE vbap-kwmeng,
netpr LIKE vbap-netpr,
netwr LIKE vbap-netwr,
werks LIKE vbap-werks,
matnr LIKE vbap-matnr,
arktx LIKE vbap-arktx,
END OF wa_vbap.
if helpful reward soem points.
with regards,
suresh.

Difference between data and types

dear friends
Its a very simple question i am confused with why we create structures with types where we can create structures with data as well :
Types: begin of stru
end of stru.
Data: begin of stru
end of stru...
regards
Naim

To construct a new structured data type struc_typein a program, you use several TYPES statements:
TYPES BEGIN OF struc_type.
{TYPES dtype ...} | {INCLUDE {TYPE|STRUCTURE} ...}.
TYPES END OF struc_type.
The syntax for directly declaring a variable as a structure is the same as you would use to define a structured data type using the TYPES statement:
DATA BEGIN OF struc.
{DATA comp ...} | {INCLUDE {TYPE|STRUCTURE} ...}.
DATA END OF struc.
The individual components of a structure are addressed in the program with the structure component selector between the structure name and component name as follows: struc_comp.
Have a look at below link.
http://help.sap.com/saphelp_nw2004s/helpdata/en/fc/eb3364358411d1829f0000e829fbfe/content.htm
I hope it helps.
Best Regards,
Vibha
*Please mark all the helpful answers

Hi I want to know the difference between the type of internal tables.

I know the types of internal table but i dont know the difference between them can any one explain me in simple sentence.

Hi,
Standard Internal Tables
Standard tables have a linear index. You can access them using either the index or the key. If you use the key, the response time is in linear relationship to the number of table entries. The key of a standard table is always non-unique, and you may not include any specification for the uniqueness in the table definition.
This table type is particularly appropriate if you want to address individual table entries using the index. This is the quickest way to access table entries. To fill a standard table, append lines using the (APPEND) statement. You should read, modify and delete lines by referring to the index (INDEX option with the relevant ABAP command). The response time for accessing a standard table is in linear relation to the number of table entries. If you need to use key access, standard tables are appropriate if you can fill and process the table in separate steps. For example, you can fill a standard table by appending records and then sort it. If you then use key access with the binary search option (BINARY), the response time is in logarithmic relation to
the number of table entries.
Sorted Internal Tables
Sorted tables are always saved correctly sorted by key. They also have a linear key, and, like standard tables, you can access them using either the table index or the key. When you use the key, the response time is in logarithmic relationship to the number of table entries, since the system uses a binary search. The key of a sorted table can be either unique, or non-unique, and you must specify either UNIQUE or NON-UNIQUE in the table definition. Standard tables and sorted tables both belong to the generic group index tables.
This table type is particularly suitable if you want the table to be sorted while you are still adding entries to it. You fill the table using the (INSERT) statement, according to the sort sequence defined in the table key. Table entries that do not fit are recognised before they are inserted. The response time for access using the key is in logarithmic relation to the number of
table entries, since the system automatically uses a binary search. Sorted tables are appropriate for partially sequential processing in a LOOP, as long as the WHERE condition contains the beginning of the table key.
Hashed Internal Tables
Hashes tables have no internal linear index. You can only access hashed tables by specifying the key. The response time is constant, regardless of the number of table entries, since the search uses a hash algorithm. The key of a hashed table must be unique, and you must specify UNIQUE in the table definition.
This table type is particularly suitable if you want mainly to use key access for table entries. You cannot access hashed tables using the index. When you use key access, the response time remains constant, regardless of the number of table entries. As with database tables, the key of a hashed table is always unique. Hashed tables are therefore a useful way of constructing and
using internal tables that are similar to database tables.

Difference between Data carrier type and Data carrier??

Hi experts,
Could you please explain me the difference between Data carrier type and Data carrier with an example??
Regards,
Kiran T

hi Kiran,
Data carrier is to achive communication between server and user front end. We can define one data carrier type along with path as default for all or seperate data carriers type for specific users in define data carrier in SPRO. This defined data carriers again we assign to application in defining network for workstation application in SPRO.
By using data carrier we can upload to & download originals from server. We can change and print the documents from server.
Please award pts if its useful / need further information.
Pramod

How to transfer data from a dynamic internal table

Hi All
I want to transfer data from a dynamic internal table<dyn_table>
to a non dynamic internal table itab which should have the same structure as <dyn_table>.
How can this be done?
Regards,
Harshit Rungta

As stated earlier this can be done only through field symbols...
You cannot create an non dynamic internal table with ANY structure...using DATA statement
If the strucutre is defined well and good...you can create an non-dynamic internal table...
If you do not know the structure then the internal table has to be dynamic...and to be generated using field symbols
DATA: lv_ref TYPE REF TO data.
FIELD-SYMBOLS: <fs_dyn_table> TYPE STANDARD TABLE.
* You create a dynamic internal table...
CREATE DATA lv_ref LIKE (your_dynamic_internal_table).
ASSIGN lv_ref->* TO <fs_dyn_table>.
Now...do the transfer.
<fs_dyn_table> = "your_dynamic_internal_Table
Hope it helps!

Reading data from XML to Internal table

Hi Experts,
I got a requirement to read the data fom xml to internal table.is it possible to store deep internel table data into flat internal tables?my internel table contains 4 internel table and these 4 internel table contains 2 internel tables each...can any one help me o this...
points will be rewarded...
Regards,
Rakhi

Hi Rakhi,
* Structure to Get the Client Details as in XML format
DATA: BEGIN OF client,
          BEGIN OF Personal_Details,
            kunnr like kna1-kunnr,
            name1 like kna1-name1,
            adrnr like kna1-adrnr,
          END OF Personal_Details,
          BEGIN OF Address,
            street like adrc-street,
            city1 like adrc-city1,
          END OF Address,
          BEGIN OF Communication,
            fax_number like adrc-fax_number,
            tel_number like adrc-tel_number,
          END OF Communication,
        END OF client.
DATA: it_client TYPE TABLE OF client WITH HEADER LINES,
        result LIKE client.
DATA: xml_string TYPE string.
* Get the Client Details into the structure to be made as an XML string
TRY.
* Convert the Structure to XML string
      CALL TRANSFORMATION ('ID')
        SOURCE para = it_client
        RESULT XML xml_string.
* Convert the XML string to structure - result
      CALL TRANSFORMATION ('ID')
        SOURCE XML xml_string
        RESULT para = result.
CATCH cx_st_error.
ENDTRY.
best regards,
Thangesh

One Example program required on All types of internal tables

Hi All
Good Morning and Good day to you. I know that there are three types of internal tables like standard, sorted and hashed. I would request you to please send me one small example program on each type, so that i can understand better about the usage of different types.
Hoping for positive reply.
Thanks in advance.
Regards
Nagaraju

hi,
data: begin of struct,
 v_id type i,
 v_name(10) type c,
 v_phn type i,
 end of struct.
 "STANDARD TABLE.
data itab like standard table of struct with default key .
 write 'standard table'.
 struct-v_id = 1.
 struct-v_name = 'subash'.
 struct-v_phn = 234567.
 "INSERT struct into ITAB.
 append struct to itab.
 struct-v_id = 3.
 struct-v_name = 'sanchana'.
 struct-v_phn = 2378499.
 INSERT struct into ITAB index 1.
 "append struct to itab.
 struct-v_id = 2.
 struct-v_name = 'sanchith'.
 struct-v_phn = 2455667.
 INSERT struct into ITAB index 2 .
 loop at itab into struct.
 write: / struct-v_id , struct-v_name,struct-v_phn.
 endloop.
 skip.
 uline.
 "sorted table.
data itab1 like sorted table of struct with non-unique key v_id.
 write 'sorted table'.
 struct-v_id = 3.
 struct-v_name = 'subash'.
 struct-v_phn = 234567.
 INSERT struct into TABLE ITAB1.
 "append struct to itab.
 struct-v_id = 2.
 struct-v_name = 'sanchana'.
 struct-v_phn = 2378499.
 INSERT struct into table ITAB1.
 "append struct to itab.
 struct-v_id = 1.
 struct-v_name = 'sanchith'.
 struct-v_phn = 2455667.
 INSERT struct into ITAB1 index 1.
 "append struct to itab.
 loop at itab1 into struct.
 write: / struct-v_id , struct-v_name, struct-v_phn.
 endloop.
 skip.
 uline.
 "hashed table
 data itab2 like hashed table of struct with unique key v_id.
 write 'hashed table'.
 struct-v_id = 1.
 struct-v_name = 'subash'.
 struct-v_phn = 234567.
 INSERT struct into TABLE ITAB2.
 struct-v_id = 3.
 struct-v_name = 'sanchana'.
 struct-v_phn = 2378499.
 INSERT struct into TABLE ITAB2.
 struct-v_id = 2.
 struct-v_name = 'sanchith'.
 struct-v_phn = 2455667.
 INSERT struct into TABLE ITAB2.
&--SORTED USING SORT STATEMENT--
 loop at itab2 into struct.
 write:'non-sorted table' , / struct-v_id , struct-v_name, struct-v_phn.
 endloop.
 sort itab2 by v_id.
SKIP.
 loop at itab2 into struct.
 write: 'sorted hash table', / struct-v_id , struct-v_name, struct-v_phn.
 endloop.
 SKIP.
 ULINE.
Reward Useful Points
Siva

How meny types of internal tables?

how meny types of internal tables? can any one explain brifly what r their use?

INTERNAL TABLES:
Internal tables are holds the data which is having the same structure and storing it in working memory in ABAP. The data is stored line by line in the memory. The main purpose of internal table is for storing and formatting data from a database table within a program. It is used to minimize the DB access time in report programs.
Internal table are dynamic data objects, since they can contain any number of lines of a particular type. The maximum memory that can be occupied by an internal table (including its internal administration) is 2 gigabytes.
Types of Internal Tables :
1. Standard Internal Tables :
Standard tables have an internal linear index. The system can access records either by using the table index or the key. The response time for key access is proportional to the number of entries in the table. This means that standard tables can always be filled very quickly, since the system does not have to check whether there are already existing entries. WE can fill a standard table by appending lines (ABAP APPEND statement), and read, modify and delete entries by specifying the index (INDEX option with the relevant ABAP command).
2. Sorted tables :
Sorted tables are always saved sorted by the key. They also have an internal index. The system can access records either by using the table index or the key. The response time for key access is logarithmically proportional to the number of table entries, since the system uses a binary search. Entries are inserted according to the sort sequence defined through the table key.
3. Hashed tables :
Hashed tables have no linear index. You can only access a hashed table using its key. The response time is independent of the number of table entries, and is constant, since the system access the table entries using a hash algorithm. we cannot access a hashed table using its index.

Types of internal tables - More explanation(urgent)

hi friends,
            I wanted to explore diiferent types of internal table. when i went through the SAP.Help.Com for this , i wasnot able to get a clear idea of those 4 types of tables
Mainly i wanted to know
what is 1.standard table
        2.Hashed Table
        3.Sorted Table
        4. Index tables..
what are the advantages of these table and please explain me a scenario for when under what circumstances we would use these?
please reply me soon as i need to submit my documents reagarding this.
Thanks in advance
Thanks&Regards
Prasanna.

Standard tables
This is the most appropriate type if you are going to address the individual table entries using the index. Index access is the quickest possible access. You should fill a standard table by appending lines (ABAP APPEND statement), and read, modify and delete entries by specifying the index (INDEX option with the relevant ABAP command). The access time for a standard table increases in a linear relationship with the number of table entries. If you need key access, standard tables are particularly useful if you can fill and process the table in separate steps. For example, you could fill the table by appending entries, and then sort it. If you use the binary search option with key access, the response time is logarithmically proportional to the number of table entries.
Sorted tables
This is the most appropriate type if you need a table which is sorted as you fill it. You fill sorted tables using the INSERT statement. Entries are inserted according to the sort sequence defined through the table key. Any illegal entries are recognized as soon as you try to add them to the table. The response time for key access is logarithmically proportional to the number of table entries, since the system always uses a binary search. Sorted tables are particularly useful for partially sequential processing in a LOOP if you specify the beginning of the table key in the WHERE condition.
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.

Types of internal tables with regard to EFFICIENCY

Will any one tell me syntax to define each type of internal table (standard, sorted , hashed , database) . how to compare their efficincy ( access time which is more effficent) is there any documantation or programme of such type exist then please tell . i want to declare each type of above table and also to compare them w.r.t to efficeny thanks want urgent reply

Hi,
There are 3 types of Internal tables.
Standard Internal Tables:
Standard tables have a linear index. You can access them using either the index or the key. If you use the key, the response time is in linear relationship to the number of table entries. The key of a standard table is always non-unique, and you may not include any specification for the uniqueness in the table definition.
This table type is particularly appropriate if you want to address individual table entries using the index. This is the quickest way to access table entries. To fill a standard table, append lines using the (APPEND) statement. You should read, modify and delete lines by referring to the index (INDEX option with the relevant ABAP command). The response time for accessing a standard table is in linear relation to the number of table entries. If you need to use key access, standard tables are appropriate if you can fill and process the table in separate steps. For example, you can fill a standard table by appending records and then sort it. If you then use key access with the binary search option (BINARY), the response time is in logarithmic relation to the number of table entries.
Sorted Internal Tables:
Sorted tables are always saved correctly sorted by key. They also have a linear key, and, like standard tables, you can access them using either the table index or the key. When you use the key, the response time is in logarithmic relationship to the number of table entries, since the system uses a binary search. The key of a sorted table can be either unique, or non-unique, and you must specify either UNIQUE or NON-UNIQUE in the table definition. Standard tables and sorted tables both belong to the generic group index tables.
This table type is particularly suitable if you want the table to be sorted while you are still adding entries to it. You fill the table using the (INSERT) statement, according to the sort sequence defined in the table key. Table entries that do not fit are recognised before they are inserted. The response time for access using the key is in logarithmic relation to the number of table entries, since the system automatically uses a binary search. Sorted tables are appropriate for partially sequential processing in a LOOP, as long as the WHERE condition contains the beginning of the table key.
Hashed Internal Tables:
Hashes tables have no internal linear index. You can only access hashed tables by specifying the key. The response time is constant, regardless of the number of table entries, since the search uses a hash algorithm. The key of a hashed table must be unique, and you must specify UNIQUE in the table definition.
This table type is particularly suitable if you want mainly to use key access for table entries. You cannot access hashed tables using the index. When you use key access, the response time remains constant, regardless of the number of table entries. As with database tables, the key of a hashed table is always unique. Hashed tables are therefore a useful way of constructing and
using internal tables that are similar to database tables.
http://help.sap.com/saphelp_470/helpdata/EN/fc/eb35de358411d1829f0000e829fbfe/frameset.htm
Regards,
Kiran Sure

Diference between STO and Shipment order?

Hi All ,
There are two plants , one is manufacturing and other is sales . In sales plant sales order is created and after MRP run Purchase requisition is created(for getting materisl from production plant) . In me59 we convert this Preq to shipment order.
1)Can oyu please tell me whant is diference between STO and shipment order?
2) Can you tell me what is the configuration to avoid creation of shipment order and system will only create the STO from Preq after executing Me59?
Thanks
Rohit Chavan

Hi Chavan,
Starting with "Shipmnt Order" definition => (from SAP Help):
   An order to a transportation service provider to ship goods from a shipper to a single consignee with agreed terms and conditions. The corresponding confirmation from the transportation service provider is also part of the business object.
   You can use this business object to subcontract the transportation of goods from a shipper to a single consignee if you cannot fulfill a shipment request yourself or if you regularly subcontract transportation services.
   You can also use this business object in the process of transportation service provider selection and tendering. The aim of both processes is to assign a suitable transportation service provider (TSP) to a shipment order.
http://help.sap.com/saphelp_tm60/helpdata/en/66/dda98bb6b64c30b925f031bb0a2023/content.htm
STO is just Stock Transport Order => functionality to move stock from one plant to another plant in two steps( inclidung GI in the sending plant and GR in the receiving plant).
Usuall documnt flow in the STO process => PO(UB or NB order type), delivery, GI -> GR (done via migo for example).
I believe that you can avoid cration of the Shipmnt order via correct selection on ME59 screen. Just something what is characteristic for STO and not for Shipmnt Orders.
Best Regadrs,
Tomek.

Differences between standard structured sorted hashed internal tables.

can any one elobrate the differences among them with simple examples.
why hashed table serch is faster...what happens if list is not sorted...explain the scenarios best suitable ..when we go for what kinda tables...

<a href="http://www.sap-img.com/abap/what-are-different-types-of-internal-tables-and-their-usage.htm">refer this link for details</a>
<a href="http://www.geekinterview.com/question_details/1498">also refer this</a>
<a href="http://help.sap.com/saphelp_nw04/helpdata/en/fc/eb366d358411d1829f0000e829fbfe/content.htm">also this- SAP Help</a>
regards,
srinivas

Simple command to refresh data of all declared internal tables & variables!

Hi All,
I have declared many internal tables & variables in my program in declaration include.
Is there any Simple command which can refresh data of all declared internal tables & variables!
Instead of clearing & refreshing each i.table & variable i want to use single command to refresh data.
Is this possible!
Thanks in advance.
Thanks,
Deep.

CLEAR: lv_field1,
             lv_field2,
             lt_itab1[],
             lt_itab2[].
ONE simple command (CLEAR), can initialize fields, workareas, field-symbols,.... and internal tables.

Moving data in all the internal tables to the final table t_data

hi all,
how to data in all the internal tables to the final table t_data
*selecting fields from bkpf table
SELECT     bukrs
             belnr
             gjahr
             bldat
             xblnr
             usnam
     FROM    bkpf
     INTO TABLE t_bkpf
    WHERE bukrs EQ po_bukrs AND
           belnr IN so_belnr AND
           budat IN so_budat AND
           blart IN so_blart.
IF t_bkpf[] IS INITIAL.
    MESSAGE a999(zfi_ap_gl) WITH text-011.
    STOP.
ELSE.
*selecting fields from bseg table.
    SELECT bukrs
            belnr
            gjahr
            koart
            shkzg
            dmbtr
            zuonr
            sgtxt
            kostl
            hkont
            lifnr
            prctr
            FROM bseg
            INTO TABLE t_bseg
            FOR ALL ENTRIES IN t_bkpf
          WHERE bukrs EQ t_bkpf-bukrs AND
                belnr EQ t_bkpf-belnr AND
                gjahr EQ t_bkpf-gjahr AND
                lifnr IN so_lifnr.
ENDIF.
IF t_bseg[] IS INITIAL.
    MESSAGE a999(zfi_ap_gl) WITH text-011.
    STOP.
ELSE.
*selecting the companies address from adrc table
    SELECT SINGLE addrnumber street str_suppl2 city1
                   region post_code1
                   FROM adrc
                   INTO wa_adrc
                   WHERE addrnumber EQ w_adrnr.
*selecting adrnr from the lfa1 table
    SELECT lifnr adrnr name1 ort01 regio pstlz
                 FROM lfa1
                 INTO TABLE t_adrnr
                 FOR ALL ENTRIES IN t_bseg
                 WHERE lifnr EQ t_bseg-lifnr.
    IF NOT t_adrnr[] IS INITIAL.
*populating the t_vaddress table.
      SELECT addrnumber
              street
              str_suppl2
              FROM adrc
              INTO TABLE t_vaddress
              FOR ALL ENTRIES IN t_adrnr
              WHERE addrnumber EQ t_adrnr-adrnr.
*populating the t_vendor table with the vendor address
      SELECT lifnr
             adrnp_2
             namev
             name1
             INTO TABLE t_vendor
             FROM knvk
             FOR ALL ENTRIES IN t_adrnr
             WHERE lifnr EQ t_adrnr-lifnr AND
                    adrnp_2 EQ t_adrnr-adrnr.
    ENDIF.
ENDIF.

Loop the internal table which is having the maximum number of records,then use read table....for other internal tables....in that loop and then append them into final internal table.
Ex-LOOP AT IT_VBRP INTO WA_VBRP.
    WA_FINAL-WERKS = WA_VBRP-WERKS_I.
    WA_FINAL-KUNAG = WA_VBRP-KUNAG.
    WA_FINAL-AEDAT = WA_VBRP-AEDAT.
    READ TABLE IT_KONV INTO WA_KONV WITH KEY KNUMV = WA_VBRP-KNUMV
                                             KPOSN = WA_VBRP-POSNR_I.
    IF SY-SUBRC EQ 0.
      WA_FINAL-KSCHL = WA_KONV-KSCHL.
      CLEAR WA_KONV.
    ENDIF.
    READ TABLE IT_KNA1 INTO WA_KNA1 WITH KEY KUNNR = WA_VBRP-KUNAG.
    IF SY-SUBRC EQ 0.
      WA_FINAL-NAME1 = WA_KNA1-NAME1.
      CLEAR WA_KNA1.
    ENDIF.
    ENDIF.
    APPEND WA_FINAL TO IT_FINAL.
    CLEAR: WA_FINAL,WA_KONV,wa_kna1.
ENDLOOP.

Diference between DATA: and TYPES: on internal tables

Similar Messages

Maybe you are looking for