Replacement for the iphone 5?

There were no results for I'm sending apple my iphone 5 and the water indicator of the sim slot is white but what happens if the two water indicators are red in the inside Will apple still replace it cause they guy said I was going to mail the iphone and when they got the iphone they were going to send me my replacement and my screen is gray when I turn it on

Only Apple can tell you if they will replace it or not.
No one here is "Apple", we are all users like yourself.

Similar Messages

Can someone let me know if this is true, ive read that iphone are replacing the 3gs 8gb for the iphone 4 8gb is this at all true?

can someone let me know if this is true, ive read that iphone are replacing the 3gs 8gb for the iphone 4 8gb is this at all true?

You do realize that this article ( form August -beofore Apple announced the new iphone) was simply speculating on what the next iphone to be released would be.
You do not have to guess any longer. Apple has allready released the iphone 4s.
You seem to be very confused about what this is saying.
This article simply guessed that maybe iphone was going to announce a new cheap iphone at the conferance which happend a couple of months ago.
We now know that this was completely wrong. Apple released the iphone 4s.
The article does not mean that they would give iphone 3gs users a iphone 4 as a replacement. It meant that they would not make 3gs any longer and would now make a cheaper iphone 4 instead.
We now know that this was incorrect.

Where can I find the OOW replacement fees for the IPhone 4S in Canada ? I have spent over 45 minutes searching for the cost but can't locate it.

Where can I find the OOW replacement cost(s) for the IPhone 4S on the Apple Canada (English) website ? I have spent considerable time in looking but nothing is apparent. Does Apple not publish these cost(s) if so why not ?

If you own an iPhone that is ineligible for warranty service but is eligible for Out-of-Warranty (OOW) Service, Apple will service your iPhone for the Out-of-Warranty Service Fee listed below.
iPhone Model
Out-of-Warranty Service
iPhone 5s, iPhone 5c,
iPhone 5
$269
iPhone 4S
$199
iPhone 4, iPhone 3GS,
iPhone 3G
$169
A $10.77 shipping fee will be added if you arrange service through Apple that requires shipping. All fees are in Canadian dollars and exclude applicable taxes. iPhone Out-of-Warranty Service may also be available from your wireless carrier. Pricing may vary."
http://www.apple.com/support/service/

Is there a replacement YouTube App for the removal of the native YouTube in iOS 6? There is one for the iPhone/iPod but so far nothing for the iPad. Will this be fixed soon?

Just wondering if there is anything coming out soon. Kind of a big missing chunk from the iPad features list in my opinion. Thanks.

The website version is nowhere near as functional as the original app. It can't even go into fullscreen mode. I hope Google will make a decent version of YouTube for the iPad like they did for the iPhone. Third party apps seem to fall short in terms of software fluidity and features right now.

How much do i have to pay if i want to upgrade my iphone 4s for the iphone 6 plus

how much do i have to pay for upgrade an iphone 4s to the iphone 6 plus?
how much do i have to pay for exchange a broken iphone 5s for a new one?

some retailers buy your phone and help u to put credit towards new iphone. if your iphone has accidental damage it will cost you 299 CAD dollars, if the only screen is broken it will cost 119 dollars. if the iphone is under warranty. i suggest you to replace the display first then. wait for the iphone to give you issues so that geniuses replace the iphonr for free

What is the actual file size for the iphone 4s update - 55.5 mb's or 832 mb's

Can someone tell me the actual file size of the new update for the iphone 4s On my iphone it is telling me it is 55.5 mbs but when I try to download the file thru i tunes it twlls me it is 830 odd mb's.
Thanks, michael.

I suspect if you update wirelessly you are just downloading a "delta" updater whereas downloading through iTunes you are downloading the entire replacement firmware. Wirelessly updating does not take nearly as long for the download nor does it require completely erasing then restoring the device.

Is there an iCloud Drive app for the iPhone?

Is there an iCloud Drive app for the iPhone? I have a 5c that's running 8.0.2.
I was able to install iCloud Drive on my pc. I placed some files out there and would like to view them on my iPhone but I can't seem to find the iCloud Drive app in the app store.
There appears to be an iCloud Drive app according to the pictures here: http://www.apple.com/icloud/icloud-drive/.
Is the app not available yet?

