Methods and systems involving browser nodes
First Claim
Patent Images
1. A method comprising:
- creating a first node with a processor;
determining whether an indicator associated with a head node is present; and
designating the first node as a head node by defining and associating a head node identifier with the first node, defining a link from the first node to the first node, wherein the link defines a data flow path from the first node to the first node, and creating and saving, in a memory device, an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present, wherein the link from the first node to the first node is saved in a linked list table of a memory, wherein the linked list table includes the link that defines the data flow path from the first node to the first node.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
13 Claims
-
1. A method comprising:
-
creating a first node with a processor; determining whether an indicator associated with a head node is present; and designating the first node as a head node by defining and associating a head node identifier with the first node, defining a link from the first node to the first node, wherein the link defines a data flow path from the first node to the first node, and creating and saving, in a memory device, an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present, wherein the link from the first node to the first node is saved in a linked list table of a memory, wherein the linked list table includes the link that defines the data flow path from the first node to the first node. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method comprising:
-
closing a first node with a processor; removing the first node from a linked list table stored in a memory device; 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; 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, the defining including defining a link from the second node to the second node, the link defining a data flow path from the first node to the first node, wherein the linked list table includes the link that defines the data flow path from the second node to the second node. - View Dependent Claims (9, 10, 11, 12, 13)
-
Specification