Apparatus and methods of reconciling different versions of an ordered list

At least one processor configured to reconcile different versions of an ordered list, comprising:

• a first module for receiving a first version of an ordered list having a first plurality of ordered entries, wherein the first plurality of ordered entries have respectively associated order indexes, and for receiving a second version of the ordered list having a second plurality of ordered entries, wherein the second plurality of ordered entries have respectively associated order indexes;
• a second module for comparing, at a selected order index, respective ordered entries from the first and second versions of the ordered list;
• a third module for generating, based on the comparing, at least a portion of all possible current lists that reconcile the first and second versions of the ordered list;
• and
• a fourth module for accumulating, for each possible current list, a penalty when the comparing identifies a difference between the respective ordered entries;
• and
• a fifth module for selecting one of the possible current lists that has a lowest accumulated penalty among all the possible current lists, and for storing the selected one of the possible current lists as a current version of the ordered list;
• wherein the comparing, generating and accumulating are repeated for at least one further selected order index, and wherein said repeated generating produces at least one said possible current list completely.

A computer program product stored in a memory and configured to reconcile different versions of an ordered list, comprising:

• a non-transitory computer-readable storage medium comprising:
• a first set of codes for causing a computer to receive a first version of an ordered list having a first plurality of ordered entries, wherein the first plurality of ordered entries have respectively associated order indexes, and to receive a second version of the ordered list having a second plurality of ordered entries, wherein the second plurality of ordered entries have respectively associated order indexes;
• a second set of codes for causing the computer to compare, at a selected order index, respective ordered entries from the first and the second versions of the ordered list;
• a third set of codes for causing the computer to generate, based on the comparing, at least a portion of all possible current lists that reconcile the first and second versions of the ordered list;
• a fourth set of codes for causing the computer to accumulate, for each possible current list, a penalty when the comparing identifies a difference between the respective ordered entries;
• a fifth set of codes for causing the computer to select one of the possible current lists that has a lowest accumulated penalty among all the possible current lists, and for storing the selected one of the possible current lists as a current version of the ordered list;
• wherein the comparing, generating and accumulating are repeated for at least one further selected order index, and wherein said repeated generating produces at least one said possible current list completely.

An apparatus for reconciling different versions of an ordered list, comprising:

• means for receiving, at a computer, a first version of an ordered list having a first plurality of ordered entries, wherein the first plurality of ordered entries have respectively associated order indexes, and for receiving, at the computer, a second version of the ordered list having a second plurality of ordered entries, wherein the second plurality of ordered entries have respectively associated order indexes;
• means for comparing, at a selected order index, respective ordered entries from the first and second versions of the ordered list;
• means for generating, based on the comparing, at least a portion of all possible current lists that reconcile the first and second versions of the ordered list;
• means for accumulating, for each possible current list, a penalty when the comparing identifies a difference between the respective ordered entries;
• means for selecting one of the possible current lists that has a lowest accumulated penalty among all the possible current lists;
• and
• means for storing, at the computer, the selected one of the possible current lists as a current version of the ordered list;
• wherein the comparing, generating and accumulating are repeated for at least one further selected order index, and wherein said repeated generating produces at least one said possible current list completely.

A reconciler apparatus configured to reconcile different versions of an ordered list, comprising:

• an input for receiving a first version of an ordered list having a first plurality of ordered entries, wherein the first plurality of ordered entries have respectively associated order indexes, and to receive a second version of the ordered list having a second plurality of ordered entries, wherein the second plurality of ordered entries have respectively associated order indexes;
• a comparator coupled to said input and operable to compare, at a selected order index, respective ordered entries from the first and second versions of the ordered list;
• a list generator coupled to said comparator and operable to generate, based on the comparing, at least a portion of all possible current lists that reconcile the first and second versions of the ordered list;
• a penalty assignor coupled to said comparator and operable to accumulate, for each possible current list, a penalty when the comparing identifies a difference between the respective ordered entries;
• a selector coupled to said list generator and operable to select one of the possible current lists that has a lowest accumulated penalty among all the possible current lists;
• and
• a memory operable to store the selected one of the possible current lists as a current version of the ordered list;
• wherein the comparing, generating and accumulating are repeated for at least one further selected order index, and wherein said repeated generating produces at least one said possible current list completely.