https://github.com/otaviojava/sorted-streams

https://github.com/otaviojava/sorted-streams

Last synced: 8 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/otaviojava/sorted-streams
• Owner: otaviojava
• Created: 2020-03-06T17:00:24.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2022-10-20T06:04:15.000Z (about 2 years ago)
• Last Synced: 2023-03-12T06:39:27.115Z (over 1 year ago)
• Language: Java
• Size: 11.7 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Exercise summary

================

Combine multiple multiple ordered streams into a single ordered streamItem.

You may use any resources, programming languages, platforms, or frameworks to fulfill the exercise. Put all the code into a single git repository. The exercise should not take more than an hour or so, so scope the level of effort to that amount of time. We will use the code as the basis of a technical discussion later.

Exercise detail

===============

Assume you have n streamItem instances which have the following methods available:

- `peek()` returns the next available record or null/undefined/None if the streamItem is empty, but does not remove that record from the underlying queue. This method is idempotent.

- `next()` returns the next available record and removes it from the underlying queue. This method is not idempotent.

The records returned by these streamItem instances are JSON objects (or their equivalent in whatever language you choose) with the following fields:

- `timestamp` an non-negative integer

- `value` some arbitrary integer

Within each streamItem instance, `timestamp` is monotonically increasing. The `timestamp` value will always be equal to or greater than the `timestamp` value of the previous record emitted by a call to `next()`. Once a streamItem is empty, it's done and will never produce any further records.

Create a class that implements `peek()` and `next()` as described above; it must accept an arbitrary number of streams when instantiated.

Finally, create a method that will read from the given streams and will:

- print the values of the `timestamp` and `value` fields from the input streams in timestamp-order

- every 5 records, print the count, sum, and average value of all the records consumed so far

- if/when the streams are all exhausted, print the final count, sum, and average values of all the records consumed.

For example, if there are 2 input streams which contain data  `[{timestamp: 0, value: 10}, {timestamp: 2, value: 12}]` and `[{timestamp: 1, value:11}, {timestamp: 2, value: 13}]`, the output would be:

    timestamp: 0, value: 10

    timestamp: 1, value: 11

    timestamp: 2, value: 12

    timestamp: 2, value: 13

    count: 4, sum: 46, avg: 11.5

Testing

=======

For convenience, a very simple test harness is set up via `make test`. Input "streamItem" values are provided in JSON files, an array of array where each inner array is the contents of one particular streamItem, and expected output is provided in a text file. Note that multiple orders are valid because order is on the timestamp field and not on value field, so the test harness should be considered a helpful tool but not the only definition of correctness.

Edit `launcher.sh` to run your application as needed if you find it helpful.