Replacement for hypercam program

Does anybody know if there is a program like hypercam for mac?
Thanx

Yes
SnapzProX
http://www.ambrosiasw.com/utilities/snapzprox/
iFelix

Similar Messages

OS X replacement for Microsoft's SyncToy

Microsoft released SyncToy for download last year and I began to rely on it for basic syncing between my flash drive and my PC. (If you don't know what SyncToy is, go to http://www.microsoft.com/windowsxp/using/digitalphotography/prophoto/synctoy.msp x.)
A few weeks ago, I bought my first Mac, and I have been looking for a replacement for this program since. Anybody know of any good file sync utilities? Freeware is better. Thanks!

Anybody out there???
I've discovered ChronoSync (http://www.econtechnologies.com/site/Pages/ChronoSync/chrono_overview.html), but I would prefer freeware. Its just for syncing one of my documents folders with my flash drive. Please help!

Replacement for the Replacement? help!! 1st generation program

Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
Thanks in advance...

Apple Service Operations
3011 Laguna Blvd., Building A
ELk Grove, CA 95758

What is the cost of replacing a battery for an Ipad 2 in India? On asking the service centre, I was informed the entire Ipad would be replaced for 20K which is exorbitant. Is it advisable to buy the Apple protection program in this case?

What is the cost of replacing a battery for an Ipad 2 in India? On asking the service centre, I was informed the entire Ipad would be replaced for 20K which is exorbitant. The same is done in US for a paltry (comparably) 100 dollars. Is it advisable to buy the Apple protection program in this case?

Battery Replacement
http://www.apple.com/batteries/replacements.html

Hi! How can I change the shipping address for the program of replacement of the 1 generation ipod nano? I've already received the empty box and now I should send back the old ipod but I'd like to receive the new one to another address. Thank you.

Hi! How can I change the shipping address for the program of replacement of the 1 generation ipod nano? I've already received the empty box and now I should send back the old ipod but I'd like to receive the new one to another address. Thank you.

I would contact Apple directly and have them work with to get the iPod shipped to a new/different address.
http://www.apple.com/contact/
B-rock

So I had photshop cs5 installed on my pc...i had to get my hard drive replaced! I have the serial number and everything, but I need to know how to download it. I really don't wanna have to pay for the program over again.

So I had photshop cs5 installed on my pc...i had to get my hard drive replaced! I have the serial number and everything, but I need to know how to download it. I really don't wanna have to pay for the program over again.

If you registered your product, you should be able to find the download and serial number from your Adobe account.
https://www.adobe.com/account.html
Otherwise:
Download Adobe CS5.5 Trials: Direct Links (no Assistant or Manager) | ProDesignTools
You might still have to contact Customer Support to reset your Activations, unless you managed to deactivate the original installation.

Replacement for Appleworks "Draw" Program?

Hi -
With Apple's announcement that it will no longer upgrade or support Appleworks, can anyone recommend a simple (and inexpensive) replacement for AW's Draw program? I use it a lot for creating CD/DVD covers and inserts and would love to find a more modern and -- but non-complex -- replacement. Thanks for any recommendations.
Shelly

With Apple's announcement that it will no longer upgrade or support Appleworks, ....
I guess I don't understand the premise here. It's been years and years since Apple has supported AW in any reasonable way, and it's been known or at least accepted for some time that nothing further was likely to happen after 6.2.9.
The only thing that's changed is that it's no longer sold in the Apple Store. The support page (http://www.apple.com/support/appleworks/) still exists, downloads and links are still alive from there, and of course there is still this forum and the rest of the support structure in place (knocking softly on wood).
At the end of the day, why start rushing around now to look for a replacement? If it meets your needs and will continue to do so, then you should, and should be able to, continue to use it.
In a different thread in a different forum I came across a post which stated that AW would not be usable on Leopard. If that's the case, it's come as news to me — is it some announcement that I've missed, some connection I've not made?
If so — so sad, too bad, and will just delay my transition into the new OS.

QuickJog 1.0 - Shuttle/Jog Replacement for Premiere CS6... almost

quickJog 1.0 - "fixing what Adobe broke in CS6"
a shuttle/jog replacement for Premiere/Prelude CS6
* see below for download links and instructions *
Introduction
I'll waste no time in expressing my opinion on this one: I loved the jog control in previous versions of Premiere, and a small part of my heart died when I realised that those beloved controls couldn't be reinstated in CS6 (though an ever larger chunk died when I realised that Q and W don't work by default in Prelude... ).
JKL is great as a concept, but in practice, not very responsive - it's difficult to make precise jumps in speed quickly, and I'd hate to log footage in CS6 using the JKL keys alone.
It was whilst reading through a different thread on the forums that I had an idea. Why not just jog with the middle mouse button? REAPER uses a similar idea to great effect for scrubbing.
And so the journey began.
Installing/using quickJog
Pre-requisites
Glovepie is only available for Windows. The script, therefore, only works on Windows.
Sorry Mac users.
To use quickJog, you'll need to download the following:
GlovePie, from glovepie.org. Doesn't matter whether you grab the version with or without emotiv support, as long as it's a recent version
The quickJog script, from bit.ly/getQuickJog (unreserved thanks go to Creative Inlet Films for hosting this)
A mouse with a middle-mouse button/clickable scroll wheel
You'll also need to ensure:
The JKL keys have not been re-mapped in Premiere. This is essential, as quickJog 'presses' the JKL keys to alter the jog speed in Premiere.
Installation/usage
Is currently as simple as...
Start Glovepie
From the File menu, select Open...
Navigate to wherever you unzipped the quickJog script. Open it.
Click the Run button
Click the [ .] button at the end of the menu bar to minimise Glovepie to the system tray
To shuttle, click on the program monitor, source monitor or trim monitor, and scroll the mouse wheel. This functionality is built-into Premiere. You can hold Shift for bigger jumps.
To jog, click and hold the middle-mouse button over the source monitor, program monitor, or timeline, and move left or right to increase/decrese the jog speed (just like the old jog slider).
QuickJog tracks the position of the mouse itself, not the position of your mouse cursor, so don't worry about the cursor touching the edge of your screen.
Keep your eyes on the video, not the mouse!
To exit, right-click the glovePie icon, and select Exit.
quickJog works in Prelude too, which is pretty cool.
Links/Misc
HOW AWESOME WOULD SOME EXTRA BITS OF INFORMATION BE FOR THE WORLD? Like information on how to tweak the configuration variables??
Pretty awesome, I'd say James. Have you thought about actually writing this section, then?
Paha! Don't be crass.
Aww.

I stand humbly informed!
In hindsight, I'm not surprised that the JKL keys are a popular choice amongst editors (especially for those who've moved across from other NLEs), but it does rest somewhat uncomfortably in my heart. It feels like Adobe have replaced the pedals and gearstick in my car with a keyboard: not great for those moments when a child runs into the road.
The Shuttle Pro (and Bella to my knowledge?) controllers emulate left/right arrow keypresses to do their work, making the playback 'glitchy' during shuttle operations - I don't like that. I didn't particularly like the feel of the Shuttle Pro when I tried it either. I do like controllers like this (I have one), but have been working for some time on interfacing between the Sony 9-pin protocol and Premiere.
As such, my intermediate preference has been to use a graphics tablet (with a keyboard) for NLE work - hence why having the jog/shuttle controls on screen was so darn useful! Now that I have quickJog mapped to the stylus eraser, edits are much faster.
Quick aside: Huge commendations on just how much can be mapped to keyboard shortcuts in Premiere, huzzah!

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

How to improve performace for this program

Hi,
I want to improve performance for this program.Pls help me.Here is the code.
Thanks
kumar
--# SCCS: @(#)nscdprpt_rpt_fam_fweq_detail_aggr_dml.sql 2.1 08/17/05 12:16:11
--# Location: /appl/dpdm/src/sql/SCCS/s.nscdprpt_rpt_fam_fweq_detail_aggr_dml.sql
-- =============================================================================
-- Purpose:
-- DML Script to calculate aggregate rows from table NSCDPRPT.RPT_FAM_FWEQ_DETAIL
-- inserts one (1) monthly total row for each comparison type (6 of them)
-- Modification History
-- Date Version Who What
-- 28-Jun-05 V1.00 J. Myers Initial Version
-- 17-Aug-05 gzuerc Replaced UNION ALL code with INSERT's to avoid
-- Oracle error out of undo tablespace.
-- ============================================================================
-- NOTES:
-- This process pulls data from RPT_FAM_FWEQ_DETAIL table.
-- The target table RPT_FAM_FWEQ_DETAIL_AGGR is truncated by plan_ctry and loaded daily;
-- it is the data used in the Forecast Accuracy Measurements Report.
-- The input data is 'wide' (6 quantities), and this script outputs a single
-- row for each quantity as a 'thin' table (single column F1_QTY and F2_QTY shared by all quantities), and
-- with a ROW_TYPE = 'TOTAL'
-- Two (2) other scripts add additional rows to this table as follows:
-- 1) nscdprpt_rpt_fam_FWEQ_detail_aggr_sesn_avg_dml.sql => calculates the
-- total quantities F1_QTY, F2_QTY and AE for each LEVEL_VALUE
-- 2) nscdprpt_rpt_fam_FWEQ_detail_aggr_pct_swg_dml.sql => calculates the
-- percent swing in quantities between DISP_EVENTS for each grouping
-- of PLAN_CTRY, DIVISION, SEASON and TRG_EVENT_NUM for only LEVEL_TYPE = 'SUB_CAT'
-- =============================================================================
-- The result set from joining RPT_FAM_FWEQ_DETAIL rows with comparison types
-- is inserted into the table RPT_FAM_FWEQ_DETAIL_AGGR
INSERT INTO rpt_fam_FWEQ_detail_aggr
SELECT plan_ctry,
division,
season,
monthly_seq,
 bucket_month_date,
