Question about sort after commit

Hello!
I have a view object. I put in "order by clause" some sort(In query tab of this view object). I created jsf page and dropped this view object like table. I also dropped a Commit operation as button. When I change some value in row and press Commit button, my "order by clause" on view object doesn't perform and I get unsorted data. When I press Commit second time, "order by clause" perform. Can you suggest how to workaround this "Commit" behavior?
JDeveloper version 11.1.2.2.0
Thank's for answers.
Regards, Stanislav

Hi,
Perform Execute after the commit. You can do this by executing both the actions in the actionListener of the commit button. Search in this forum for how to execute the action binding from backing bean.
-Arun

Similar Messages

Question about sorting files in media library

Hey,
I'm Sam Hoste from Belgium and I have a question about sorting music files in my media library in iTunes.
My music collection mainly exists of complete albums instead of individual songs. The problem is that I can not play the songs of an album in the same order as on the tracklist of the album in the media library of iTunes.
I also take very good care of the ID3 tags from my mp3-files, but that doesn't help.
For example, if I had an album with the following tracklist,
01. Artist - Song 1
02. Artist - Song 2
03. Artist - Song 3
04. Artist ft Otherartist - Song 4
05. Artist ft Otherartist - Song 5
06. Artist - Song 6
07. Artist - Song 7,
every music file would have an ID3 tag for tracknumber (1, 2, 3, ...), an ID3 tag for artist ("Artist" or "Artist ft Otherartist"), an ID3 tag for title (Song 1, ...) and an ID3 tag for album ("Albumname").
When I load this album in my media library in iTunes, I cannot get them sorted by album and by tracknumber on that album. When I sort by artist I get this list:
01. Artist - Song 1
02. Artist - Song 2
03. Artist - Song 3
06. Artist - Song 6
07. Artist - Song 7
04. Artist ft Otherartist - Song 4
05. Artist ft Otherartist - Song 5.
But that's normal, but even if I sort by album I get the same list:
01. Artist - Song 1
02. Artist - Song 2
03. Artist - Song 3
06. Artist - Song 6
07. Artist - Song 7
04. Artist ft Otherartist - Song 4
05. Artist ft Otherartist - Song 5.
So the songs aren't in the same order as they are supposed to be on the CD. And I would really like my albums to play in the same order than on the tracklist on the CD.
I think the problem is caused by the fact that when you sort by "album" in iTunes media library, iTunes first sorts by albumname, and second by artistname, and third by tracknumber. In stead of sorting first by albumname, and then second by tracknumber in stead of the artist.
My question: Is there a way to make sure iTunes sorts by albumname, and then by tracknumber in stead of artist, so I can play my albums in the same order as on the CD? Or is there an other solution for this issue?
Thanks and kind regards,
Sam Hoste

See my previous post on Grouping Tracks Into Albums, in particular the topics Use an album friendly view and
Tracks out of sequence.
tt2

Questions about Adobe After Effects CS5 and CS5.5

I have the Adobe Design Creative Suite CS5 (Photoshop CS5, Illustrator CS5, Flash CS5, Dreamweaver CS5, InDesign CS5, and Fireworks CS5) and was going to order an old copy of After Effects CS5 for my iMac. However when I was about to order on an online store, I notice that there is a CS5 and a CS5.5 version for After Effects. I would like to know which version is better and if I get Adobe After Effects CS5.5 version will I be able to intergrate with CS5 versions of Photoshop, Illustrator, and Flash?
Alos is there a way for to order a copy of Adobe After Effects CS5(or CS5.5 version) on the Adobe online store? I don't want to order the CS6 version of After Effects because I'm afraid I will not be able to intergrate it with my CS5 versions of Photoshop, Illustrator, and Flash.

You should get After Effects CS6. There is no reason to be concerned about using After Effects Effects CS6 with Flash, Illustrator, and Photoshop CS5.
Here's what's new and changed from After Effects CS5 to After Effects CS5.5: http://adobe.ly/hX01mB
Here's what's new and changed from After Effects CS5.5 to After Effects CS6: http://adobe.ly/HCGNMJ

Question about sorted, hashed tables, mindset when using OO concepts...

