Appeal No. 2002-2237 Page 6
Application No. 09/336,046
nodes[,] and the particular method of linking of Holtz provides a
compact structure which is quickly searched when implemented in
an [sic] content addressable memory improving the versatility of
the DP system."
Appellants assert (brief, page 2) that the present invention
presents a scheme for a linked list that is different in
several respects from a traditional linked list. Each entry
includes a pointer. However, instead of pointing to a next
entry, the pointer points to a previous entry. To access a next
entry, a search is done to determine which entry contains a
pointer to the current entry. The entry that contains a pointer
to the current entry is the next entry. Appellants argue (brief,
pages 5 and 6) that in Holtz, the existence of a pointer within a
valid entry is not sufficient identification of the valid entry
as being uniquely the next entry. Appellants argue (brief, page
6) that claim 1 requires a content addressable memory that
includes at least a portion of a second entry, and that the
memory is searched for a reference to a first entry in the linked
list. The reference functions as a pointer from the second entry
to the first entry. It is argued (id.) that this feature is not
taught or suggested by Holtz because in Holtz, to find a next
entry, it is necessary to match a gate (e.g., the letter "R") and
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007