Anyone who wants zCover action for their Nano.

http://cgi.ebay.ca/ws/eBayISAPI.dll?ViewItem&rd=1&item=5812282517&ssPageName=STR K:MEWN:IT
I just bought one from this vendor in preparation before my Nano arrives.
Got a shield for the screen, two shells, a lanyard.
Looks to be high quality stuff.

I ordered one (black) a few days ago, and am waiting for it to arrive. will link photos when i get it.

Similar Messages

Does anyone have the iSkin Duo for their nano?

if you do, I'm just wondering when my order for it will come in. I ordered it off the website, and I'm waiting for it from thorold in Ontario, Canada...I ordered it on December 29, can anyone tell me when I should expect it to come it?

well i have so many cases now, iskin duo included, i think that it is great! it looks great, feels great and makes me happy!

HT6114 Joined problem labels Labels to color everyone in the line archives mp3 and selection in dots as it exists now can be anyone who wants to do what HELPS of how thoroughly enjoyable.

Joined problem labels Labels to color everyone in the line archives mp3 and selection in dots as it exists now can be anyone who wants to do what HELPS of how thoroughly enjoyable.

Sp188585 wrote:
Joined problem labels Labels to color everyone in the line archives mp3 and selection in dots as it exists now can be anyone who wants to do what HELPS of how thoroughly enjoyable.
Sorry, you will have to outline your issues more clearly.
Thanks
Pete

Has anyone else had a problem with their nano sim slot bending snapping or breaking when they put their sim in!? I have had to order a replacement and only had the phone 5hours!

Has anyone else had a problem with their nano sim slot bending snapping or breaking when they put their sim in!? I have had to order a replacement and only had the phone 5hours!

Hannahjadepurnell wrote:
From giffgaff.
i Don't actually mean when you put it In the phone. I mean when you try to take the slot out of the phone with the pin. As soon as I pulled it out it bent.
That makes less sense as the sim tray a fairly stiff metal and should be pulled straight out once released. You didn't answer the question about where is was bought. Is is a real iPhone?

Has anyone tried CDN cloud serving for their podcasts?

Is anyone using Akamai or Highwinds Content Distribution Network for their podcast files? I'm thinking of using 'Origin Pull' where they take the first request for the file at your site and store it 'in the cloud' then all subsequent requests are served from the cloud.
I was wondering if anyone has tried this and if there were any complications with it?

I can't answer you specifically on this, but I've seen cases where odd redirect or content management URLs broke the Store, which is much more touchy than a browser.
If the URL the Store has is directly to the file, and the method you describe takes place in the background, it would likely be OK; but if some sort of odd URL is used then it's risky. Unless someone happens to have done exactly this already I can only suggest either making a new podcast and trying it (make it look convincing - it the Store thinks it's a test it will be rejected -you can always get it removed afterwards); or possibly you could post just one episode done in this way; if it doesn't work you would only need to modify the URL back to a normal one.
The first method would test whether it works for the feed as well as the media, the second only for the media. Note that if you want to use this to count downloads it's probably useless with the feed, since the iTunes application checks subscribed feeds periodically - I don't know whether checking but not actually downloading would count or not.

Has anyone found a stable browser for their Power Mac?

I remember when I first jumped on the Macintosh bandwagon. My friend at the time told me that "Apple has no problem leaving you behind." I am wondering if the community has any solutions. I have a PowerMac G5 that runs great most of the time, except for one problem. I can't find a web browser that its stable. I have Safari 5.0.6 because Firefox no longer supports Power PC and their older versions are unusable and Chrome is Intel only.
The problem I am having is that if I leave my computer on and walk away I am getting scripting errors or spinning pinwheels. The only way I can rectify the issue is to force quit the browser, and this happens so many times throughout the day it makes me ill.
At first I thought maybe it was becasue I didn't have 10% free on my drive. I got a new hard drive. That didn't work. Then I thought maybe I had too much stuff on my machine, so I reformatted my entire drive, and I still suffer from the same problem.
I've finally given up and I ask you. I am really frustarted because signing off on an old OS is one thing. Signing off on the very thing you need to access information efficiently and effectively is ridiculous. Especially since they keep supporting iTunes updates. I guess the legacy support is contingent upon the bottom line and nothing else matters.
If anyone else has found a stable browser for their PowerMac, I would love to hear it. I am running Leopard 10.5.8. Thanks.

