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.

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

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.

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

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 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

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 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.

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[]

Questions about using a PDF form online

I have a client who wants to create an online version of a PDF form that they are currently using. I am currently trying to explain to them that this would be best done as an HTML web form, but I may not win this argument. I have only used PDFs for printed forms (either hand-written or using form fields) so I am not familiar with any problems that converting the form for use online would entail.
When the 'Submit' button is pressed on the form, is there a way to redirect to another web page after the data is submitted? (i.e. does the PDF have access to it's outer 'environment'?)
Are there any security issues submitting data using the PDF form as opposed to using a standard web form? (There may be sensitive data being submitted)
I'm not sure how they plan to handle the data that is submitted, but there are several options in the submitForm parameters - I am assuming that using the HTML option would submit the data in the same format as a web form would. Am I correct here?
Can the PDF be prevented from being downloaded or printed? This form should only be used to submit data to their server, not as a printed form.
Are there any other 'gotchas' that I need to look out for? Does anyone have a recommendation for a site which contains any tutorials or guidelines for using PDF forms online?

Thanks for the information.
Yes, I agree that there is less reason for it to be a PDF form (Actually, no real reason other than the original form already exists in PDF), but I am unfortunately in the position that my input in this project is not necessarily being considered (my company is following direct -and inconsistent- directions from the client, and I have no contact with the client to ask questions about what their actual needs are). I have been told to give the client the 'Tomato' that they are asking for, even though they are describing an 'Apple'.
The reason this form is not meant to be printed is that we have replaced the 'Signature' fields from the original form with checkboxes that the user must check to confirm they have 'signed' the document. If they are to print/fax/whatever the document, they should use the original form, not this one. And I am still trying to explain to them that this would be better served with an HTML web form, but I fear I am losing that battle.
I have brought up the fact that it is not 100% guaranteed that Acrobat will be available in the browser, although I can only guess that it is less than likely that anyone will not have some sort of PDF viewer available to their browser.
I will also mention that issues may arise if the file is not submitted from within the browser.

Had to change my Apple ID because the original email address is no longer valid. How do I change the iCloud user name on iMac? I found instructions about signing out of iCloud and signing back end. It asks questions about contact, etc.

Had to change Apple ID due to email address no longer valid. Trying to change id for icloud...saw direction online about signing out of icloud and signing back in...when it ask questions about contacts, photos, etc. being deleted how do I answer those? That just sort of freaks me out.

For the ones that give you an option, select the option you want (keep on the Mac or Delete). For the ones that are simply warning you, click on Delete from Mac.
They will all come back when you sign back on, since all you did was change your existing Apple ID to a new email address. It's the same iCloud account, just with a different name.
It's the only way to get your updated ID signed onto iCloud.
Cheers,
GB

Question about Rescheduling Start Date of a Task

Question about Rescheduling Start Date of a Task
I'm trying to determine whether the 'Reschedule' action is appropriate to my situation...
I have a service that consists of 4 tasks. The first 3 tasks will be completed immediately and then the request's 4th task will sit in a queue for about a month so that all of these requests can be grouped together and fulfilled during a few overnight work sessions.
While the 4th task is waiting to be fulfilled, the technician will be contacting the requestor to schedule the work to be done sometime during a 3 day window. The technician needs to specify which of the 3 days each request will be worked on. I'm not sure if I should store the date in a service form field or have the technician reschedule the task so that the start date of the task is set to one of the 3 days. If I use the reschedule feature, are there any downsides?
The advantage of using the reschedule feature is that the scheduled start date can be displayed in ServiceManager's task list and can therefore be sorted on and queried. This wouldn't be possible if I stored the date in a dictionary field on the service form. In that case, I'd have to use custom reports to group the tasks by start date.
Please let me know your thoughts...
Thanks,
Scott

This strikes me as a very good use of this feature, since your need to to have the date for this task rescheduled/reflected in ServiceManager. This is the specific effect of using this feature.
For the benefit of others reading this post, remember: this rescheduled date will not change the due date for the service.

Question about Id3-tags and song managem

Hello, I am getting ready to buy a Zen Touch 20GB in a couple of weeks and I have a few questions about the management software.
(Correct me if I am wrong about something)
) Are songs organized into groups by Genre instead of just folders like on the Ipod?
2) Are Id3-tags used instead of filename for identification?
3) What parts of the tag are needed besides title and artist?
4) Which version of tags does the Zen Touch recognize: Version or Version 2?
5) If I edit my tags using an external program such as Id3-TagIT, will the tags carry over to the Creative software and to the player?
Thanks a lot for your help. I want to make sure I have my music collection in order before I get my Zen Touch.

