Methods and Systems Involving Browser Nodes

• US 20110072398A1
• Filed: 09/21/2009
• Published: 03/24/2011
• Est. Priority Date: 09/21/2009
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Grant, Shayne, Liu, Pu, Cocuzza, Anthony M.
• Granted Patent: US 9,021,401 B2
• Time in Patent Office: Days
• US Class Current: 715/853
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/95 Retrieval from the web

Abstract

A method comprises creating a first node, determining whether an indicator associated with a head node is present, and designating the first node as a head node, defining and associating a head node identifier with the first node, define a link from the first node to the first node, and create and save an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present.

Claims

1. A method comprising:

creating a first node;

determining whether an indicator associated with a head node is present; and

designating the first node as a head node, defining and associating a head node identifier with the first node, defining a link from the first node to the first node, and creating and saving an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present.

2. The method of claim 1, wherein the method further comprises responsive to determining that the indicator associated with a head node is present:

retrieving a handle of the head node, changing a link of a node linked to the head node to link to the first node, defining a link from the first node to the head node, and defining and saving an identifier of the first node.

3. The method of claim 2, wherein the method further comprises:

requesting state data from the head node; and

updating state data in the first node.

4. The method of claim 1, wherein the link from the first node to the first node is saved in a linked list table of a memory.

5. The method of claim 1, wherein the first node is a browser window.

6. The method of claim 1, wherein the indicator is a cookie.

7. The method of claim 1, wherein the link from the first node to the first node is a pointer operative to define a data flow path.

8. A computer program product for linking nodes in a browser, the computer program product comprising a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for implementing the method of claim 1.

9. A method comprising:

determining whether a first node has received event data from a second node;

identifying a node linked to the first node in a linked list table in a memory;

sending the event data from the first node to the identified node linked to the first node responsive to receiving the event data from the second node.

10. The method of claim 9, wherein the method further comprises:

determining whether the first node has generated event data;

identifying a node linked to the first node in a linked list table in the memory;

sending the event data from the first node to the identified node linked to the first node responsive to generating the event data.

11. The method of claim 9, wherein the linked list table includes a link entry, wherein the link entry is a pointer from the second node to the first node.

12. A computer program product for node communication in a browser, the computer program product comprising a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for implementing the method of claim 9.

13. A method comprising:

closing a first node;

removing the first node from a linked list table;

determining whether the closed node is a head node;

determining whether the head node is the last sequential node in the linked list table responsive to determining that the closed node is the head node; and

designating a second node as the head node responsive to determining that the closed node is the head node.

14. The method of claim 13, wherein the method further comprises:

identifying a second node linked to the first node in the linked list table; and

changing a link associated with the second node to link the second node to a next sequential node in the linked list table responsive to determining that the closed node is not the head node.

15. The method of claim 13, wherein the method further comprises deleting an indicator associated with the head node responsive to determining that the closed node is the head node and that the head node is not the last sequential node in the linked list table.

16. The method of claim 13, wherein the method further comprises defining and associating a head node identifier with the second node responsive to determining that the closed node is the head node and that the head node is not the last sequential node in the linked list table.

17. The method of claim 16, wherein the method further comprises sending a handle of the second node to linked nodes.

18. The method of claim 17, wherein the method further comprises saving state data in the second node.

19. A computer program product for linking nodes in a browser, the computer program product comprising a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for implementing the method of claim 13.

20. The method of claim 13, wherein the link from the first node to the first node is a pointer operative to define a data flow path.