Hello experts,
I just want to make sure if my idea about sorted and hashed table is correct.Please give tips and suggestions.
In one of my reports, I declared a structure and an itab.
TYPES: BEGIN OF t_mkpf,
 mblnr LIKE mkpf-mblnr,
 mjahr LIKE mkpf-mjahr,
 budat LIKE mkpf-budat,
 xblnr(10) TYPE c,
 tcode2 LIKE mkpf-tcode2,
 cputm LIKE mkpf-cputm,
 blart LIKE mkpf-blart,
 END OF t_mkpf.
it_mkpf TYPE SORTED TABLE OF t_mkpf WITH HEADER LINE
 WITH NON-UNIQUE KEY mblnr mjahr.
Now, I declared it as a sorted table with a non-unique key MBLNR and MJAHR. Now suppose I have 1000 records in my itab. how will it search for a particular record?
2. Is it faster than sorting a standard table then reading it using binary search?
3. How do I use a hashed table effectively? lets say that I want to use hashed type instead of sorted table in my example above.
4. I am currently practicing ABAP Objects and my problem is that I think my mindset when programming a report is still the 'procedural one'. How do one use ABAP concepts effectively?
Again, thank you guys and have a nice day!

Hi Viray,
The different ways to fill an Internal Table:
append&sort
This is the simplest one. I do appends on a standard table and then a sort.
data: lt_tab type standard table of ...
do n times.
ls_line = ...
append ls_line to lt_tab.
enddo.
sort lt_tab.
The thing here is the fast appends and the slow sort - so this is interesting how this will compare to the following one.
read binary search & insert index sy-tabix
In this type I also use a standard table, but I read to find the correct insert index to get a sorted table also.
data: lt_tab type standard table of ...
do n times.
ls_line = ...
read table lt_tab transporting no fields with key ... binary search.
if sy-subrc <> 0.
insert ls_line into lt_tab index sy-tabix.
endif.
enddo.
sorted table with non-unique key
Here I used a sorted table with a non-unique key and did inserts...
data: lt_tab type sorted table of ... with non-unique key ...
do n times.
ls_line = ...
insert ls_line into table lt_tab.
enddo.
sorted table with unique key
The coding is the same instead the sorted table is with a unique key.
data: lt_tab type sorted table of ... with unique key ...
do n times.
ls_line = ...
insert ls_line into table lt_tab.
enddo.
hashed table
The last one is the hashed table (always with unique key).
data: lt_tab type hashed table of ... with unique key ...
do n times.
ls_line = ...
insert ls_line into table lt_tab.
enddo.
You Can use this Program to Test:
types:
begin of local_long,
 key1 type char10,
 key2 type char10,
 data1 type char10,
 data2 type char10,
 data3 type i,
 data4 type sydatum,
 data5 type numc10,
 data6 type char32,
 data7 type i,
 data8 type sydatum,
 data9 type numc10,
 dataa type char32,
 datab type i,
 datac type sydatum,
 datad type numc10,
 datae type char32,
 dataf type i,
 datag type sydatum,
 datah type numc10,
 datai type char32,
 dataj type i,
 datak type sydatum,
 datal type numc10,
 datam type char32,
 datan type i,
 datao type sydatum,
 datap type numc10,
 dataq type char32,
 datar type i,
 datas type sydatum,
 datat type numc10,
 datau type char32,
 datav type i,
 dataw type sydatum,
 datax type numc10,
 datay type char32,
 dataz type i,
 data11 type numc10,
 data21 type char32,
 data31 type i,
 data41 type sydatum,
 data51 type numc10,
 data61 type char32,
 data71 type i,
 data81 type sydatum,
 data91 type numc10,
 dataa1 type char32,
 datab1 type i,
 datac1 type sydatum,
 datad1 type numc10,
 datae1 type char32,
 dataf1 type i,
 datag1 type sydatum,
 datah1 type numc10,
 datai1 type char32,
 dataj1 type i,
 datak1 type sydatum,
 datal1 type numc10,
 datam1 type char32,
 datan1 type i,
 datao1 type sydatum,
 datap1 type numc10,
 dataq1 type char32,
 datar1 type i,
 datas1 type sydatum,
 datat1 type numc10,
 datau1 type char32,
 datav1 type i,
 dataw1 type sydatum,
 datax1 type numc10,
 datay1 type char32,
 dataz1 type i,
