10 examples of 'pass in for loop python' in Python

88
def visit_For(self, node):
89
    self.make_tab()
90
    self.write('for ')
91
    self.visit(node.target)
92
    self.write(' in ')
93
    self._in_args = True
94
    self.visit(node.iter)
95
    self._in_args = False
96
    self.write(':\n')
97
    self._indent += 1
98
    for n in node.body:
99
        self.visit(n)
100
    self._indent -= 1

365
def FOR(self, node):
366
    """
367
    Process bindings for loop variables.
368
    """
369
    vars = []
370
    def collectLoopVars(n):
371
        if hasattr(n, 'name'):
372
            vars.append(n.name)
373
        else:
374
            for c in n.getChildNodes():
375
                collectLoopVars(c)
376
377
    collectLoopVars(node.assign)
378
    for varn in vars:
379
        if (isinstance(self.scope.get(varn), Importation)
380
                # unused ones will get an unused import warning
381
                and self.scope[varn].used):
382
            self.report(messages.ImportShadowedByLoopVar,
383
                        node.lineno, varn, self.scope[varn].source.lineno)
384
385
    self.handleChildren(node)

994
def setLoopVar(self, loop_var):
995
    self.loop_var = loop_var

258
def emit_sequential_loop(self, codegen_state, iname, iname_dtype,
259
        lbound, ubound, inner):
260
    ecm = codegen_state.expression_to_code_mapper
261
262
    from pymbolic.mapper.stringifier import PREC_NONE, PREC_SUM
263
    from genpy import For
264
265
    return For(
266
            (iname,),
267
            "range(%s, %s + 1)"
268
            % (
269
                ecm(lbound, PREC_NONE, "i"),
270
                ecm(ubound, PREC_SUM, "i"),
271
                ),
272
            inner)

677
def visitGenExprFor(self, node):
678
    start = self.newBlock()
679
    anchor = self.newBlock()
680
    end = self.newBlock()
681
    self.setups.push((LOOP, start))
682
    self.emit('SETUP_LOOP', end)
683
    if node.is_outmost:
684
        self.loadName('.0')
685
    else:
686
        self.visit(node.iter)
687
        self.emit('GET_ITER')
688
    self.nextBlock(start)
689
    self.set_lineno(node, force=True)
690
    self.emit('FOR_ITER', anchor)
691
    self.nextBlock()
692
    self.visit(node.assign)
693
    return (start, anchor, end)

69
def test_for():
70
    src = dedent("""\
71
    for a in [1,2]:
72
        a
73
74
    for a1 in 1,"":
75
        a1
76
    """)
77
    check_p(src, 1)

323
def visit_ParFor(self, expr):
324
  self.visit_expr(expr.fn)
325
  self.visit_expr(expr.bounds)

285
def _For(self, t):
286
    self.fill("for ")
287
    self.dispatch(t.target)
288
    self.write(" in ")
289
    self.dispatch(t.iter)
290
    self.body(t.body)
291
    if t.orelse:
292
        self.fill("else")
293
        self.body(t.orelse)

691
def handle_gen_for (self, node):
692
    return self._handle_comp_for(node)

74
def visit_For(self, node):
75
    """
76
    OUT = (node,) + last body statements
77
    RAISES = body's that are not break or continue
78
    """
79
    currs = (node,)
80
    break_currs = tuple()
81
    raises = ()
82
    # handle body
83
    for n in node.body:
84
        self.result.add_node(n)
85
        for curr in currs:
86
            self.result.add_edge(curr, n)
87
        currs, nraises = self.visit(n)
88
        for nraise in nraises:
89
            if isinstance(nraise, ast.Break):
90
                break_currs += (nraise,)
91
            elif isinstance(nraise, ast.Continue):
92
                self.result.add_edge(nraise, node)
93
            else:
94
                raises += (nraise,)
95
    # add the backward loop
96
    for curr in currs:
97
        self.result.add_edge(curr, node)
98
    # the else statement if needed
99
    if node.orelse:
100
        for n in node.orelse:
101
            self.result.add_node(n)
102
            for curr in currs:
103
                self.result.add_edge(curr, n)
104
            currs, nraises = self.visit(n)
105
    # while only
106
    if hasattr(node, 'test') and is_true_predicate(node.test):
107
        return break_currs, raises
108
109
    return break_currs + currs, raises