I've had an android phone since they first came out. Verizon took forever to get the iphone and by the time they did, I was so used to having a phone with a big screen and was already on a 4g device and I didn't want to take a step back to 3g and a smaller screen so I never gave apple a try. I recently sold my android phone in preparation for the next android phone release and I broke my temporary phone trying to it's replace it's cracked glass (something that's much easier to do on an iphone btw) so I had to find another temp phone. With the release of the iphone 6/6+ and everyone going so crazy about it, I decided to borrow a friend's old 5c for a month to see what all the hype was about when it comes to iphones while I wait for my android phone to come in. So far I can honestly say aside from a few things here and there, I haven't really felt like there's much of a difference to warrant the flame wars that I see on android vs apple. Some things work better on iOS for sure but there are some things I'm used to doing on android that I can't do on iOS. I really like it's overall simplistic feeling. The people on the far left and far right in terms of apple over android or android over apple and their arguments are pretty comical to me now that I've had some exposure to both.
Anyway in terms of the iCloud drive, from everything I've read it looks like it'll be identical to Google Drive which I've been using for years but without an app, it's definitely confusing on how I get to my documents and photos that I've stored on my iCloud Drive. With android, before the app I could go to the desktop site for google drive and access my documents. When I try to go to icloud drive from safari on my phone, it automatically takes me to "set up icloud tutorial" even though it's already set up on my phone. I'm happy to find that I'm not the only one that's confused by apple's description of the implementation and what's actually implemented.
I still have a few weeks before I get my android, but I'd be lying if said I haven't considered cancelling my preorder of the note 4 and grabbing a 6+ to give an iphone more than a months trial. I mean in the end, people buy iphone's like candy so it's not like I'd be stuck if I end up ultimately not liking it.
Thanks for your responses, hopefully they implement it's full functionality while I still have time to decide one way or another.

Is there a similar app to Ring Scheduler available for the iPhone?

Hi,
I currently use a Droid, and I am NOT happy with it overall. However, the reason I chose a Droid over the iPhone is because of one application not available for the iPhone, but available for Droids. That application is "Ring Scheduler." (RS) With RS you can select times at which your phone's ringer will automatically silence itself. Additionally and MOST importantely, you can add contacts to an exceptions list so that when these contacts call during silence time the phone will ring.
For example, I have my silence times set from 10:00 p.m. to 6:30 a.m. I have my parents in the exceptions list, so if they call at 2:00 a.m. with an emergency, my phone will ring. My buddy John, however, who may drunk dial me at 3:00 a.m. will not wake me since the phone is silenced and he is not on the exceptions list. I also own a business with 70+ employees who tend to call at any hour of the day/night. I don't need to be woken up at 2:30 a.m. from John Doe who is calling out for the day, but if my aunt has an emergency, since she is on the exceptions list, the phone will ring.
Is there a functionality within the phone, or is there a similar application avaialble for the iPhone? I have asked at the Verizon dealers, but I've never gotten a straight answer. My Droid is nearing its end and I'd like to replace with an iPhone, but because my family is older and I have numerous people who call at any hour I NEED this application. Please advise!
Thanks in advance!

It will be baked into iOS 6 when it's released this fall.
http://www.apple.com/ios/ios6/#phone
It's called "Do Not Disturb".
3rd party apps don't have access to the functions necessary to do this.

Replacement for the J6400

We currently have a HP OfficeJet J6400 All-in-One Printer. It works fine and we are happy with it. However, our platforms are changing. We both have iPhones, iPads and iPods. We need to migrate to an Air Printer in order to make better use of our technology. It's a pain to have to send something to another platform (laptop) and then print.
My question is, which HP with Air Print would be a good replacement for the J6400. We still want all the features of an All-in-One.
Thanks,
Jim
This question was solved.
View Solution.

Hello jghannah
For a list of AirPrint printers check the right hand side of this page.
I personally think either the Officejet 6500A Plus or the Officejet Pro 8600 would be perfect for your upgrade. They share a similar design to that of the Officejet 6400 series. They all have Airprint as well. For a good comparison between them check out the following link: Officejets with Airprint Comparison
Don't forgot to say thanks by giving "Kudos" to those that help solve your problems.
When a solution is found please mark the post that solves your issue.

HT1665 Does the Otter hard plastic belt holder for the iPhone 5 have a warranty by Apple?

Does the Otter hard plastic belt holder for the iPhone 5 have a warranty by Apple?

No, it is made by Otter. I learned that Otter calls it a "Holster Accessory Apple Defender IPhone." Its also called a IPhone belt clip. It came with the IPhone 5 when I purchased it. When I asked about a replacement at an electronic store, they told me that Apple might have a warranty on it. I couldn't find anything on the Apple Web site. So the question was: does Apple have a warranty for the clip?

Apple listen up!! Itunes should include a diagnostic program for the Iphone

Hey Apple, with all the problems that are being reported on here with the Iphone
wouldn't it be prudent to include a diagnostic program in Itunes for the Iphone?
A program that could check for missing or corrupted files. Maybe one that could bring it back from a crash to restore it. Also scan the backup OS for missing or corrupted files. Can everyone else second this motion?

Lgend45,
The restore replaces corrupted files. In addition the iPhone does its own checks during power on, updates, and restores. For example if you are prompted to restore during an update it is because a file that is not being changed by the update is not correct.
However, a restore can not fix issues caused by some unauthorized software.
Hope this helps,
Nathan C.

Can i use my husbands upgrade for the iphone 6 promotion

My line is technically not eligible for upgrade, but my husbands line is (we are on a family plan with my mom). Last time I upgraded, they let me use my husbands upgrade since his was available. Can I do this for the iphone 6 promotion or will they not allow it?

Can I transfer upgrade eligibility from one line to another?
If you have multiple devices on your account and one is eligible for an upgrade, you can transfer upgrade eligibility to another line on your account whenupgrading your device in My Verizon. When you transfer eligibility from one line to another, the original line is no longer eligible for the upgrade discount.
To transfer upgrade eligibility from one line to another line on your account:Go to the Upgrade Device page in My Verizon.
Click Transfer Upgrade.
Note: If the Transfer Upgrade link isn’t appearing, you may not be eligible to transfer an upgrade at this time
Select the mobile number you want to upgrade. This will transfer upgrade eligibility to that line.
Select the device you want to upgrade to and click Next.
Follow the onscreen prompts to complete the remaining steps to upgrade your device.
You’ve successfully transferred your upgrade eligibility to another line.

How do i convert my imovie trailer for the iphone 4 to other file formats?

I'm due to make a comical presentation in 2 days, and i downloaded iMovie for the iphone 4, and would like to use the trailers created as part of the presentation.
I'm on windows xp, and have sent the file to itunes, gone into the file sharing part, added it, saved it, and even synched the flipping thing and yet it wont even play in itunes??? thats driving me mad as it is??
Not really bothered about that....My real main concern is wanting to play the movie file in an AVI/MOV/MP4 etc format, and have even downloaded various video conversion packages to try an convert and playback my results, but once again, and a few hours wasted, I find myself facing another brick wall.
Is it even possible to playback the imovie trailers created in a more generic video format for others to see??
I really do hope so!!!!
If not, then apple, i want my £2.99 (about $5.50) back, coz that would be as pointless as a paper ashtray.
I hope ive not had my pants pulled down and wasted my money an time on this.
Please someone help me, or put me out of my misery.

Actually, scrap that one girls. Ive figured it out. For those who have a similar prob, just make sure you have quicktime installed. plug ur iphone into ur pc as normal, and choose the camera an scanner options that appears auto on ur window. select the trailer u wish after the usual wizard talk through and then "ok" or "apply" or whatever the button is called. select your destination folder, and walaa. its all done, and converted into .MOV format.
NOTE: When saving ur trailer on ur phone, and it asks what file size, chose the Medium one, or it takes ages to open.....unless ur comp is super fast, and not like my craptop.

TS3694 Why can't I update my iPhone 4 to iOS 5.1? Every time I try it gets all the way done downloading it; however when it's processing the file the page tells me "There is a problem downloading the software for the iPhone. Network connection timed out.

Why can't I update my iPhone 4 to iOS 5.1? Every time I try it gets all the way done downloading it; however when it's processing the file the page tells me "There is a problem downloading the software for the iPhone. Network connection timed out. Make sure your network settings are correct and your network connection is active. or try again later." and next to the file it has err = -3259. I have tried this 17 times and it won't work. My iTunes is completely up to date. I have made sure that my connection is fine and I have tried turning my firewall off with no avail. This has happened to me before but usually the update will go through after 2-3 tries, never to this extent. I don't know what to do. Help!

Error -3259 is a network timeout error, usually. This article might help:
http://support.apple.com/kb/TS2799

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.

Replacement for the iphone 5?

Similar Messages

Maybe you are looking for