Most instabilitiy with Safari is due to third-party add-ons or plug-ins. Many are serious troublemakers, like the "CT" or "Community Toolbar."
If you have a crash report from Safari, I think you'd get some good help by posting it in the Safari forums. Those people are good at ferreting out the add-ons/conflcits that make it unstable.
I run Safari on a number of Macs with OS versions from 10.4.11 to 10.6.8 and I run no add-ons/extensions and a minimal number of plug-ins. It's completely stable for me.
I am running Leopard 10.5.8.
Then you may wish to update the info in your equipment line:
I was about to tell you to update your OS to 10.4.11 when I got to the last line of your post!

Has anyone bought the colored cases for their Mac? If so please share the pros and cons

I have seen these cases on Tv shows and online would like to know if anyone else is using it. And if so is it a good product to buy?

I don't own a colored case, but I have used macbooks with colored cases on them. One time was when I used the white macbook (late 2007)... it had a full red colored case on it. To be honest, it looked pretty bad. The best colors are the macbook's original colors.
I have a clear case, and it isn't too bad.
PROS:
- very protective of scratches/dents
- made of sturdy material to have maximum strength
- easy to take off/on
CONS:
- expensive (most of the times)
- makes the MacBook very heavy and makes it thicker
- uncomfortable because of the small edges that clip on to the sides of the computer
- who wants a colored macbook?
anyways if you DO want to buy it, I suggest you buy it from Speck

For anyone who wants to customize their IT Superhero...

You are persistent!!

i took the IT Superhero quiz, and it made me a girl! so i tried retaking it until i got what i wanted, and finally, i just decided to reverse engineer their logic answers! it ended up being (somewhat) simple, and yet tricky to decipher, and so i decided to share my findings here at the Water Cooler to anyone in a similar predicament as me :Di highly recommend taking the quiz FIRST to see what you get (it IS rather fun), but once that is out of the way, feel free to have fun (i know i did). and don't forget to use your avatar if you like it!so basically, you just take the address of the Superhero quiz:
http://community.spiceworks.com/careers/sysadminday/superhero-quizand add the appropriate keys after it. for example:...
This topic first appeared in the Spiceworks Community

For anyone who wants a challenge....

I have an old imac that will not boot into any other form than the login screen. The computer person who set up the computer did not make me the admin, and I have no idea what the admin password is, so I cannot change what the startup disk is, nor disable the login screen from the system preferences. I also cannot boot from target disk mode, an installation CD/DVD or any other magical keyboard combinations. I tried resetting the PRAM, no bongs were heard, other than the original startup. All I want to do at this point is erase the hard drive and reinstall the system software, but as mentioned earlier, I cannot start up from the DVD. I do have the Al keyboard connected, but I highly doubt that changing that will fix things, but I will use another one tomorrow to see if that fixes anything. Does anyone else have any other suggestions?
It is designed to connect to our network, so I can login there, and get to my user interface, but again, I am not the admin - but I should also mention that I do own the computer... it is not stolen, hacked or whatever, I would just like it back to it's original state so it could function as a computer again. I am pretty sure my applecare has expired on this one too, which is unfortunate.
Any other ideas would be greatly appreciated!

So what does one do when you cannot login the single user mode?
You need to buy a license of Snow Leopard ($29.00) which is still available from Apple or Amazon and upgrade. Make sure your computer meets the minimum specifications for Snow Leopard which are:
System Requirements
Mac computer with an Intel processor
1GB of memory
5GB of available disk space
DVD drive for installation
Some features require a compatible Internet service provider; fees may apply.
Some features require Apple's MobileMeservice; fees and terms apply.
Once you have that you can use this video for instructions on how to do an Erase and Install. The kid is kind of annoying but he knows what he's doing. Clean Install Of Snow Leopard video

A challenge for anyone who wants one : )

