* ActiveDeadlineSeconds is validated in workload controllers now, make sure it's not set anywhere (it shouldn't be set by default and having it set means your controller will restart the Pods at some point) ([#38741](https://github.com/kubernetes/kubernetes/pull/38741), [@sandflee](https://github.com/sandflee))

* `kubectl run --env` no longer supports CSV parsing. To provide multiple env vars, use the `--env` flag multiple times instead of having env vars separated by commas. E.g. `--env ONE=1 --env TWO=2` instead of `--env ONE=1,TWO=2`. ([#47460](https://github.com/kubernetes/kubernetes/pull/47460), [@mengqiy](https://github.com/mengqiy))

- Add limited lines to log when having tail option ([#93920](https://github.com/kubernetes/kubernetes/pull/93920), [@zhouya0](https://github.com/zhouya0)) [SIG Node]

  * [stable] [containerd](https://github.com/containerd/containerd): containerd v1.1 natively supports CRI v1alpha2 now, so users can use Kubernetes v1.10 with containerd v1.1 directly, without having to use the intermediate cri-containerd daemon. [All Kubernetes 1.10 tests passed](https://k8s-testgrid.appspot.com/sig-node-containerd). [@Random-Liu]

  
  For developers of out-of-tree PostFilter plugins, note that the semantics of NodeToStatusMap are changing: A node with an absent value in the NodeToStatusMap should be interpreted as having an UnschedulableAndUnresolvable status ([#125307](https://github.com/kubernetes/kubernetes/pull/125307), [@gabesaba](https://github.com/gabesaba)) [SIG Scheduling]

### Feature

- Azure: per VMSS VMSS VMs cache to prevent throttling on clusters having many attached VMSS ([#93107](https://github.com/kubernetes/kubernetes/pull/93107), [@bpineau](https://github.com/bpineau)) [SIG Cloud Provider]

	p()
}
</pre>

<p>
prints
</p>

<pre>
1
3
5
</pre>

<p>
Prior to [<a href="#Go_1.22">Go 1.22</a>], iterations share one set of variables
instead of having their own separate variables.
In that case, the example above prints
</p>

<pre>
6
6
6
</pre>

<h4 id="For_range">For statements with <code>range</code> clause</h4>

<p>

func rr(m *Modulus) *Nat { rr := NewNat().ExpandFor(m) n := uint(len(rr.limbs)) mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning...

func rr(m *Modulus) *Nat { rr := NewNat().ExpandFor(m) n := uint(len(rr.limbs)) mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning...