def deploy_tokens_and_fund_accounts(
    token_amount: int,
    number_of_tokens: int,
    deploy_service: BlockChainService,
    participants: typing.List[typing.Address],
    contract_manager: ContractManager,
) -> typing.List[typing.TokenAddress]:
    """ Deploy `number_of_tokens` ERC20 token instances with `token_amount` minted and
    distributed among `blockchain_services`. Optionally the instances will be registered with
    the raiden registry.

    Args:
        token_amount (int): number of units that will be created per token
        number_of_tokens (int): number of token instances that will be created
        deploy_service (BlockChainService): the blockchain connection that will deploy
        participants (list(address)): participant addresses that will receive tokens
    """
    result = list()
    for _ in range(number_of_tokens):
        token_address = deploy_contract_web3(
            CONTRACT_HUMAN_STANDARD_TOKEN,
            deploy_service.client,
            contract_manager=contract_manager,
            constructor_arguments=(token_amount, 2, "raiden", "Rd"),
        )

        result.append(token_address)

        # only the creator of the token starts with a balance (deploy_service),
        # transfer from the creator to the other nodes
        for transfer_to in participants:
            deploy_service.token(token_address).transfer(
                to_address=transfer_to, amount=token_amount // len(participants)
            )

    return result
def __init__(self, root, cwd, kindpats, ctx=None, badfn=None):
        super(includematcher, self).__init__(root, cwd, badfn)

        # Can we use tree matcher?
        rules = _kindpatstoglobs(kindpats, recursive=True)
        fallback = True
        if rules is not None:
            try:
                matcher = treematcher(root, cwd, badfn=badfn, rules=rules)
                # Replace self to 'matcher'.
                self.__dict__ = matcher.__dict__
                self.__class__ = matcher.__class__
                fallback = False
            except ValueError:
                # for example, Regex("Compiled regex exceeds size limit of 10485760 bytes.")
                pass
        if fallback:
            self._pats, self.matchfn = _buildmatch(ctx, kindpats, "(?:/|$)", root)
            # prefix is True if all patterns are recursive, so certain fast paths
            # can be enabled. Unfortunately, it's too easy to break it (ex. by
            # using "glob:*.c", "re:...", etc).
            self._prefix = _prefix(kindpats)
            roots, dirs = _rootsanddirs(kindpats)
            # roots are directories which are recursively included.
            # If self._prefix is True, then _roots can have a fast path for
            # visitdir to return "all", marking things included unconditionally.
            # If self._prefix is False, then that optimization is unsound because
            # "roots" might contain entries that is not recursive (ex. roots will
            # include "foo/bar" for pattern "glob:foo/bar/*.c").
            self._roots = set(roots)
            # dirs are directories which are non-recursively included.
            # That is, files under that directory are included. But not
            # subdirectories.
            self._dirs = set(dirs)
            # Try to use a more efficient visitdir implementation
            visitdir = _buildvisitdir(kindpats)
            if visitdir:
                self.visitdir = visitdir