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

Feature/storm new planner #250

Merged
merged 14 commits into from
Sep 26, 2013
Merged

Feature/storm new planner #250

merged 14 commits into from
Sep 26, 2013

Conversation

ianoc
Copy link
Collaborator

@ianoc ianoc commented Sep 24, 2013

Storm platform now uses the newly generated graphs

store.asInstanceOf[StoreFactory[K, W]])

def foldOperations(producers: List[Producer[Storm, _]]): FlatMapOperation[Any, Any] = {
producers.foldLeft(FlatMapOperation.identity[Any]) {
Copy link
Collaborator

Choose a reason for hiding this comment

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

we need to make sure andThen on identity is free. We need to override andThen on the identity to just return the right hand argument.

// We also drop all StormNodes with no members(may occur when we visit a node already seen and its the first in that Node)
val revsersedNodeSet = stormNodeSet.filter(_.members.size > 0).foldLeft(List[StormNode]()){(nodes, n) => n.reverse :: nodes}
// We also drop all Nodes with no members(may occur when we visit a node already seen and its the first in that Node)
val revsersedNodeSet = stormNodeSet.filter(_.members.size > 0).foldLeft(List[Node]()){(nodes, n) => n.reverse :: nodes}
Copy link
Collaborator

Choose a reason for hiding this comment

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

is that reveresedNodeSet?

@ianoc
Copy link
Collaborator Author

ianoc commented Sep 25, 2013

@johnynek since this is all refactored around a in the other open PR i put the spellcheck name into the other one

def dependantsOf(n: StormNode): List[StormNode] = dependsOnM.get(n).getOrElse(List())
def dependsOn(n: StormNode): List[StormNode] = dependantOfM.get(n).getOrElse(List())
def dependantsOf(n: Node): List[Node] = dependsOnM.get(n).getOrElse(List())
def dependsOn(n: Node): List[Node] = dependantOfM.get(n).getOrElse(List())
Copy link
Collaborator

Choose a reason for hiding this comment

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

rename dependsOn to dependenciesOf?

Also, the right hand side looks reversed. Is it right? Can you explain this in a comment?

// TODO (https://github.com/twitter/summingbird/issues/86):
// support topologies that don't end with a sum
populate(topologyBuilder, summer, name)
stormDag.nodes.map { node =>
Copy link
Collaborator

Choose a reason for hiding this comment

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

.foreach

johnynek added a commit that referenced this pull request Sep 26, 2013
@johnynek johnynek merged commit 249276a into develop Sep 26, 2013
@johnynek johnynek deleted the feature/storm_new_planner branch September 26, 2013 23:34
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.

2 participants