end of local_long.
data:
ls_long type local_long,
lt_binary type standard table of local_long,
lt_sort_u type sorted table of local_long with unique key key1 key2,
lt_sort_n type sorted table of local_long with non-unique key key1 key2,
lt_hash_u type hashed table of local_long with unique key key1 key2,
lt_apsort type standard table of local_long.
field-symbols:
<ls_long> type local_long.
parameters:
min1 type i default 1,
max1 type i default 1000,
min2 type i default 1,
max2 type i default 1000,
i1 type i default 100,
i2 type i default 200,
i3 type i default 300,
i4 type i default 400,
i5 type i default 500,
i6 type i default 600,
i7 type i default 700,
i8 type i default 800,
i9 type i default 900,
fax type i default 1000.
types:
begin of measure,
 what(10) type c,
 size(6) type c,
 time type i,
 lines type i,
 reads type i,
 readb type i,
 fax_s type i,
 fax_b type i,
 fax(6) type c,
 iter type i,
end of measure.
data:
lt_time type standard table of measure,
lt_meantimes type standard table of measure,
ls_time type measure,
lv_method(7) type c,
lv_i1 type char10,
lv_i2 type char10,
lv_f type f,
lv_start type i,
lv_end type i,
lv_normal type i,
lv_size type i,
lv_order type i,
lo_rnd1 type ref to cl_abap_random_int,
lo_rnd2 type ref to cl_abap_random_int.
get run time field lv_start.
lo_rnd1 = cl_abap_random_int=>create( seed = lv_start min = min1 max = max1 ).
add 1 to lv_start.
lo_rnd2 = cl_abap_random_int=>create( seed = lv_start min = min2 max = max2 ).
ls_time-fax = fax.
do 5 times.
do 9 times.
 case sy-index.
 when 1. lv_size = i1.
 when 2. lv_size = i2.
 when 3. lv_size = i3.
 when 4. lv_size = i4.
 when 5. lv_size = i5.
 when 6. lv_size = i6.
 when 7. lv_size = i7.
 when 8. lv_size = i8.
 when 9. lv_size = i9.
 endcase.
 if lv_size > 0.
 ls_time-iter = 1.
 clear lt_apsort.
 ls_time-what = 'APSORT'.
 ls_time-size = lv_size.
 get run time field lv_start.
 do lv_size times.
 perform fill.
 append ls_long to lt_apsort.
 enddo.
 sort lt_apsort by key1 key2.
 get run time field lv_end.
 ls_time-time = lv_end - lv_start.
 ls_time-reads = 0.
 ls_time-readb = 0.
 ls_time-lines = lines( lt_apsort ).
 get run time field lv_start.
 do.
 add 1 to ls_time-readb.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_apsort
 assigning <ls_long>
 with key key1 = lv_i1
 key2 = lv_i2
 binary search.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do.
 add 1 to ls_time-reads.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_apsort
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_apsort
 assigning <ls_long>
 with key key1 = lv_i1
 key2 = lv_i2
 binary search.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_b = lv_end - lv_start.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_apsort
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_s = lv_end - lv_start.
 collect ls_time into lt_time.
 clear lt_binary.
 ls_time-what = 'BINARY'.
 ls_time-size = lv_size.
 get run time field lv_start.
 do lv_size times.
 perform fill.
 read table lt_binary
 transporting no fields
 with key key1 = ls_long-key1
 key2 = ls_long-key2
 binary search.
 if sy-index <> 0.
 insert ls_long into lt_binary index sy-tabix.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-time = lv_end - lv_start.
 ls_time-reads = 0.
 ls_time-readb = 0.
 ls_time-lines = lines( lt_binary ).
 get run time field lv_start.
 do.
 add 1 to ls_time-readb.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_binary
 assigning <ls_long>
 with key key1 = lv_i1
 key2 = lv_i2
 binary search.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do.
 add 1 to ls_time-reads.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_binary
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_binary
 assigning <ls_long>
 with key key1 = lv_i1
 key2 = lv_i2
 binary search.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_b = lv_end - lv_start.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_binary
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_s = lv_end - lv_start.
 collect ls_time into lt_time.
 clear lt_sort_n.
 ls_time-what = 'SORT_N'.
 ls_time-size = lv_size.
 get run time field lv_start.
 do lv_size times.
 perform fill.
 insert ls_long into table lt_sort_n.
 enddo.
 get run time field lv_end.
 ls_time-time = lv_end - lv_start.
 ls_time-reads = 0.
 ls_time-readb = 0.
 ls_time-lines = lines( lt_sort_n ).
 get run time field lv_start.
 do.
 add 1 to ls_time-readb.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_n
 assigning <ls_long>
 with table key key1 = lv_i1
 key2 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do.
 add 1 to ls_time-reads.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_n
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_n
 assigning <ls_long>
 with table key key1 = lv_i1
 key2 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_b = lv_end - lv_start.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_n
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_s = lv_end - lv_start.
 collect ls_time into lt_time.
 clear lt_sort_u.
 ls_time-what = 'SORT_U'.
 ls_time-size = lv_size.
 get run time field lv_start.
 do lv_size times.
 perform fill.
 insert ls_long into table lt_sort_u.
 enddo.
 get run time field lv_end.
 ls_time-time = lv_end - lv_start.
 ls_time-reads = 0.
 ls_time-readb = 0.
 ls_time-lines = lines( lt_sort_u ).
 get run time field lv_start.
 do.
 add 1 to ls_time-readb.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_u
 assigning <ls_long>
 with table key key1 = lv_i1
 key2 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do.
 add 1 to ls_time-reads.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_u
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_u
 assigning <ls_long>
 with table key key1 = lv_i1
 key2 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_b = lv_end - lv_start.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_sort_u
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_s = lv_end - lv_start.
 collect ls_time into lt_time.
 clear lt_hash_u.
 ls_time-what = 'HASH_U'.
 ls_time-size = lv_size.
 get run time field lv_start.
 do lv_size times.
 perform fill.
 insert ls_long into table lt_hash_u.
 enddo.
 get run time field lv_end.
 ls_time-time = lv_end - lv_start.
 ls_time-reads = 0.
 ls_time-readb = 0.
 ls_time-lines = lines( lt_hash_u ).
 get run time field lv_start.
 do.
 add 1 to ls_time-readb.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_hash_u
 assigning <ls_long>
 with table key key1 = lv_i1
 key2 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do.
 add 1 to ls_time-reads.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_hash_u
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data11 = sy-index.
 endif.
 get run time field lv_end.
 subtract lv_start from lv_end.
 if lv_end >= ls_time-time.
 exit.
 endif.
 enddo.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_hash_u
 assigning <ls_long>
 with table key key1 = lv_i1
 key2 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_b = lv_end - lv_start.
 get run time field lv_start.
 do fax times.
 lv_i1 = lo_rnd1->get_next( ).
 lv_i2 = lo_rnd2->get_next( ).
 read table lt_hash_u
 assigning <ls_long>
 with key key2 = lv_i1
 key1 = lv_i2.
 if sy-subrc = 0.
 <ls_long>-data21 = sy-index.
 endif.
 enddo.
 get run time field lv_end.
 ls_time-fax_s = lv_end - lv_start.
 collect ls_time into lt_time.
 endif.