euph_jay wrote:Ok, so lets say I have all my music in folders right now seperated into different categories on my hard dri've. Some folders denote the artist, some the album, and some a genre. Example: Folder: Chicago Contents: Chicago .mp3 files Folder: Techno Contents: various Techno artist's songs What is the best way of organizing my folder system, so that the transition will be easy to the player?
Folders are pretty much irrelevant. What the software will do is look at the *tags* in the files and then use these to build the player's library.
Will imbedded folders work on the player? (like Techno->Crystal Method->Cystal Method .mp3's)
Again the player has no concept of folders, although if you set Techno as a Genre tag you will be able to view via this in the Music Library.
Or, am I misunderstanding how music is stored into the mp3 player. Instead of storing music in a "folder like" system (like the Chicago folder or Techno folder), does it store all the songs individually on the device? Then you have to sort it by artist, album, or genre?
Using your example, in the Music Library you have essentially three categories: Album, Artist, and Genre. So under Album you would see "Vegas" (the Crystal Method's album), under Artist you would see "The Crystal Method", and under Genre you would see "Techno" (and then either the album or artist under this... I forget which it is offhand).
Make sense?

Important conceptual question about Application Module, Maximum Pool Size

Hello everyone,
We have a critical question about the Application Module default settings (taking the DB connections from a DataSource)
I know that on the Web it is generally suggested that each request must end with either a commit or rollback when executing PL/SQL blocks "directly" on the DB without the framework BC/ViewObject/Entity service intervention.
Now, for some reasons, we started to develop our applications with thinking that each Web Session would reference exactly one DB session (opened by any instance taken from the AM pool) for the whole duration of the session, so that the changes made by each Web session to its DB session would never interfere with the changes made by "other" Web Sessions to "other" DB sessions .
In other words, because of that convincement we often implemented sort of "transactions" that open and close (with either commit or rollback) each DB session not in/after a single HTTP request, but during many HTTP Requests.
As a concrete example think of this scenario:
1. the user presses the "Insert" button. An HTTP request is fired. The action listener is executed and ends up with inserting rows in a table via a PL SQL block (not via the ViewObjects API).
2. no commit or rollback after the above PL/SQL block is done yet.
3. finally the user presses a "Commit" or "Rollback" button, firing the call to the appropriate AM methos.
Those three requests consist of what I called "transaction".
From the documentation it's clear that there is no guarantee that the couple AM istance + DB session is the same during all the requests.
This means that, during step 2, it's possible that another user might reference the same "pending" AM/DbSession for his needs and "steal" somehow the work done via PL/SQL after step 1. (This happens because sessions taken by the pool are always rolled back by default.)
Now my question is:
Suppose we set the "Maximum Pool Size" parameter to very a great number (always inferior to the maximum number of concurrent users):
Is there any guarantee that all the requests will be isolated in that case?
I hope the problem is clear.
Let me know if you want more details.

Thanks for the answers.
If I am right, from all your answers about resource avaiability, this means that even supposing the framework is able to always give us the same AM instance back from the AM pool (by following the session-affinity criterias), there is, however, no "connection affinity" with the connections from the DataSource. This means that the "same AM instance" might take the "a new DB connection", if necessary, from the connection pool of the DataSource. If that happens, that could give us the same problems as taking "a new AM instance" (that is, not following session-affinity) from the beginning, since each time an a new connection is taken (either via a new AM instance or via the same AM instance plus a new DB connection), the corresponding DB session is rolle back by default, clearing all the pending transactions we might have performed before with direct PL/SQL calls bypassing the AM services during the life cycle of our application, so that the new HTTP request will have a clean DB session to start to work with.

Question about inserting Sysdate (SQL)

Hi all,
I got a question about records insert when one of the fields is sysdate.
I have to store several records representing a log, generated by the execution of a database package.
Inside my package I wrote an internal procedure devoted to insert a record in my log table for each processing step I wanted to trace (I call this proc each time I want to record a certain step of my package).
My log table structure is: PREC_LOGS(log_date DATE, log_message VARCHAR2(1000)), no constraints at all.
Database ver. 8.1.7.1.0 - Production for VMS O.S.
The 'problem' occurs when several records have the same sysdate (DD-MM-YYYY HH24:MI:SS). In this case, if I select log_date,log_message ... order by log_date, the list of records I get respects the sort condition, but when several records have the same sysdate (DD-MM-YYYY HH24:MI:SS), it doesn't respect the order of the steps theoretically inserted by the internal proc.
Resault
25-07-2002 11:10:20 ........ (date changed)
25-07-2002 11:10:22 Loading data for order nr. 82364 (step 3)
25-07-2002 11:10:22 Verifying order nr. 82364 (step 2)
25-07-2002 11:10:22 Procedure started for order nr. 82364 (step 1)
25-07-2002 11:10:22 Updating conditions for order nr. 82364 (step 4)
25-07-2002 11:10:22 Procedure accomplished for order nr. 82364 (step 6)
25-07-2002 11:10:22 Commit changes for order nr. 82364 (step 5)
25-07-2002 11:10:24 ........ (date changed)
Please ask for more detail if someone is interested in replying...I realize it's not a very clear explanation of my issue.
Thanks, Marco

Hi
Add a field to the table that is that uses a sequence
PREC_LOGS(log_id NUMBER(30),log_date DATE, log_message VARCHAR2(1000))
Create a database sequence
The insert statement now becomes something like
INSERT INTO PREC_LOCS(log_id, log_date, log_message)
VALUES (sequence_name.NEXTVAL, SYSDATE, 'Some message');
Then order by the log_id when you do your select.
Daniel

Question about sorting

Similar Messages

Maybe you are looking for