Spooling strategies using structured job information
First Claim
1. A system comprising:
- a processing unit; and
memory accessible to the processing unit, the memory comprising;
a spooling module that consumes a data structure that specifies job information from a spool storage, wherein the data structure defines a plurality of nodes organized into a hierarchical arrangement representing different aspects of the job information, the plurality of nodes including at least two nodes that share at least one of a font resource or an image resource; and
a plurality of print tickets that are associated with the plurality of nodes of the data structure, the plurality of print tickets defining operations to be performed by filter logic with respect to the plurality of nodes of the data structure,wherein the spooling module merges the plurality of print tickets based on the plurality of nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
Spooling strategies are described for producing job information that conforms to a hierarchical structure, and then storing the job information in a spool storage. The job information is then retrieved from the spool storage and consumed. The structured job information includes a multi-level hierarchy of nodes, including a job level that represents the entire job, a document level that represents a document to be processed within the job; a rendition level that represents a rendition of the document to be processed; and a page level that represents a page associated with the rendition. In addition, filter logic processes job information based on capabilities of a target entity utilizing the job information.
-
Citations
22 Claims
-
1. A system comprising:
-
a processing unit; and memory accessible to the processing unit, the memory comprising; a spooling module that consumes a data structure that specifies job information from a spool storage, wherein the data structure defines a plurality of nodes organized into a hierarchical arrangement representing different aspects of the job information, the plurality of nodes including at least two nodes that share at least one of a font resource or an image resource; and a plurality of print tickets that are associated with the plurality of nodes of the data structure, the plurality of print tickets defining operations to be performed by filter logic with respect to the plurality of nodes of the data structure, wherein the spooling module merges the plurality of print tickets based on the plurality of nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. One or more computer-readable storage devices comprising instructions that, when executed by a processor, perform acts comprising:
-
consuming a data structure that specifies job information for a target device from a spool storage, wherein the data structure defines a plurality of nodes organized into a hierarchical arrangement representing different aspects of the job information, the plurality of nodes including at least two nodes that share at least one of a font resource or an image resource; generating a plurality of print tickets that are associated with the plurality of nodes of the data structure, the plurality of print tickets defining operations to be performed by filter logic with respect to the nodes of the data structure, and wherein the plurality of print tickets includes a first print ticket associated with a root node of the data structure and a second print ticket associated with a child node of the data structure; and merging the plurality of print tickets by moving up the hierarchical arrangement using a parent property of each node to the root node along an access path and then moving down the hierarchical arrangement to merge the plurality of print tickets. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. One or more computer-readable storage devices comprising instructions that, when executed by a processor, perform acts comprising:
-
consuming a data structure that specifies job information for a target device from a spool storage, wherein the data structure defines a plurality of nodes organized into a hierarchical arrangement representing different aspects of the job information, the plurality of nodes including at least two nodes that share at least one of a font resource or an image resource; generating a plurality of print tickets that are associated with the plurality of nodes of the data structure, the plurality of print tickets defining operations to be performed by filter logic with respect to the nodes of the data structure; and merging the plurality of print tickets by moving up the hierarchical arrangement using a parent property of each node to a root node along an access path and then moving down the hierarchical arrangement to merge the plurality of print tickets, wherein a first print ticket associated with a first node applies operations to the first node and child nodes of the first node, and wherein a second print ticket associated with a second node that is a child node of the first node applies operations only to the second node. - View Dependent Claims (19, 20, 21, 22)
-
Specification