enddo.
enddo.
sort lt_time by what size.
write: / ' type | size | time | tab-size | directread | std read | time direct | time std read'.
write: / sy-uline.
loop at lt_time into ls_time.
write: / ls_time-what, '|', ls_time-size, '|', ls_time-time, '|', ls_time-lines, '|', ls_time-readb, '|', ls_time-reads, '|', ls_time-fax_b, '|', ls_time-fax_s.
endloop.
form fill.
lv_i1 = lo_rnd1->get_next( ).
lv_i2 = lo_rnd2->get_next( ).
ls_long-key1 = lv_i1.
ls_long-key2 = lv_i2.
ls_long-data1 = lv_i1.
ls_long-data2 = lv_i2.
ls_long-data3 = lv_i1.
ls_long-data4 = sy-datum + lv_i1.
ls_long-data5 = lv_i1.
ls_long-data6 = lv_i1.
ls_long-data7 = lv_i1.
ls_long-data8 = sy-datum + lv_i1.
ls_long-data9 = lv_i1.
ls_long-dataa = lv_i1.
ls_long-datab = lv_i1.
ls_long-datac = sy-datum + lv_i1.
ls_long-datad = lv_i1.
ls_long-datae = lv_i1.
ls_long-dataf = lv_i1.
ls_long-datag = sy-datum + lv_i1.
ls_long-datah = lv_i1.
ls_long-datai = lv_i1.
ls_long-dataj = lv_i1.
ls_long-datak = sy-datum + lv_i1.
ls_long-datal = lv_i1.
ls_long-datam = lv_i1.
ls_long-datan = sy-datum + lv_i1.
ls_long-datao = lv_i1.
ls_long-datap = lv_i1.
ls_long-dataq = lv_i1.
ls_long-datar = sy-datum + lv_i1.
ls_long-datas = lv_i1.
ls_long-datat = lv_i1.
ls_long-datau = lv_i1.
ls_long-datav = sy-datum + lv_i1.
ls_long-dataw = lv_i1.
ls_long-datax = lv_i1.
ls_long-datay = lv_i1.
ls_long-dataz = sy-datum + lv_i1.
ls_long-data11 = lv_i1.
ls_long-data21 = lv_i1.
ls_long-data31 = lv_i1.
ls_long-data41 = sy-datum + lv_i1.
ls_long-data51 = lv_i1.
ls_long-data61 = lv_i1.
ls_long-data71 = lv_i1.
ls_long-data81 = sy-datum + lv_i1.
ls_long-data91 = lv_i1.
ls_long-dataa1 = lv_i1.
ls_long-datab1 = lv_i1.
ls_long-datac1 = sy-datum + lv_i1.
ls_long-datad1 = lv_i1.
ls_long-datae1 = lv_i1.
ls_long-dataf1 = lv_i1.
ls_long-datag1 = sy-datum + lv_i1.
ls_long-datah1 = lv_i1.
ls_long-datai1 = lv_i1.
ls_long-dataj1 = lv_i1.
ls_long-datak1 = sy-datum + lv_i1.
ls_long-datal1 = lv_i1.
ls_long-datam1 = lv_i1.
ls_long-datan1 = sy-datum + lv_i1.
ls_long-datao1 = lv_i1.
ls_long-datap1 = lv_i1.
ls_long-dataq1 = lv_i1.
ls_long-datar1 = sy-datum + lv_i1.
ls_long-datas1 = lv_i1.
ls_long-datat1 = lv_i1.
ls_long-datau1 = lv_i1.
ls_long-datav1 = sy-datum + lv_i1.
ls_long-dataw1 = lv_i1.
ls_long-datax1 = lv_i1.
ls_long-datay1 = lv_i1.
ls_long-dataz1 = sy-datum + lv_i1.
endform.".
Thanks & Regards,
YJR.

