Client asked for the missing functionality (related to RG23D) -
One of my client of SAP B1 2007 B SP0 PL7 asked for the functionality (related to RG23D) as follows -
The tax amount they are paying at the time of purchase for a certain item, they have to receive the same amount of tax from the customer at time of saling the same item. And the tax amount (at the time of purchase) must be populated automatically at the time of sales. And an automatically generated number must be there (starting from purchase) for the reference of this tax amount linking from purchase to sales.
Any one have a suitable solution for this?
N.B. the related report Named RG23D format is also an additional requirement.
Dear Narottam
As on today SAP B1 India Localization doesn't support RG23D, we are working towards providing the solution to this feature. Please keep on checking the SAP market place for updates.
As a workaround, you can replace the amount of AV at the time of sales with the amount of AV at the time of purchase manually so that you passon the right excise duty to end user.
Regards
CA. Deepak Kumar Garg
Regional Solution Manager-IN/SG/ANZ/ZA
SAP India Pvt. Ltd.
Similar Messages
-
by asking for the function seek and replace [apple F] i get no display - so see nothing except the upper grey line. what is going on? and what can i do about it?
restarting doesn't workDoes trashing the preferences help? See Replace Your Preferences
-
I use firefox 4 form beta 9 to RC (zh) now and there are also firefox 3.6 installed in computer. One day when I open Fx 4 RC, some (actually a lot but not all) of the adoons just disappear. When I check on about:addons page, some addons installed do not appear in the list.
The addons '''REMAINED''' including:
* addons I already used in Fx 3.6 (like webmail notifie , xmarks)
* ''addons only can use in Fx 4'' (like Open Web Apps for Firefox).
The addons '''DISAPPEARED''' including:
* addons I already used in Fx 3.6 (like yoono)
* '' addons installed when using Fx 4'' (like updatescanner, Thumbnail Zoom).
But when I check the profile(by Help > Troubleshooting Information>Open Containing Folder) , some (not sure is it all) of the missing addons related files are still here [lucky], so any one know how to make the missing addons back?
Some more details:
* This happened when i use RC for already a few days and keep on even i restart Fx and windows.
* The bookmarks, history, search engine and even themes and icon setting are still here. [ I only sync bookmarks but not history for both xmarks and firefox sync.]
* This addons are really '''disappeared''' but not disable only!
* This number of addons missed, as i remember, at least 30, should be more than that number bacause some of them are installed but in disable mode.
* I try to install back one of the addons - Stylish, the installed code are still here.
* It is nearly an impossible mission to install every missing addons again, as it really kill my time.Delete the files extensions.* (extensions.rdf, extensions.cache, extensions.ini, extensions.sqlite) and compatibility.ini in the Firefox [[Profiles|profile folder]] to reset the extensions registry. New files will be created when required.
See "Corrupt extension files": http://kb.mozillazine.org/Unable_to_install_themes_or_extensions
If you see disabled, not compatible, extensions in "Tools > Add-ons > Extensions" then click the Tools button at the left side of the Search Bar to do a compatibility check. -
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 | <p | ? | >p ] Then swap = part to middle at the end
[ =p | <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 | =p | >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 | ? | =p | ? | >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 MuqaddasThanks 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. -
I deleted my old email address and added a new one, after my iPhone died iCloud keeps popping up asking for the password of my old email address. I can't remember my password and the account is still gone, it pops up every few seconds. How can I fix this?
If you are unable to remember your password, security questions, don’t have access to your rescue address or are unable to reset your password for whatever reason, your only option is to contact AppleCare(or Apple ID Support), upon speaking to an operator you should explain that your problem is related to your Apple ID, this way you will not be charged for assistance, even if you don’t have an AppleCare plan.
The operator will take you through some steps you may have already tried, however they need to be sure they have exhausted all usual approaches before trying to reset your account, so you should try to be helpful and show patience with the procedure.
The operator will need to verify they are speaking to the account holder and may ask you some questions that only the account holder could know, and you will need to answer them if the process is to proceed.
Once the operator has verified your identity they will send a message through to your device which contains an alpha numeric code, which you will need to read back to them.
Once this has been completed they will send an email to your iCloud email address after a period of 24 hours, so you should check that mail is enabled in your devices iCloud settings.
Upon receipt of the email, use the reset link provided to reset your password, after which you should be able to make the adjustments to iCloud that you wish to do. -
Can we create a local client copy for the RFID Client in discovery Box
Can we create a local client copy for the RFID(400 Client) in the Discovery Box,and if created which profile we have to select for the client and also at a time we can work on these both client or not .
This isn't possible with Live Mail. Acrobat has an add-in for Outlook (which you've used), but there is no similar function for Live Mail.
-
BlackBerry Desktop Keeps Asking for the Password
Alright, well here is the problem. I've connected my father's Bold 9790 device to my laptop with BlackBerry Descktop Installe. However, it will not allow me to proceed with any actions such as the much needed backup feature without entering the password.
Here is the catch, my father kept entering the wrong password on his phone for some reason. I'm not sure why, but he isn't one of the most tech savvy guys out there. He gave it to my little brother since he is (a dumb tryhard, well tech wise lol) and tries to always be the tech hero even when he lacks sufficient knowledge on the situation. I myself don't even own a blackberry, have never used one, but i was aware of the whole 10 attempt thing until the wipe. While he was making the attempts, i was thinking two things at the time. One was that there weren't two many attempts made yet. Two, that maybe after all these years since me learning about it, RIM may have came up with a better and less devastating security feature. Man was I wrong on both of these things. When my little brother gives up and my dad finally decides to give me the phone to figure out the issue. It asks for me to enter blackberry, then after that tells me it was the final attempt before a complete wipe. Had I had just one or two extra chances, i'm pretty positive i could have gotten it unlocked, but it's too late for that.
I have a single shot, and not much else sadly. My first instinct was to obviously back it up. But as you can see, the worst of my fears have been realised seeing as Blackberry Desktop is also asking for the pass stating that it is also the final attempt. Backing up is often a recommended solution i find on these forums, but is Blackberry Desktop usually suppposed to always ask you for the pass before you can even connect to it fully?
So now I'm at a point where i don't know what to do. Are there really no other options? I've heard that there are a few people who have claimed to bypass the security feature, but they've never shared how, and if true, it is also quite complex to figure out.
One further complication is that by default, the keypad for the password enters numbers, but right now it is entering letters by default. His password contains 4 numbers. I've read on forums that if you type in the corresponding letters in place of the numbers, it is actually the correct way to enter it, instead of pressing alt and the corresponding character for the password. Can anyone else confirm this? So if the pass was "2113" would i put in the default "ewwr" instead of pressing alt to type in "2113?
Any replies would most greatly be appreciated. I'm not a blackberry user, so issues such as these are not too fresh in my mind atm lol.Hi and Welcome to the Community!
feloow72 wrote:
Two, that maybe after all these years since me learning about it, RIM may have came up with a better and less devastating security feature.
As you discovered, no. BB's remain the recognized leader in security, and lessening this function would lessen that rating.
feloow72 wrote:
but is Blackberry Desktop usually suppposed to always ask you for the pass before you can even connect to it fully?
Yes...consider...if the Desktop Software could bypass the device lock security, then someone would have access to all of the data on the BB. The device lock security is intended to keep anyone but the actual user from accessing the information, regardless of method of attempted access. Again...part of that high security thing.
feloow72 wrote:
Are there really no other options? I've heard that there are a few people who have claimed to bypass the security feature, but they've never shared how, and if true, it is also quite complex to figure out.
There is no "master", "override", or "bypass" mechanism to get past the user-created device lock password...again, if there were, then the security level of the device would not be as strong as it is. I've no idea what anyone may have claimed elsewhere...but I highly doubt that they are actually successful.
Do note that, if you truly know the password, and can successfully enter it on either interface (the device keyboard or the PC keyboard when prompted), that will reset the counter...the same counter of attempts is used for both. So if you do succeed on one, you will have more chances again on the other.
feloow72 wrote:
One further complication is that by default, the keypad for the password enters numbers, but right now it is entering letters by default. His password contains 4 numbers. I've read on forums that if you type in the corresponding letters in place of the numbers, it is actually the correct way to enter it, instead of pressing alt and the corresponding character for the password. Can anyone else confirm this? So if the pass was "2113" would i put in the default "ewwr" instead of pressing alt to type in "2113?
Maybe...it all depends on what the password actually is. If, when it was created, the proper sequence of using the alt key was not done, then the password may truly not be what it is thought to be.
For instance, if your password is
ab123
and you enter
a > b > ALT > 1 > 2 > 3
the actual result will be
ab1er
You must enter
a > b > ALT > 1 > ALT > 2 > ALT > 3
in order to wind up with ab123. So, in this example, while on the BB keyboard you think you are typing ab123, you are actually typing ab1er.
But no one can tell you what it is...only correctly entering it can reveal what is correct. And, with just the one chance left, the likelihood of success is low.
Good luck!
Occam's Razor nearly always applies when troubleshooting technology issues!
If anyone has been helpful to you, please show your appreciation by clicking the button inside of their post. Please click here and read, along with the threads to which it links, for helpful information to guide you as you proceed. I always recommend that you treat your BlackBerry like any other computing device, including using a regular backup schedule...click here for an article with instructions.
Join our BBM Channels
BSCF General Channel
PIN: C0001B7B4 Display/Scan Bar Code
Knowledge Base Updates
PIN: C0005A9AA Display/Scan Bar Code -
Dose middle tier installation asks for the instance name?
Dose middle tier installation asks for the instance name?
If yes, should it be same as the infrastructure instance name?
Regards,
DNDose middle tier installation asks for the instance name?It should, and the name is not the same as infrastructure. Infrastructure and Midtier are different installations and different Oracle homes, in fact they could be installed on different machines.
In Application Server terminology, an "Instance" is related to an "Installation", the difference is that an installation is the set of files installed into an Oracle home and an instance is the set of processes associated with those files. -
Can I ask for the C++ LIB of Flash Player
Hello, Adobe!
Can I ask for the C++ LIB of Flash Player for windows.as I know, Adobe never support the Flash Player SDK any more.I want to make a Flash Player, but the FlashOCX used inconveniently.So I hope that Adobe could support the C++ LIB of Flash Player and the Instructions for using it.
Adobe can you help me?I really need it.Thanks for your reply, Adobe! I am very happy that you have paid attention to my question. Thanks again!
Though my English is poor, I try my best to make you understand what I say. I am sure that you could help me.</:includetail>
</:includetail>
What I need is not a Flash Player SDK. It's only a C++ LIB. You couldn't open the codes in it, but some interface functions. Actually it is like the OCX, but it is static and used conveniently.</:includetail>
</:includetail>
Reasons:</:includetail>
</:includetail> 1. I want to make my own Flash Player in my application.</:includetail>
</:includetail> 2. I want to use it conveniently.</:includetail>
3. You may say that I can use the OCX(Your FlashPlayer.OCX). But you don't know the OCX is used inconveniently. The last thing in the OCX I like is resizing for the OCX object. Its drawing speed is not the same as the EXE(Your FlashPlayer.EXE) when resizing.</:includetail>
4. The LIB not only helps me, but also helps everyone. Because lots of programers ask for how to run the OCX in API.</:includetail>
</:includetail></:includetail>
Can you help me? What I ask for is only a static OCX and its running speed is as the same as the EXE. As I know, to make a LIB is easy to you. I really need it. I hope that you could consider my request. Thank you! I am waitting for the good messages.</:includetail>
</:includetail>
</:includetail -
The update DVD dosn't ask for the kind of install
it's my first system upgrade, but i read a lot
now that i receaved the DVD once it start the installation it dosn't ask for the kind of install
archive/upgrade/flat
why? am i missing something?I did not see any install options either.
I was watching very carefully, or so I thought.
The process just went ahead, after the screen that asked which
drive was to get the install, and performed an Upgrade.
Took about 1 hour, 15 minutes and so far everything I've tried
works.
Hope this helps.
Jim -
I bought an ipad2 from a private individual for my wife's birthday. When she tries to update an app, she is asked for the former owner's password, which we do not have. How can I fix this so it asks for her apple password?
If the app was bought with the formers owners Apple ID, you cannot update the app with her ID. Apps belong to the ID that was used to purchase them. The former owner should have erased the iPad before he sold it to you and his ID would not be popping up.
If these were apps that your wife bought, then her ID would be popping up, unless I am missing something. -
I can't change my apple id password because my security answers don't match. It won't give me any other options and just keeps asking for the answers. What do I do?
Contact the Apple ID Security site from http://support.apple.com/kb/HT5699 or call the AppleCare support number from http://support.apple.com/kb/HE57 and ask to speak with the Account security Team.
-
Hi, I need help and advice. Basically me and my ex partner both had iphones and synced it with the same computer under the same ID. We split up and now im trying to get all my apps and info onto my new laptop with a new account but it keeps asking me for the old apple ID which she is still using and she changed the password. i tried backing it up but still nohing. When i try to back up purchased items being apps etc its keeps asking for the old one. help
See Recover your iTunes library from your iPod or iOS device. But you'll still need the password.
Once you have the computer authorized to use the account she could change the password again to stop you buying apps on her card (assuming it's not on yours!). It would lock you out of upgrading them too but they should work unless she uses the deathorize all feature.
It depends on how amicable the split is...
tt2 -
I have 11 updates in my App Store but every time I click the update they ask first my apply ID that would be fine but after they will ask my credit card details since this is only to update. Please help me.
Also, even I would like to download some games it's ok to ask for our Apple ID but in the second time they will ask for the credit card details. Please help meMy younger brother had the same problem. You have to go into settings, app store, details and then change your credit card details to none. If there is no none option, you will have to use a different apple id.
-
My ipod has had a previous owner How do I change my ipods email address so that when I try to down load anything it asks for the previous owners password but when I go to my account it says its my email my account but not when I try to download can anyone please help me ????Plus it still has some of the previous owners pictures and videos on it that I want to delete and can't????? Also is there a way to kill the apps that u have used throughout the day the battery doesn't last long at all ??????
- How did you dlete stuff from the iPod? If you have a 1G or 2G iPod and deleted the stuff by going to Settings>Genera.>Reset>Erase aall contents and settings without being connected to a power source, the battery dies before he erase was comleted since it can take hour.
- In any event try the following:
- Connect to a chaging sour for three hours.
- Reset the iPod and then connect to the computer and try to restore va iTunes.
Reset iPod touch: Hold down the On/Off button and the Home button at the same time for at
least ten seconds, until the Apple logo appears.
- Next try placing the iPod in recovery moe and then try to restore. For recovery mode:
iPhone and iPod touch: Unable to update or restore
- Last try DFU made and restore.
How to put iPod touch / iPhone into DFU mode « Karthik's scribblings
Maybe you are looking for
-
What happens to the original photo after editing? Does it get replaced by the edited photo?
I just bought my first iPhone(5). On Android, when editing a photo, the original stays in your gallery and the edited photo gets placed right next to it. So what I want to know is, When editing a photo in the photo app, what happens to the original
-
Using a different brand MP3 player in iTunes??
i have some other brand MP3 player (not iPod). how do i make it show up in my iTunes so i can drag and drop songs into this MP3 player? or can i not? it just shows up like a hard drive on my desktop now.thanks.
-
Printing to HP Laserjet 2100 via Time Capsule very very slow
If I connect the above printer directly to my Macbook (OS 10.5.2) it prints fine, at reasonable speed and quality. Connected via the Time Capsule a half-page text document takes about 4-5 minutes to print. I have updated the printer driver from this
-
Problem in creating dynamic internal table
Hi Experts, I am trying creating a dynamic internal table. But I am getting the error 'The field string "LT_GENTAB" contains no fields. 4 LT_GENTAB". Can anybody tell me what is the error and how to solve it. Thanks, Sudheer
-
Colour calibration which is correct PS, Windows viewer or IE?
Hello. I have a iOne display 2 calibrator, Im using Photoshop CS5, and viewing pictures in the standard windows photo viewer. Im producing digital art to be primaraly viewed on the web. Recently Iv been working on a project within Photoshop to get t