tier_num,
level_num,
tier_volume,
trg_event_num,
disp_event_num,
max_event_num,
compare_name,
first_display_event_num,
level_type,
level_value,
'TOTAL' AS row_type,
material,
key_material,
sap_cat_cd,
sap_cat_desc,
sap_sub_cat_cd,
sap_sub_cat_desc,
sty_colr_sdesc,
sty_grp_nbr,
sty_grp_desc,
matl_typ,
sap_prod_typ_grp, -- 'Type Group' in Brio
typ_grp_desc, -- 'Type Group' in Brio
curr_prod_i2_life_cyc_cd,
NULL AS promo_ind, -- for future use
-- Each RPT_FAM_FWEQ_DETAIL row's eight (8) quantity columns are broken down
-- into F1_QTY from DISP_aaaa_QTY, F2_QTY from TRG_aaaa_QTY and
 -- AE from aaaa_AE where 'aaaa' is equal to one of the COMPARE_TYPEs below:
-- F1_QTY
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
disp_dlvry_plan_qty
WHEN compare_type = 'NET' THEN
disp_net_qty
WHEN compare_type = 'NET_AO' THEN
disp_ao_qty
WHEN compare_type = 'NET_FTRS' THEN
disp_futr_qty
WHEN compare_type = 'NET_REPLENS' THEN
disp_replen_qty
WHEN compare_type = 'AUTH_FTRS' THEN
disp_auth_futr_qty
END as f1_qty,
-- F2_QTY
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
trg_dlvry_plan_qty
WHEN compare_type = 'NET' THEN
trg_net_qty
WHEN compare_type = 'NET_AO' THEN
trg_ao_qty
WHEN compare_type = 'NET_FTRS' THEN
trg_futr_qty
WHEN compare_type = 'NET_REPLENS' THEN
trg_replen_qty
WHEN compare_type = 'AUTH_FTRS' THEN
trg_auth_futures_qty
END as f2_qty,
-- AE
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
abs(disp_dlvry_plan_qty - trg_dlvry_plan_qty)
WHEN compare_type = 'NET' THEN
abs(disp_net_qty - trg_net_qty)
WHEN compare_type = 'NET_AO' THEN
abs(disp_ao_qty - trg_ao_qty)
WHEN compare_type = 'NET_FTRS' THEN
abs(disp_futr_qty - trg_futr_qty)
WHEN compare_type = 'NET_REPLENS' THEN
abs(disp_replen_qty - trg_replen_qty)
WHEN compare_type = 'AUTH_FTRS' THEN
abs(disp_auth_futr_qty - trg_auth_futures_qty)
END as ae,
SYSDATE AS zz_insert_tmst
FROM
-- The following in-line view provides three (3) result sets from the RPT_FAM_FWEQ_DETAIL table
 -- This in-line view returns only LEVEL_NUM = 1 or LEVEL_TYPE = 'SUB_CAT' data
 SELECT plan_ctry,
 division,
 season,
 monthly_seq,
 bucket_month_date,
 tier_num,
 level_num,
 tier_volume,
 trg_event_num,
 trg_event_type,
 disp_event_num,
 max_event_num,
 first_display_event_num,
 level_type,
 level_value,
 -- The following NULL'd columns' values cannot be saved due to aggregation
 NULL AS material,
 NULL AS key_material,
 sap_cat_cd,
 sap_cat_desc,
 sap_sub_cat_cd,
 sap_sub_cat_desc,
 NULL AS sty_colr_sdesc,
 NULL AS sty_grp_nbr,
 NULL AS sty_grp_desc,
 NULL AS matl_typ,
 sap_prod_typ_grp, -- 'Type Group' in Brio
 typ_grp_desc, -- 'Type Group' in Brio
 NULL AS curr_prod_i2_life_cyc_cd,
 sum(disp_net_qty) AS disp_net_qty,
 sum(trg_net_qty) AS trg_net_qty,
 -- ABS(sum(trg_net_qty) - sum(disp_net_qty)) AS net_AE,
 sum(disp_dlvry_plan_qty) AS disp_dlvry_plan_qty,
 sum(trg_dlvry_plan_qty) AS trg_dlvry_plan_qty,
 -- ABS(sum(trg_dlvry_plan_qty) - sum(disp_dlvry_plan_qty)) AS dlvry_plan_AE,
 sum(disp_futr_qty) AS disp_futr_qty,
 sum(trg_futr_qty) AS trg_futr_qty,
 -- ABS(sum(trg_futr_qty) - sum(disp_futr_qty)) AS futr_AE,
 sum(disp_ao_qty) AS disp_ao_qty,
 sum(trg_ao_qty) AS trg_ao_qty,
 -- ABS(sum(trg_ao_qty) - sum(disp_ao_qty)) AS ao_AE,
 sum(disp_replen_qty) AS disp_replen_qty,
 sum(trg_replen_qty) AS trg_replen_qty,
 -- ABS(sum(trg_replen_qty) - sum(disp_replen_qty)) AS replen_AE,
 sum(disp_futr_qty) AS disp_auth_futr_qty,
 sum(trg_auth_futures_qty) AS trg_auth_futures_qty --,
 -- ABS(sum(trg_auth_futures_qty) - sum(disp_futr_qty)) AS auth_futures_AE
 FROM rpt_fam_FWEQ_detail
 WHERE plan_ctry &where_plan_ctry
 and level_num = 1 -- 'SUB-CAT'
 -- AND (promo_ind <> 'Y' OR promo_ind IS null)
 GROUP BY plan_ctry,
 division,
 season,
 monthly_seq,
 bucket_month_date,
 tier_num,
 level_num,
 tier_volume,
 trg_event_num,
 trg_event_type,
 disp_event_num,
 max_event_num,
 first_display_event_num,
 level_type,
 level_value,
 sap_cat_cd,
 sap_cat_desc,
 sap_sub_cat_cd,
 sap_sub_cat_desc,
 sap_prod_typ_grp, -- 'Type Group' in Brio
 typ_grp_desc -- 'Type Group' in Brio
 ) dtl,
 -- The following in-line view returns all of the different combinations
 -- of comparison types in the RPT_FAM_FWEQ_DETAIL table
 -- This select returns the pairing of all forecast types
 SELECT event_type, compare_type, compare_name
 from
 (SELECT event_type, compare_type, compare_type_description || ' to ' || compare_type_description AS compare_name
 FROM rpt_fam_compare_types
 WHERE event_type = 'FCST'
 UNION
 -- This select returns the pairing of all bookings types with forecast types
 SELECT bkng.event_type, fcst.compare_type, bkng.compare_type_description || ' to ' || fcst.compare_type_description AS compare_name
 FROM rpt_fam_compare_types fcst,
 rpt_fam_compare_types bkng
 WHERE fcst.event_type = 'FCST'
 AND bkng.event_type = 'BKNG'
 AND fcst.compare_type = bkng.compare_type
 WHERE event_type || ' ' || compare_type <> 'FCST AUTH_FTRS'
 AND compare_type NOT IN ('NET_SHIP', 'SHIP_NET_FTRS', 'NET_ETS', 'GROSS_FTRS')
 ) cmpr
-- The two (2) in-line views are joined by EVENT_TYPE (i.e. 'FCST' and 'BKNG')
-- to form a product of all RPT_FAM_FWEQ_DETAIL rows with comparison types
WHERE dtl.trg_event_type = cmpr.event_type
ORDER BY plan_ctry,
division,
season,
monthly_seq,
tier_num,
level_num,
tier_volume,
trg_event_num,
disp_event_num,
max_event_num,
first_display_event_num,
level_type,
level_value
COMMIT
INSERT INTO rpt_fam_FWEQ_detail_aggr
SELECT plan_ctry,
division,
season,
monthly_seq,
 bucket_month_date,
tier_num,
level_num,
tier_volume,
trg_event_num,
disp_event_num,
max_event_num,
compare_name,
first_display_event_num,
level_type,
level_value,
'TOTAL' AS row_type,
material,
key_material,
sap_cat_cd,
sap_cat_desc,
sap_sub_cat_cd,
sap_sub_cat_desc,
sty_colr_sdesc,
sty_grp_nbr,
sty_grp_desc,
matl_typ,
sap_prod_typ_grp, -- 'Type Group' in Brio
typ_grp_desc, -- 'Type Group' in Brio
curr_prod_i2_life_cyc_cd,
NULL AS promo_ind, -- for future use
-- Each RPT_FAM_FWEQ_DETAIL row's eight (8) quantity columns are broken down
-- into F1_QTY from DISP_aaaa_QTY, F2_QTY from TRG_aaaa_QTY and
 -- AE from aaaa_AE where 'aaaa' is equal to one of the COMPARE_TYPEs below:
-- F1_QTY
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
disp_dlvry_plan_qty
WHEN compare_type = 'NET' THEN
disp_net_qty
WHEN compare_type = 'NET_AO' THEN
disp_ao_qty
WHEN compare_type = 'NET_FTRS' THEN
disp_futr_qty
WHEN compare_type = 'NET_REPLENS' THEN
disp_replen_qty
WHEN compare_type = 'AUTH_FTRS' THEN
disp_auth_futr_qty
END as f1_qty,
-- F2_QTY
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
trg_dlvry_plan_qty
WHEN compare_type = 'NET' THEN
trg_net_qty
WHEN compare_type = 'NET_AO' THEN
trg_ao_qty
WHEN compare_type = 'NET_FTRS' THEN
trg_futr_qty
WHEN compare_type = 'NET_REPLENS' THEN
trg_replen_qty
WHEN compare_type = 'AUTH_FTRS' THEN
trg_auth_futures_qty
END as f2_qty,
-- AE
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
abs(disp_dlvry_plan_qty - trg_dlvry_plan_qty)
WHEN compare_type = 'NET' THEN
abs(disp_net_qty - trg_net_qty)
WHEN compare_type = 'NET_AO' THEN
abs(disp_ao_qty - trg_ao_qty)
WHEN compare_type = 'NET_FTRS' THEN
abs(disp_futr_qty - trg_futr_qty)
WHEN compare_type = 'NET_REPLENS' THEN
abs(disp_replen_qty - trg_replen_qty)
WHEN compare_type = 'AUTH_FTRS' THEN
abs(disp_auth_futr_qty - trg_auth_futures_qty)
END as ae,
SYSDATE AS zz_insert_tmst
FROM
 -- This in-line view returns only LEVEL_NUM = 2 or LEVEL_TYPE = 'STYLE_GROUP' data
 (SELECT plan_ctry,
 division,
 season,
 monthly_seq,
 bucket_month_date,
 tier_num,
 level_num,
 tier_volume,
 trg_event_num,
 trg_event_type,
 disp_event_num,
 max_event_num,
 first_display_event_num,
 level_type,
 level_value,
 -- The following NULL'd columns' values cannot be saved due to aggregation
 NULL AS material,
 NULL AS key_material,
 sap_cat_cd,
 sap_cat_desc,
 sap_sub_cat_cd,
 sap_sub_cat_desc,
 NULL AS sty_colr_sdesc,
 sty_grp_nbr,
 sty_grp_desc,
 NULL AS matl_typ,
 sap_prod_typ_grp, -- 'Type Group' in Brio
 typ_grp_desc, -- 'Type Group' in Brio
 NULL AS curr_prod_i2_life_cyc_cd,
 sum(disp_net_qty) AS disp_net_qty,
 sum(trg_net_qty) AS trg_net_qty,
 -- ABS(sum(trg_net_qty) - sum(disp_net_qty)) AS net_AE,
 sum(disp_dlvry_plan_qty) AS disp_dlvry_plan_qty,
 sum(trg_dlvry_plan_qty) AS trg_dlvry_plan_qty,
 -- ABS(sum(trg_dlvry_plan_qty) - sum(disp_dlvry_plan_qty)) AS dlvry_plan_AE,
 sum(disp_futr_qty) AS disp_futr_qty,
 sum(trg_futr_qty) AS trg_futr_qty,
 -- ABS(sum(trg_futr_qty) - sum(disp_futr_qty)) AS futr_AE,
 sum(disp_ao_qty) AS disp_ao_qty,
 sum(trg_ao_qty) AS trg_ao_qty,
 -- ABS(sum(trg_ao_qty) - sum(disp_ao_qty)) AS ao_AE,
 sum(disp_replen_qty) AS disp_replen_qty,
 sum(trg_replen_qty) AS trg_replen_qty,
 -- ABS(sum(trg_replen_qty) - sum(disp_replen_qty)) AS replen_AE,
 sum(disp_futr_qty) AS disp_auth_futr_qty,
 sum(trg_auth_futures_qty) AS trg_auth_futures_qty --,
 -- ABS(sum(trg_auth_futures_qty) - sum(disp_futr_qty)) AS auth_futures_AE
 FROM rpt_fam_FWEQ_detail
 WHERE plan_ctry &where_plan_ctry
 and level_num = 2 -- 'STYLE-GRP' or 'STYLE'
 -- AND (promo_ind <> 'Y' OR promo_ind IS null)
 GROUP BY plan_ctry,
 division,
 season,
 monthly_seq,
 bucket_month_date,
 tier_num,
 level_num,
 tier_volume,
 trg_event_num,
 trg_event_type,
 disp_event_num,
 max_event_num,
 first_display_event_num,
 level_type,
 level_value,
 sap_cat_cd,
 sap_cat_desc,
 sap_sub_cat_cd,
 sap_sub_cat_desc,
 sty_grp_nbr,
 sty_grp_desc,
 sap_prod_typ_grp, -- 'Type Group' in Brio
 typ_grp_desc -- 'Type Group' in Brio
 ) dtl,
 -- The following in-line view returns all of the different combinations
 -- of comparison types in the RPT_FAM_FWEQ_DETAIL table
 -- This select returns the pairing of all forecast types
 SELECT event_type, compare_type, compare_name
 from
 (SELECT event_type, compare_type, compare_type_description || ' to ' || compare_type_description AS compare_name
 FROM rpt_fam_compare_types
 WHERE event_type = 'FCST'
 UNION
 -- This select returns the pairing of all bookings types with forecast types
 SELECT bkng.event_type, fcst.compare_type, bkng.compare_type_description || ' to ' || fcst.compare_type_description AS compare_name
 FROM rpt_fam_compare_types fcst,
 rpt_fam_compare_types bkng
 WHERE fcst.event_type = 'FCST'
 AND bkng.event_type = 'BKNG'
 AND fcst.compare_type = bkng.compare_type
 WHERE event_type || ' ' || compare_type <> 'FCST AUTH_FTRS'
 AND compare_type NOT IN ('NET_SHIP', 'SHIP_NET_FTRS', 'NET_ETS', 'GROSS_FTRS')
 ) cmpr
-- The two (2) in-line views are joined by EVENT_TYPE (i.e. 'FCST' and 'BKNG')
-- to form a product of all RPT_FAM_FWEQ_DETAIL rows with comparison types
WHERE dtl.trg_event_type = cmpr.event_type
ORDER BY plan_ctry,
division,
season,
monthly_seq,
tier_num,
level_num,
tier_volume,
trg_event_num,
disp_event_num,
max_event_num,
first_display_event_num,
level_type,
level_value
COMMIT
INSERT INTO rpt_fam_FWEQ_detail_aggr
SELECT plan_ctry,
division,
season,
monthly_seq,
 bucket_month_date,
tier_num,
level_num,
tier_volume,
trg_event_num,
disp_event_num,
max_event_num,
compare_name,
first_display_event_num,
level_type,
level_value,
'TOTAL' AS row_type,
material,
key_material,
sap_cat_cd,
sap_cat_desc,
sap_sub_cat_cd,
sap_sub_cat_desc,
sty_colr_sdesc,
sty_grp_nbr,
sty_grp_desc,
matl_typ,
sap_prod_typ_grp, -- 'Type Group' in Brio
typ_grp_desc, -- 'Type Group' in Brio
curr_prod_i2_life_cyc_cd,
NULL AS promo_ind, -- for future use
-- Each RPT_FAM_FWEQ_DETAIL row's eight (8) quantity columns are broken down
-- into F1_QTY from DISP_aaaa_QTY, F2_QTY from TRG_aaaa_QTY and
 -- AE from aaaa_AE where 'aaaa' is equal to one of the COMPARE_TYPEs below:
-- F1_QTY
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
disp_dlvry_plan_qty
WHEN compare_type = 'NET' THEN
disp_net_qty
WHEN compare_type = 'NET_AO' THEN
disp_ao_qty
WHEN compare_type = 'NET_FTRS' THEN
disp_futr_qty
WHEN compare_type = 'NET_REPLENS' THEN
disp_replen_qty
WHEN compare_type = 'AUTH_FTRS' THEN
disp_auth_futr_qty
END as f1_qty,
-- F2_QTY
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
trg_dlvry_plan_qty
WHEN compare_type = 'NET' THEN
trg_net_qty
WHEN compare_type = 'NET_AO' THEN
trg_ao_qty
WHEN compare_type = 'NET_FTRS' THEN
trg_futr_qty
WHEN compare_type = 'NET_REPLENS' THEN
trg_replen_qty
WHEN compare_type = 'AUTH_FTRS' THEN
trg_auth_futures_qty
END as f2_qty,
-- AE
CASE WHEN compare_type = 'DELIVERY_PLAN' THEN
abs(disp_dlvry_plan_qty - trg_dlvry_plan_qty)
WHEN compare_type = 'NET' THEN
abs(disp_net_qty - trg_net_qty)
WHEN compare_type = 'NET_AO' THEN
abs(disp_ao_qty - trg_ao_qty)
WHEN compare_type = 'NET_FTRS' THEN
abs(disp_futr_qty - trg_futr_qty)
WHEN compare_type = 'NET_REPLENS' THEN
abs(disp_replen_qty - trg_replen_qty)
WHEN compare_type = 'AUTH_FTRS' THEN
abs(disp_auth_futr_qty - trg_auth_futures_qty)
END as ae,
SYSDATE AS zz_insert_tmst
FROM
 -- This in-line view returns only LEVEL_NUM = 3 or LEVEL_TYPE = 'MATL' data
 (SELECT plan_ctry,
 division,
 season,
 monthly_seq,
 bucket_month_date,
 tier_num,
 level_num,
 tier_volume,
 trg_event_num,
 trg_event_type,
 disp_event_num,
 max_event_num,
 first_display_event_num,
 level_type,
 level_value,
 material,
 key_material,
 sap_cat_cd,
 sap_cat_desc,
 sap_sub_cat_cd,
 sap_sub_cat_desc,
 sty_colr_sdesc,
 sty_grp_nbr,
 sty_grp_desc,
 matl_typ,
 sap_prod_typ_grp, -- 'Type Group' in Brio
 typ_grp_desc, -- 'Type Group' in Brio
 curr_prod_i2_life_cyc_cd,
 sum(disp_net_qty) AS disp_net_qty,
 sum(trg_net_qty) AS trg_net_qty,
 -- ABS(sum(trg_net_qty) - sum(disp_net_qty)) AS net_AE,
 sum(disp_dlvry_plan_qty) AS disp_dlvry_plan_qty,
 sum(trg_dlvry_plan_qty) AS trg_dlvry_plan_qty,
 -- ABS(sum(trg_dlvry_plan_qty) - sum(disp_dlvry_plan_qty)) AS dlvry_plan_AE,
 sum(disp_futr_qty) AS disp_futr_qty,
 sum(trg_futr_qty) AS trg_futr_qty,
 -- ABS(sum(trg_futr_qty) - sum(disp_futr_qty)) AS futr_AE,
 sum(disp_ao_qty) AS disp_ao_qty,
 sum(trg_ao_qty) AS trg_ao_qty,
 -- ABS(sum(trg_ao_qty) - sum(disp_ao_qty)) AS ao_AE,
 sum(disp_replen_qty) AS disp_replen_qty,
 sum(trg_replen_qty) AS trg_replen_qty,
 -- ABS(sum(trg_replen_qty) - sum(disp_replen_qty)) AS replen_AE,
 sum(disp_futr_qty) AS disp_auth_futr_qty,
 sum(trg_auth_futures_qty) AS trg_auth_futures_qty --,
 -- ABS(sum(trg_auth_futures_qty) - sum(disp_futr_qty)) AS auth_futures_AE
 FROM rpt_fam_FWEQ_detail
 WHERE plan_ctry &where_plan_ctry
 and level_num = 3 -- 'MATERIAL'
 -- AND promo_ind <> 'Y'
 GROUP BY plan_ctry,
 division,
 season,
 monthly_seq,
 bucket_month_date,
 tier_num,
 level_num,
 tier_volume,
 trg_event_num,
 trg_event_type,
 disp_event_num,
 max_event_num,
 first_display_event_num,
 level_type,
 level_value,
 material,
 key_material,
 sap_cat_cd,
 sap_cat_desc,
 sap_sub_cat_cd,
 sap_sub_cat_desc,
 sty_colr_sdesc,
 sty_grp_nbr,
 sty_grp_desc,
 matl_typ,
 sap_prod_typ_grp, -- 'Type Group' in Brio
 typ_grp_desc, -- 'Type Group' in Brio
 curr_prod_i2_life_cyc_cd
 ) dtl,
 -- The following in-line view returns all of the different combinations
 -- of comparison types in the RPT_FAM_FWEQ_DETAIL table
 -- This select returns the pairing of all forecast types
 SELECT event_type, compare_type, compare_name
 from
 (SELECT event_type, compare_type, compare_type_description || ' to ' || compare_type_description AS compare_name
 FROM rpt_fam_compare_types
 WHERE event_type = 'FCST'
 UNION
 -- This select returns the pairing of all bookings types with forecast types
 SELECT bkng.event_type, fcst.compare_type, bkng.compare_type_description || ' to ' || fcst.compare_type_description AS compare_name
 FROM rpt_fam_compare_types fcst,
 rpt_fam_compare_types bkng
 WHERE fcst.event_type = 'FCST'
 AND bkng.event_type = 'BKNG'
 AND fcst.compare_type = bkng.compare_type
 WHERE event_type || ' ' || compare_type <> 'FCST AUTH_FTRS'
 AND compare_type NOT IN ('NET_SHIP', 'SHIP_NET_FTRS', 'NET_ETS', 'GROSS_FTRS')
 ) cmpr
-- The two (2) in-line views are joined by EVENT_TYPE (i.e. 'FCST' and 'BKNG')
-- to form a product of all RPT_FAM_FWEQ_DETAIL rows with comparison types
WHERE dtl.trg_event_type = cmpr.event_type
ORDER BY plan_ctry,
division,
season,
monthly_seq,
tier_num,
level_num,
tier_volume,
trg_event_num,
disp_event_num,
max_event_num,
first_display_event_num,
level_type,
level_value
COMMIT
/

I agree.
SELECT ticket_no,name_of_the_passenger..
FROM ticket_master
WHERE ticket_no NOT IN
(SELECT Ticket_no
FROM ticket_cancellations
WHERE trip_id = my_trip_id);
This involves creating a little temp table for each record in ticket_no. Then full scanning it.
Change it to
SELECT ticket_no,name_of_the_passenger..
FROM ticket_master B
WHERE ticket_no NOT EXISTS
(SELECT null
FROM ticket_cancellations A
WHERE A.ticket_no = B.ticket_no
AND trip_id = my_trip_id);
Then you get an index hit in both cases.

Schedule a background job for a program using ABAP code.

Hi,
I have to write a program to schedule a background job for another program.
Need your help to understand how we can achieve this functionality.Any example of an abap code would be of great help.
Need it urgently.
Thanks in advance.
Sandeep.

Hi Sandeep,
Here is the demo program regarding the BDC For the background job.
report zprprbdc1
 no standard page heading line-size 255.
include bdcrecx1.
parameters: dataset(132) lower case.
*** DO NOT CHANGE - the generated data section - DO NOT CHANGE ***
* If it is nessesary to change the data section use the rules:
* 1.) Each definition of a field exists of two lines
* 2.) The first line shows exactly the comment
* '* data element: ' followed with the data element
* which describes the field.
* If you don't have a data element use the
* comment without a data element name
* 3.) The second line shows the fieldname of the
* structure, the fieldname must consist of
* a fieldname and optional the character '_' and
* three numbers and the field length in brackets
* 4.) Each field must be type C.
*** Generated data section with specific formatting - DO NOT CHANGE ***
***data: begin of itab occurs 0 ,
*** matnr(20) type c,
*** mbrsh(30) type c,
*** mtart(30) type c,
*** kzsel(20) type c,
*** maktx(40) type c,
*** meins(5) type c,
*** end of itab.
data: begin of record occurs 0,
* data element: MATNR
 matnr_001(018),
* data element: MBRSH
 mbrsh_002(001),
* data element: MTART
 mtart_003(004),
* data element: XFELD
 kzsel_01_004(001),
* data element: MAKTX
 maktx_005(040),
* data element: MEINS
 meins_006(003),
* data element: MTPOS_MARA
 mtpos_mara_007(004),
 end of record.
*** End generated data section ***
start-of-selection.
*perform open_dataset using dataset.
perform open_group.
**do.
**read dataset dataset into record.
**if sy-subrc <> 0. exit. endif.
call function 'GUI_UPLOAD'
exporting
 filename = 'c:\jitu\bdc\10002.txt'
 filetype = 'ASC'
 has_field_separator = 'x'
* HEADER_LENGTH = 0
* READ_BY_LINE = 'X'
* DAT_MODE = ' '
* CODEPAGE = ' '
* IGNORE_CERR = ABAP_TRUE
* REPLACEMENT = '#'
* CHECK_BOM = ' '
* VIRUS_SCAN_PROFILE =
* NO_AUTH_CHECK = ' '
* IMPORTING
* FILELENGTH =
* HEADER =
tables
 data_tab = record
* EXCEPTIONS
* FILE_OPEN_ERROR = 1
* FILE_READ_ERROR = 2
* NO_BATCH = 3
* GUI_REFUSE_FILETRANSFER = 4
* INVALID_TYPE = 5
* NO_AUTHORITY = 6
* UNKNOWN_ERROR = 7
* BAD_DATA_FORMAT = 8
* HEADER_NOT_ALLOWED = 9
* SEPARATOR_NOT_ALLOWED = 10
* HEADER_TOO_LONG = 11
* UNKNOWN_DP_ERROR = 12
* ACCESS_DENIED = 13
* DP_OUT_OF_MEMORY = 14
* DISK_FULL = 15
* DP_TIMEOUT = 16
* OTHERS = 17
if sy-subrc <> 0.
* MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
* WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
endif.
loop at record .
perform bdc_dynpro using 'SAPLMGMM' '0060'.
perform bdc_field using 'BDC_CURSOR'
 'RMMG1-MATNR'.
perform bdc_field using 'BDC_OKCODE'
 '/00'.
perform bdc_field using 'RMMG1-MATNR'
 record-matnr_001.
perform bdc_field using 'RMMG1-MBRSH'
 record-mbrsh_002.
perform bdc_field using 'RMMG1-MTART'
 record-mtart_003.
perform bdc_dynpro using 'SAPLMGMM' '0070'.
perform bdc_field using 'BDC_CURSOR'
 'MSICHTAUSW-DYTXT(01)'.
perform bdc_field using 'BDC_OKCODE'
 '=ENTR'.
perform bdc_field using 'MSICHTAUSW-KZSEL(01)'
 record-kzsel_01_004.
perform bdc_dynpro using 'SAPLMGMM' '4004'.
perform bdc_field using 'BDC_OKCODE'
 '=BU'.
perform bdc_field using 'MAKT-MAKTX'
 record-maktx_005.
perform bdc_field using 'BDC_CURSOR'
 'MARA-MEINS'.
perform bdc_field using 'MARA-MEINS'
 record-meins_006.
perform bdc_field using 'MARA-MTPOS_MARA'
 record-mtpos_mara_007.
perform bdc_transaction using 'MM01'.
**enddo.
endloop.
perform close_group.
*perform close_dataset using dataset.
&*****************Reward point if helpful************&

Dv6 hard drive failing how do i transferrer os 7 and hp info ??? i have a 500g wd replacement for it

dv6 hard drive failing how do i transferrer os 7 and hp info ??? I have a 500G wd replacement for it.
I have transferrer my self using WD Smart ware and a separate win 7 backed up to a WD 2T external ( win 7 backup is now struggling to back up but I do have one copy)
when new HD was put in, and repair disk put in it wouldn't pick up the back up off the WD 2 T. WIN 7 or my manual backup.
So I loaded up a win 7 32bit (off an older computer which is now parts) but it wouldn't reconis Win 7 back up on the WD 2 T.
Using WD smart ware. I did transferrer all the files over to the new HD but could only make an put it in a new folder. Not reload back to the same as it was before I had to transferrer every thing.
I am know stuck with win 7 32bit can't use all 6G memory an no Hp info on comp .+ no ordinal programs or settings install
there is probably some small thing I have mist thanks for your help

Hi,
Here is a topic which helps you to clone the old HDD:
http://www.makeuseof.com/tag/5-ways-to-clone-and-copy-your-hard-drive/
Regards.
BH
**Click the KUDOS thumb up on the left to say 'Thanks'**
Make it easier for other people to find solutions by marking a Reply 'Accept as Solution' if it solves your problem.

How do i create a header template for ABAP programs?

Hi all.
Need a little bit of help here. When you create a new program you get a template with space for comments at the top of the program and basic stuff. If I want to change this template to add areas that we want to have comments on for every program we make at work. How do I do that?
Instead of :
I want to have in a way similar to this:
*     Author:                         *
*     Function:                    *
And so on
I want the words to be there when our developers creates the program.
How can I do that?
BR
Kalle

After I create a new report program, I delete everything but the REPORT line. I then put this code in for my skeleton.
* Created By:            Walter Industries (Paul Chapman)
* Created On:            02/29/2008
* Tran Code:             ZLMxx
* Program Name:          YPTC_REPORT_SKELETON        " replace New Progam Name herer
* Program Descr:         Configurable Leads Data Query
*                         Modification Log
* Programmer   :Issue:   Date   : Chg Req. : Description
* Paul Chapman :00000:02/29/2008:DEVK000000:New Program
REPORT yptc_report_skeleton MESSAGE-ID zleads_msg.      " replace New Progam Name herer
*_________________________________________________ Tables
TABLES: zpca, cepc, zlmlead.
*_________________________________________________ Constants
CONSTANTS:
line_length      TYPE i VALUE 100,
c_tab            TYPE x VALUE 9,                          " x'09'
c_crlf           TYPE x VALUE 3338. " x'ODOA'
*_________________________________________________ Types
TYPES: BEGIN OF scr_text_line,
         line(line_length) TYPE c,
       END OF scr_text_line.
*_________________________________________________ DATA
DATA:
curr_screen_tab(4) TYPE n.
*_________________________________________________ ALV Area
*_________________________________________________ Ranges
RANGES:
r_branch       FOR zpca-branch.
*_________________________________________________ Selection Screen
SELECTION-SCREEN:
BEGIN OF TABBED BLOCK tabs FOR 36 LINES,
    TAB (20) tab1   USER-COMMAND push1 DEFAULT SCREEN 1010,
    TAB (20) tab2   USER-COMMAND push2 DEFAULT SCREEN 1020,
END OF BLOCK tabs.
* Tab1 Options            S E L E C T I O N    S C R E E N S    Tab 01 *
SELECTION-SCREEN BEGIN OF SCREEN 1010 AS SUBSCREEN.
SELECTION-SCREEN: BEGIN OF BLOCK blk1 WITH FRAME TITLE text-001.
SELECT-OPTIONS:
   sdiv      FOR cepc-prctr MATCHCODE OBJECT zdivjwh,
   ssbrch    FOR zlmlead-branch.