General question about packages after the -Rs removal

Hi !
This is more of curiosity question . I was always wondering after i perform the command pacman -Rs package and then i try to install it again the downloaded size is 0 kb
Meaning that the file is already stored on my hard drive . How can those packages be removed from my hard disk ?

shak wrote:OK thanks for your help . The only relevant command i found is pacman with the -n option , nosave. Is this the one ?
No. the nosave option is for config files that would be saved as .pacnew if the option was not passed in.
What you need is
sudo pacman -Sc
This will clean your cache and remove all the packages that are NOT installed on your system.
If you want to remove every package from the cache then pass in an extra -c option
sudo pacman -Scc

A question about sorting tables.

Hello All!
Just a quick question: performance wise, which is better, declare an itab with the 'sorted table of' or use the 'sort itab' later.
Thanks in advance!
Moderator message: please try yourself and search for available information and previous, similar discussions.
Edited by: Thomas Zloch on Feb 23, 2012

Hi Kevin,
follow for example more or less the code given in this thread: Functionality to dynamically sort tableview columns and implement a compare method corresponding to your needs (for example using compareToIgnoreCase method of String).
Hope it helps
Detlev

I have a question about backdating after upgrading to a larger minute plan.

I have overages in the amount of almost 400 minutes. We downgraded our plan back in Feb., to Nationwide talk and text 700 minutes because we had huge bills and were not using the minutes with that plan. So, we noticed last months bill we had 40 minutes of overages... okay, not too bad, we didn't say anything. Then this month we noticed that our "friends and family" numbers/option for numbers were gone! Rep said NOTHING when we downgraded about loosing them, in fact, I made the comment with the rep on the phone that 700 minutes with our friends and family numbers would be plenty (and it would have been), but since we have lost those, we are now incurring huge overages. So, today I called in, had it changed to 1400 minutes, which miraculously gave us our friends and family numbers back, but they are "unable to backdate to cover the overages" and we are now looking at a $700 bill to be billed out on the 10th of May. Even our online account said to upgrade our minutes and request and backdate on the account to keep from incurring the overage charges... So, my question is, has anyone else had this problem? Is this truly non-fixable? Am I going to be stuck with a $700 bill for one month????!!!! Do I need to call back tomorrow and try again for a backdate in the plan? I feel extremely cheated right now.

