problem with collect

[Former Member]

how i do 2 lines instead of 3

matnr ............ menge

11111 10 4 3 3 3 3 10

22222 10 3 3 3 3 3 5

22222 10 3 3 3 3 3 10

[Former Member]

i want only the menge to make collect the other need to stay

[Former Member]

hi Rani,

In that case use <b>SUM</b> statement instead of collect. Since Collect statement sums up all the numeric fields.

Use in this way i.,e SUM(MENGE).

[former_member188685]

Hi Rani,

Can you tell me what are the other fields. i can't see your internal table fields fully. where exactly MENGE is there.

can you show your required Output.

Regards

vijay

[Former Member]

how what is the code pls

[Former Member]

the itab is 3 lines

ebeln ebelp ....menge

11111 10 30

22222 20 10

22222 20 5

[Former Member]

Hi

chk this out

COLLECT

Basic form

COLLECT [wa INTO] itab.

Extras:

1. ... ASSIGNING <fs>

2. ... REFERENCE INTO dref

3. ... SORTED BY f

The syntax check performed in an ABAP Objects context is stricter than in other ABAP areas. See Cannot Use Short Forms in Line Operations.

Effect

COLLECT allows you to create unique or summarized datasets. The system first tries to find a table entry corresponding to the table key. (See also Defining Keys for Internal Tables). The key values are taken either from the header line of the internal table itab, or from the explicitly-specified work area wa. The line type of itab must be flat - that is, it cannot itself contain any internal tables. All the components that do not belong to the key must be numeric types ( ABAP Numeric Types).

If the system finds an entry, the numeric fields that are not part of the table key (see ABAPNumeric Types) are added to the sum total of the existing entries. If it does not find an entry, the system creates a new entry instead.

The way in which the system finds the entries depends on the kind of the internal table:

STANDARD TABLE:

The system creates a temporary hash administration for the table to find the entries. This means that the runtime required to find them does not depend on the number of table entries. The administration is temporary, since it is invalidated by operations (such as DELETE, INSERT, MODIFY, or SORT). A subsequent COLLECT is then no longer independent of the table size, because the system has to use a linear search to find entries. For this reason, you should only use COLLECT to fill standard tables.

SORTED TABLE:

The system uses a binary search to find the entries. There is a logarithmic relationship between the number of table entries and the search time.

HASHED TABLE:

The system uses the internal hash administration of the table to find records. Since (unlike standard tables), this remains intact even after table modification operations, the search time is always independent of the number of table entries.

For standard tables and SORTED TABLEs, the system field SY-TABIX contains the number of the existing or newly-added table entry after the COLLECT. With HASHED TABLEs, SY-TABIX is set to 0.

Notes

COLLECT allows you to create a unique or summarized dataset, and you should only use it when this is necessary. If neither of these characteristics are required, or where the nature of the table in the application means that it is impossible for duplicate entries to occur, you should use INSERT [wa INTO] TABLE itab instead of COLLECT. If you do need the table to be unique or summarized, COLLECT is the most efficient way to achieve it.

If you use COLLECT with a work area, the work area must be compatible with the line type of the internal table.

If you edit a standard table using COLLECT, you should only use the COLLECT or MODIFY ... TRANSPORTING f1 f2 ... statements (where none of f1, f2, ... may be in the key). Only then can you be sure that:

-The internal table actually is unique or summarized

-COLLECT runs efficiently. The check whether the dataset

already contains an entry with the same key has a constant

search time (hash procedure).

If you use any other table modification statements, the check for entries in the dataset with the same key can only run using a linear search (and will accordingly take longer). You can use the function module ABL_TABLE_HASH_STATE to test whether the COLLECT has a constant or linear search time for a given standard table.

Example

Summarized sales figures by company:

TYPES: BEGIN OF COMPANY,

NAME(20) TYPE C,

SALES TYPE I,

END OF COMPANY.

DATA: COMP TYPE COMPANY,

