Need help with creating a linked list

I need to create a linked list that i can put numbers or an operator into
class Number_or_op
boolean flag;
double number;
char operator;
Number_or_op(boolean flag1,double number1,char operator1)
flag = flag1;
number = number1;
operator = operator1;
class Expr {
Number_or_op first;
Expr rest;
Expr(Number_or_op first1,Expr rest1)
first = first1;
rest = rest1;
how do i make a linked list out of this? im trying
Expr list1 = new Expr(3, new Expr('*' , new Expr(4 , null)));
but keep getting an error D:\Documentation\expr.java:14: internal error; cannot instantiate Expr.<init> at Expr to ()
how do i fix the number_or_op so it can make it into a list?

Let me reitterate my problem because i am so lost...
I am used to making linked list using an integers only.. and now my teacher wants me to use both integers and chars, the chars being operators..
I have no idea how to do that using hte code he provided because it makes no sense at all to me
class Number_or_op
boolean flag;
double number;
char operator;
Number_or_op(boolean flag1,double number1,char operator1)
flag = flag1;
number = number1;
operator = operator1;
class Expr {
Number_or_op first;
Expr rest;
Expr(Number_or_op first1,Expr rest1)
first = first1;
rest = rest1;
I need to make a list that looks like 1 + 3 / 4 each operator or number needs a different node.. i just cant think of how to do it and keep getting an error message everytime i do saying:
File: D:\Documentation\expr.java [line: 14]
Error: D:\Documentation\expr.java:14: internal error; cannot instantiate Expr.<init> at Expr to ()
I just dont know what to do

Similar Messages

  • Need help on creating a linked list with array...

    I want to create a linked listed using array method. Any suggestion on how would I start it.
    thanks

    That means I want to implement linked list using an
    array.I believe you mean you want to implement list using an array. Linked list is a very different implementation of a list, which can be combined with arrays for a niche implementation of list, but I don't think this is what you're talking about.
    Do you mind if we ask why you don't want to use ArrayList? It does exactly what you specify, plus it will increase the size of the internal array as necessary to ensure it can store the required elements.
    If you really want to make your own, have a look at the source for ArrayList (in src.jar in your JDK installation folder) - it will answer any questions you have. If you don't understand any of the code, feel free to post the relevant code here and ask for clarification.

  • Need help with creating invoice and list of invoices

    Hello everybody,
    I need to create Credit / Debit memo invoices and for this I try to use FM GN_INVOICE_CREATE in my Z program, please let me know if it is correct way to go?
    As well I need to create list of Credit / Debit memo invoices, how to achieve this?
    Thanks in advance.
    Usefull answers will be awarded.
    Regards, M.

    You can use RV_INVOICE_CREATE for credit memo and debit memo
    list of credit and debit memo - use this FM - RV_INVOICE_LIST_CREATE
    see the below sample code
    refresh: XKOMFK, XKOMV,
               XTHEAD, XVBFS,
               XVBPA,  XVBRK,
               XVBRP,  XVBSS.
      clear  : XKOMFK, XKOMV,
               XTHEAD, XVBFS,
               XVBPA,  XVBRK,
               XVBRP,  XVBSS,
               VBSK_I.
      VBSK_I-SMART = 'F'.
      XKOMFK-VBELN =  v_deliv.
      XKOMFK-VBTYP = 'J'.
      APPEND XKOMFK.
      CALL FUNCTION 'RV_INVOICE_CREATE'
           EXPORTING
                VBSK_I       = VBSK_I
                WITH_POSTING = 'C'
           TABLES
                XKOMFK       = XKOMFK
                XKOMV        = XKOMV
                XTHEAD       = XTHEAD
                XVBFS        = XVBFS
                XVBPA        = XVBPA
                XVBRK        = XVBRK
                XVBRP        = XVBRP
                XVBSS        = XVBSS.
      if sy-subrc eq 0.
        COMMIT WORK.
       flag = 'X'.
      else.
      message i011 with p_vbeln.
      endif.
    Reward Points if it is helpful
    Thanks
    Seshu

  • I need Help with the dynamic link feature in CS3

    Hi I was wondering if anyone could help me with an issue I am having? I have the adobe cs3 master collection. Having watched tutorials on the dynamic link feature my version seems not to have the same options as those I have viewed. I wish to send my premiere video creation to encore using dynamic link, however when I click "file" and then "adobe dynamic link" the only options available are about "adobe after effects". I can export to encore however I am only alloowed to export one premiere sequence to one new encore file, I cannot create an encore file and import several premiere sequence into the same encore project. That means currently I can only have an encore creation with one premiere sequence in it, and I have no adobe dynamic link. Any help anyone could offer would be greatly appreciated.

    Thanks very much for that guys but my premiere media encoder only lets me export as: MPEG1, MPEG1-VCD, MPEG2, MPEG2 blu-ray, MPEG2-DVD, MPEG2-SVCD, H.264, H.264 blu-ray, Adobe Flash Video, Quicktime, Real Media, Windows Media. Are any of these formats DV AVI?
    Am I to export my videos direct to encore or save them elsewhere (e.g desktop). It seems that I cannot export sequences from different premiere projects to the same encore project.
    Sorry if any of these questions seem obvious, I am just new to premiere and keen to do things right from the off.
    Many thanks again guys.
    Date: Tue, 24 Nov 2009 19:32:47 -0700
    From: [email protected]
    To: [email protected]
    Subject: I need Help with the dynamic link feature in CS3
    Harm is correct.  For SD DVD, exporting as a DV AVI file from Pr will give you good results.  Encore's Automatic Transcoding will give you maximum quality for the available disc space.
    -Jeff
    >