Vzn SHOULD be able to backdate your plan to cover current overages as long as your bill cycle has not closed (unless you made other changes to your account during the month). Call customer care

Two quick questions about Library after moving beginning on a new computer

Hi there,
I just moved from Windows to Mac, meaning I had to move my iTunes library from the old PC to my new MBA.
Just a couple of quick questions.
1. When I started iTunes on my new Mac, in the preferences I directed the media folder to the folder with all my itunes music/podcasts etc, and then I imported the Library XML file. Is this incorrect? Should I have imported a different file? Should I have used the itl file instead?
If so, should I delete the library and start again? (if this is the case, please suggest the best way of doing this without affecting my media)
- a kind of sub-question to this one: some of the media files arent showing up in the iTunes library, but they are in the media folder on the ext HDD. Is there a way I can find out which ones havent been recognized by iTunes? Whats the best way of getting them in to my library?
2. Pretty much half of my podcasts have not been loaded in the new iTunes. The ones that havent were ones that I subscribed to on my iPhone, whereas the ones that show up in iTunes were ones I downloaded from iTunes. When I connect my iPhone and sync it with iTunes, will those podcasts show up in iTunes? Or is there a risk that they will be deleted from my iPhone?
Cheers,

The .xml is lacking some information such as ratings, date added, and play count. Using the .itl includes this information but cannot be imported using the method you did.
A complete library is everything in the iTunes folder. By using the method you did you left the artwork behind in the artwork folder on the other machine.
Selecting the media folder in preferences does not get iTunes to recognize the media. All it does is tell iTunes to start storing new media in that location.
Using the method I outlined nothing will be missed (with the exception of WMA) because you aren't rebuilding your library, you are using the one that already exists.
You don't have to re-copy everything as long as you get the stuff you missed and re-assemble it all as it was before except not on the Mac.
What are the iTunes library files? - http://support.apple.com/kb/HT1660
More on iTunes library files and what they do - http://en.wikipedia.org/wiki/ITunes#Media_management
What are all those iTunes files? - http://www.macworld.com/article/139974/2009/04/itunes_files.html
Where are my iTunes files located? - http://support.apple.com/kb/ht1391

NEED HELP! Possibly easy question about 'sorting' on your iPod

I can't find the answer anywhere... You know when you sort on 'artist' (or probably anything) on your iPod, if the artist's name is "The Beatles", the artist will be found under the letter "B", not "T". Or if the artist's name is "A Perfect Circle", the artist will be found under "P" and not "A". Etc...
Is there a way to change this? I actually don't mind it, but was curious because:
Is there a way to add words that it would do this for? i.e. add the word "Tha" in iTunes for your iPod so artist "Tha Dogg Pound" is found under "D" and not under "T".
Sorry if this answer is somewhere but I cannot find it. Any help would be greatly appreciated! Thank you in advance!!!

In iTunes for Windows the auto-sort feature is controlled by the file C:\Program Files\iTunes\iTunes.Resources\<Region Code>.lproj\SortPrefixes.plist. For English the words ignored for sorting are "A ", "An " & "The ". You could edit this list or just use the Sort Artist, Sort Album Artist etc. fields as necessary when you'd like something sorted into a different position. I can't recall ever testing to see if the iPod picks up on changes made to this file so it may be that another properties file would need editing on the classic in order to achieve the same end.
tt2

Question about multiple servlet comms

all,
Ok here is the setup:
Let�s say I have 3 servlets (A, B, C)
A is started and then responsible for polling a database to check for updates since last poll until it is destroyed on server shutdown
B is an intermediary servlet
C is responsible for pushing data to the client�s that have subscribed
The problem is this:
A is invoked and begins periodically checking a DB for updated data. Upon finding updated data it should forward the data to B. This does some checking and then in turn forwards the updated data to C. C then formats the data and pushes it to the client�s browser where it is displayed as SVG.
I am thinking B->C could simply be resolved through the use of a request dispatcher.
However the problem lies in the communication of A->B.
Since servlet A should frequently (once a sec) poll and check the database contents to see if it has been updated I thought an easy way to do this would be to have the servlet make its check; if nothing has changed redirect the response back to itself. If there has been a change, update servlet B with that change. The problem is how can one send the update to servlet B without halting servlet A�s cycle?
If I open a httpURL connection to B then A will wait for B to pass a response back, but B wants to forward the request, via request dispatcher to C after some processing. Therefore A will hang as no response from B will be written.
If I have A use a request dispatcher to forward the data to B I am unable to redirect the response back to A and thus have it continuously checking.
Unfortunately it is unlikely I can make any changes to the architecture. Any ideas?
Kind regards

Sorry I can't help but I am interested in a similar problem.
Anyone out there?

Question about sorting of items...

...when their perspective is published as a portlet. We have a perspective published as a portlet, and the items are seemingly sorted in some random order. How are these items sorted? Thanks for the help.

I assume you're using Portal 3.0. There's not much you can do to control the sorting in the category or perspective portlets. In Portal Release 2, the custom search portlet replaces the category/perspective portlets and gives you additional control, including control over the sort order if you don't have Oracle Text enabled.
As a workaround, you could write a custom report or dynamic page using the content area views to display content anyway you want.
Regards,
Jerry
Portal PM

Question about sorting

I'm sorting many, many dozens of pictures into folders.
When I move pics from the "Last 12 Months" view into a folder, the view switches to that folder. To resume sorting, I have to go back to the 12-month view, re-find the pics I left off on, select the new ones, move them, and - bamm - I'm now seeing the folder I just moved THOSE to. Lather, rinse, repeat.
Is there any way to stay in the 12 Months view as I move pictures into other folders? This is such a tedious waste of time!
Thanks in advance for any advice.

You need to clarify terms.
Folder in iPhoto don't contain photos. They hold Albums (which do contain photos) or other folders.
So what are you moving to?
Also, 'Last 12 months' isn't a "place" in iPhoto. It's just a list.

Question about sort technique

we have a report that shows a list of contacts and we have an sub-report that displays (1) one field max(history completed date) so we can see that last time the contact was talked to. The issue is: if we want to have a sort parameter sorts on the max(history completed date) field. How would we do this?
1) pass the field value from the sub-report to the main report?
2) don't created a sub-report, create field value in the main report using sql
Please comment on the approaches above or any other methods that I might not have thought of.

Better yet, here's a sample of what your query should look like.
Insert it into 'Add Command'
select contact_names,
(select max(lasttime) from time.table b where a.contactID=b.contactID)
from table.contacts a
Enjoy,
Zack H.

Questions about AVCHD after being Ingested

I ingested AVCHD video shot with a Panasonic HDC-SD1, using Log and Transfer. The video appears in my Browser.
1. I do not seem to see any settings for ingesting video like you would set when using Log and Capture. Are there any settings like this?
2. The video is now in my Browser, what video format is it in? I have read that it needs to be converted to ProRes to work in FCP. Is this something I need to do, or did it already happen during Log and Transfer?
Thanks!!!

Hi gogiangigo,
I just checked my Capture Scratch and the videos appear there as .mov and I did a Get Info on them and they are indeed ProRes. I have read about so many people having problems ingesting AVCHD that I just figured it would be more difficult to ingest and work with in FCP. It seemed easy to me.
1. I used the default settings to ingest it. I just want to make sure I am not missing anything. Are there any settings that may affect the quality?
2. Is there anything special that needs to be done with the video once it is ingested, or can it be edited and encoded just like any other video at this point?
Thanks!!!

Question about sorting arrays

Hi,
I have posted information from an one-dimensional array on to a list widget. When a user selects an item in the list(index value = 3), presses the delete button, the item would be removed. Likewise, the element of the array at index value 3 would also be removed (or set to null?).
The trouble I am having is, how would you move up the elements that are subsequent to the element index value 3? For example, moving element index value 4 up to 3, 5 up to 4, 6 up to 5....etc.?
Here is my code:
public void delete()
list.delItem(list.getSelectedIndex());
student[list.getSelectedIndex()]=null;
Thanks alot!!

It's usually faster to use System.arraycopy() to close up the "hole" when removing something from an array: public void delete() {
 int index = list.getSelectedIndex() ;
 list.delItem(index) ;
 // if not removing last item... close up hole...
 if (index < (student.length-1)) {
 System.arraycopy(student, index+1, student, index, student.length - 1 - index) ;
 // clear out space made empty at end of array
 student[student.length-1] = null ; // or whatever represents 'empty' in your student[]

Question about sort after commit

Similar Messages

Maybe you are looking for