Patent application number | Description | Published |
20100325083 | SKIP LIST GENERATION - A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria. | 12-23-2010 |
20120011166 | SKIP LIST GENERATION - A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria. | 01-12-2012 |
20120136871 | SKIP LIST GENERATION - A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria. | 05-31-2012 |
20120268794 | CURVE VECTORIZATION WITH PRESERVED TANGENTS AT ENDPOINTS - A method of vectoring a curve having an endpoint and a tangent associated with the curve at the endpoint. The method determines a first point on the curve following the endpoint where a perpendicular distance between a first linear segment, joining the first point and the endpoint, and the curve, does not exceed a tolerance. A second point on the tangent is then determined for which a perpendicular distance from the first segment to the second point does not exceed the tolerance. The curve is then vectorized by a path formed of a plurality of linear segments, the plurality of linear segments comprising at least a second segment joining the endpoint and the second point, and a third segment joining the second point to the first point. | 10-25-2012 |