Hi, I am trying to write a method that basically takes in a vector containing short objects which have variable legnth codes in them. I want to manipulate these shorts and create a new Vector of shorts that contain fixed length code versions of these;
Right now you can think of the shorts as overlapping on its neighbour in the vector, some of the bits are spilling over into the next short.
Heres an example to make it clearer
every short should have two parts, a 3 bit 'id' that tells the algorithm how many bits folling these 3 bits are to be associated with the id. The id can be used to get this number of bits from an array:
indexlengths[] = {7, 6, 8, 5, 4, 7, 9, 8}
so, when the algorithm encounters id #2 (the in the 3 leftmost bits) it looks in this array in position 2 and then knows that following the id is 6 bits to be extracted. once this has been extracted a new short should created and, these 6 bits should be added but shifted over to the very right of the short(shifted 13-6 in this case) and this id should added but to the very leftmost 3 bits.
so:
010 1111110100000
(id:2) (6 bits)
should go to:
010 0000000111111
now this wouldn't be too much of a problem BUT the remaining bits that were discarded (in this case 0100000) must be kept and plugged to the next short in the vector
so if the next short in the vector is
1010000011111110
it will have this remainder from the previous short plugged into the right of it
010 0000101000001 and 'pushed' off is:1111110
now this process must continue making sure that this remainder that was 'pushed' off in plugged in to the next short BUT FIRST the process that we started with must be applied, a new short is created(for which the resulting fixed legnth code will be stored in), the ID is extracted from the leftmost 3 bits (id: 0) of the current short and the number of bits to follow is found from the above array indexLengths[0] which is 7 bits. these 7 bits are shifted by (16-3)-7 = 6 positions to the right so they are stored in to the rightmost part of this new short and the id will stay at the leftmost 3 bits:
010 0000000000101 'pushed off: 000001'
so now we have both 1111110 and 000001 'pushed' off of the same short, as the length of bits of this remainder gets longer and reaches 16, a new short should be created and added to the result vector.
One more example just to show it visually:
this time the indexes after the 'id' part are all 6
int[] indexLengths = {6, 6, 6, 6, 6, 6, 6, 6};
a vector of 3 shorts:
111 1000011111111, 011 0111111100000, 101 1000000000000,
results in:
111 0000000100001, 111 1111011 011111, 110 00001011000000, 000000
looking at the first resulting short:
(id) (6 bits that followed the index shifted to the right most 6 bits)
111 0000000100001
the remiander that had to be 'pushed off' is inserted in to the start of the next short and the process starts again.
I know this is alot to ask, but any tips would be great, java isn't being any help when working with bits and shorts, for example when extracting the id (using a mask and then shifting to the right 13 places) I get negative numbers sometimes!
Any suggestions on how to break this down into a managable problem to solve would be great too : )
Thanks!
Message was edited by:
digiology

this might help, heres a method doing the opposite, turning fixed legnth codes into variable length codes, the whole idea of this method is to splim down the array of shorts before sending it in a message. This works fine, however the problem above of doing it the other way around has caused me alot of grief after 3 attempts!
public Vector convertVectorToSlimmerVector(Vector v)
          System.out.println("initial:");
          for(int i=0;i<v.size();i++)
               System.out.print(toBinaryString(((Short)v.get(i)).shortValue())+", ");
          System.out.println();
          Vector result = new Vector();
          //assume vector starts at message part for now
          //seems to be fine for legnths
          int[] indexLengths = {6, 6, 6, 6, 6, 6, 6, 6}; //this will be passes as a parameter or stored in the incomming vector later!
          // above values cant be greater than 13!
          short mask1 = 0x1;
          short mask2 = 0x3;
          short mask3 = 0x7;    //000 0000000000111;
          short mask4 = 0xF;       //000 0000000001111;
          short mask5 = 0x1F;       //000 0000000011111;
          short mask6 = 0x3F;       //000 0000000111111;
          short mask7 = 0x7F;       //000 0000001111111;
          short mask8 = 0xFF;       //000 0000011111111;
          short mask9 = 0x1FF; //000 0000111111111;
          short mask10 = 0x3FF; //000 0001111111111;
          short mask11 = 0x7FF; //000 0011111111111;
          short mask12 = 0xFFF; //000 0111111111111;
          short mask13 = 0x1FFF;//000 1111111111111;
          short mask14 = 0x3FFF;//001 1111111111111;
          short mask15 = 0x7FFF;//011 1111111111111;
          //short mask16 = 0xFFFF;//111 1111111111111;
          long longMask1 = 0x8000;//100 0000000000000;
          long longMask2 = 0xC000;//110 0000000000000;
          long longMask3 = 0xE000;//111 0000000000000;
          long longMask4 = 0xF000;
          long longMask5 = 0xF800;
          long longMask6 = 0xFC00;
          long longMask7 = 0xFE00;
          long longMask8 = 0xFF00;
          long longMask9 = 0xFF80;
          long longMask10 = 0xFFC0;
          long longMask11 = 0xFFE0;
          long longMask12 = 0xFFF0;
          long longMask13 = 0xFFF8;
          long longMask14 = 0xFFFC;
          long longMask15 = 0xFFFE;
          //others omitted for now
          Vector redundantShortPositions = new Vector();
          //short lengthMask=0xE000;
          long lengthMask = (long)0xF000; //111 0000000000000;
          short[] masks = {mask1, mask2, mask3, mask4, mask5, mask6, mask7, mask8, mask9, mask10, mask11, mask12, mask13, mask14, mask15};
          long[] longMasks = {longMask1, longMask2, longMask3, longMask4, longMask5, longMask6, longMask7, longMask8, longMask9, longMask10, longMask11, longMask12, longMask13, longMask14, longMask15};
          short currentShort;
          Short currentShortObject;
          long currentWordLength;
          int indexLength;
          int currentBitLength;
          int numberOfCarriedBits = 0;
          int numberOfBitsToSpillOver = 0; //number of bits that cant be stored in this iteration and will spill over into the next
          int numberOfBitsLeftOver = 0; //number of redundant bits at the end of the current byte(/short?)
          short valueCarriedOver = 0;
          long currentLong;
          String currentProgress;
          Short lastShort = null;
          short l;
          System.out.println();
          for(int index=0; index<v.size(); index++)
               System.out.println("index:"+index);
               currentShort = ((Short)v.get(index)).shortValue();
               currentProgress = toBinaryString(currentShort);
               System.out.println("progress: "+currentProgress);
               currentShortObject = (Short)(v.get(index));
               currentLong = currentShortObject.longValue();
               currentWordLength = (long)(currentLong & lengthMask);
               currentWordLength = (currentWordLength>>13);
               //currentShort = (short)currentLong;
          //     short l2 = (short)currentWordLength;
               indexLength = indexLengths[(int)currentWordLength]; //make sure that the index length for word legnth 0 is stored above somewhere
               //System.out.print("isolated legnth: "+toBinaryString((short)currentWordLength)+", ");
               //l = (short)(currentShort & lengthMask);
               //currentWordLength = (short)(currentShort & lengthMask);
               //l = (short)currentWordLength;
               //currentWordLength >> 13;
          //System.out.println(toBinaryString((short)l));//currentWordLength));
               //that 1 is added to it
               if(currentWordLength != 0)
                    currentShort = (short)(currentShort & masks[indexLength-1]); //extract index
                    currentShort = (short)(currentShort << ((16-3)-indexLength));//shift index over (just 3 bits from the left most bit, next to where the length will go)
                                                                                          //number of bits from this short placed in previous short
                    currentBitLength = (3 + indexLength + numberOfCarriedBits)-numberOfBitsLeftOver;
                    currentWordLength = currentWordLength<<13;
                    currentShort = (short)(currentWordLength + currentShort);
                    currentProgress = toBinaryString(currentShort);
                    System.out.println("progress: "+currentProgress);
                    if(index!=0)
                         //number of free bits from last short is > 0
                         if(numberOfBitsLeftOver > 0)
                              System.out.println("last short: "+toBinaryString(lastShort));
                              System.out.println("current short: "+toBinaryString(currentShort));
                              //isolate left most bits from current short that can be stored in previous short
                              short tmp = (short)(currentShort & longMasks[numberOfBitsLeftOver-1]);
                              System.out.println("tmp after mask: "+toBinaryString(tmp));
                              //shift over to rightmost position
                              tmp = (short)(tmp >> (16-numberOfBitsLeftOver));
                              tmp = (short)(tmp & masks[numberOfBitsLeftOver-1]);
                              System.out.println("tmp: "+toBinaryString(tmp));
                              lastShort = new Short((short)(lastShort.shortValue() + tmp));
                              System.out.println("lastshort fter spillage: "+toBinaryString(lastShort));
//                              v.setElementAt(lastShort,(index-1));
//                              v.remove(index-1);
//                              v.add(index-1,lastShort);
                              result.setElementAt(lastShort,(index-1)); //could be buggy (check with dict legnths of 2!)
                              currentShort = (short)(currentShort << numberOfBitsLeftOver);
                    currentProgress = toBinaryString(currentShort);
                    System.out.println("progress after spilling to previous: "+currentProgress);
//                    if(currentBitLength <= 8)
//                         numberOfBitsLeftOver = 8 - currentBitLength;
//                    else
                    {// if currentBitLength > 8
                         numberOfBitsLeftOver = 16 - currentBitLength;
                         if(numberOfBitsLeftOver < 0)
                              numberOfBitsToSpillOver = Math.abs(numberOfBitsLeftOver);
                              numberOfBitsLeftOver = 0;
                         else
                              numberOfBitsToSpillOver = 0;
                         short pluggedInValue = (short)(valueCarriedOver << (16-numberOfCarriedBits)); //shift value to appropriate left most position
                         if(numberOfCarriedBits > 0)
//                              isolate part of currentShort that will be 'pushed off' to the right
                              short temp = (short)(currentShort & masks[numberOfCarriedBits-1]);
                              valueCarriedOver = temp;
                         else
                              valueCarriedOver = 0;
                         currentShort = (short)(currentShort >> numberOfCarriedBits);
                         currentShort = (short)(pluggedInValue + currentShort);
                         lastShort = new Short(currentShort);
                         numberOfCarriedBits = numberOfBitsToSpillOver;
                         currentProgress = toBinaryString(currentShort);
                         System.out.println("number of carried bits: "+numberOfCarriedBits);
                         System.out.println("num bits left over: "+numberOfBitsLeftOver);
                         System.out.println("progress: "+currentProgress);
                         //System.out.print(toBinaryString(currentShort)+", ");
               else
               {// currentWordLength = 0
                    System.out.println("word length is zero");
               if(numberOfBitsLeftOver >= 16)     //hopefully should be ok, remove condition if not and remove redundant shorts afterwards
                    //reset this value and dont add current shot
                    numberOfBitsLeftOver = numberOfBitsLeftOver - 16;
//                    System.out.println("BOOLEAN");
//                    System.out.println(toBinaryString((Short)result.get(index-1)));
                    //result.add(new Boolean(false)); //just to act as a flag
                    System.out.println("position of redundantness? "+index);
                    //store position of redundant short
                    redundantShortPositions.add(new Integer(index));
//               else
//                    result.add(new Short(currentShort));
               result.add(new Short(currentShort));
          //remove redundant shorts
          int offset = 0;
          for(int j=0;j<redundantShortPositions.size();j++)
               int p = ((Integer)(redundantShortPositions.get(j))).intValue();
               result.remove(p-offset);
               offset++;
          System.out.println("result:");
          for(int i=0;i<result.size();i++)
               System.out.print(toBinaryString(((Short)result.get(i)).shortValue())+", ");
          return result;
     }here my crappy attempt at solving the first mentioned problem (converting from variable length to fixed legnth):
public Vector convertToFatterVector(Vector v)
          System.out.println("initial:");
          for(int i=0;i<v.size();i++)
               System.out.print(toBinaryString(((Short)v.get(i)).shortValue())+", ");
          short mask1 = 0x1;
          short mask2 = 0x3;
          short mask3 = 0x7;    //000 0000000000111;
          short mask4 = 0xF;       //000 0000000001111;
          short mask5 = 0x1F;       //000 0000000011111;
          short mask6 = 0x3F;       //000 0000000111111;
          short mask7 = 0x7F;       //000 0000001111111;
          short mask8 = 0xFF;       //000 0000011111111;
          short mask9 = 0x1FF; //000 0000111111111;
          short mask10 = 0x3FF; //000 0001111111111;
          short mask11 = 0x7FF; //000 0011111111111;
          short mask12 = 0xFFF; //000 0111111111111;
          short mask13 = 0x1FFF;//000 1111111111111;
          short mask14 = 0x3FFF;//001 1111111111111;
          short mask15 = 0x7FFF;//011 1111111111111;
          //short mask16 = 0xFFFF;//111 1111111111111;
          long longMask1 = 0x8000;//100 0000000000000;
          long longMask2 = 0xC000;//110 0000000000000;
          long longMask3 = 0xE000;//111 0000000000000;
          long longMask4 = 0xF000;//111 1000000000000;
          long longMask5 = 0xF800;
          long longMask6 = 0xFC00;
          long longMask7 = 0xFE00;
          long longMask8 = 0xFF00;
          long longMask9 = 0xFF80;
          long longMask10 = 0xFFC0;
          long longMask11 = 0xFFE0;
          long longMask12 = 0xFFF0;
          long longMask13 = 0xFFF8;
          long longMask14 = 0xFFFC;
          long longMask15 = 0xFFFE;
          short[] masks = {mask1, mask2, mask3, mask4, mask5, mask6, mask7, mask8, mask9, mask10, mask11, mask12, mask13, mask14, mask15};
          long[] longMasks = {longMask1, longMask2, longMask3, longMask4, longMask5, longMask6, longMask7, longMask8, longMask9, longMask10, longMask11, longMask12, longMask13, longMask14, longMask15};
          Vector result = new Vector();
          int[] indexLengths = {6, 6, 6, 6, 6, 6, 6, 6};
          long lengthMask = (long)0xF000;
          //long tmp = 0xE000;
          //short lengthMask = (short)tmp;      //111 0000000000000;
          short indexMask = 0x1FFF;           //000 1111111111111;
          System.out.println();
          System.out.println("length mask: "+toBinaryString((short)lengthMask));
          System.out.println();
          short currentShort;
          long currentLong;
          String currentProgress;
          Short currentShortObject;
          long currentWordLength;
          int indexLength;
          //int numberOfBitsSpillingOver=0;
          short spillValue = 0;
          Short lastShort;
          int currentBitLength;
          int numBitsCarriedOver=0;
          short firstShort;
          short secondShort;
          long firstLong;
          long secondLong;
          short valueThatWasSpilledOver=0;
          short valueThatWillSpillOver=0;
          for(int index=0;index<v.size();index++)
               currentShort = ((Short)v.get(index)).shortValue();
               currentLong = ((Short)v.get(index)).longValue();
               if(index == 0)
                    currentWordLength = (short)(currentShort >> 13);
//                    currentWordLength = (long)(currentShort & lengthMask);
//                    System.out.println("currentShort: ");
//                    currentWordLength = (long)(currentWordLength>>13);
                    System.out.println("current word legnth: " + toBinaryString((short)currentWordLength));
                    indexLength = indexLengths[toAbsoluteIntValue((short)currentWordLength)];//(int)currentWordLength];
                    //numBitsCarriedOver = (int)(13-indexLength);//////
               //valueThatWillSpillOver = (short)(masks[numBitsCarriedOver-1]&currentShort);
               currentWordLength = (valueThatWasSpilledOver<<(16-numBitsCarriedOver)&lengthMask);
               currentWordLength = (short)(currentWordLength>>13);
                                                       //dont forget might need to be set somewhere!
               currentShort = (short)((currentShort>>numBitsCarriedOver)+(valueThatWasSpilledOver<<(16-numBitsCarriedOver)));
               System.out.println("progress after spilling from previous:"+toBinaryString(currentShort));
               //currentShort should now have the length and index contained in it but the index is shifted to the left
               indexLength = indexLengths[(int)currentWordLength];
               numBitsCarriedOver = (int)(13-indexLength);
               valueThatWillSpillOver = masks[13-indexLength];
               valueThatWasSpilledOver = valueThatWillSpillOver; //?
               //get index(shifted to the right) on its own
               short temp = (short)((currentShort & indexMask)>>(13-indexLength));
               System.out.println("index on its own shifted to the right: "+toBinaryString(temp));
               //get length on its own
               short temp2 = (short)(currentShort & lengthMask);
               System.out.println("length on its own: "+toBinaryString(temp2));
               currentShort = (short)(temp + temp2);
               System.out.println("progress after shifting index to the right: "+toBinaryString(currentShort));
               result.add(new Short(currentShort));
          System.out.println("result");
          for(int i=0;i<result.size();i++)
               System.out.print(toBinaryString(((Short)result.get(i)).shortValue())+", ");
          }