SELECTION-SCREEN: END OF BLOCK blk1.
SELECTION-SCREEN: BEGIN OF BLOCK bl10 WITH FRAME TITLE text-010.
PARAMETERS:
cparm1   AS CHECKBOX USER-COMMAND sel,
cparm2   AS CHECKBOX USER-COMMAND sel,
cparm3   AS CHECKBOX USER-COMMAND sel,
cparm4   AS CHECKBOX USER-COMMAND sel,
cparm5   AS CHECKBOX USER-COMMAND sel.
SELECTION-SCREEN: END OF BLOCK bl10.
SELECTION-SCREEN END OF SCREEN 1010.
* Tab 2 Options            S E L E C T I O N    S C R E E N S   Tab 02 *
SELECTION-SCREEN BEGIN OF SCREEN 1020 AS SUBSCREEN.
SELECTION-SCREEN: BEGIN OF BLOCK blk2 WITH FRAME TITLE text-002.
SELECT-OPTIONS:
   sctype      FOR zlmlead-ctype,
   sprfcnt     FOR zlmlead-prefcont.
SELECTION-SCREEN SKIP.
SELECTION-SCREEN BEGIN OF LINE.
SELECTION-SCREEN COMMENT 1(25)   text-201.
SELECTION-SCREEN POSITION 30.
PARAMETERS: rb_opt1 RADIOBUTTON GROUP gr20.
SELECTION-SCREEN COMMENT 34(03) text-991. " Yes
SELECTION-SCREEN POSITION 40.
PARAMETERS: rb_opt2 RADIOBUTTON GROUP gr20.
SELECTION-SCREEN COMMENT 44(03) text-992. " No
SELECTION-SCREEN POSITION 50.
PARAMETERS: rb_opt3 RADIOBUTTON GROUP gr20.
SELECTION-SCREEN COMMENT 54(06) text-993. " Either
SELECTION-SCREEN END OF LINE.
SELECTION-SCREEN: END OF BLOCK blk2.
SELECTION-SCREEN: BEGIN OF BLOCK bl20 WITH FRAME TITLE text-020.
PARAMETERS:
cb_opt1   AS CHECKBOX,
cb_opt2   AS CHECKBOX DEFAULT 'X'.
SELECTION-SCREEN: END OF BLOCK bl20.
SELECTION-SCREEN END OF SCREEN 1020.
*____________________________________________ Screen Actions
AT SELECTION-SCREEN OUTPUT.
PERFORM what_tab_am_i_on.
CASE curr_screen_tab.
    WHEN '1010'.                                            " Tab 1
    WHEN '1020'.                                            " Tab 2
    WHEN OTHERS.
ENDCASE.
PERFORM tab_hide_unhide.
*___________________________________________ Initialization
INITIALIZATION.
* Tab Text
tab1 = 'Tab 1'.
tab2 = 'Tab 2'.
*_________________________________________________ Load of Program
LOAD-OF-PROGRAM.
*_________________________________________________ Start of Selection
START-OF-SELECTION.
PERFORM set_up_branch_range.
*_________________________________________________ End of Selection
END-OF-SELECTION.
*&      Form what_tab_am_i_on
FORM what_tab_am_i_on.
LOOP AT SCREEN.
    IF     screen-name CS 'BLOCK_1010'.
      curr_screen_tab = '1010'.
    ELSEIF screen-name CS 'BLOCK_1020'.
      curr_screen_tab = '1020'.
    ENDIF.
ENDLOOP.
ENDFORM.                    " what_tab_am_i_on
*&      Form tab_hide_unhide
FORM tab_hide_unhide.
LOOP AT SCREEN.
    CHECK screen-group3 = 'TAB'.
    CASE screen-name.
      WHEN 'TAB1'.
*        IF
*          screen-active = 1.
*          screen-required = 1.
*          screen-input = 1.
*          screen-output = 1.
*          screen-intensified = 1.
*          screen-invisible = 1.
*        ELSE.
*          screen-active = 0.
*          screen-required = 0.
*          screen-input = 0.
*          screen-output = 0.
*          screen-intensified = 0.
*          screen-invisible = 0.
*        ENDIF.
      WHEN 'TAB2'.
*        IF
*          screen-active = 1.
*        ELSE.
*          screen-active = 0.
*        ENDIF.
    ENDCASE.
    MODIFY SCREEN.
ENDLOOP.
ENDFORM.                    " tab_hide_unhide
*&      Form set_up_branch_range
FORM set_up_branch_range.
r_branch[] = ssbrch[].
CHECK NOT sdiv IS INITIAL.
r_branch     = 'IEQ'.
SELECT branch INTO r_branch-low
    FROM zpca
    WHERE region = 'JWHCO'
      AND division IN sdiv.
    APPEND r_branch.
ENDSELECT.
SORT r_branch.
DELETE ADJACENT DUPLICATES FROM r_branch.
ENDFORM.                    " set_up_branch_range

I got the old iphone, can i replace for a new one??

i have a old iphone which was the first iphone. it,s worn out.....can apple replace for a new one of the same model

Apple has an out of warranty replacement program, the cost in the US is $199. I don't know if any original iPhones are still available under this program(remember, that phone was discontinued sometime ago), but even if they were, why would you spend $200 on a discontinued phone?

FM replacement for TRANSFER_NAMES_TO_FIELDS

Hi,
The FM TRANSFER_NAMES_TO_FIELDS is obsole in ECC 6.Can any one suggest the replacement for this FM.
Thanks
Ansari

hi Ansari,
You can use F4IF_INT_TABLE_VALUE_REQUEST, Check out the documentation for more info on that FM
Check out this program too
BCALV_TEST_FULLSCREEN_CALLS
Regards,
Santosh

Replacement for hypercam program

Similar Messages

Maybe you are looking for