Unbounded list processing

• US 10,296,655 B2
• Filed: 06/24/2016
• Issued: 05/21/2019
• Est. Priority Date: 06/24/2016
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Connolly, Robert J., Hudson, Michael J.
• Primary Examiner(s): Chbouki, Tarek
• Application Number:
  US15/191,903
• Publication Number:
  US 20170371977A1
• Time in Patent Office: 1,061 Days
• CPC Class Codes: G06F 16/34 Browsing; Visualisation therefor
• CPC Class Codes: G06F 16/84 Mapping; Conversion

Abstract

A computer-implemented method includes receiving, from a first network application, a first unbounded list of objects of a first type and a second unbounded list of objects of a second type, wherein the second type is distinct from the first type, and producing a third unbounded list of objects of a third type, wherein the third type is distinct from both the first type and the second type. The computer-implemented method further includes providing the third unbounded list to a second network application. A corresponding computer program product and computer system are also disclosed.

Claims

1. A computer-implemented method comprising:

receiving, from a first network application, a first unbounded list of objects of a first type and a second unbounded list of objects of a second type, wherein said second type is distinct from said first type;

producing a third unbounded list of objects of a third type, wherein said third type is distinct from both said first type and said second type, and wherein said third unbounded list is populated through a process including;

applying a merging function to said first unbounded list and said second unbounded list to yield said third unbounded list;

splitting said third unbounded list into a first intermediate unbounded list and a second intermediate unbounded list;

associating said first unbounded list with said first intermediate unbounded list;

associating said second unbounded list with said second intermediate unbounded list;

associating said first intermediate unbounded list and said second intermediate unbounded list with said third type;

iterating over said first unbounded list, transforming each element thereof into an element of said first intermediate unbounded list; and

iterating over said second unbounded list, transforming each element thereof into an element of said second intermediate unbounded list; and

combining said first intermediate unbounded list with said second intermediate unbounded list to yield a populated instance of said third unbounded list; and

providing said third unbounded list to a second network application by streaming data of said third unbounded list sequentially into a handler instantiated by the second network application.

2. The computer-implemented method of claim 1, further comprising providing an application programming interface, wherein said first unbounded list and said second unbounded list are inputs to said application programming interface, and wherein said third type is an output of said application programming interface.

3. The computer-implemented method of claim 1, further comprising:

determining a merging algorithm based on said first type and said second type.

4. The computer-implemented method of claim 1, further comprising:

receiving one or more rules; and

applying said one or more rules to said first unbounded list and said second unbounded list to yield said third unbounded list.

5. The computer-implemented method of claim 1, further comprising:

receiving said merging function, said merging function including a program function including arguments comprising the first unbounded list of objects of the first type and the second unbounded list of objects of the second type.

6. The computer-implemented method of claim 1, wherein said third type is generic to both said first type and said second type.

7. A computer program product comprising one or more computer readable storage media and program instructions stored on said one or more computer readable storage media, said program instructions comprising instructions to:

receive, from a first network application, a first unbounded list of objects of a first type and a second unbounded list of objects of a second type, wherein said second type is distinct from said first type;

produce a third unbounded list of objects of a third type, wherein said third type is distinct from both said first type and said second type, and wherein said third unbounded list is populated through a process including;

apply a merging function to said first unbounded list and said second unbounded list to yield said third unbounded list;

split said third unbounded list into a first intermediate unbounded list and a second intermediate unbounded list;

associate said first unbounded list with said first intermediate unbounded list;

associate said second unbounded list with said second intermediate unbounded list;

associate said first intermediate unbounded list and said second intermediate unbounded list with said third type;

iterate over said first unbounded list, transforming each element thereof into an element of said first intermediate unbounded list; and

iterate over said second unbounded list, transforming each element thereof into an element of said second intermediate unbounded list; and

combine said first intermediate unbounded list with said second intermediate unbounded list to yield a populated instance of said third unbounded list; and

provide said third unbounded list to a second network application by streaming data of said third unbounded list sequentially into a handler instantiated by the second network application.

8. The computer program product of claim 7, wherein said program instructions further comprise instructions to provide an application programming interface, wherein said first unbounded list and said second unbounded list are inputs to said application programming interface, and wherein said third type is an output of said application programming interface.

9. The computer program product of claim 7, wherein said program instructions further comprise instructions to:

determine a merging algorithm based on said first type and said second type.

10. The computer program product of claim 7, wherein said program instructions further comprise instructions to:

receive one or more rules; and

apply said one or more rules to said first unbounded list and said second unbounded list to yield said third unbounded list.

11. The computer program product of claim 7, wherein said program instructions further comprise instructions to:

receive said merging function, said merging function including a program function including arguments comprising the first unbounded list of objects of the first type and the second unbounded list of objects of the second type.

12. The computer program product of claim 7, wherein said third type is generic to both said first type and said second type.

13. A computer system comprising:

one or more processors;

one or more computer readable storage media;

computer program instructions;

said computer program instructions being stored on said one or more computer readable storage media;

said computer program instructions comprising instructions to;

receive, from a first network application, a first unbounded list of objects of a first type and a second unbounded list of objects of a second type, wherein said second type is distinct from said first type;

produce a third unbounded list of objects of a third type, wherein said third type is distinct from both said first type and said second type, and wherein said third unbounded list is populated through a process including;

apply a merging function to said first unbounded list and said second unbounded list to yield said third unbounded list;

split said third unbounded list into a first intermediate unbounded list and a second intermediate unbounded list;

associate said first unbounded list with said first intermediate unbounded list;

associate said second unbounded list with said second intermediate unbounded list;

associate said first intermediate unbounded list and said second intermediate unbounded list with said third type;

iterate over said first unbounded list, transforming each element thereof into an element of said first intermediate unbounded list; and

iterate over said second unbounded list, transforming each element thereof into an element of said second intermediate unbounded list; and

combine said first intermediate unbounded list with said second intermediate unbounded list to yield a populated instance of said third unbounded list; and

provide said third unbounded list to a second network application by streaming data of said third unbounded list sequentially into a handler instantiated by the second network application.

14. The computer system of claim 13, wherein said computer program instructions further comprise instructions to:

determine a merging algorithm based on said first type and said second type.

15. The computer system of claim 13, wherein said computer program instructions further comprise instructions to:

receive one or more rules; and

apply said one or more rules to said first unbounded list and said second unbounded list to yield said third unbounded list.

16. The computer system of claim 13, wherein said third type is generic to both said first type and said second type.

17. The computer system of claim 13, wherein said program instructions further comprise instructions to:

receive said merging function, said merging function including a program function including arguments comprising the first unbounded list of objects of the first type and the second unbounded list of objects of the second type.