Has anyone bought a Crumpler bag for their MB?

I want to buy a Crumpler bag (www.crumplerbags.com) for my MB, but I am kind of confused by the colors and need any Crumpler owners' advice!
They have at least two photos for each "Considerable Embarrassment" bag, but the colors look radically different and I want to know which is truer to the actual color. For example, here are the photos they provide of the green bag:
first one: http://www.crumplerbags.com/Cart/Resources/CartResources/195res/b195o3.jpg
second one: http://www.crumplerbags.com/Cart/Resources/CartResources/195res/b195_o10039ai178.jpg
Those are too totally different greens (I don't want to buy it if it's ULTRA bright like the second picture). Just curious if anyone owns a Crumpler or as actually seen one in person and can tell me what they think!

I object to buying something from a company with such a poorly designed website.
Seriously. That is he worst site I have seen from a company who actually tries to make money on the web.
I have heard good things about their bags.

Who uses a case for their iPhone 3GS?

I have a case I've been using just to protect the back of my iPhone. I'm thinking of taking it off and just going naked (the phone that is).
Anyone have any problems with their naked iPhone in their pocket? Any scratches? Just wondering.
Thanks.

dbell-mac wrote:
I have a case I've been using just to protect the back of my iPhone. I'm thinking of taking it off and just going naked (the phone that is).
Anyone have any problems with their naked iPhone in their pocket? Any scratches? Just wondering.
Thanks.
Has long as you do not have coins or keys or the like in your pocket, then your iPhone should not get scratched while in your pocket.
I have a leather case for my iPhone (this one)
http://store.apple.com/uk/product/TU776ZM/A?fnode=MTY1NDA0NA&mco=MTE0MzU0NjY
It doesn't add any additional bulk to the iPhone and it just gives the iPhone a cover of the front, back, sides, it also has a soft velveteen interior. I can highly recommend the case.

