Thanks to visit codestin.com
Credit goes to github.com

Skip to content
This repository was archived by the owner on Jan 20, 2022. It is now read-only.

Conversation

@tsdeng
Copy link
Contributor

@tsdeng tsdeng commented Mar 20, 2015

retry of
#612

the check of "at least one batch is covered by timespan" only applies to merging.

@MansurAshraf
Copy link
Contributor

60546669

@tsdeng
Copy link
Contributor Author

tsdeng commented Mar 23, 2015

working on the tests here: tsdeng#1

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

.zip or .join with Arbitrary.arbitrary[Map[Int, Int]]

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

don't have two maps back to back, just do one.

Also, maybe for comprehension here.

@tsdeng
Copy link
Contributor Author

tsdeng commented Mar 24, 2015

Hi, @johnynek
Thanks for the feedback, addressed your comment, could you take a look again?
Thanks!

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why do you have the fake data here? Why not use PipeFactory[Nothing] which is a subclass of all PipeFactories? TypedPipe.empty gives you a TypedPipe[Nothing]

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It's because for merging, if it returns a TypedPipe[Nothing], then I need to define a semigroup of Nothing

johnynek added a commit that referenced this pull request Mar 24, 2015
…merging

ensure at least one batch before merging
@johnynek johnynek merged commit 6422528 into twitter:develop Mar 24, 2015
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants