Can someone help me recover my contact list from my iphone 3gs, if the phone is stolen?

I am in a really bad situation...i really need to somehow recover my contact list from my iphone 3g, but the phone was stolen along with the sim card. I did a backup on my phone a couple months ago, but it was on a friends computer,which they no longer have. So my question is there anyway for me to retrieve the contact information online maybe? .... help!!
jodi k

No.  Sorry.
You should have been syncing them with your computer regularly.

Similar Messages

  • HT1751 how do i transfer my contact list from my iphone 3gs to my ipad3 ? please help .

    i'm new to apple products.please help me to transfer my contact list from iphone 3gs to ipad3. thx in advance

    Your contacts should be on your computer.
    Sync them to your ipad, just as you sync them to your iphone

  • Can someone help me email to distribution list on my iPhone that I created in Address Book?

    I use a Macbook Pro and have no problem emailing to a distribution list I created in Address Book using Mail.  However, iPhone Mail does not seem to recognize the "group"...instead I have to enter each person's email address separately in the Send To box.  Does anyone know why or what I need to do?

    That's not a feature of the iPhone. The phone can not address distribution lists.

  • I purchased a one year subscription to Rolling Stone magazine . I got two issues and now it will not allow me to view the current issue, I have to pay again. Can someone help me, how do I get my purchase. I have the automatic download turned on.

    I purchased a one year subscription to Rolling Stone magazine . I got two issues and now it will not allow me to view the current issue, I have to pay again. Can someone help me, how do I get my purchase ? I have the automatic download turned on.

    Try contacting apple

  • How do I recover contact list from my Iphone 4?

    How do I recover contact list from my Iphone 4 if I do not have ICloud and do not have the ITunes sync installed/

    If you don't have backups, theres really not much that can be done other than to have everyone you know send you their numbers/emails again.
    Also, backup your contacts twice from now on. Use iCloud and Lookout Mobile Security.
    Make regular iPhone backups to keep this from happening again.

  • My MacBook Pro is running slowly. I run Mountain Lion on it.  I received the following report from Etrecheck.  Can someone help me decipher it and provide me with steps to fix the slow speed?

    My MacBook Pro is running slowly. I run Mountain Lion on it.  I received the following report from Etrecheck.  Can someone help me decipher it and provide me with steps to fix the slow speed?
    Problem description:
    slow computer
    EtreCheck version: 2.0.11 (98)
    Report generated November 15, 2014 2:57:16 PM EST
    Hardware Information: ℹ️
      MacBook Pro (15-inch, Mid 2012) (Verified)
      MacBook Pro - model: MacBookPro9,1
      1 2.3 GHz Intel Core i7 CPU: 4-core
      4 GB RAM
      BANK 0/DIMM0
      2 GB DDR3 1600 MHz ok
      BANK 1/DIMM0
      2 GB DDR3 1600 MHz ok
      Bluetooth: Good - Handoff/Airdrop2 supported
      Wireless:  en1: 802.11 a/b/g/n
    Video Information: ℹ️
      Intel HD Graphics 4000 - VRAM: 384 MB
      NVIDIA GeForce GT 650M - VRAM: 512 MB
      Color LCD 1440 x 900
    System Software: ℹ️
      OS X 10.8.5 (12F45) - Uptime: 6 days 7:45:47
    Disk Information: ℹ️
      TOSHIBA MK5065GSXF disk0 : (500.11 GB)
      S.M.A.R.T. Status: Verified
      disk0s1 (disk0s1) <not mounted> : 210 MB
      Macintosh HD (disk0s2) /  [Startup]: 499.25 GB (25.67 GB free)
      Recovery HD (disk0s3) <not mounted>  [Recovery]: 650 MB
      HL-DT-ST DVDRW  GS31N 
    USB Information: ℹ️
      Apple Inc. FaceTime HD Camera (Built-in)
      Apple Inc. BRCM20702 Hub
      Apple Inc. Bluetooth USB Host Controller
      Apple Computer, Inc. IR Receiver
      Apple Inc. Apple Internal Keyboard / Trackpad
    Thunderbolt Information: ℹ️
      Apple Inc. thunderbolt_bus
    Gatekeeper: ℹ️
      Mac App Store and identified developers
    Kernel Extensions: ℹ️
      /Applications/Rowmote Helper.app
      [loaded] com.regularrateandrhythm.driver.RowmoteIREmu (1.0 - SDK 10.8) Support
      /System/Library/Extensions
      [not loaded] com.smarttech.iokit.SMARTBoard (11) Support
      [not loaded] com.tectona.driver.PL2303 (1.3.0) Support
      [loaded] com.webroot.driver.WebrootSecureAnywhere (54 - SDK 10.7) Support
    Problem System Launch Agents: ℹ️
      [failed] com.apple.accountsd.plist
      [failed] com.apple.AirPlayUIAgent.plist
      [failed] com.apple.coreservices.appleid.authentication.plist
      [failed] com.apple.lookupd.plist
      [failed] com.apple.printtool.agent.plist
      [failed] com.apple.scopedbookmarkagent.xpc.plist
    Problem System Launch Daemons: ℹ️
      [failed] com.apple.coresymbolicationd.plist
      [failed] com.apple.wdhelper.plist
    Launch Agents: ℹ️
      [loaded] com.oracle.java.Java-Updater.plist Support
      [running] com.smarttech.boardservice.plist Support
      [running] com.smarttech.floatingtools.plist Support
      [running] com.smarttech.ink.plist Support
      [running] com.smarttech.SBWDKService.plist Support
      [running] com.smarttech.smartnotification.plist Support
      [running] com.smarttech.systemtrayicon.plist Support
      [running] com.webroot.WRMacApp.plist Support
      [running] com.webroot.WRMacBackNSync.plist Support
    Launch Daemons: ℹ️
      [loaded] com.adobe.fpsaud.plist Support
      [loaded] com.microsoft.office.licensing.helper.plist Support
      [loaded] com.oracle.java.Helper-Tool.plist Support
      [running] com.regularrateandrhythm.rowmotehelperaide.plist Support
      [running] com.webroot.security.mac.plist Support
      [running] com.webroot.webfilter.mac.plist Support
    User Launch Agents: ℹ️
      [loaded] com.google.keystone.agent.plist Support
      [running] com.spotify.webhelper.plist Support
    User Login Items: ℹ️
      Garmin Express Service UNKNOWN (missing value)
      iTunesHelper ApplicationHidden (/Applications/iTunes.app/Contents/MacOS/iTunesHelper.app)
      Dropbox Application (/Applications/Dropbox.app)
      Spotify Application (/Applications/Spotify.app)
      Google Chrome ApplicationHidden (/Applications/Google Chrome.app)
      Rowmote Helper Application (/Applications/Rowmote Helper.app)
    Internet Plug-ins: ℹ️
      Flip4Mac WMV Plugin: Version: 3.2.0.16   - SDK 10.8 Support
      FlashPlayer-10.6: Version: 15.0.0.223 - SDK 10.6 Support
      npwebroot: Version: 2.0.15 Support
      AdobePDFViewerNPAPI: Version: 11.0.06 - SDK 10.6 Support
      Flash Player: Version: 15.0.0.223 - SDK 10.6 Support
      AdobePDFViewer: Version: 11.0.06 - SDK 10.6 Support
      QuickTime Plugin: Version: 7.7.1
      SharePointBrowserPlugin: Version: 14.4.5 - SDK 10.6 Support
      Unity Web Player: Version: UnityPlayer version 4.5.1f3 - SDK 10.6 Support
      Silverlight: Version: 5.1.20513.0 - SDK 10.6 Support
      JavaAppletPlugin: Version: Java 7 Update 51 Check version
    Safari Extensions: ℹ️
      Password Manager
      webfilter
    3rd Party Preference Panes: ℹ️
      Flash Player  Support
      Flip4Mac WMV  Support
      Java  Support
      SMART Board  Support
    Time Machine: ℹ️
      Time Machine not configured!
    Top Processes by CPU: ℹ️
          3% WindowServer
          2% iPhoto
          2% mds
          2% mdworker
          1% Google Chrome
    Top Processes by Memory: ℹ️
      382 MB Mail
      275 MB WebProcess
      107 MB Google Chrome
      103 MB WindowServer
      99 MB Google Chrome Helper
    Virtual Memory Information: ℹ️
      270 MB Free RAM
      1.50 GB Active RAM
      1.30 GB Inactive RAM
      1.22 GB Wired RAM
      20.97 GB Page-ins
      8.64 GB Page-outs

    Hi Linc
    I hope this is what you were after.  Looking forward to hearing your feedback.
    Thanks, Susanna.
    11/16/14 12:36:02.738 PM com.apple.XType.FontHelper[91728]: FontHelper:  message received. (<dictionary: 0x7fbb9b606ce0> { count = 2, contents =
      "query" => <string: 0x7fbb9b605720> { length = 109, contents = "com_apple_ats_name_postscript == "Roboto-Regular" && kMDItemContentTypeTree != com.adobe.postscript-lwfn-font" }
      "restricted" => <bool: 0x7fff7912f320>: true
    11/16/14 12:36:02.738 PM com.apple.XType.FontHelper[91728]: AutoActivation:  scopes (
        "/Library/Application Support/Apple/Fonts"
    11/16/14 12:36:02.878 PM com.apple.XType.FontHelper[91728]: FontHelper:  message received. (<dictionary: 0x7fbb9a41d950> { count = 2, contents =
      "query" => <string: 0x7fbb9a41d2e0> { length = 108, contents = "com_apple_ats_name_postscript == "Roboto-Medium" && kMDItemContentTypeTree != com.adobe.postscript-lwfn-font" }
      "restricted" => <bool: 0x7fff7912f320>: true
    11/16/14 12:36:02.878 PM com.apple.XType.FontHelper[91728]: AutoActivation:  scopes (
        "/Library/Application Support/Apple/Fonts"
    11/16/14 12:36:02.889 PM com.apple.XType.FontHelper[91728]: FontHelper:  message received. (<dictionary: 0x7fbb9b102580> { count = 2, contents =
      "query" => <string: 0x7fbb9b100580> { length = 107, contents = "com_apple_ats_name_postscript == "Roboto-Light" && kMDItemContentTypeTree != com.adobe.postscript-lwfn-font" }
      "restricted" => <bool: 0x7fff7912f320>: true
    11/16/14 12:36:02.889 PM com.apple.XType.FontHelper[91728]: AutoActivation:  scopes (
        "/Library/Application Support/Apple/Fonts"
    11/16/14 12:36:02.898 PM com.apple.XType.FontHelper[91728]: FontHelper:  message received. (<dictionary: 0x7fbb9a41d1d0> { count = 2, contents =
      "query" => <string: 0x7fbb9a41d2e0> { length = 106, contents = "com_apple_ats_name_postscript == "Roboto-Bold" && kMDItemContentTypeTree != com.adobe.postscript-lwfn-font" }
      "restricted" => <bool: 0x7fff7912f320>: true
    11/16/14 12:36:02.898 PM com.apple.XType.FontHelper[91728]: AutoActivation:  scopes (
        "/Library/Application Support/Apple/Fonts"
    11/16/14 12:36:03.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91723 [cfprefsd]
    11/16/14 12:36:03.784 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91721]) Exited: Killed: 9
    11/16/14 12:36:03.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91721 [SleepServicesD]
    11/16/14 12:36:08.471 PM com.apple.launchd.peruser.501[159]: (com.apple.tccd[91730]) Exited: Killed: 9
    11/16/14 12:36:08.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91730 [tccd]
    11/16/14 12:36:09.592 PM com.apple.launchd[1]: (com.apple.xpcd.F5010000-0000-0000-0000-000000000000[91727]) Exited: Killed: 9
    11/16/14 12:36:09.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91727 [xpcd]
    11/16/14 12:36:13.129 PM com.apple.launchd[1]: (com.apple.XType.FontHelper[91728]) Exited: Killed: 9
    11/16/14 12:36:13.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91728 [XType.FontHelper]
    11/16/14 12:36:14.996 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91739]) Exited: Killed: 9
    11/16/14 12:36:14.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91739 [SleepServicesD]
    11/16/14 12:36:20.120 PM com.apple.launchd[1]: (com.apple.cfprefsd.xpc.daemon[76618]) Exited: Killed: 9
    11/16/14 12:36:20.000 PM kernel[0]: memorystatus_thread: idle exiting pid 76618 [cfprefsd]
    11/16/14 12:36:23.433 PM com.apple.launchd.peruser.501[159]: (com.apple.cfprefsd.xpc.agent[76616]) Exited: Killed: 9
    11/16/14 12:36:23.000 PM kernel[0]: memorystatus_thread: idle exiting pid 76616 [cfprefsd]
    11/16/14 12:36:26.261 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91752]) Exited: Killed: 9
    11/16/14 12:36:26.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91752 [SleepServicesD]
    11/16/14 12:36:37.691 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91764]) Exited: Killed: 9
    11/16/14 12:36:38.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91764 [SleepServicesD]
    11/16/14 12:36:48.938 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91777]) Exited: Killed: 9
    11/16/14 12:36:49.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91777 [SleepServicesD]
    11/16/14 12:37:01.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91788 [SleepServicesD]
    11/16/14 12:37:00.821 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91788]) Exited: Killed: 9
    11/16/14 12:37:04.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91706 [distnoted]
    11/16/14 12:37:15.656 PM com.apple.launchd[1]: (com.apple.sleepservicesd[91795]) Exited: Killed: 9
    11/16/14 12:37:15.000 PM kernel[0]: memorystatus_thread: idle exiting pid 91795 [SleepServicesD]
    11/16/14 12:37:27.016 PM ReportCrash[91819]: Failed to create CSSymbolicatorRef for Webroot SecureAnywhere[264]
    11/16/14 12:37:27.125 PM ReportCrash[91819]: Failed to create dSYM-less CSSymbolicatorRef for Webroot SecureAnywhere[264]
    11/16/14 12:37:27.487 PM com.apple.launchd.peruser.501[159]: (com.webroot.WRMacApp[264]) Job appears to have crashed: Segmentation fault: 11
    11/16/14 12:37:30.336 PM com.apple.launchd[1]: (WSDaemon[61]) Exited abnormally: Broken pipe: 13
    11/16/14 12:37:34.295 PM WindowServer[79]: CGXDisableUpdate: UI updates were forcibly disabled by application "iPhoto" for over 1.00 seconds. Server has re-enabled them.
    11/16/14 12:37:34.594 PM WindowServer[79]: reenable_update_for_connection: UI updates were finally reenabled by application "iPhoto" after 1.30 seconds (server forcibly re-enabled them after 1.00 seconds)
    11/16/14 12:37:37.648 PM ReportCrash[91819]: Saved crash report for Webroot SecureAnywhere[264] version 8.0.7.78 (8.0.7.78) to /Users/landerson/Library/Logs/DiagnosticReports/Webroot SecureAnywhere_2014-11-16-123737_lukes-MacBook-Pro.crash
    11/16/14 12:37:42.660 PM WindowServer[79]: CGXDisableUpdate: UI updates were forcibly disabled by application "iPhoto" for over 1.00 seconds. Server has re-enabled them.
    11/16/14 12:37:43.632 PM WindowServer[79]: reenable_update_for_connection: UI updates were finally reenabled by application "iPhoto" after 1.97 seconds (server forcibly re-enabled them after 1.00 seconds)
    11/16/14 12:37:50.783 PM WSDaemon[91822]: CGSRegisterConnectionNotifyProc called with invalid connection
    11/16/14 12:38:09.909 PM Problem Reporter[91853]: launch_msg returned m

  • HT4946 can you back up your contacts list from your iphone?

    can you back up a contact list from an iphone 4

    You should be syncing them to a cloud service or to an address book on your computer. Are you?

  • How do i erase a corrupt contact list from iCloud,iPhone, iPad and MacBook Pro and restore Address Book backup to all devices and cloud?

    how do i erase a corrupt contact list from iCloud,iPhone, iPad and MacBook Pro and restore Address Book backup to all devices and cloud?
    I saved a corrected, most up to date version of my master Address Book Contacts as a back-up on my Mac Book Pro.
    then in an effort to "simplify my life"  i attempted to sync my I phone contacts - ( pre clean-up version) with my clean list on Mac Book Pro, New I pad and newly available icloud. DUH!! Using iTunes to do the sync caused the clean MacBOOK Pro list to be commingled with the dirty iphone contacts. amd now the whole mess is in the cloud. 
    I need to clear out the contaminated lists from all iplaces, and startover with Back-up on my macbook pro. BUT HOW???
    Help
    Karen

    I had exported an address book backup: abbu
    so since i wrote, i have found my way into the cloud: selected all entries - deleted them all from the cloud.
    This wiped out contacts on my iphone and i pad, and MBP, as well as on the cloud.  I then imported the abbu back into my now empty address book. 
    To repopulate the crowd, i selected all in my address book and created a single card vCard for export to my desktop.  I then dragged that vcard into my empty cloud.  Now my cloud has the same clean contacts as my MBP addressbook.  The cloud then pushed the clean contacts into my empty ipad and iphone contacts. 
    I had to go back to Address Book>preferences>Accounts and Add an I cloud account - but if you accidentally create a second i cloud account - all of a sudden your address book will duplicate itself.  I quickly reversed it by deleting one of the icloud accounts in my Address Book>preferences>Accounts. 
    I created a new entry on my MBP and it is now on all devices and in cloud
    I also created a new entry on my iPhone and it is now in the address book on my MBP.
    I feel empowered!!
    Have i missed anything??

  • HT4356 Is there a way to print a contact list from an iPhone?

    Is there a way to print a contact list from an iPhone?

    Another way to do this is to use Contact Sheet (https://itunes.apple.com/app/id894488957?mt=8) which can print your contacts and pictures or it can export them into an Excel file.  You can print all of your contacts or just a select group that you choose.  You can even share contacts and only include the fields you want, so, for example, if you want to share email addresses with a new mom's group but you don't want to share home addresses, you can create a contact share file (VCF) that only includes the names and email addresses of the members of your new mom's group!

  • Can computer expert retrieve deleted videos and photo from and iphone 4 which the photos and video are not sync before? is there any tools or software to retrieve it?

    can computer expert retrieve deleted videos and photo from and iphone 4 which the photos and video are not sync before? Are there any tools or software to retrieve it?

    kimberlyq wrote:
    That means it is possible for sure there is a chance to retrieve back those photos and video.
    No, there are no gurantees. The capabilitty exists to retrive deleted data from an iPhone, but like many things in life it is not 100% successful all the time. Be careful, there are a lot of scam artists out there. They take your money & retrive nothing. This guy is one of the best in the business, but he does not work for people in the private sector. Perhaps he can recommend a service to you. But, as already pointed out, you're looking at thousands of dollars out of pocket whether these folks are successful or not:
    http://www.zdziarski.com/blog/

  • How do i transfer my contacts from my iphone 3gs to the new iphone 4s?

    How do I transfer my contacts etc from my iphone 3gs to iphone 4s ?

    You do it via iTunes on your Mac or PC (by syncing the contacts to the equivalent desktop app), or via iCloud (but you'd need to upgrade the 3GS to iOS5 and open an iCloud account).
    With iTunes, sync the 3GS, then connect the 4s and sync it
    There are utilities like PhoneView (Mac) and others that will allow you to extract the data from your 3GS, but iTunes or iCloud are the preferred methods.
    I should add that, if you're not using iTunes to sync your phone, you're at risk of losing data.

  • HT4389 recovering unintenial contact list o my Iphone 4S

    as a "fingeritis" newby ,I deleted my contact list on my Iphone. I would appreciate help.
    <Email Edited By Host>

    Hello Chuck,
    You have  2 options here that I can see. 1 is to restore your iPhone from a backup that would have had to have been created before this happened in iTunes.
    iOS: How to back up and restore your content
    http://support.apple.com/kb/ht1766
    If there is not one, then you can see if there are any contacts at www.icloud.com. If so then you can either export the contacts to your computer, and import them to the Contacts app, then sync them over to the iPhone
    iCloud: Export contact information as a vCard
    http://support.apple.com/kb/PH3606
    Address Book 6.x: Export and import vCards
    http://support.apple.com/kb/ph4655
    Or, setup iCloud on your iPhone and sync them down from the Cloud.
    http://www.apple.com/icloud/setup/ios.html
    Regards,
    Sterling

  • Can someone help with splitting a Linked List.??

    Any help would be awesome!!!
    My code just will not work!! Any help would be appreciated! My problem is in the last method SplitAt. These are the conditions set and my code:
    Splitting a Linked List at a Given Node, into Two Sublists
    a. Add the following as an abstract method to the class
    LinkedListClass:
    public void splitAt (LinkedListClass<T> secondList, T item);
    //This method splits the list at the node with the info item into two sublists.
    //Precondition: The list must exist.
    //Postcondition: first and last point to the first and last nodes of the first sublist,
    // respectively. secondList.first and secondList.last point to the first
    // and last nodes of the second sublist.
    Consider the following statements:
    UnorderedLinkedList<Integer> myList;
    UnorderedLinkedList<Integer> otherList;
    Suppose myList points to the list with the elements 34, 65, 18, 39, 27, 89, and 12 (in this order). The statement
    myList.splitAt(otherList, 18);
    splits myList into two sublists: myList points to the list with elements 34 and 65, and otherList points to the sublist with elements 18, 39, 27, 89, and 12.
    b. Provide the definition of the method splitAt in the class UnorderedLinkedList. Also write a program to test your method.
    public class UnorderedLinkedList<T> extends LinkedListClass<T>
           //Default constructor
        public UnorderedLinkedList()
            super();
            //Method to determine whether searchItem is in
            //the list.
            //Postcondition: Returns true if searchItem is found
            //               in the list; false otherwise.
        public boolean search(T searchItem)
            LinkedListNode<T> current; //variable to traverse
                                       //the list
            boolean found;
            current = first;  //set current to point to the first
                              //node in the list
            found = false;    //set found to false
            while (current != null && !found) //search the list
                if (current.info.equals(searchItem)) //item is found
                    found = true;
                else
                   current = current.link; //make current point to
                                           //the next node
            return found;
            //Method to insert newItem in the list.
            //Postcondition: first points to the new list
            //               and newItem is inserted at the
            //               beginning of the list. Also,
            //               last points to the last node and
            //               count is incremented by 1.
        public void insertFirst(T newItem)
            LinkedListNode<T> newNode;     //variable to create the
                                        //new node
            newNode =
               new LinkedListNode<T>(newItem, first); //create and
                                           //insert newNode before
                                           //first
            first = newNode;   //make first point to the
                               //actual first node
            if (last == null)   //if the list was empty, newNode is
                                //also the last node in the list
                last = newNode;
            count++;     //increment count
            //Method to insert newItem at the end of the list.
            //Postcondition: first points to the new list and
            //               newItem is inserted at the end
            //               of the list. Also, last points to
            //               the last node and
            //               count is incremented by 1.
        public void insertLast(T newItem)
            LinkedListNode newNode; //variable to create the
                                    //new node
            newNode =
               new LinkedListNode(newItem, null);  //create newNode
            if (first == null)  //if the list is empty, newNode is
                                //both the first and last node
                first = newNode;
                last = newNode;
            else     //if the list is not empty, insert
                     //newNode after last
                last.link = newNode; //insert newNode after last
                last = newNode;      //set last to point to the
                                     //actual last node
            count++;
        }//end insertLast
            //Method to delete deleteItem from the list.
            //Postcondition: If found, the node containing
            //               deleteItem is deleted from the
            //               list. Also, first points to the first
            //               node, last points to the last
            //               node of the updated list, and count
            //               is decremented by 1.
        public void deleteNode(T deleteItem)
            LinkedListNode<T> current; //variable to traverse
                                       //the list
            LinkedListNode<T> trailCurrent; //variable just
                                            //before current
            boolean found;
            if ( first == null)    //Case 1; the list is empty
                System.err.println("Cannot delete from an empty "
                                 + "list.");
            else
                if (first.info.equals(deleteItem)) //Case 2
                    first = first.link;
                       if (first == null)  //the list had only one node
                          last = null;
                       count--;
                else  //search the list for the given info
                    found = false;
                    trailCurrent = first; //set trailCurrent to
                                          //point to the first node
                    current = first.link; //set current to point to
                                          //the second node
                    while (current != null && !found)
                        if (current.info.equals(deleteItem))
                            found = true;
                        else
                            trailCurrent = current;
                            current = current.link;
                    }//end while
                    if (found) //Case 3; if found, delete the node
                        count--;
                        trailCurrent.link = current.link;
                        if (last == current)  //node to be deleted
                                              //was the last node
                           last = trailCurrent;  //update the value
                                                 //of last
                    else
                       System.out.println("Item to be deleted is "
                                        + "not in the list.");
                }//end else
            }//end else
        }//end deleteNode
        public void splitAt(LinkedListClass<T> secondList, T item)
         LinkedListNode<T> current;
         LinkedListNode<T> trailCurrent;
         int i;
         boolean found;
         if (first==null)
        System.out.println("Empty.");
        first=null;
        last=null;
        count--;
         else
              current=first;
              found=false;
              i=1;
              while(current !=null &&!found)
                   if(current.info.equals(secondList))
                       found= true;
                       else
                            trailCurrent=current;
                            i++;
              if(found)
                   if(first==current)
                        first=first;
                        last=last;
                        count=count;
                        count=0;
                   else
                        first=current;
                        last=last;
                        last=null;
                        count = count- i+1;
                        count = i-1;
                   else
                        System.out.println("Item to be split at is "
                             + "not in the list.");
                   first=null;
                   last=null;
                   count=0;
        }Edited by: romeAbides on Oct 10, 2008 1:24 PM

    I dont have a test program at all. The program is supposed to prompt for user input of numbers. (it does) Take the input and end at input of -999 (it does). Then it asks user where it wants to split list (it does). When I enter a number it does nothing after that. I am going to post updated code and see if that helps along with all the classes. Thanks!
    This is the class to prompt:
    import java.util.*;
    public class Ch16_ProgEx6
        static Scanner console = new Scanner(System.in);
         public static void main(String[] args)
             UnorderedLinkedList<Integer> list
                              = new UnorderedLinkedList<Integer>();
            UnorderedLinkedList<Integer> subList =
                              new UnorderedLinkedList<Integer>();
             Integer num;
             System.out.println("Enter integers ending with -999.");
             num = console.nextInt();
             while (num != -999)
                 list.insertLast(num);
                 num = console.nextInt();
            System.out.println();
            System.out.println("list: ");
            list.print();
            System.out.println();
            System.out.println("Length of list: " + list.length());
            System.out.print("Enter the number at which to split list: ");
            num = console.nextInt();
            list.splitAt(subList, num);
            System.out.println("Lists after splitting list");
            System.out.print("list: ");
            list.print();
            System.out.println();
            System.out.println("Length of list: " + list.length());
            System.out.print("sublist: ");
            subList.print();
            System.out.println();
            System.out.println("Length of sublist: " + subList.length());
    }This is the ADT:
    public interface LinkedListADT<T> extends Cloneable
        public Object clone();
           //Returns a copy of objects data in store.
           //This method clones only the references stored in
           //each node of the list. The objects that the
           //list nodes point to are not cloned.
        public boolean isEmptyList();
           //Method to determine whether the list is empty.
           //Postcondition: Returns true if the list is empty;
           //               false otherwise.
        public void initializeList();
           //Method to initialize the list to an empty state.
           //Postcondition: The list is initialized to an empty
           //               state.
        public void print();
           //Method to output the data contained in each node.
        public int length();
           //Method to return the number of nodes in the list.
           //Postcondition: The number of nodes in the list is
           //               returned.
        public T front();
           //Method to return a reference of the object containing
           //the data of the first node of the list.
           //Precondition: The list must exist and must not be empty.
           //Postcondition: The reference of the object that
           //               contains the info of the first node
           //               is returned.
        public T back();
           //Method to return a reference of object containing
           //the data of the last node of the list.
           //Precondition: The list must exist and must not be empty.
           //Postcondition: The reference of the object that
           //               contains the info of the last node
           //               is returned.
        public boolean search(T searchItem);
           //Method to determine whether searchItem is in the list.
           //Postcondition: Returns true if searchItem is found
           //               in the list; false otherwise.
        public void insertFirst(T newItem);
           //Method to insert newItem in the list.
           //Postcondition: newItem is inserted at the
           //               beginning of the list.
        public void insertLast(T newItem);
           //Method to insert newItem at the end of the list.
           //Postcondition: newItem is inserted at the end
           //               of the list.
        public void deleteNode(T deleteItem);
           //Method to delete deleteItem from the list.
           //Postcondition: If found, the node containing
           //               deleteItem is deleted from the
           //               list.
        public void splitAt(LinkedListClass<T> secondList, T item);
    }This is the linked list class:
    import java.util.NoSuchElementException;
    public abstract class LinkedListClass<T> implements LinkedListADT<T>
        protected class LinkedListNode<T> implements Cloneable
            public T info;
            public LinkedListNode<T> link;
               //Default constructor
               //Postcondition: info = null; link = null;
            public LinkedListNode()
                info = null;
                link = null;
               //Constructor with parameters
               //This method sets info pointing to the object to
               //which elem points to and link is set to point to
               //the object to which ptr points to.
               //Postcondition:  info = elem; link = ptr;
            public LinkedListNode(T elem, LinkedListNode<T> ptr)
                info = elem;
                link = ptr;
               //Returns a copy of objects data in store.
               //This method clones only the references stored in
               //the node. The objects that the nodes point to
               //are not cloned.
            public Object clone()
                LinkedListNode<T> copy = null;
                try
                    copy = (LinkedListNode<T>) super.clone();
                catch (CloneNotSupportedException e)
                    return null;
                return copy;
               //Method to return the info as a string.
               //Postcondition: info as a String object is
               //               returned.
            public String toString()
                return info.toString();
        } //end class LinkedListNode
        public class LinkedListIterator<T>
            protected LinkedListNode<T> current;  //variable to
                                                  //point to the
                                                  //current node in
                                                  //list
            protected LinkedListNode<T> previous; //variable to
                                                  //point to the
                                                  //node before the
                                                  //current node
               //Default constructor
               //Sets current to point to the first node in the
               //list and sets previous to null.
               //Postcondition: current = first; previous = null;
            public LinkedListIterator()
                current = (LinkedListNode<T>) first;
                previous = null;
               //Method to reset the iterator to the first node
               //in the list.
               //Postcondition: current = first; previous = null;
            public void reset()
                current = (LinkedListNode<T>) first;
                previous = null;
               //Method to return a reference of the info of the
               //current node in the list and to advance iterator
               //to the next node.
               //Postcondition: previous = current;
               //               current = current.link;
               //               A refrence of the current node
               //               is returned.
            public T next()
                if (!hasNext())
                    throw new NoSuchElementException();
                LinkedListNode<T> temp = current;
                previous = current;
                current = current.link;
                return temp.info;
                //Method to determine whether there is a next
                //element in the list.
                //Postcondition: Returns true if there is a next
                //               node in the list; otherwise
                //               returns false.
            public boolean hasNext()
                return (current != null);
               //Method to remove the node currently pointed to
               //by the iterator.
               //Postcondition: If iterator is not null, then the
               //               node that the iterator points to
               //               is removed. Otherwise the method
               //               throws NoSuchElementException.
            public void remove()
                if (current == null)
                    throw new NoSuchElementException();
                if (current == first)
                    first = first.link;
                    current = (LinkedListNode<T>) first;
                    previous = null;
                    if (first == null)
                        last = null;
                else
                    previous.link = current.link;
                    if (current == last)
                        last = first;
                        while (last.link != null)
                            last = last.link;
                    current = current.link;
                count--;
               //Method to return the info as a string.
               //Postcondition: info as a String object is returned.
            public String toString()
                return current.info.toString();
        } //end class LinkedListIterator
           //Instance variables of the class LinkedListClass
        protected LinkedListNode<T> first; //variable to store the
                                           //address of the first
                                           //node of the list
        protected LinkedListNode<T> last;  //variable to store the
                                           //address of the last
                                           //node of the list
        protected int count;  //variable to store the number of
                              //nodes in the list
           //Default constructor
           //Initializes the list to an empty state.
           //Postcondition: first = null, last = null,
           //               count = 0
        public LinkedListClass()
            first = null;
            last = null;
            count = 0;
           //Method to determine whether the list is empty.
           //Postcondition: Returns true if the list is empty;
           //               false otherwise.
        public boolean isEmptyList()
            return (first == null);
           //Method to initialize the list to an empty state.
           //Postcondition: first = null, last = null,
           //               count = 0
        public void initializeList()
            first = null;
            last = null;
            count = 0;
           //Method to output the data contained in each node.
        public void print()
            LinkedListNode<T> current; //variable to traverse
                                       //the list
            current = first;    //set current so that it points to
                                //the first node
            while (current != null) //while more data to print
                System.out.print(current.info + " ");
                current = current.link;
        }//end print
           //Method to return the number of nodes in the list.
           //Postcondition: The value of count is returned.
        public int length()
            return count;
           //Method to return a reference of the object containing
           //the data of the first node of the list.
           //Precondition: The list must exist and must not be empty.
           //Postcondition: The reference of the object that
           //               contains the info of the first node
           //               is returned.
        public T front()
            return first.info;
            //Method to return a reference of object containing
            //the data of the last node of the list.
            //Precondition: The list must exist and must not be empty.
            //Postcondition: The reference of the object that
            //               contains the info of the last node
            //               is returned.
        public T back()
            return last.info;
           //Returns a copy of objects data in store.
           //This method clones only the references stored in
           //each node of the list. The objects that the
           //list nodes point to are not cloned.
        public Object clone()
            LinkedListClass<T> copy = null;
            try
                copy = (LinkedListClass<T>) super.clone();
            catch (CloneNotSupportedException e)
                return null;
                //If the list is not empty clone each node of
                //the list.
            if (first != null)
                   //Clone the first node
                copy.first = (LinkedListNode<T>) first.clone();
                copy.last = copy.first;
                LinkedListNode<T> current;
                if (first != null)
                    current = first.link;
                else
                    current = null;
                   //Clone the remaining nodes of the list
                while (current != null)
                    copy.last.link =
                            (LinkedListNode<T>) current.clone();
                    copy.last = copy.last.link;
                    current = current.link;
            return copy;
           //Method to return an iterator of the list.
           //Postcondition: An iterator is instantiated and
           //               returned.
        public LinkedListIterator<T> iterator()
            return new LinkedListIterator<T>();
           //Method to determine whether searchItem is in
           //the list.
           //Postcondition: Returns true if searchItem is found
           //               in the list; false otherwise.
        public abstract boolean search(T searchItem);
           //Method to insert newItem in the list.
           //Postcondition: first points to the new list
           //               and newItem is inserted at the
           //               beginning of the list. Also,
           //               last points to the last node and
           //               count is incremented by 1.
        public abstract void insertFirst(T newItem);
           //Method to insert newItem at the end of the list.
           //Postcondition: first points to the new list and
           //               newItem is inserted at the end
           //               of the list. Also, last points to
           //               the last node and
           //               count is incremented by 1.
        public abstract void insertLast(T newItem);
           //Method to delete deleteItem from the list.
           //Postcondition: If found, the node containing
           //               deleteItem is deleted from the
           //               list. Also, first points to the first
           //               node, last points to the last
           //               node of the updated list, and count
           //               is decremented by 1.
        public abstract void deleteNode(T deleteItem);
        public abstract void splitAt(LinkedListClass<T> secondList, T item);
    }And this is the UnorderedLinked Class with the very last method the one being Im stuck on. The SplitAt Method.
    public class UnorderedLinkedList<T> extends LinkedListClass<T>
           //Default constructor
        public UnorderedLinkedList()
            super();
            //Method to determine whether searchItem is in
            //the list.
            //Postcondition: Returns true if searchItem is found
            //               in the list; false otherwise.
        public boolean search(T searchItem)
            LinkedListNode<T> current; //variable to traverse
                                       //the list
            boolean found;
            current = first;  //set current to point to the first
                              //node in the list
            found = false;    //set found to false
            while (current != null && !found) //search the list
                if (current.info.equals(searchItem)) //item is found
                    found = true;
                else
                   current = current.link; //make current point to
                                           //the next node
            return found;
            //Method to insert newItem in the list.
            //Postcondition: first points to the new list
            //               and newItem is inserted at the
            //               beginning of the list. Also,
            //               last points to the last node and
            //               count is incremented by 1.
        public void insertFirst(T newItem)
            LinkedListNode<T> newNode;     //variable to create the
                                        //new node
            newNode =
               new LinkedListNode<T>(newItem, first); //create and
                                           //insert newNode before
                                           //first
            first = newNode;   //make first point to the
                               //actual first node
            if (last == null)   //if the list was empty, newNode is
                                //also the last node in the list
                last = newNode;
            count++;     //increment count
            //Method to insert newItem at the end of the list.
            //Postcondition: first points to the new list and
            //               newItem is inserted at the end
            //               of the list. Also, last points to
            //               the last node and
            //               count is incremented by 1.
        public void insertLast(T newItem)
            LinkedListNode newNode; //variable to create the
                                    //new node
            newNode =
               new LinkedListNode(newItem, null);  //create newNode
            if (first == null)  //if the list is empty, newNode is
                                //both the first and last node
                first = newNode;
                last = newNode;
            else     //if the list is not empty, insert
                     //newNode after last
                last.link = newNode; //insert newNode after last
                last = newNode;      //set last to point to the
                                     //actual last node
            count++;
        }//end insertLast
            //Method to delete deleteItem from the list.
            //Postcondition: If found, the node containing
            //               deleteItem is deleted from the
            //               list. Also, first points to the first
            //               node, last points to the last
            //               node of the updated list, and count
            //               is decremented by 1.
        public void deleteNode(T deleteItem)
            LinkedListNode<T> current; //variable to traverse
                                       //the list
            LinkedListNode<T> trailCurrent; //variable just
                                            //before current
            boolean found;
            if ( first == null)    //Case 1; the list is empty
                System.err.println("Cannot delete from an empty "
                                 + "list.");
            else
                if (first.info.equals(deleteItem)) //Case 2
                    first = first.link;
                       if (first == null)  //the list had only one node
                          last = null;
                       count--;
                else  //search the list for the given info
                    found = false;
                    trailCurrent = first; //set trailCurrent to
                                          //point to the first node
                    current = first.link; //set current to point to
                                          //the second node
                    while (current != null && !found)
                        if (current.info.equals(deleteItem))
                            found = true;
                        else
                            trailCurrent = current;
                            current = current.link;
                    }//end while
                    if (found) //Case 3; if found, delete the node
                        count--;
                        trailCurrent.link = current.link;
                        if (last == current)  //node to be deleted
                                              //was the last node
                           last = trailCurrent;  //update the value
                                                 //of last
                    else
                       System.out.println("Item to be deleted is "
                                        + "not in the list.");
                }//end else
            }//end else
        }//end deleteNode
        public void splitAt(LinkedListClass<T> secondList, T item)
         LinkedListNode<T> current;
         LinkedListNode<T> trailCurrent;
         int i;
         boolean found;
         if (first==null)
        System.out.println("Empty.");
        first=null;
        last=null;
        count--;
        count=0;
         else
              current=first;
              found=false;
              i=1;
              while(current !=null &&!found)
                   if(current.info.equals(item))
                       found= true;
                       else
                            trailCurrent=first;
                            current=first;
                            i++;
              if(found)
                   if(first==current)
                        first.link=first;
                        last.link=last;
                           count--;
                        count=0;
                   else
                        first.link=current;
                        last.link=last;
                        last=null;
                        count = count- i+1;
                        count = i-1;
              } else  {
                  System.out.println("Item to be split at is "
                    + "not in the list.");
                   first=null;
                   last=null;
                   count=0;
        Any help or just advice would be fine. Im not the best at Java, better at VB. Am completely stumped! Thanks so much!

  • Can someone help me with this contact sync dillema?

    I apologize in advance -- I posted this on the iphone forum as well ...
    Ok here goes ...
    I have a work computer (using a microsoft exchange server) with over 2000+ contacts that I need on that computer for work (they are in outlook)
    I have an iphone (and an ipad, but that's immaterial for this)
    I know how to sync contacts using a microsoft exchange server. The thing is, I don't want the 2000 work contacts on my iphone, but I DO want the current contents (and any new ones) on my iphone to be on my work computer.
    Using the iphone and exchange server settings, is this possible???

    It's not an option at my place of work.

  • My address book on my Mac was over written by the contact list from my iPhone, Help? restore??

    Recently picked up an iphone - beginning to think it was a mistake. Just found the address book on my Mac was over written by my iphone contact list.
    How did this happen, why was I not warned? and can I somehow restore my address book? I'm lost any help is greatly appreciated!

    I really appreciate you taking the time to help me out, and I apologize for my lack of understanding. no problem, sometimes it's better not to know in detail what's going on inside your mac
    ok, on one side you have a backup of your computer you made some time ago when you had all your contacts on your phone, right?
    On the other side you have your computer as it is now, the MobileSync folder contains a backup of your phone, but you can't use it because it contains the wrong data.
    So in order to have the backup from some date in the past you'll have to replace (overwrite) the folder on your computer. This can be done by moving the old MobileSync folder to the location I described earlier.
    After you replaced the folder, there will be the "old" backup inside and you can go into itunes/settings/devices and see if the backup can be used to restore your phone.

Maybe you are looking for

  • ITunes 7 Destroying my Movies when editing artwork

    A few weeks back i began importing my DVD collection to my new iMac, using Visual Hub to take DVD sources (video_ts folders) and converting them to H.264 mp4 files. I had all of these converted movies (about 30 of them) in my ~/Movies folder, when it

  • Merged pdf with "extend features in adobe reader" rights

    Hi all, I would like to merge a pdf file into my basic pdf form with "extend features in adobe reader" rights but I would like to keep my basic form without those rights. My problem is that when I try to open my basic form and link to my merged attac

  • Why is the website tutorial no longer loading?

    I have installed the software recently and made a start on the tutorial but 2 days later the website will not load, I have no problem with the internet connection. 

  • Import dvd to edit

    Hello all, I've a DVD not anything copywrited, and I want to import it to imovie and edit it. When I click and drag the disc when it's on my desktop to imovie in dock, it doesn't recognize it. Though it does recognize it in iphoto which i thought was

  • What to buy for TurboTax

    Each year, I do my business taxes using TurboTax for Business. This is not for Schedule C companies, but for C and S - Corps that file the 1120 form. This version is only available for Windows computers. The last few years, I borrowed a PC. Before th