Files
deb-python-taskflow/taskflow/patterns/linear_flow.py
Joshua Harlow 686ea905ed Allow instance methods to be wrapped and unwrapped correctly.
Change-Id: Ia29e0e8a54fa815dec88016a9444fe7cfad7b8ac
2013-06-27 12:35:28 -07:00

78 lines
2.9 KiB
Python

# -*- coding: utf-8 -*-
# vim: tabstop=4 shiftwidth=4 softtabstop=4
# Copyright (C) 2012 Yahoo! Inc. All Rights Reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License"); you may
# not use this file except in compliance with the License. You may obtain
# a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
# License for the specific language governing permissions and limitations
# under the License.
import collections
from taskflow import exceptions as exc
from taskflow.patterns import ordered_flow
from taskflow import utils
class Flow(ordered_flow.Flow):
"""A linear chain of tasks that can be applied as one unit or
rolled back as one unit. Each task in the chain may have requirements
which are satisfied by the previous task/s in the chain."""
def __init__(self, name, parents=None):
super(Flow, self).__init__(name, parents)
self._tasks = []
def _fetch_task_inputs(self, task):
would_like = set(utils.get_attr(task, 'requires', []))
would_like.update(utils.get_attr(task, 'optional', []))
inputs = {}
for n in would_like:
# Find the last task that provided this.
for (last_task, last_results) in reversed(self.results):
if n not in utils.get_attr(last_task, 'provides', []):
continue
if last_results and n in last_results:
inputs[n] = last_results[n]
else:
inputs[n] = None
# Some task said they had it, get the next requirement.
break
return inputs
def _validate_provides(self, task):
# Ensure that some previous task provides this input.
missing_requires = []
for r in utils.get_attr(task, 'requires', []):
found_provider = False
for prev_task in reversed(self._tasks):
if r in utils.get_attr(prev_task, 'provides', []):
found_provider = True
break
if not found_provider:
missing_requires.append(r)
# Ensure that the last task provides all the needed input for this
# task to run correctly.
if len(missing_requires):
msg = ("There is no previous task providing the outputs %s"
" for %s to correctly execute.") % (missing_requires, task)
raise exc.InvalidStateException(msg)
def add(self, task):
assert isinstance(task, collections.Callable)
self._validate_provides(task)
self._tasks.append(task)
def order(self):
return list(self._tasks)