  • I need help with Creating Key Pairs

    Hello,
    I need help with Creating Key Pairs, I generate key pais with aba provider, but the keys generated are not base 64.
    the class is :
    import java.io.*;
    import java.math.BigInteger;
    import java.security.*;
    import java.security.spec.*;
    import java.security.interfaces.*;
    import javax.crypto.*;
    import javax.crypto.spec.*;
    import au.net.aba.crypto.provider.ABAProvider;
    class CreateKeyPairs {
    private static KeyPair keyPair;
    private static KeyPairGenerator pairGenerator;
    private static PrivateKey privateKey;
    private static PublicKey publicKey;
    public static void main(String[] args) throws Exception {
    if (args.length != 2) {
    System.out.println("Usage: java CreateKeyParis public_key_file_name privete_key_file_name");
    return;
    createKeys();
    saveKey(args[0],publicKey);
    saveKey(args[1],privateKey);
    private static void createKeys() throws Exception {
    Security.addProvider(new ABAProvider());
    pairGenerator = KeyPairGenerator.getInstance("RSA","ABA");
    pairGenerator.initialize(1024, new SecureRandom());
    keyPair = pairGenerator.generateKeyPair();
    privateKey = keyPair.getPrivate();
    publicKey = keyPair.getPublic();
    private synchronized static void saveKey(String filename,PrivateKey key) throws Exception {
    ObjectOutputStream out= new ObjectOutputStream(new FileOutputStream(filename));
    out.writeObject(key);
    out.close();
    private synchronized static void saveKey(String filename,PublicKey key) throws Exception {
    ObjectOutputStream out= new ObjectOutputStream( new FileOutputStream(filename));
    out.writeObject(key);
    out.close();
    the public key is:
    �� sr com.sun.rsajca.JSA_RSAPublicKeyrC��� xr com.sun.rsajca.JS_PublicKey~5< ~��% L thePublicKeyt Lcom/sun/rsasign/p;xpsr com.sun.rsasign.anm����9�[ [ at [B[ bq ~ xr com.sun.rsasign.p��(!g�� L at Ljava/lang/String;[ bt [Ljava/lang/String;xr com.sun.rsasign.c�"dyU�|  xpt Javaur [Ljava.lang.String;��V��{G  xp   q ~ ur [B���T�  xp   ��ccR}o���[!#I����lo������
    ����^"`8�|���Z>������&
    d ����"B��
    ^5���a����jw9�����D���D�)�*3/h��7�|��I�d�$�4f�8_�|���yuq ~
    How i can generated the key pairs in base 64 or binary????
    Thanxs for help me
    Luis Navarro Nu�ez
    Santiago.
    Chile.
    South America.

    I don't use ABA but BouncyCastle
    this could help you :
    try
    java.security.Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());
    java.security.KeyPairGenerator kg = java.security.KeyPairGenerator.getInstance("RSA","BC");
    java.security.KeyPair kp = kg.generateKeyPair();
    java.security.Key pub = kp.getPublic();
    java.security.Key pri = kp.getPrivate();
    System.out.println("pub: " + pub);
    System.out.println("pri: " + pri);
    byte[] pub_e = pub.getEncoded();
    byte[] pri_e = pri.getEncoded();
    java.io.PrintWriter o;
    java.io.DataInputStream i;
    java.io.File f;
    o = new java.io.PrintWriter(new java.io.FileOutputStream("d:/pub64"));
    o.println(new sun.misc.BASE64Encoder().encode(pub_e));
    o.close();
    o = new java.io.PrintWriter(new java.io.FileOutputStream("d:/pri64"));
    o.println(new sun.misc.BASE64Encoder().encode(pri_e));
    o.close();
    java.io.BufferedReader br = new java.io.BufferedReader(new java.io.FileReader("d:/pub64"));
    StringBuffer keyBase64 = new StringBuffer();
    String line = br.readLine ();
    while(line != null)
    keyBase64.append (line);
    line = br.readLine ();
    byte [] pubBytes = new sun.misc.BASE64Decoder().decodeBuffer(keyBase64.toString ());
    br = new java.io.BufferedReader(new java.io.FileReader("d:/pri64"));
    keyBase64 = new StringBuffer();
    line = br.readLine ();
    while(line != null)
    keyBase64.append (line);
    line = br.readLine ();
    byte [] priBytes = new sun.misc.BASE64Decoder().decodeBuffer(keyBase64.toString ());
    java.security.KeyFactory kf = java.security.KeyFactory.getInstance("RSA","BC");
    java.security.Key pubKey = kf.generatePublic(new java.security.spec.X509EncodedKeySpec(pubBytes));
    System.out.println("pub: " + pubKey);
    java.security.Key priKey = kf.generatePrivate(new java.security.spec.PKCS8EncodedKeySpec(priBytes));
    System.out.println("pri: " + priKey);
    catch(Exception e)
    e.printStackTrace ();
    }

  • I need help with creating PDF with Preview...

    Hello
    I need help with creating PDF documetns with Preview. Just a few days ago, I was able to create PDF files composed of scanned images (notes) and everything worked perfectly fine. However, today I was having trouble with it. I scanned my notebook and saved 8 images/pages in jpeg format. I did the usual routine with Preview (select all files>print>PDF>save as PDF>then save). Well this worked a few days ago, but when I tried it today, I was able to save it, but the after opening the PDF file that I have saved, only the first page was there. The other pages weren't included. I really don't see anything wrong with what I'm doing. I really need help. Any help would be greatly appreciated.

    I can't find it.  I went into advanced and then document processing but no batch sequence is there and everything is grayed out.
    EDIT: I realized that you cant do batch sequences in standard.  Any other ideas?

  • Need help with creating a brush

    Hi guys,
    I wanted to ask for help with creating a brush (even a link to a tutorial will be goon enough ).
    I got this sample:
    I've created a brush from it, and i'm trying to get this kind of result:
    but it's only duplicates it and gives me this result:
    Can someone help me please understand what i need to define in order to make the brush behave like a continues brush instead of duplicate it?
    Thank you very much
    shlomit

    what you need to do is make a brush that looks like the tip of a brush. photoshop has several already but you can make your own that will be better.
    get a paintbrush and paint a spot kind of like what you did but dont paint a stroke. make it look kindof grungy. then make your brush from that, making sure to desaturate it and everything.
    EDIT:
    oh, and if you bring the fill down to like 10-20% your stroke will look better

  • I need help with creating some formulas

    I'm not sure if anyone around here can help me, but I'm trying to create a Numbers document and need some help with creating a formula/function.
    I have a column of amounts and I would like to create a formula which deducts a percentage (11.9%) and puts the result in another column.
    If anyone can help me, it would be greatly appreciated.

    Here is an example that shows one way to do this:
    The original data is in column A.  In column B we will store formulas to adjust the amounts:
    1) select the cell where you want to formula (in this case cell B2)
    2) Type the "=" (equal sign):
    3) click cell A2:
    4) now type the rest of the formula which is: "*(100-11.9)/100"  that is asterisk, then open parenthesis, 100 minus eleven point nine close parenthesis forward slash  one hundred
    The Asterisk is the multiply operator  (times) and the forward slash is the division operator (divide)
    now hit return.  select cell B2 and hover the cursor over the bottom edge of the cell:
    drag the little yellow dot down to "fill" the formula down as needed.

  • Need help with creating text anchors with tagged text.

    Can anyone tell me how to determine the correct value for a "Hyperlink Dest Index" value?
    I have a script which creates a tagged text file that specifies about about 280 pages of tables (thank heavens for autoflow) , and would like to add live links between different parts. I can create a text anchor and a hyperlink to it in InDesign. The tagged text definition for the link source is simple and in-line and exports and imports nicely as tagged text. However, I see that all the link destinations, aka  text anchors, are all exported at the very end of the tagged text files as global definitions, and thier location iin the document is specified by the property HyperlinkDestIndex. However, I can't figure out how to set this value progammatically. I've spent over an hour exporting links, and it sure isn't anything as obvious as character index in the story.
    Any advice appreciated,
      Read Roberts

    Read, I'm not sure the following is going to help you. It works for external hyperlinks, but you want internal links, right? Anyway, it might give you some clues.
    A funny thing: I was reviewing some script where I got links to work, and I spotted a tiny coding error. Links seemed to be defined by two separate identifiers: a "link name", which is what appears in Edit Hyperlink dialog, and a "Dest Key", which seems to be a simple increasing number. However, due to aformentioned coding error, the dest keys between the actual link and its definition were off by '1', so there was no way that ought to have matched. But it still worked! So "Dest Key" is a red herring ...
    As far as I understand, it works like this (for hyperlinks): in your text, you have
    HplName -- this is actually the 'title' that appears in the Hyperlink palette
    HplDest -- this is the 'internal name'
    DestKey. Hm. Perhaps you could omit this, per above obsvn.
    CharStyleRef, the name of the auto-applied style
    Hid -- seems to be always '0'
    HplOff: the "offset" from this entire command to the start of the hyperlink, in InDesign characters.
    HplLen: the "length" from the hyperlinked text, in InDesign characters.
    and in the list of 'proper' definitions, those that appear at the very end of your file:
    HplDestDfn -- the internal name again
    DestKey -- see above
    HplDestUrl -- finally! A real URL! (But you must escape lots of characters, such as the forward slash and colon.)
    Hid -- again, always seems to be '0'.
    Some of these items are perhaps optional, but experimenting with what may be left out only lead to frustration The Tagged Text guide is far from complete, as I'm sure you already knew.
    As noted, some (or all) of the named items need a backslash escape for a few characters, but I can't find a definitive way to determine in advance what is 'good' and what is 'not good'.
    The following script creates a Tagged Text file with a couple of working hyperlinks in it -- I don't know if this is of any help for your internal links.
    var hyperlinkDest = [];
    var text = "This is some text with a link [http://www.jongware.com/idjshelp.html] and another one [http://forums.adobe.com/thread/1014617?tstart=0] in it.";
    var tagtext = text.replace (/\[(.+?)\]/g, function (full, match)
                        return makelink (match, 'title:'+match, match, match);
    // When done processing plain text, add the destinations at the end:
    tagtext += hyperlinkDest.join('');
    tagFile = File(Folder.myDocuments+'/__tmp.txt');
    if (tagFile.open('w') == false)
              alert ("Unable to create temporary file!");
              exit();
    if (File.fs == "Windows")
              tagFile.write ("<ASCII-WIN>\n");
    else
              tagFile.write ("<ASCII-MAC>\n");
    tagFile.write ("<dcs:HYPERLINK=<cu:1>>\n");
              tagFile.write (tagtext);
    tagFile.close();
    // 'text' is the actual text that will be clickable
    // 'title' is what will appear in the Hyperlinks palette
    // 'name' is the internal name in the Edit Hyperlink dialog
    // 'url' is the actual URL that will be linked to
    function makelink (text, title, name, url)
              var destkey = hyperlinkDest.length;
              // In URL you must escape forward slashes and colons
              // .. and some other characters as well, by the way. There seems to be no list
              url = url.replace(/\//g, '\\/').replace(/:/g, '\\:');
              hyperlinkDest.push ('<HplDestDfn:=<HplDestName:'+name+'><DestKey:'+String(destkey)+'><HplDestUrl:'+url+'><Hid:0>>');
              return '<Hpl:=<HplName:'+title+'><HplDest:'+name+'><DestKey:'+String(destkey)+'><CharStyleRef:HYPERLINK><Hid:0><Brdrv:0><HplOff:0><HplLen:'+String(text.length)+'>>'+text;

  • Need help with creating template. Changes are not going through to index.html page

    Hi all,
    I have an issue with my template that I am creating and also a question about creating template Regions (Repeating and Editable).
    Somehow my changes to my index.dwt are not changing my index.html page.
    Also my other question is: For my top navigation bar and left navigation bar links, do I need to select and define each individual button or link as Repeating/Editable Region? or can I just select the whole navigation bar (the one on the top) etc...
    Below are my steps for creating my template...I am kinda fairly new to using DW and this is my first attempt to making a template following the DW tutorial CD that came with DW CS3.
    I appreciate any help with this...regards, Dano
    -Open my index.html file
    -File/save as template
    -Save
    -update links - yes
    -Select Repeating and Editable Regions (I selected the whole top navigation bar and selected Repeating Region and Editable Region, same with the left side navigation links)
    -File close all
    -Open the index.dwt
    -Save as and selected the index.html and chose to overide it..
    When I make changes to my index.dwt it is not changing the index.html
    I feel that I am missing some important steps here.....
    Website address
    www.defenseproshop.com

    Figured out

  • Help with creating a price list

    I'm just wondering if anybody could possibly help me when creating a price list?. I'm new to SAP so don't have a great knowledge of it.
    Our company needs to send out a wholesale price list to customers, however some of the items we stock do not include vat, when the price list is previewed it doesnt show which items include vat or exclusive of vat. this information could do with being visible to make it clearer to the customers.
    Is there anyway the priclist could be exported to microsoft excel etc for editing?
    many thanks.

    go to inventory--prce lists-Price List.
    double click on the price list you want.
    It will open the new window showing Items with prices.
    Click on the Excel icon on menu bar on the top.
    save file as .xls.

  • 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!

  • Need help with ouput of a list or array of numbers input from user

    I'm only a few weeks into learning java, so this may seem simple to some, but...
    I am trying to write a program that will receive numbers from a user,
    and then list, add, average those numbers. I've got the program to
    work except for listing the numbers that were input.
    Can someone help guide me????
    i've left the code I've tried in as comments.
    Enter an integer value, the program exits if the input is 0:
    20
    Enter an integer value, the program exits if the input is 0:
    40
    Enter an integer value, the program exits if the input is 0:
    60
    Enter an integer value, the program exits if the input is 0:
    80
    Enter an integer value, the program exits if the input is 0:
    0
    Total numbers entered: 4
    The array of numbers is: 0 0 0 0
    The sum is 200
    The average is 50
    The maximum number is 0
    The minimum is 0
    Here is my code:
    * Title:        Reads integers and finds the total, average, maximum of the input values
    * Description:
    * Copyright:    Copyright (c) 2002
    * Company:      Duke Court.
    * @author Mary Davenport
    * @version 1.0
    public class part3page6
      public static void main(String[] args)
      int data = 0;
      int sum = 0;
      int countnum = -1;
      int maximum = 0;
      int minimum = 0;
      int average = (countnum - 1);
      do
          System.out.println("Enter an integer value, " +
            " the program exits if the input is 0:  ");
          data = MyInput.readInt();
          sum += data;
          countnum++;
        } while (data != 0);
          //in order to figure the max & the min it appears that the
        //program will need to utilize arrays to store the individual numbers
        //that are input from the user.
        //create an array of the input data
        int[] number = new int[countnum];
        //creat a list of the input data
        int []myList = {data};
        //lists how many numbers entered
        System.out.println("Total numbers entered:  " + number.length);
        //list array of numbers -- this is giving me [I@3179c3,
        //instead of 20, 40, 60, 80 when I use "new int[countnum]"
    //     System.out.print("The array of numbers is: "
    //      + new int[countnum]);
        //list array of numbers:  this is giving me " 0 0 0 0 "
           //instead of 20, 40, 60, 80  with the following for statement
           // (number[i] + " ")
        System.out.print("The array of numbers is: ");
          for(int i=0; i<number.length; i++)
            System.out.print(number[i] + "  ");
      //list mylist of numbers from input, 20, 40, 60, 80
      //output is The list of numbers is: [I@3179c3
    //  System.out.print("The list of numbers is: " + myList);
        System.out.println();
        System.out.println("The sum is " +  sum);
        average = sum/countnum;
        System.out.println("The average is " + average);
        System.out.println("The maximum number is " +  maximum);
        System.out.println("The minimum is " +  minimum);

    When you input the data you need to save it to the array. Currently you are not saving the value you are just adding it
    ArrayList nums = new ArrayList();
       do
           System.out.println("Enter an integer value, " +
             " the program exits if the input is 0:  ");
           data = MyInput.readInt();
    nums.add(new Integer(data));
           sum += data;
           countnum++;
         } while (data != 0);

  • Need Help with creating Line Graph Chart

    I have the following XML Data
    <DATA>
    <PERCENT_ROW>
    <YEAR>2007</YEAR>
    <PERIOD>3</PERIOD>
    <MATERIAL_TYPE>C</MATERIAL_TYPE>
    <BRANCHDESC>Longview</BRANCHDESC>
    <LOCATION>30</LOCATION>
    <QUARTERDESC>Quarter 1</QUARTERDESC>
    <CURRPERIOD>Mar 2007</CURRPERIOD>
    <VALUECURRENTPERIOD>99.9</VALUECURRENTPERIOD>
    <QUARTERVALUE>100</QUARTERVALUE>
    <YTDVALUE>100</YTDVALUE>
    <STDCURRENTPERIOD>99.2</STDCURRENTPERIOD>
    <VARIANCE_STD>-.7</VARIANCE_STD>
    <VARIANCE_STD_PERCENT>-.7</VARIANCE_STD_PERCENT>
    <CURRENT_12MMA>99.97</CURRENT_12MMA>
    <PRIOR_12MMA>0</PRIOR_12MMA>
    <CURRPERSUB1>Feb 2007</CURRPERSUB1>
    <VALUECURRENTPERIODSUB1>100</VALUECURRENTPERIODSUB1>
    <CURRPERSUB2>Jan 2007</CURRPERSUB2>
    <VALUECURRENTPERIODSUB2>100</VALUECURRENTPERIODSUB2>
    <CURRPERSUB3>Dec 2006</CURRPERSUB3>
    <VALUECURRENTPERIODSUB3>0</VALUECURRENTPERIODSUB3>
    <CURRPERSUB4>Nov 2006</CURRPERSUB4>
    <VALUECURRENTPERIODSUB4>0</VALUECURRENTPERIODSUB4>
    <CURRPERSUB5>Oct 2006</CURRPERSUB5>
    <VALUECURRENTPERIODSUB5>0</VALUECURRENTPERIODSUB5>
    <CURRPERSUB6>Sep 2006</CURRPERSUB6>
    <VALUECURRENTPERIODSUB6>0</VALUECURRENTPERIODSUB6>
    <CURRPERSUB7>Aug 2006</CURRPERSUB7>
    <VALUECURRENTPERIODSUB7>0</VALUECURRENTPERIODSUB7>
    <CURRPERSUB8>Jul 2006</CURRPERSUB8>
    <VALUECURRENTPERIODSUB8>0</VALUECURRENTPERIODSUB8>
    <CURRPERSUB9>Jun 2006</CURRPERSUB9>
    <VALUECURRENTPERIODSUB9>0</VALUECURRENTPERIODSUB9>
    <CURRPERSUB10>May 2006</CURRPERSUB10>
    <VALUECURRENTPERIODSUB10>0</VALUECURRENTPERIODSUB10>
    <CURRPERSUB11>Apr 2006</CURRPERSUB11>
    <VALUECURRENTPERIODSUB11>0</VALUECURRENTPERIODSUB11>
    </PERCENT_ROW>
    <PERCENT_ROW>
    <YEAR>2007</YEAR>
    <PERIOD>3</PERIOD>
    <MATERIAL_TYPE>C</MATERIAL_TYPE>
    <BRANCHDESC>Oakland</BRANCHDESC>
    <LOCATION>31</LOCATION>
    <QUARTERDESC>Quarter 1</QUARTERDESC>
    <CURRPERIOD>Mar 2007</CURRPERIOD>
    <VALUECURRENTPERIOD>100</VALUECURRENTPERIOD>
    <QUARTERVALUE>100</QUARTERVALUE>
    <YTDVALUE>100</YTDVALUE>
    <STDCURRENTPERIOD>100</STDCURRENTPERIOD>
    <VARIANCE_STD>0</VARIANCE_STD>
    <VARIANCE_STD_PERCENT>0</VARIANCE_STD_PERCENT>
    <CURRENT_12MMA>100</CURRENT_12MMA>
    <PRIOR_12MMA>0</PRIOR_12MMA>
    <CURRPERSUB1>Feb 2007</CURRPERSUB1>
    <VALUECURRENTPERIODSUB1>100</VALUECURRENTPERIODSUB1>
    <CURRPERSUB2>Jan 2007</CURRPERSUB2>
    <VALUECURRENTPERIODSUB2>100</VALUECURRENTPERIODSUB2>
    <CURRPERSUB3>Dec 2006</CURRPERSUB3>
    <VALUECURRENTPERIODSUB3>0</VALUECURRENTPERIODSUB3>
    <CURRPERSUB4>Nov 2006</CURRPERSUB4>
    <VALUECURRENTPERIODSUB4>0</VALUECURRENTPERIODSUB4>
    <CURRPERSUB5>Oct 2006</CURRPERSUB5>
    <VALUECURRENTPERIODSUB5>0</VALUECURRENTPERIODSUB5>
    <CURRPERSUB6>Sep 2006</CURRPERSUB6>
    <VALUECURRENTPERIODSUB6>0</VALUECURRENTPERIODSUB6>
    <CURRPERSUB7>Aug 2006</CURRPERSUB7>
    <VALUECURRENTPERIODSUB7>0</VALUECURRENTPERIODSUB7>
    <CURRPERSUB8>Jul 2006</CURRPERSUB8>
    <VALUECURRENTPERIODSUB8>0</VALUECURRENTPERIODSUB8>
    <CURRPERSUB9>Jun 2006</CURRPERSUB9>
    <VALUECURRENTPERIODSUB9>0</VALUECURRENTPERIODSUB9>
    <CURRPERSUB10>May 2006</CURRPERSUB10>
    <VALUECURRENTPERIODSUB10>0</VALUECURRENTPERIODSUB10>
    <CURRPERSUB11>Apr 2006</CURRPERSUB11>
    <VALUECURRENTPERIODSUB11>0</VALUECURRENTPERIODSUB11>
    </PERCENT_ROW>
    <PERCENT_ROW>
    <YEAR>2007</YEAR>
    <PERIOD>3</PERIOD>
    <MATERIAL_TYPE>C</MATERIAL_TYPE>
    <BRANCHDESC>Seattle</BRANCHDESC>
    <LOCATION>32</LOCATION>
    <QUARTERDESC>Quarter 1</QUARTERDESC>
    <CURRPERIOD>Mar 2007</CURRPERIOD>
    <VALUECURRENTPERIOD>12.4</VALUECURRENTPERIOD>
    <QUARTERVALUE>18.7</QUARTERVALUE>
    <YTDVALUE>18.7</YTDVALUE>
    <STDCURRENTPERIOD>-2527.7</STDCURRENTPERIOD>
    <VARIANCE_STD>-2540.1</VARIANCE_STD>
    <VARIANCE_STD_PERCENT>100.5</VARIANCE_STD_PERCENT>
    <CURRENT_12MMA>18.7</CURRENT_12MMA>
    <PRIOR_12MMA>0</PRIOR_12MMA>
    <CURRPERSUB1>Feb 2007</CURRPERSUB1>
    <VALUECURRENTPERIODSUB1>37.2</VALUECURRENTPERIODSUB1>
    <CURRPERSUB2>Jan 2007</CURRPERSUB2>
    <VALUECURRENTPERIODSUB2>6.5</VALUECURRENTPERIODSUB2>
    <CURRPERSUB3>Dec 2006</CURRPERSUB3>
    <VALUECURRENTPERIODSUB3>0</VALUECURRENTPERIODSUB3>
    <CURRPERSUB4>Nov 2006</CURRPERSUB4>
    <VALUECURRENTPERIODSUB4>0</VALUECURRENTPERIODSUB4>
    <CURRPERSUB5>Oct 2006</CURRPERSUB5>
    <VALUECURRENTPERIODSUB5>0</VALUECURRENTPERIODSUB5>
    <CURRPERSUB6>Sep 2006</CURRPERSUB6>
    <VALUECURRENTPERIODSUB6>0</VALUECURRENTPERIODSUB6>
    <CURRPERSUB7>Aug 2006</CURRPERSUB7>
    <VALUECURRENTPERIODSUB7>0</VALUECURRENTPERIODSUB7>
    <CURRPERSUB8>Jul 2006</CURRPERSUB8>
    <VALUECURRENTPERIODSUB8>0</VALUECURRENTPERIODSUB8>
    <CURRPERSUB9>Jun 2006</CURRPERSUB9>
    <VALUECURRENTPERIODSUB9>0</VALUECURRENTPERIODSUB9>
    <CURRPERSUB10>May 2006</CURRPERSUB10>
    <VALUECURRENTPERIODSUB10>0</VALUECURRENTPERIODSUB10>
    <CURRPERSUB11>Apr 2006</CURRPERSUB11>
    <VALUECURRENTPERIODSUB11>0</VALUECURRENTPERIODSUB11>
    </PERCENT_ROW>
    <PERCENT_ROW>
    <YEAR>2007</YEAR>
    <PERIOD>3</PERIOD>
    <MATERIAL_TYPE>C</MATERIAL_TYPE>
    <BRANCHDESC>Yakima</BRANCHDESC>
    <LOCATION>33</LOCATION>
    <QUARTERDESC>Quarter 1</QUARTERDESC>
    <CURRPERIOD>Mar 2007</CURRPERIOD>
    <VALUECURRENTPERIOD>36.4</VALUECURRENTPERIOD>
    <QUARTERVALUE>68.2</QUARTERVALUE>
    <YTDVALUE>68.2</YTDVALUE>
    <STDCURRENTPERIOD>-5517.2</STDCURRENTPERIOD>
    <VARIANCE_STD>-5553.6</VARIANCE_STD>
    <VARIANCE_STD_PERCENT>100.7</VARIANCE_STD_PERCENT>
    <CURRENT_12MMA>68.17</CURRENT_12MMA>
    <PRIOR_12MMA>0</PRIOR_12MMA>
    <CURRPERSUB1>Feb 2007</CURRPERSUB1>
    <VALUECURRENTPERIODSUB1>68.6</VALUECURRENTPERIODSUB1>
    <CURRPERSUB2>Jan 2007</CURRPERSUB2>
    <VALUECURRENTPERIODSUB2>99.5</VALUECURRENTPERIODSUB2>
    <CURRPERSUB3>Dec 2006</CURRPERSUB3>
    <VALUECURRENTPERIODSUB3>0</VALUECURRENTPERIODSUB3>
    <CURRPERSUB4>Nov 2006</CURRPERSUB4>
    <VALUECURRENTPERIODSUB4>0</VALUECURRENTPERIODSUB4>
    <CURRPERSUB5>Oct 2006</CURRPERSUB5>
    <VALUECURRENTPERIODSUB5>0</VALUECURRENTPERIODSUB5>
    <CURRPERSUB6>Sep 2006</CURRPERSUB6>
    <VALUECURRENTPERIODSUB6>0</VALUECURRENTPERIODSUB6>
    <CURRPERSUB7>Aug 2006</CURRPERSUB7>
    <VALUECURRENTPERIODSUB7>0</VALUECURRENTPERIODSUB7>
    <CURRPERSUB8>Jul 2006</CURRPERSUB8>
    <VALUECURRENTPERIODSUB8>0</VALUECURRENTPERIODSUB8>
    <CURRPERSUB9>Jun 2006</CURRPERSUB9>
    <VALUECURRENTPERIODSUB9>0</VALUECURRENTPERIODSUB9>
    <CURRPERSUB10>May 2006</CURRPERSUB10>
    <VALUECURRENTPERIODSUB10>0</VALUECURRENTPERIODSUB10>
    <CURRPERSUB11>Apr 2006</CURRPERSUB11>
    <VALUECURRENTPERIODSUB11>0</VALUECURRENTPERIODSUB11>
    </PERCENT_ROW>
    <PERCENT_ROW>
    <YEAR>2007</YEAR>
    <PERIOD>3</PERIOD>
    <MATERIAL_TYPE>C</MATERIAL_TYPE>
    <BRANCHDESC>Twin Falls</BRANCHDESC>
    <LOCATION>34</LOCATION>
    <QUARTERDESC>Quarter 1</QUARTERDESC>
    <CURRPERIOD>Mar 2007</CURRPERIOD>
    <VALUECURRENTPERIOD>100</VALUECURRENTPERIOD>
    <QUARTERVALUE>99.8</QUARTERVALUE>
    <YTDVALUE>99.8</YTDVALUE>
    <STDCURRENTPERIOD>100</STDCURRENTPERIOD>
    <VARIANCE_STD>0</VARIANCE_STD>
    <VARIANCE_STD_PERCENT>0</VARIANCE_STD_PERCENT>
    <CURRENT_12MMA>99.8</CURRENT_12MMA>
    <PRIOR_12MMA>0</PRIOR_12MMA>
    <CURRPERSUB1>Feb 2007</CURRPERSUB1>
    <VALUECURRENTPERIODSUB1>99.4</VALUECURRENTPERIODSUB1>
    <CURRPERSUB2>Jan 2007</CURRPERSUB2>
    <VALUECURRENTPERIODSUB2>100</VALUECURRENTPERIODSUB2>
    <CURRPERSUB3>Dec 2006</CURRPERSUB3>
    <VALUECURRENTPERIODSUB3>0</VALUECURRENTPERIODSUB3>
    <CURRPERSUB4>Nov 2006</CURRPERSUB4>
    <VALUECURRENTPERIODSUB4>0</VALUECURRENTPERIODSUB4>
    <CURRPERSUB5>Oct 2006</CURRPERSUB5>
    <VALUECURRENTPERIODSUB5>0</VALUECURRENTPERIODSUB5>
    <CURRPERSUB6>Sep 2006</CURRPERSUB6>
    <VALUECURRENTPERIODSUB6>0</VALUECURRENTPERIODSUB6>
    <CURRPERSUB7>Aug 2006</CURRPERSUB7>
    <VALUECURRENTPERIODSUB7>0</VALUECURRENTPERIODSUB7>
    <CURRPERSUB8>Jul 2006</CURRPERSUB8>
    <VALUECURRENTPERIODSUB8>0</VALUECURRENTPERIODSUB8>
    <CURRPERSUB9>Jun 2006</CURRPERSUB9>
    <VALUECURRENTPERIODSUB9>0</VALUECURRENTPERIODSUB9>
    <CURRPERSUB10>May 2006</CURRPERSUB10>
    <VALUECURRENTPERIODSUB10>0</VALUECURRENTPERIODSUB10>
    <CURRPERSUB11>Apr 2006</CURRPERSUB11>
    <VALUECURRENTPERIODSUB11>0</VALUECURRENTPERIODSUB11>
    </PERCENT_ROW>
    <PERCENT_ROW>
    <YEAR>2007</YEAR>
    <PERIOD>3</PERIOD>
    <MATERIAL_TYPE>C</MATERIAL_TYPE>
    <BRANCHDESC>Spanish Fork</BRANCHDESC>
    <LOCATION>35</LOCATION>
    <QUARTERDESC>Quarter 1</QUARTERDESC>
    <CURRPERIOD>Mar 2007</CURRPERIOD>
    <VALUECURRENTPERIOD>7.7</VALUECURRENTPERIOD>
    <QUARTERVALUE>10.2</QUARTERVALUE>
    <YTDVALUE>10.2</YTDVALUE>
    <STDCURRENTPERIOD>-6016.2</STDCURRENTPERIOD>
    <VARIANCE_STD>-6023.9</VARIANCE_STD>
    <VARIANCE_STD_PERCENT>100.1</VARIANCE_STD_PERCENT>
    <CURRENT_12MMA>10.23</CURRENT_12MMA>
    <PRIOR_12MMA>0</PRIOR_12MMA>
    <CURRPERSUB1>Feb 2007</CURRPERSUB1>
    <VALUECURRENTPERIODSUB1>14.9</VALUECURRENTPERIODSUB1>
    <CURRPERSUB2>Jan 2007</CURRPERSUB2>
    <VALUECURRENTPERIODSUB2>8.1</VALUECURRENTPERIODSUB2>
    <CURRPERSUB3>Dec 2006</CURRPERSUB3>
    <VALUECURRENTPERIODSUB3>0</VALUECURRENTPERIODSUB3>
    <CURRPERSUB4>Nov 2006</CURRPERSUB4>
    <VALUECURRENTPERIODSUB4>0</VALUECURRENTPERIODSUB4>
    <CURRPERSUB5>Oct 2006</CURRPERSUB5>
    <VALUECURRENTPERIODSUB5>0</VALUECURRENTPERIODSUB5>
    <CURRPERSUB6>Sep 2006</CURRPERSUB6>
    <VALUECURRENTPERIODSUB6>0</VALUECURRENTPERIODSUB6>
    <CURRPERSUB7>Aug 2006</CURRPERSUB7>
    <VALUECURRENTPERIODSUB7>0</VALUECURRENTPERIODSUB7>
    <CURRPERSUB8>Jul 2006</CURRPERSUB8>
    <VALUECURRENTPERIODSUB8>0</VALUECURRENTPERIODSUB8>
    <CURRPERSUB9>Jun 2006</CURRPERSUB9>
    <VALUECURRENTPERIODSUB9>0</VALUECURRENTPERIODSUB9>
    <CURRPERSUB10>May 2006</CURRPERSUB10>
    <VALUECURRENTPERIODSUB10>0</VALUECURRENTPERIODSUB10>
    <CURRPERSUB11>Apr 2006</CURRPERSUB11>
    <VALUECURRENTPERIODSUB11>0</VALUECURRENTPERIODSUB11>
    </PERCENT_ROW>
    </DATA>
    Note that each Branch_Desc has 12 periods called CURRPERIOD,CURPERSUB1,CURPERSUB2 ...... and 12 values for those periods as VALUECURRENTPERIOD, VALUECURRENTPERIODSUB1, VALUECURRENTPERIODSUB2......
    I need to create a Line Graph for each Branch for the 12 periods as defined above where VALUECURRENTPERIOD, VALUECURRENTPERIODSUB1 etc. are the values for that period. The current BIPublisher Chart tool only allows one Value and One Label. In my case I have 12 VALUES (VALUECURRENTPERIOD etc.) and 12 LABELS (CURRPERIOD, CURPERSUB1 etc.). The SERIES or LEGEND should be the Branch Desc . So what I am looking for is to plot values(12 values) for 6 branches (so six lines) over a period of time (12 periods).

    Hi Tim,
    We have this XML data calculated from several tables where the layout was in the format of One account(a Branch in this case) and 12 periodic values for the same . So reformatting the XML is not going to be easy as the source data is like this itself. I tried un-pivioting the table (as this one is already pivoted) but it looks like Oracle doesn't support this feature yet, but is suported in DB2 or SQL. Please take a look at this link
    http://blogs.ittoolbox.com/database/technology/archives/unpivot-query-12798?close=true
    So I am stuck with the data in this format and users want a line graph for each branch over he period of time. May be somone on this forum can figure out how to un-pivot a table in Oracle. Thanks for your help in advance.

  • Need help with CRM billing due list error!

    Hi Experts,
    I created a sales order which got split into 3 deliveries and upon pgi looks like 2 of the deliveries when to the incomplete billing due list with an error "Billing due list item for transaction ****** is blocked by user R3USER" . I see only delivery made it to the billing due list. Has anyone seen this error before if yes can you get me some incite on this pelase.
    Appreciate your response. Thanks in advance!
    Regards,
    Div.

    Hi Divya,
    first thing you can go to SM13 to see the reason for the update terminate. If you think the info provided there is something technical then you resort for an abapers help. Before that if you want analyse in another way why its happening take that invoice number which throws update terminate. Go to VF01 and try to do the invoice individually. Please check if it gives any error log and you may get more info.
    regards
    sadhu kishore

Maybe you are looking for

  • ORA-01722: invalid number error when trying to pass a list of values

    Gurus We are using a function like so The usage for the function below is Select fn_st_bb_nm_uc ('1232131312, 123213312') from dual; SQL> / Select fn_st_bb_nm_uc ('1232131312, 123213312') from dual ERROR at line 1: ORA-01722: invalid number It's givi

  • Lost system sounds, then all sound gone even after installing a Live! 24-bit ca

    I'm having a migraine over a computer at work. It has Windows Xp Pro installed as the OS, and originally had an integrated sound card. At some point, before I was even hired in, the system sounds stopped playing. The BIOS for the machine showed that

  • Can't turn off music sharing

    Here's a strange quasi-problem. I recently noticed that my computer is sharing my entire iTunes library, whether I want it to or not! If I have sharing turned on then two librarys are available for people to connect to, and if I turn it off on librar

  • Procedure to switch Primary into Standby database

    Hi group, I have been asked to write a document describing a procedure to put a standby database as a primary database ((1)primary -> (2)standby) to ((1)failed db - (2)primary), and after their testing switch them again to the first state ((1)primary

  • IPS Event Viewer Losing Connection to 4215

    With no certain regularity, I am losing updates to IEV (v. 5.2(1) from my 4215 (v. 5.1(1). When I check Device Status from IEV, I get: ct-sensorApp.335 not responding, please check system processes - The connect to the specified Io::ClientPipe failed