Including Help in the Linked List Entries

Hi,
Can any one explain how to include Help text to the Linked List Entries like including normal help in the other APEX 2.2 items?
Thanks
Chitra

Hi santhosh
while you are creating the fieldcatalog there is a field called 'ROLLNAME' - Data element for F1 help.
If your F1 help is in reference to this data element you can specifiy it here so that it appears on the List viewer. Otherwise you have to create your own data element with the documentation and specify it here for it to appear.
In the Grid control, you can use events for triggering the same.
Hope this helps.
Reward points.
Regards
Meera

Similar Messages

  • After Delete in Linked list...unable to display the linked list

    Hi...i know that there is an implementation of the class Linked Link but i am required to show how the linked list works in this case for my project...please help...
    Yes..I tried to delete some objects in a linked list but after that i am not able to display the objects that were already in the linked list properly and instead it throws an NullPointerException.
    Below shows the relevant coding for deleting and listing the linked list...
    public Node remove(Comparator comparer) throws Exception {
         boolean found = false;
         Node prevnode = head;          //the node before the nextnode
         Node deletedNode = null;     //node deleted...
         //get next node and apply removal criteria
         for(Node nextnode = head.getNextNode(); nextnode != null; nextnode = nextnode.getNextNode()) {
              if(comparer.equals(nextnode)) {
                   found = true;
                   //remove the next node from the list and return it
                   prevnode.setNextNode(nextnode.getNextNode());
                   nextnode.setNextNode(null);
                   deletedNode = nextnode;
                   count = count - 1;
                   break;
         if (found) return deletedNode;
         else throw new Exception ("Not found !!!");
    public Object[] list() {
         //code to gather information into object array
         Node node;
         Object[] nodes = new Object[count];
         node = head.getNextNode();
         for (int i=0; i<count; i++) {
              nodes[i] = node.getInformation();  // this is the line that cause runtime error after deleting...but before deleting, it works without problem.
              node = node.getNextNode();
         return nodes;
    }Please help me in figuring out what went wrong with that line...so far i really can't see any problem with it but it still throws a NullPointerException
    Thanks

    OK -- I've had a cup and my systems are coming back on line...
    The problem looks to be the way that you are handling the pointer to the previous node in your deletion code. Essentially, that is not getting incremented along with the nextNode -- it is always pointing to head. So when you find the node to delete then the line
       prevnode.setNextNode(nextnode.getNextNode());will set the nextNode for head to be null in certain situations (like if you are removing the tail, for instance).
    Then when you try to print out the list, the first call you make is
    node = head.getNextNode();Which has been set to null, so you get an NPE when you try to access the information.
    Nothing like my favorite alkaloid to help things along on a Monday morning...
    - N

  • WPC - highlighting the link of the current page in the link list

    Hi,
    is there any way to highlight a link in my linklist if it's the link to the page i am currently visiting?
    That would make it possible for me to customize the link list form and change it into some kind of "tab"-list form where the current tab is highlighted.
    A solution via xsl would be fantastic.
    Thanks for your support.
    Sebastian

    You can submit ideas here - http://hendrix.mozilla.org/
    The [https://addons.mozilla.org/firefox/addon/3880/ Add Bookmark Here ²] extension does what you want.

  • Hi i need help with my linked list

    hello
    im having trouble with my list
    this is where i create the studentlinked list. within my constructor for my college.
    public class MyCollege {
         private int capacity;
         public MyCollege(){
              StudentLinkedList studentList = new StudentLinkedList();
         }now my problem is in my add student method
    here it is.
    at the end of the method where i add the student to the linked list (studentList.add(aStudent);)is my problem. it says that studentList cannot be resolved.
    i understand that it cant find studentList. but i am creating it.
    why isnt it working???????????????????
    public static void main(String[] args) {
              MyCollege mc1 = new MyCollege();
         public void addStudent(int i){
              try{
                   Student aStudent = new Student();
                   String name,studentNumber, programmeCode;
                   int yearBegan;
                   if(i < capacity){
                        // this defines the buffer that will hold the data to be input
                        BufferedReader theDataStream;
                        theDataStream = new BufferedReader(new InputStreamReader(System.in));
                        //enter the details of the student
                        System.out.println("Enter in the name of the student followed by their student number");
                        System.out.println("followed by the year they began in the college a and then the course code");
                        System.out.println(" hit enter after each one");
                        name = theDataStream.readLine();
                        studentNumber = theDataStream.readLine();
                        yearBegan = Integer.parseInt(theDataStream.readLine());
                        programmeCode = theDataStream.readLine();
                        aStudent.setName(name);
                        aStudent.setStudentNumber(studentNumber);
                        aStudent.setYearBegan(yearBegan);
                        aStudent.setProgrammeCode(programmeCode);
                        studentList.add(aStudent);
                   }//end if
              }//end try
              catch(IOException e) {
                   System.out.println(e.getMessage());
         }

    cheers got it striaght away
         private int capacity;
         private StudentLinkedList studentList;
         

  • Help abstract classes linked list

    I have a base abstract class Vegetable which is basically Node for a linkedlist
    The base class Vegetable has a few abstract methods Pumpkin, Carrot, Potato basically extends Vegetable
    Another class called VegetableCollection
    basically in VegetableCollection
    can this be done if the objects are different types eg Pumpkin, potato, Carrot?
    public void add(Vegetable addObject)
    head = new Vegetable(addObject);
    }

    I have a base abstract class Vegetable which is basically Node for a linkedlist
    The base class Vegetable has a few abstract methods Pumpkin, Carrot, PotatoYou probably wouldn't have abstract methods with those names. Abstract methods are methods that you will need to define in every subclass. And a subclass called Pumpkin probably won't have meaningful definitions for methods called Carrot and Potato.
    can this be done if the objects are different types eg Pumpkin, potato, Carrot?
    public void add(Vegetable addObject)
    head = new Vegetable(addObject);
    }Here is an example of "polymorphism" at work:
    import java.util.*;
    abstract class Vegetable
      public abstract void identify();
    class Carrot extends Vegetable
      public void identify()
        System.out.println("I'm a Carrot.");
    class Pumpkin extends Vegetable
      public void identify()
        System.out.println("I'm a Pumpkin.");
    public class Test
      public static void main(String args[])
        LinkedList<Vegetable> myVegetables = new LinkedList<Vegetable>();
        myVegetables.add(new Carrot());
        myVegetables.add(new Pumpkin());
        Iterator<Vegetable> i = myVegetables.iterator();
        Vegetable v = null;
        while(i.hasNext())
          v = i.next();
          v.identify();
    output:
    I'm a Carrot.
    I'm a Pumpkin.To get polymorphism to work, you need to:
    1) Define a base class with a method that you want in all the subclasses.
    2) Override the method in the subclasses so that it does what's necessary for that subclass.
    3) Store the subclass objects in a variable(or collection) whose type is the base class.
    4) Call the method on the base type variable. Then through the magic of polymorphism, java will examine the actual object stored in the base type variable to determine what subclass it is, and then java will call the version of the method in that subclass.
    As the previous poster mentioned, you need to define a class called Node, which has head, previous, and next members. Your Node class will also have a member variable called veggie, which will be of type Vegetable. Then you can assign a Carrot, Pumpkin, or Potato object to that member variable.
    I assume this is an exercise where you have to create your own linked list. Otherwise, you can use the linked lists provided by java, which are very easy to use.

  • Help PLEASE with linked list. Inserting a string in the middle of

    I'm trying to insert new strings to a linked list but it seem i cant never insert. the following code has the instructions. What i'm I not doing right? If i try to use the code, the new strings don't go through
    please help someone
    // This method should insert a new node containing the string newString immediately after the first
        // occurrence of the string aString in the list. If aString is not in the list, the method should add a node
        // containing newString to the tail of the list.
        public void insertAfter(String newString, String aString)
            StringLLNode newNode = new StringLLNode();
            newNode.setData(newString);
            //Check if HeadNode == aString
            if (headNode.getData().equalsIgnoreCase(aString))
                headNode = newNode;
            //rest of the nodes
            StringLLNode currNode = headNode;
            while(currNode != null)
                if (currNode.getData().equalsIgnoreCase(aString))
                        newNode.setNext(currNode);
                        //System.out.println("It went THROUGH");
                currNode = currNode.getNext();
            //Last Node
            if (currNode != null)
                newNode.setNext(headNode);
        }

    I have to agree with flounder, go grab a pen and paper and logically work thru the code snippet you posted.
    public void insertAfter(String newString, String aString)
            StringLLNode newNode = new StringLLNode();
            newNode.setData(newString);
            //Check if HeadNode == aString
            if (headNode.getData().equalsIgnoreCase(aString))
                headNode = newNode;
            //rest of the nodes
            StringLLNode currNode = headNode;
            while(currNode != null)
                if (currNode.getData().equalsIgnoreCase(aString))
                        newNode.setNext(currNode);
                        //System.out.println("It went THROUGH");
                currNode = currNode.getNext();
            //Last Node
            if (currNode != null)
                newNode.setNext(headNode);
    }Given a linked list [A-E] we have: A => B => C => D => E. Each Node is referencing the node to it's right, so A references B, D references E etc.
    For example take aString = "A" and newString = "AB". Your code suggests the following:
    1. Create new_node "AB"
    2. if head[A] equals aString[A], TRUE
    2.a head = new_ node
    Now the resulting linkedlist is the following:
    AB => Null
    what happened to the rest of the list?
    Now we go on to your updated example, we result in the following list:
    A => AB => Null
    hmm do you see a pattern here? when inserting a new node we are disregarding any reference to the tail of the list.
    Extending on that idea we have the following pseudo code
    1. if node to be inserted
    1.a new_node.next = list_tail
    1.b current_node.next = new_node
    A => B => C => D => E, where newnode=AA
    AA => B => C => D => E //using 1.a
    A => AA => B => C => D => E //using 1.b
    Mel

  • Help with Library link lists ..

    Hi ,
    I am working with Scott Mazur on a incorporating 8.1.7 in our code bace for our next product release. I am having problems with defining the library link list needed for builds. In the documentation it makes referance to $ORACLE_HOME/precomp/demo/proc which I cannot find. I have installed the 8.1.7 on 3 platforms (Solaris, AIX and NT ) and none of the system have this information. Can you please point me to where I may find some help in this area. We are in a critical path right now so I would appreciate any help you could give me. The sooner the better.
    Thank you for your time and help ,
    Cheryl Pollock
    Lockheed Martin Global Telecommunications .
    Formtek
    Pittsburgh office .
    (412) 937-4970
    null

    You actually shouldn't try to get the library link lists directly. Rather, you should use the $ORACLE_HOME/rdbms/demo/demo_rdbms.mk makefile like this:
    make -f $ORACLE_HOME/rdbms/demo/demo_rdbms.mk build EXE=yourexecutable OBJS="object list"
    where yourexecutable is the name for your executable and the OBJS= includes a quoted list of all your object and library files.
    null

  • Help needed in linked lists...

    I have been working on this computer assignment lately but I still don't understand linked lists yet..I did an assignment on array based implementation and now I am supposed to do the same thing in linked list implementation..
    I need help on how to change this into a linked list implementation..any help would be appreciated. Thank you..below is the code for the array based implementation..the only thing that needs change here is after where is says Array-based implementation of the ADT list.
    public class ListArrayBasedDriver {
      public static void main(String [] args) {
        ListArrayBased myGroceryList = new ListArrayBased();
        myGroceryList.add(1,"milk");
        myGroceryList.add(2,"eggs");
        myGroceryList.add(3,"butter");
        myGroceryList.add(4,"pecans");
        myGroceryList.add(5,"apples");
        myGroceryList.add(6,"bread");
        myGroceryList.add(7,"chicken");
        myGroceryList.add(8,"rice");
        myGroceryList.add(9,"red beans");
        myGroceryList.add(10,"sausage");
        myGroceryList.add(11,"flour");
        printList(myGroceryList); //print out original List
        System.out.print("numItems is now: " + myGroceryList.size() + "\n");
        System.out.println("adding juice for 5th item...");
        myGroceryList.add (5, (Object) "juice");  //add juice
        System.out.println("item 5 is: " + myGroceryList.get(5)); //get position 5
        printList(myGroceryList);
        System.out.print("numItems is now: " + myGroceryList.size() + "\n");
        System.out.println("removing juice...");
        myGroceryList.remove (5); //remove item at position 5
        printList(myGroceryList);
        System.out.print("numItems is now: " + myGroceryList.size() + "\n");
      public static void printList(ListArrayBased myList)
            //method prints a list, numbering the values,  e.g, "1.  milk" .... "5.  juice".... etc.
            int i;
            for(i=1; i <= myList.size(); i++)
                String tempString = new String((String)myList.get(i));
                System.out.println(i+" "+ tempString);
    // Array-based implementation of the ADT list.
    class ListArrayBased {
        private static final int MAX_LIST = 50;
        private Object items[];  // an array of list items
        private int numItems;  // number of items in list
        public ListArrayBased()
        // creates an empty list
             items = new Object[MAX_LIST];
             numItems = 0;
        }  // end default constructor
        public boolean isEmpty()
          return (numItems == 0);
        } // end isEmpty
        public int size()
           return numItems;
        }  // end size
        public void removeAll()
          // Creates a new array; marks old array for
          // garbage collection.
          items = new Object[MAX_LIST];
          numItems = 0;
        } // end removeAll
        public void add(int index, Object item) throws  ListIndexOutOfBoundsException
          if (numItems > MAX_LIST)
            throw new ListException("ListException on add");
        }  // end if
          if (index >= 1 && index <= numItems+1)
            // make room for new element by shifting all items at
            // positions >= index toward the end of the
            // list (no shift if index == numItems+1)
            for (int pos = numItems; pos >= index; pos--) {
              items[translate(pos+1)] = items[translate(pos)];
          } // end for
          // insert new item
          items[translate(index)] = item;
          numItems++;
          else
          {  // index out of range
            throw new ListIndexOutOfBoundsException(
             "ListIndexOutOfBoundsException on add");
          }  // end if
        } //end add
        public Object get(int index) throws ListIndexOutOfBoundsException
          if (index >= 1 && index <= numItems)
            return items[translate(index)];
          else 
          {  // index out of range
            throw new ListIndexOutOfBoundsException(
              "ListIndexOutOfBoundsException on get");
          }  // end if
        } // end get
        public void remove(int index) throws ListIndexOutOfBoundsException
          if (index >= 1 && index <= numItems)
            // delete item by shifting all items at
            // positions > index toward the beginning of the list
            // (no shift if index == size)
                for (int pos = index+1; pos <= size(); pos++) {
                    items[translate(pos-1)] = items[translate(pos)];
          }  // end for
          numItems--;    
          else
          {  // index out of range
            throw new ListIndexOutOfBoundsException("ListIndexOutOfBoundsException on remove");
          }  // end if
        } // end remove
        private int translate(int position) {
        return position - 1;
       } // end translate
    }  // end ListArrayBased
    class ListException extends RuntimeException
      public ListException(String s)
        super(s);
      }  // end constructor
    }  // end ListException
    class ListIndexOutOfBoundsException
                extends IndexOutOfBoundsException {
      public ListIndexOutOfBoundsException(String s) {
        super(s);
      }  // end constructor
    }  // end ListIndexOutOfBoundsException

    Could someone check for me if this will work and if it doesn't what I need to do to make it work..Thanks...
    public class ListArrayBasedDriver {
      public static void main(String [] args) {
        ListArrayBased myGroceryList = new ListArrayBased();
        myGroceryList.add(1,"milk");
        myGroceryList.add(2,"eggs");
        myGroceryList.add(3,"butter");
        myGroceryList.add(4,"pecans");
        myGroceryList.add(5,"apples");
        myGroceryList.add(6,"bread");
        myGroceryList.add(7,"chicken");
        myGroceryList.add(8,"rice");
        myGroceryList.add(9,"red beans");
        myGroceryList.add(10,"sausage");
        myGroceryList.add(11,"flour");
        printList(myGroceryList); //print out original List
        System.out.print("numItems is now: " + myGroceryList.size() + "\n");
        System.out.println("adding juice for 5th item...");
        myGroceryList.add (5, (Object) "juice");  //add juice
        System.out.println("item 5 is: " + myGroceryList.get(5)); //get position 5
        printList(myGroceryList);
        System.out.print("numItems is now: " + myGroceryList.size() + "\n");
        System.out.println("removing juice...");
        myGroceryList.remove (5); //remove item at position 5
        printList(myGroceryList);
        System.out.print("numItems is now: " + myGroceryList.size() + "\n");
      public static void printList(ListArrayBased myList)
            //method prints a list, numbering the values,  e.g, "1.  milk" .... "5.  juice".... etc.
            int i;
            for(i=1; i <= myList.size(); i++)
                String tempString = new String((String)myList.get(i));
                System.out.println(i+" "+ tempString);
    // Linked List-based implementation of the ADT list.
    class ListNode
         //class to represent one node in a list
         class ListNode
              //package access members; List can access these directly
              Object data;
              ListNode nextNode;
              //contructor creates a ListNode that refers to object
              ListNode( Object object)
                   this( object, null );
              } //end ListNode one-argument constructor
              //constructor creates ListNode that refers to
              // Object and to the next ListNode
              ListNode ( Object object, ListNode node)
                   data = object;
                   nextNode = node;
              // end ListNode two-argument contructor
              //return reference to data in node
              Object getObject()
                   return data; // return Object in this mode
              //return reference to next node in list
              ListNode getNext()
                   return nextNode; // get next node
              } // end method getNext
    } //end class ListNode
    //class List Definition
    public class List
         private ListNode firstNode;
         private ListNode lastNode;
         private String name; // string like " list " used in printing
         //contructor creates empty List with " list " as the name
         public List()
              this(" list ");
         } //end List no-arguement constructor
    //contructor creates an empty list with a name
    public List( String listName )
         name = listname;
         firstNode = lastNode = null;
    } //end List no-arguement contructor
    //insert Object at front of List
    public void insertAtFront ( object insertItem )
         if ( isEmpty() ) //firstNode and lastNode refer to same object
              firstNode = lastNode = newListNode( insertItem );
         else // firstNode refers to new node
              firstNode = new ListNode ( insertItem, firstNode );
    } // end method insertAtFront
    // insert Object at end of List
    public void insert AtBack ( Object insertItem )
         if ( isEmpty() ) //firstNode and lastNode refer to same object
              firstNode = new ListNode ( insertItem );
         else // firstNode refers to new node
         firstNode = new ListNode (insertItem, firstNode );
    } // end method insertAtFront
    // insert Object at end of List
    public void insertAtBack ( Object insertItem )
         if ( isEmpty() ) //firstNode and LastNode refer to same Object
              firstNode = lastNode = new ListNode ( insertItem );
         else // lastNode = lastNode.nextNode = new ListNode ( insertItem );
    } // end method insertAtBack
    //remove first node from List
    public Object removeFromFront() throws EmptyListException
         if( isEmpty() ) //throw exception if list is empty
         throw new EmptyListException( name );
         object removedItem = firstNode.data; //retrieve data being removed
    // update references firstNode and lastNode
    if (firstNode == lastNode )
         firstNode =lastNode = null;
    else
         firstNode = firstNode.nextNode;
         return removedItem; // return removed node data
    } //end method removeFromFront
    //remove last node from List
    Public Object removeFromBack() throws EmptyListException
         If ( isEmpty() ) // throw exception if list is empty
              throw new EmptyListException( name );
         Object removedItem = lastNode.data; // retrieve data being removed
         // update references firstNode and lastNode
         If ( firstNode == lastNode )
              firstNode = lastNode = null;
         else // locate new last node
              ListNode current = firstNode;
              // loop while current node does not refer to lastNode
              while ( current.nextNode != lastNode )
                   current = current.nextNode;
              lastNode = current; // current is new lastNode
              current.nextNode = null;
         } // end else
         return removedItem; // return removed node data
    } // end method removeFromBack
    // determine whether list is empty
    public boolean isEmpty()
         return firstNode == null; // return true if list is empty
    }     // end method isEmpty
    //output List contents
    public void print()
         if (isEmpty() )
              System.out.printf(�Empty %s\n�, name );
              return;
         System.out.printf(�The %s is: �, name );
         ListNode current = firstNode;
         //while (current != null )
              System.out,printf(�%s �, current.data );
              current = current.nextNode;
         } //end while
         System.out.println( �\n� );
    } //end method print
    } end class List

  • Network Magic v 5.5 I cannot access the online help from the links within NM

    When I try to access the online help from any link button in NM V5.5 including the main help > Help center > Network magic help, the browser will open and resolve address ,  Status bar will state done but I have a blank page.
    The URL in the address bar is
    http://go.purenetworks.com/redir/webhelp/nm/_cover.htm?pn=nm&a=5.5.9195.0&as=0&ad=2&bt=shp&b=Pure&dc=Pure0.LinksysRouterSetup&dt=OLN&k=1611759616&ct=cisco&ag=d9429c0fe2fd40b9&g=d04c74e28eb95300%2Cb2610a4f03b2f988&lcid=1033&ulcid=2057&am=99&it=upgrade
    I am running windows 7 Ultimate,  have tried 
    Firefox  3.6 and
    IE 8.0  -- I have put the Url into the trusted zone  and the web page will again show up as done and status bar shows trusted zone
    I have tried all this with my Firewall & AV (Kaspersky Internet Security 2010) both on and disabled
     NB  The "ask linskys link works" as does the "community forums"
    The Main help > Help center >Getting Started also works.
    ( I am running the WRT610N Router set up by Network Magic)
    Many Thanks

    I've seen this too use http://support.networkmagic.com
    Mikro the Owner of the Linksys BEFCMU10_V4-UG Modem & The BEFSR41v4 Router.

  • I need help with circular linked list

    Hi,
    I need help with my code. when I run it I only get the 3 showing and this is what Im supposed to ouput
    -> 9 -> 3 -> 7
    empty false
    9
    empty false
    3
    -> 7
    empty false
    Can someone take a look at it and tell me what I'm doing wrong. I could nto figure it out.
    Thanks.This is my code
    / A circular linked list class with a dummy tail
    public class CLL{
         CLLNode tail;
         public CLL( ){
              tail = new CLLNode(0,null); // node to be dummy tail
              tail.next = tail;
         public String toString( ){
         // fill this in. It should print in a format like
         // -> 3 -> 5 -> 7
    if(tail==null)return "( )";
    CLLNode temp = tail.next;
    String retval = "-> ";
         for(int i = 0; i < -999; i++)
    do{
    retval = (retval + temp.toString() + " ");
    temp = temp.next;
    }while(temp!=tail.next);
    retval+= "";}
    return retval;
         public boolean isEmpty( ){
         // fill in here
         if(tail.next == null)
              return true;
         else{
         return false;
         // insert Token tok at end of list. Old dummy becomes last real node
         // and new dummy created
         public void addAtTail(int num){
         // fill in here
         if (tail == null)
                   tail.data = num;
              else
                   CLLNode n = new CLLNode(num, null);
                   n.next = tail.next;
                   tail.next = n;
                   tail = n;
         public void addAtHead(int num){
         // fill in here
         if(tail == null)
              CLLNode l = new CLLNode(num, null);
              l.next = tail;
              tail =l;
         if(tail!=null)
              CLLNode l = new CLLNode(num, null);
              tail.next = l;
              l.next = tail;
              tail = l;
         public int removeHead( ){
         // fill in here
         int num;
         if(tail.next!= null)
              tail = tail.next.next;
              //removeHead(tail.next);
              tail.next.next = tail.next;
         return tail.next.data;
         public static void main(String args[ ]){
              CLL cll = new CLL ( );
              cll.addAtTail(9);
              cll.addAtTail(3);
              cll.addAtTail(7);
              System.out.println(cll);          
              System.out.println("empty " + cll.isEmpty( ));
              System.out.println(cll.removeHead( ));          
              System.out.println("empty " + cll.isEmpty( ));
              System.out.println(cll.removeHead( ));          
              System.out.println(cll);          
              System.out.println("empty " + cll.isEmpty( ));
    class CLLNode{
         int data;
         CLLNode next;
         public CLLNode(int dta, CLLNode nxt){
              data = dta;
              next = nxt;
    }

    I'm not going thru all the code to just "fix it for you". But I do see one glaringly obvious mistake:
    for(int i = 0; i < -999; i++)That says:
    1) Initialize i to 0
    2) while i is less than -999, do something
    Since it is initially 0, it will never enter that loop body.

  • Help make the reading list (safari) go away --FOR GOOD (not just unchecking preferences--that is not a solution)

    The READING LIST feature on safari is soo freakin annoying. Even after unchecking it in bookmark preferences, everytime I signin someplace, I still see it invisibly recording my information. The reading glasses icon isn't in my bookbar anymore, but I see a small puff go up in the left side of my screen. How can we make this stop? I even confirmed it's true, because AFTER turning it off under preferences, when I went back to turn it on just to check hours later, I was horrified that it still kept collecting information through sites I visited. This feature's invasive and irritating. Is there a way to terminate the reading list for good???

    You can turn off Reading List by clicking the reading glasses icon.

  • When I open an email, my computer won't go to the link listed, or when I am doing research the same thing, then I see a ALLOW in the upper right hand corner of the screen and I have to click on that. What happened and how do I fix this?

    Somehow my settings have changed. When I open an email and there is a link, my computer won't allow it, also when I am doing a search, my computer won't allow certain links to open.
    What I see is "ALLOW" in the upper right hand corner of the screen, and I have to click on that in order to continue my email or do a search. How did this suddenly happen and how do I change it back to being able to roam the Internet without having to click on ALLOW all the time?
    Also, I set up Google as my home page, but it won't list Email or any other options. I have to type in Google in the Google box, then Email appears. How do I get the right Google set up as my home page so I can access Email without jumping through hoops.
    Thanking you so much for your time and consideration.
    Sincerely,
    [email protected]

    Sign out of the iTunes Store. Sign in again.
    tt2

  • How can I know which link was clicked in the link list

    Hi everyone
    I'm using list of links in my page to display list of the files in some directory.
    How can I know which link user was clicked. There are some code:
    <%
    String dir = "..//files//";
    File fin = new File(dir);
    File files[]=fin.listFiles();
    for(int i=0;i<files.length;i++)
    File x = files;
    %>
    <%=x.getName()%><br>
    <%
    %>
    Please help

    You need to pass some data on the querystring to the page you are linking to.
    <a href="Main_Work.jsp?file=<%=x.getName()%>"><%=x.getName()%></a><br>
    This will send a parameter called "file" with the value of the file name that the user clicked.
    Now in Main_Work.jsp you can access this data as follows:
    <%
    String s = request.getParameter("file");
    File f = new File("..//files//"+s);
    %>

  • I need help reinstalling Adobe Photoshop Elements 12 and Premium Elements 12. I have opaid for these programs however my computer recently needed to be reset via recovery and they were erased, Any help? The link Adobe chat gave me download something-but t

    Help. Need to reinstall Adobe Photoshop Elements 12 and Premier Elements 12. Both are pre paid programs that I had on computer, however the system needed to be reset via recovery and these programs were erased> Since I already forked out the cash for these I'd like to be using them as I am an artist and need the programs. Please, any help? Ideas?

    You should try to keep the title short and sweet and put the details in the message... it's a mystery what happened regarding the download link, so here's some...
    PSE 10, 11, 12 - http://helpx.adobe.com/photoshop-elements/kb/photoshop-elements-10-11-downloads.html
    PE 10, 11, 12 - http://helpx.adobe.com/premiere-elements/kb/premiere-elements-10-11-downloads.html

  • Help with Stacked linked lists with nodes.

    I have 5 elements, { object1, object2, object3, object4, object5}; and I add then to the stack from object1 to object5 (from left to right). So the head node > object 5 > object 4 > object3> object2 > object1. (> represents points to.) So i made a method to get the nth element of the list in the order I input it to the list. The method is called ElementsAt(int i). But some reason, it always returns the last object in the list. I included my entire code because there may be something wrong somewhere else that maybe causing it.
    Note: There is also a list interface.
    public class MyList implements List {
         * The head node.
         private Node head;
         * The node it is currently reading
         private Node curr;
         * The previous node it has read.
         private Node prev;
         * A blank Node
         private Node blank;
         * The number of elements in the list
         private int numItems;
         * Default constructor
         public MyList() {
              numItems = 0;
              head = null;
         * Add an element in front of the list.
         * @param o The object to be added.
         public void addFront(Object o){
              if(head == null) {
                   head = new Node (o, null);
              else{
                   blank = new Node(o,null);
                   curr = head;
                   while (curr != null){
                        prev = curr;
                        curr = curr.getNext();
                   blank.setNext(curr);
                   prev.setNext(blank);
              numItems +=1;
         * Add an element in the back of the list.
         * @param o The object to be added.
         public void addBack(Object o){
              curr = head;
              if (head == null){
                   head = new Node(o ,null);
              else {
                   head = new Node(o, curr);
              numItems +=1;
         * Determine whether the list contains a certain object.
         * @param o The object it searches through the list to
         * see if it is present.
         * @ returns a boolean that describes whether object is
         * in the list.
         public boolean contains(Object o){
              boolean present = false;
              curr = head;
              while ((curr != null) && (present != true)){
                   present = (o.equals(curr.getElement()));
                   curr.setNext(curr.getNext());
              return present;
         /** Remove an object in the list if it is in the list.
         * @param o The object it wants to remove.
         public void remove(Object o){
              if(head ==null){
                   return ;
              if(head.getElement().equals(o)){
                   head = head.getNext();
                   numItems -=1;
              else{
                   prev = head;
                   curr = head.getNext();
                   while ((curr!=null) && (curr.getElement() !=o)){
                        prev = curr;
                        curr = curr.getNext();
                   if (curr!=null){
                        blank = curr.getNext();
                        prev.setNext(blank);
                        numItems-=1;
         /** Determine what object is at the nth place of the list.
         * @param i the nth place of the list
         * if the number is higher than the list, it is invalid.
         * @returns The element of the nth position of the list.
         public Object elementAt(int i){
              curr = head;
              Object blank = "";
              if ( i > numItems){
                   return null;
              else{
                   i = numItems - i;
                   for (int j=1; j<=i; j++){
                        if(curr!=null){
                             blank = curr.getElement();
                             curr = curr.getNext();
                   return blank;
         /** Determine the size of the list.
         * @returns The size of the list
         public int size() {
              return numItems ;
         /** Makes the list empty
         public void makeEmpty() {
              head = new Node(null,null);
              numItems = 0;
         /** Returns The list as a string.
         * @returns String containing all elemnts of the list.
         public String toString(){
              String sum = "";
              curr = head.getNext();
              blank = head;
              prev = head;
              if(curr==null){
                   prev.setNext(null);
                   curr=prev;
              while(curr != null)
                   if(curr.getNext() ==null){
                        sum += "\n" + curr.getElement();
                        curr.setNext(null);
                   if(curr.getNext()==null)
                        prev.setNext(null);
                        prev = blank;
                        curr = prev.getNext();
                   else{
                        curr = curr.getNext();
                        prev= prev.getNext();
              if (head.getElement() !=null)
              sum +="\n" + head.getElement();
              return sum;
    }this is the program i use to test it.
    public class MyListTester {
         public static void main (String [] args)
              List list = new MyList();
              String one = "Object One";
              String two = "Object Two";
              String three = "Object Three";
              int five = 5;
              list.addFront(one);
              list.addFront(two);
              list.addFront(three);
              list.addFront(five);
              System.out.println(list);
              System.out.println();
              System.out.println(list.size());
              System.out.println(list.elementAt(2));
                    //this should print out object Two, but doesn't
              System.out.println(list.elementAt(3));
                    //this should print out object Three, but doesn't
    }

    chuang7 wrote:
    So i made a method to get the nth element of the list in the order I input it to the list.
    * The node it is currently reading
    private Node curr;
    * The previous node it has read.
    These ('curr' and 'prev') should be local variables in the methods that need them, not instance variables.
    public void addFront(Object o)
    while (curr != null){
         prev = curr;
         curr = curr.getNext();
    blank.setNext(curr);At this point 'curr' is always null so this line is redundant.
    public void addBack(Object o)You can reduce this method to two lines of code.
    public boolean contains(Object o)
    curr.setNext(curr.getNext());You are modifying the list inside the contains method?
                   for (int j=1; j<=i; j++){Rethink this loop.
    public String toString()
         prev.setNext(null);
    if(curr.getNext() ==null)
         sum += "\n" + curr.getElement()+"->"+curr.getNext();
         curr.setNext(null);
    if(curr.getNext()==null)
         prev.setNext(null);
         prev = blank;
         curr = prev.getNext();You are modifying the list in the toString() method?

Maybe you are looking for

  • Tried to install  OS X on my external HD my computer crashed

    Tried to install  OS X  Disc 1 (which I believe was of 10.5 Leopard) on my external my computer crashed. I can't recover it. The hear the chim when it switches on but the screen is perminently white with no graphic or loading icon.  Here is what I di

  • Extending Validity Period In Assigned Appraisal Documents ???

    Dear Experts, Appraisal Documents is assigned to Employee via Appcreate, where we have provided some validity period and Execution period of Documents . Now requirement is to extend END Date of Validity and execution period . For Ex : Start date : 01

  • Roll back segments into READ-ONLY Mode

    To bring an v8 database into READ-ONLY Mode do we need to put the Roll back tablespace RBS also into READ-ONLY Mode?

  • House bank and Bank Account creation

    Hi All,         we need to migrate house bank and bank accounts from one system to another. Can anyone please lemme know if there is any bapi to create the same or any function module or a lsmw object for the same. Regards, GUrpreet Singh

  • Dynamic CSS

    Hi All, I hope this is simple, but what I would like to do is to include a css file, but have the FacesServlet do it's magic on it first. Let's say I have this line right now (which in fact, I do): <link rel="stylesheet" type="text/css" href="main.cs