COMPTAB TYPE HASHED TABLE OF COMPANY

WITH UNIQUE KEY NAME.

COMP-NAME = 'Duck'. COMP-SALES = 10. COLLECT COMP INTO COMPTAB.

COMP-NAME = 'Tiger'. COMP-SALES = 20. COLLECT COMP INTO COMPTAB.

COMP-NAME = 'Duck'. COMP-SALES = 30. COLLECT COMP INTO COMPTAB.

Table COMPTAB now has the following contents:

NAME | SALES

-

---

Duck | 40

Tiger | 20

Addition 1

... ASSIGNING <fs>

Effect

If this statement is successfully executed, the field symbol <fs> is set to the changed or new entry. Otherwise the field symbol remains unchanged.

Addition 2

... REFERENCE INTO dref

Effect

If this statement is successfully executed the reference to the relevant line is placed in dref. Otherwise the data reference dref remains unchanged.

Addition 3

... SORTED BY f

Effect

COLLECT ... SORTED BY f is obsolete, and should no longer be used. It only applies to standard tables, and has the same function as APPEND ... SORTED BY f, which you should use instead. (See also Obsolete Language Elements).

Note

Performance:

If you are still using internal tables with headers but, as recommended, keep your data in work areas with a different name, you do not need to assign the data to the header first in order to pass it to the internal tables. Instead, you should use the work area directly as with tables without headers. For example, "APPEND wa TO itab." is roughly twice as fast as "itab = wa. APPEND itab.". The same applies to COLLECT and INSERT.

The runtime of a COLLECT increases with the width of the table key and the number of numeric fields whose contents are summated.

plz reward if useful

[rahulkavuri]

  LOOP AT T_BOM.

    AT END OF VBELN.

      READ TABLE T_BOM INDEX SY-TABIX.
      SUM.
      MOVE T_BOM TO IT_BOM.
      APPEND IT_BOM.

    ENDAT.

  ENDLOOP.

In the above code due to the Use of SUM we get the final sum values into a new internal table IT_BOM...

otherwise u need to use modify statement and delete duplicate entries again

Message was edited by: Rahul Kavuri

[Former Member]

Hi Rani,

Am assuming menge is the last field in itab

loop at itab. 
  at end of menge.
  SUM.
  endat.
endloop.

or declarare all other fields as char and menge as numeric and then use

loop at itab.
collect itab.
endloop.

[Former Member]

hi rani,

TRY USING SUM.

SORT ITAB.

LOOP AT ITAB.

AT END OF MENGE.

SUM.

ENDAT.

ENDLOOP.

HOPE THIS HELPS,

PRIYA.

[Former Member]

hi rani,

ucan use

loop at itab.

at end of matnr .

sum(menge).

endat.

endloop.

award if helpful.

regards,

keerthi.

[nishanthbhandar]

Considering the input that you have specified ..

11111 10 4 3 3 3 3 10

22222 10 3 3 3 3 3 5

22222 10 3 3 3 3 3 10

do u want the 2 lines as below

11111 10 4 3 3 3 3 10

22222 10 3 3 3 3 3 15 ....( 5 + 10 ).

if so then code like this ..

data : l_menge type menge.

sort itab by matnr.

loop at itab.

l_menge = l_menge + itab-menge.

at end of matnr.

move-corresponding fields of itab to itab_collect.

itab_collect-menge = l_menge.

append itab_collect.

clear l_menge.

endat.

endloop.

[Clemenss]

Hi,

define your destination table as sorted table with unique key <field 1> <field 2>...

loop at itab.

read table destination_tab with key

<field 1> = itab-<field 1>

<field 2> = itab-<field 2>.

if sy-subrc <> 0.

insert itab into table destination_tab.

else.

add itab-field3 to destination_tab-field3.

add itab-field4 to destination_tab-field4.

add itab-field5 to destination_tab-field5.

endif.

endloop.

put this into a form-routine, use field symbols and itabs without headlines and we all like it better...

Regards,

Clemens