Has anyone gotten a tracking number for their iPhone 6?

Hello all, I pre ordered an unlocked 64gb Space Gray iPhone 6 via apple.com at about 6:30 A.M. on 9/12. They still had some in stock, because my delivery date has always been 9/19 by standard shipping. Has anyone gotten a tracking number when ordering via apple? When i log into my account to look at my order, it says Preparing for Shipment. It has done this since saturday night. But on my Apple support profile, it lists my 6 as a device with the serial number; and I have heard that this means it has shipped. So, what is it? And has anyone recieved a shipment notification or tracking number yet when ordering via apple? Thanks in advance!

9/19 delivery means 9/19 delivery. Be patient. UPS probably asked Apple not to release tracking info until Thursday.

Does anyone use an anti-virus for their iMac?

I have conflicting opinions as to whether or not I need it. Can anyone help?

You will find this User Tip on Viruses, Trojan Detection and Removal, as well as general Internet Security and Privacy, useful:
https://discussions.apple.com/docs/DOC-2435
The User Tip (which you are welcome to print out and retain for future reference) seeks to offer guidance on the main security threats and how to avoid them.

Who's using APEX for their corporate website?

Hi,
I'm trying to convince a prospective client that APEX is the way to go for the redevelopment of their corporate website. They would like to see some examples of other organisation's websites that have been implemented in APEX.
If you know of any I'd be grateful if you could post the URL here.
Cheers,
Andrew.

Hello Andrew,
Google on : inurl:"apex/f" 8080 and you'll get over 5000 hits of websites using the standard APEX setup. A lot of them need username/passwords, but some of them are public like:
http://ireadindia.com:8080/apex/f?p=100:1
http://siam.imida.es:8080/apex/f?p=101:1
http://www.aviationacademics.com/pls/apex/f?p=340:1
http://www.moyersoen.be/pls/apex/f?p=2008:1
https://promis.uvic.ca/apex/f?p=122:1
http://nccp.coach.ca/apex/f?p=300:1
http://search4karaoke.no-ip.com:8080/apex/f?p=1000:1
http://www.europetraditions.eu:8080/apex/f?p=100:1
and the new http://www.odtug.com !!
I don't know if all these sites are intentionally public available....
Greetings,
Roel
http://roelhartman.blogspot.com/
You can reward this reply by marking it as either Helpful or Correct ;-)

Anyone who wants zCover action for their Nano.

Similar Messages

Maybe you are looking for