Linked List- How?

I was wondering how i could get my code to insert the tokenized string into a linked list. I would need each word to be a different element so that I could perform a bubble search upon them. Can anyone help me please? Below is my code:
import java.io.*;
import java.util.*;
public class ScanText {
public static void main(String[] arguments) {
try {
File output = new File("printout.txt");
FileReader scan = new
FileReader("sample.txt");
BufferedReader in = new
BufferedReader(scan);
FileWriter fw = new
FileWriter(output);
BufferedWriter bw = new
BufferedWriter(fw);
while (in.ready()) {   
String str = in.readLine();
StringTokenizer tk = new StringTokenizer(str);
while (tk.hasMoreTokens()) {
System.out.println(tk.nextToken());
}catch (IOException e) {
System.out.println("Error -- " + e.toString());

I've established a LinkedList but I still can't figure out how to add each token then sort them into alphabetical order...I'm new to java, but I posted this on the wrong forum...I've never done a bubble sort before either. Would i have to do it using a for loop or an if function?

Similar Messages

  • How to write from a linked list collection to a text file.

    Hi,
    I want to write my data in linked list collection to a text file.
    the following is the code of my linked list. how do i write it
    Iwant the data to be comma separated while writing it to a text file.
    please help.
    class MailList
            public static void main(String args[])
                    LinkedList m1 = new LinkedList();
                    m1.add(new Address("J.W.West", "11 Oak Ave",
                           "Urbana", "IL", "118011"));
                    m1.add(new Address("H.S.sandy", "1 k ve",
                           "Bana", "L", "18011"));
                    m1.add(new Address("K.Satish", "1 104 Clarence Street",
                            "Strathfield", "NSW", "135"));
                    Collections.sort(m1);
                    Iterator itr = m1.iterator();
                    while(itr.hasNext())
                            Object element = itr.next();
                            System.out.println(element + "\n");
    }

    look at the API for FileWriter.
    http://java.sun.com/docs/books/tutorial/essential/io/index.html

  • Create a linked list

    Hi guys!
    I read the manual of java 2 and says that is not that pointers don't exist, they do exist but they are not explicit as they are in C languagge. So in need to create a circular linked list how can I do this? The instructions of the manual are not so clear. Does anyone have an idea and can give me a sample code?
    Thanks to all
    Maddy

    References are like pointers except that you cannot make any add operation on them. But you can of course change their values to make it point to other objects.
    This also means that you can create graph objects and every data structure you like. For example :
    class BinaryNode {
        public Object data;
        public BinaryNode left;
        public BinaryNode right;
    }To create binary trees or
    class GraphNode {
        public Object data;
        public ArrayList links;
    }Where links is a Java list containing a list of links (references) to other GraphNode.
    Matthieu

  • How to use methods when objects stored in a linked list?

    Hi friend:
    I stored a series of objects of certain class inside a linked list. When I get one of them out of the list, I want to use the instance method associated with this object. However, the complier only allow me to treat this object as general object, ( of Object Class), as a result I can't use instance methods which are associated with this object. Can someone tell me how to use the methods associated with the objects which are stored inside a linked list?
    Here is my code:
    import java.util.*;
    public class QueueW
         LinkedList qList;
         public QueueW(Collection s) //Constructor of QuequW Class
              qList = new LinkedList(s); //Declare an object linked list
         public void addWaiting(WaitingList w)
         boolean result = qList.isEmpty(); //true if list contains no elements
              if (result)
              qList.addFirst(w);
              else
              qList.add(w);
         public int printCid()
         Object d = qList.getFirst(); // the complier doesn't allow me to treat d as a object of waitingList class
              int n = d.getCid(); // so I use "Object d"
         return n; // yet object can't use getCid() method, so I got error in "int n = d.getCid()"
         public void removeWaiting(WaitingList w)
         qList.removeFirst();
    class WaitingList
    int cusmNo;
    String cusmName;
    int cid;
    private static int id_count = 0;
         /* constructor */
         public WaitingList(int c, String cN)
         cusmNo = c;
         cusmName = cN;
         cid = ++id_count;
         public int getCid() //this is the method I want to use
         return cid;

    Use casting. In other words, cat the object taken from the collection to the correct type and call your method.
       HashMap map = /* ... */;
       map.put(someKey, myObject);
       ((MyClass)(map.get(someKey)).myMethod();Chuck

  • How to print the contents of doubly-Linked List

    Hi
    I have a DLList consists of header , trailer and 10 linked nodes in between
    Is there a simple way to print the contents ie "the elements"
    of the list
    thanks

    In general you should write an iterator for every linked data structure for fast traversal. I'm guessing you're writing your own DLL for an assignment because one normally uses the LinkedList structure that is included in the api. Anyway, here is an example of how the iterator is implemented for a double linked list:
    http://www.theparticle.com/_javadata2.html#Doubly_Linked_Lists_with_Enumeration

  • How do I find the smallest element of a doubly linked list?

    I currently have a doubly link list, each node contains two datafields df1 and df2. I need to find the smallest of df2 contained in the list and swap it with index one - until the list is sorted.
    Any ideas on how to search a doubly linked list for the smallest element would be greatly appreciated, thanks for your help.
    ps: I have found methods for find an element in a list and tried to alter it to find smallest, but my dfs are objects and I am having difficulty with the comparison.
    thanks so much for your time.

    I have given some comments in your other thread and instead of finding the minimum in each scan, you can do "neighbour-swaps". This will sort the list in fewer scans.

  • How to add SharePoint 2013 Promoted link list view web part in page programatically with Tiles view using CSOM.

    How to add SharePoint 2013 Promoted link list view web part in page programatically with Tiles view using CSOM. I found that it can be
    done by using XsltListViewWebPart class but how can I use this one by using shraepoint client api.
    shiv

    Nice, can you point me to the solution please ?
    I'm  trying to do this but I get an error : 
    Web Part Error: Cannot complete this action. Please try again. Correlation ID: blablabla
    StackTrace:    at Microsoft.SharePoint.SPViewCollection.EnsureViewSchema(Boolean fullBlownSchema, Boolean bNeedInitallViews)     at Microsoft.SharePoint.SPList.GetView(Guid viewGuid)   
    All help really appreciated.

  • How can you create a linked list? GUI?

    I have the following program that I wrote:
    package damagecounter;
    import java.io.*;
    import java.util.*;
    public class Main
         public static void main (String[] args) throws Exception
              String logline;
              Player player1 = new Player("Kazzandar");
              try
                   BufferedReader logfile = new BufferedReader(new FileReader("TeilmonRun.txt"));
                   logline = logfile.readLine();
                   while (logline != null)
                        if (logline.startsWith (player1.getName (), 0))
                             if (logline.contains ("recites"))
                                  player1.recites++;
                             if (logline.contains ("rescues"))
                                  player1.rescues++;
                             if (logline.contains ("utters the words"))
                                  player1.spells++;
                             if (logline.contains ("sprawling with a powerful bash."))
                                  player1.bashes++;
                             if (logline.contains ("got toasted by"))
                                  player1.deaths++;
                             if ((logline.contains ("-=")) && (logline.contains ("=-")))
                                  if (logline.startsWith (player1.getName (), 0))
                                       String damage = logline.substring(logline.indexOf ("-=") + 2 , logline.indexOf ("=-"));
                                       player1.setDamage (Integer.parseInt (damage));
                        logline = logfile.readLine ();
              catch (Exception e)
                   System.out.println ("Log file not found or corrupt.");
                   e.printStackTrace();
              player1.printStats();
    }As of right now the code require a person to enter the name of a player and then scans the log file to determine the appropriate counts for that player. If I want to scan the file for multiple players how would I be able to do that without having to run the program over and over. The reason being that sometimes the logs have over 15 different players and I'd hate to have to run the program 15 times to get each players stats. Any suggestions? Would I have to make a linked list?

    Yes, the log file looks something like that. Here is a small 15 line version of what the log file actually looks like:
    Kazzandar's stab misses Icingdeath. -=0=-
    Arien's slash >>> ANNIHILATES <<< Icingdeath! -=118=-
    Arien's slash >>> ANNIHILATES <<< Icingdeath! -=112=-
    Arien's slash <<< ERADICATES >>> Icingdeath! -=158=-
    Parrish utters the words, 'yjrr pzar'.
    Arien rescues Shargaas!
    Kazzandar's counterattack does UNSPEAKABLE things to Icingdeath! -=636=-
    Icingdeath's claw does UNSPEAKABLE things to Arien! -=760=-
    Arien's fireball scratches Icingdeath. -=4=-
    Arien's lightning bolt grazes Icingdeath. -=7=-
    Arien's counterattack -- DESSICATES -- Icingdeath! -=540=-
    Icingdeath's claw COMPLETELY TRASHES Arien! -=802=-
    Arien is DEAD!
    Kitiara's fireball grazes Icingdeath. -=5=-
    Kitiara's lightning bolt grazes Icingdeath. -=8=-
    Almost always the player name is first but sometimes the "mob" name (In this case Icingdeath) comes out. I don't mind if Icingdeath is referenced as a player and included in the stats, not that big a deal. Thanks for the idea on the HashMap I'll looking into how it works. Since this is my first Java program I often find myself lost at where to begin.
    I changed "got toasted by" to "is DEAD!" since it's easier to read. I also changed the majority of the main code into a method for the player class. The main code looks like this now:
    public static void main (String[] args) throws Exception
              Player player1 = new Player("Shargaas");
              player1.scanLogForStats("TeilmonRun.txt");
              player1.printStats();
         I was hoping this would make it easier, anyway, thanks again and I'll definitely be looking into HashMap.

  • In List, How to modify the Link in Quick Edit Mode?

    In List, How to modify the Edit in Quic Mode Link? Instead of opening Quick view mode, to open in InfoPath customized form?

    Hi Eugene,
    According to your description, my understanding is that you want to midify the link of "Edit" and set it linking to a InfoPath Form which can bulk edit your List.
    You can use the code above to modify the Edit's hyperlink and set it linking to your InfoPath form.
    <script src="http://code.jquery.com/jquery-1.10.2.min.js" type="text/javascript"></script>
    <script type="text/javascript">
    $(document).ready(function () {
    $("#idHomePageNewItem").next("a").attr("href","the URL of your InfoPath form");
    $("#idHomePageNewItem").next("a").removeAttr("onclick");
    </script>
    For more information about bulk updating a SharePoint list using InfoPath form, you can have a look at the blog:
    https://social.msdn.microsoft.com/Forums/sharepoint/en-US/c05983fc-d992-49ff-8d18-fa8f70777d66/using-infopath-2010-to-bulk-update-a-sharepoint-list?forum=sharepointcustomizationprevious
    http://infopath.wordpress.com/2013/09/23/infopath-repeating-table-add-edit-delete-sharepoint-list-items-bulk/
    http://sharepointknowledgebase.blogspot.com/2011/10/updating-sharepoint-list-by-using.html#.VGFsKHkcSM8
    If any misunstanding, please feel free reminding me and provide more detail for your issue.
    Best Regards,
    Eric
    Eric Tao
    TechNet Community Support

  • How do you change the font in WPC Link List Header ...

    Does any one know how/where to change the font in Web Page Composer on the Link List Header?  I am using the Link List header delivered with the product. 
    It looks like it is pulling arial font but we are adding content in a different font in the paragraphs and want the fonts to be the same.  Is there something I can change in the theme?
    thanks
    Angie.

    You need to go to the
    Content Adminstration/KM Content/etc/wpceditor/css/runtime  and look in the sdn_general.css file.  The controls are all there.  You can rename or create a new style sheet as this will modify all WPC sites.

  • How does this Linked List work?

    Hi.
    I wonder how this linked list work
    import java.util.Scanner;
    public class LinkedList {
        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            Elem front = null;    // First element of list.
            Elem back  = null;    // Last element of list.
            while (in.hasNext()) {
                String word = in.next();
                Elem e = new Elem();     // Create a new list element.
                e.data = word;           // Set the data field.
                if (front == null) {
                    front = e;            // Back element will be set below.
                } else {
                    back.next = e;       // Link last elem to new element.
                back = e;           
            System.out.println("*** Print words in order of entry");
            Elem curr = front;
            while (curr != null) {
                System.out.println(curr.data);
                curr = curr.next;
    class Elem {
        public Elem next;    // Link to next element in the list.
        public String data;  // Reference to the data.
    }Does anyone know how this allocates memory?
    I feel strange because it's just front = e
    and back = e
    but it never says anything like front.next = back or something..
    Can anyone help me on this?

    Does anyone know how this allocates memory?Memory is allocated on this line:            Elem e = new Elem();     // Create a new list element.
    I feel strange because it's just front = e
    and back = e
    but it never says anything like front.next = back or something..Well, it doesn't need to. Setting .next is taken care of after the initial element is added. It never explicitly says front.next = back because front.next is set when the second element is added. It's set implicitly, on this line:                back.next = e;       // Link last elem to new element.It's implicit in that at that point front and back point to the same element.

  • How to concatenate two linked lists?

    Can anyone help me with this? I'm stuck. I'm trying to concatenate two linked lists. I've created a method that adds a node to the beginning of a list and a second method to concatenate. My first method works, but not my second...
    First method:
    public static Node insertFirst(Node head, Node node){
              Node newNode = new Node();          // declare and initialize newNode.
              newNode = node;                    // store the new item in the new node.
              newNode.link = head;               // newNode.link points to the head.
              head = newNode;                    // update head to be newNode.
              return head;
         }Here is where I have my problem:
    public static Node mergeTwoLists(Node a, Node b){
              Node heada = a;
              Node headb = b;
              if(heada == null)
                   return headb;                    //if heada is null then returns list headb.
              else if(headb == null)
                   return heada;                    //if headb is null then returns list heada.
              else if(heada == null && headb == null)     //if both lists are null, returns null.
                   return null;
              else if(heada.link == null){     //only one element in heada.
                   headb = insertFirst(b, a);               // inserts the element in heada into headb.
                   return headb;
              }//end else if(heada.link == null).
              else if(headb.link == null){     //only one element in headb.
                   heada = insertFirst(a,b);               // inserts the element in headb into heada.
                   else {
                        mergeTwoLists(heada.link, headb);
                        return heada;
                   }//end else
              return heada;
              }//end mergeTwoLists method.I think in this method I'm only adding the nodes if there is only one node in one of the lists. But if there are more than one element in a list...I'm confused as to how to code the last else statement that contains the recursive call.
    Can someone help?
    Thanks
    aiki985

    Can't you just point the tail of A to the head of B?
    I don't think I'd do this recursivly at all. Use a
    while look to find the last node in A and then link
    it to whatever the first element in B is.
    while(A.next != null){
    A = A.next;
    A.next = B;
    Java that up a bit and check for nulls and it should
    work.o.k. thanks...let me try that. It does seem awkward recursively...
    aiki985

  • How to use circular linked list in pl/sql?

    Hi all,
    how to use the circular linked list on pl/sql programming.
    thanks in advance
    Rgds,
    B@L@

    d balamurugan wrote:
    Hi,
    I needed this concept for the below example
    TABLE_A have the columns of
    ID COL_1 COL_2 COL_3 COL_4 COL_5 COL_6 COL_7
    1....Y.........N........N.........Y........ N........N........ N
    2....N.........N....... N.........Y.........N........N.........Y
    in the above data
    for id 1 i will need to take the value for COL_4, then i will check the next availability of Y through out through out the remaining columns, so next availability is on COL_1 so, i need to consider COL_4 which already Y and also i need to consider COL_5, COL_6, COL_7 as Y.
    for id 2 if i need COL_7 then i need to come back on circular way and need to check the next availability of Y and need to take the columns having N before the next availability of YAnd... even after all that description... you haven't given any indication of what the output should look like.
    Taking a wild guess on my part... something like this would do what you appear to be asking...
    SQL> ed
    Wrote file afiedt.buf
      1  with t as (select 1 as id, 'Y' as col1, 'N' as col2, 'N' as col3, 'Y' as col4, 'N' as col5, 'N' as col6,'N' as col7 from dual union all
      2             select 2, 'N', 'N', 'N', 'Y', 'N', 'N', 'Y' from dual)
      3  --
      4  -- END OF TEST DATA
      5  --
      6  select id
      7        ,rcol
      8        ,case when instr(cols,'Y',rcol+1) = 0 then instr(cols,'Y')
      9              else instr(cols,'Y',rcol+1)
    10         end as next_Y_col
    11  from   (select id, rcol, col1||col2||col3||col4||col5||col6||col7 as cols
    12          from t, (select &required_col as rcol from dual)
    13          where id = &required_id
    14*        )
    SQL> /
    Enter value for required_col: 4
    old  12:         from t, (select &required_col as rcol from dual)
    new  12:         from t, (select 4 as rcol from dual)
    Enter value for required_id: 1
    old  13:         where id = &required_id
    new  13:         where id = 1
            ID       RCOL NEXT_Y_COL
             1          4          1
    SQL> /
    Enter value for required_col: 7
    old  12:         from t, (select &required_col as rcol from dual)
    new  12:         from t, (select 7 as rcol from dual)
    Enter value for required_id: 2
    old  13:         where id = &required_id
    new  13:         where id = 2
            ID       RCOL NEXT_Y_COL
             2          7          4
    SQL>If that's not what you want... then it's time you started learning how to ask questions properly.

  • How is Define Links on Confirmation Page-link list key linked to iviews?

    Hi All,
    Although there is no ESS in MSS as such in our new portal (hompage framework), we have configured it as much as we could, so that it was similar to the previous ESS in MSS.  We have used a copy of the ESS address iview for the ESS in MSS emergency contact.
    The trouble is that the links on the confirmation page are trying to resolve to ESS rather than resloving to an option in MSS.  E.G. the Go to Address Overview link is trying to resolve to the address overview screen in ESS rather than MSS.
    I have  checked the parameters on the view and there does't appear to be anywhere that you can assign the lnk list key.  Similarly I have checked the resources and the services parameters and have nowhere to put this key.
    So my question is, how exactly is the link list key attached to an iview? In our case the iviews are in 2 different PCD's so how can I create a zlink list key and assign it to the copied address iview?
    Many thanks,
    Liz.

    The confirmation links are defined in V_T7XSSSERLNK - as far as I can see they are linked to services not iviews
    defined in HpF
    Also "ESS in MSS" is available as "Self-Service for My Employee" in MSS Related Activities for certain SAP releases
    Best wishes
    Stuart

  • How to make a linked list?

    I've seen how to implement a linked list in oracle ? but it's not what I'm interested in.
    First of all, it is just a curiosity, no serious task behind it. I think I've almost made a linked list (of chars) type, however it misses the notion of empty list and thus I virtually cannot construct it.
    create or replace type LString as object
      head Char,
      tail ref LString,
      member function cons(
        p_x Char)
        return LString
    create or replace type body LString is
      member function cons(
        p_x Char)
        return LString
      is
        xs LString;
      begin
        xs := LString(head => p_x, tail => self.tail);
        return xs;
      end;
    end;I need to be able to make empty list to construct other lists, for example:
    empty_lstring.cons('H').cons('i').cons('!')
    How can I do it?
    Edited by: 922141 on 12.07.2012 7:02

    I need to be able to make empty list to construct other lists, for example:
    empty_lstring.cons('H').cons('i').cons('!')
    Why ? Can you mention one procedural language who can do this? I can't! Can you?
    Sybrand Bakker
    Senior Oracle DBA

Maybe you are looking for

  • G/L Account Balance RFSLD00

    If anybody has worked on this program, I just wanted to know in the LD, SDF, what is SKC1A is doing and how it is derived from GLDB and what is GLDB? Thanks

  • 10.6.1 Server - cannot prevent authenticated users from creating a blog

    I have a brand new Snow Leopard (10.6.1) 2.26 Ghz quad core Xserve with 12Gb RAM that will be used for web collaboration services. I've currently set up Wiki and Blog services with a group membership to allow creating wikis/blogs. The reason for this

  • Output proposed  from customer master

    Hello SDN! I could not find output info in customer master. Can I check with you if output can be proposed from the customer master when creating a sales order? Or the only way output is determined is from output determination procedure where custome

  • The songs i purchased once are no longer in my library

    I had to reinstall itunes one time, and the songs i had in my account at that point are no longer there. is there anyway to get them back?

  • 10.6.4: refresh Finder window?????

    I find this unbelievable, but I can't find a way to refresh a Finder window... any suggestions? thank you..