|
Name |
|
Date |
Size |
#Lines |
LOC |
| .. | | 30-Oct-2021 | - |
| README | H A D | 30-Oct-2021 | 1.8 KiB | 46 | 34 |
README
1Copyright (c) 2002, 2018, Oracle and/or its affiliates. All rights reserved.
2DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3
4This code is free software; you can redistribute it and/or modify it
5under the terms of the GNU General Public License version 2 only, as
6published by the Free Software Foundation.
7
8This code is distributed in the hope that it will be useful, but WITHOUT
9ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
11version 2 for more details (a copy is included in the LICENSE file that
12accompanied this code).
13
14You should have received a copy of the GNU General Public License version
152 along with this work; if not, write to the Free Software Foundation,
16Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17
18Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19or visit www.oracle.com if you need additional information or have any
20questions.
21
22Strength Reduction
23------------------
24
25Strength reduction replaces an expansive operation by a cheaper one, such as
26multiplication by addition or subtraction, multiplication instead of
27exponentiation; use compound assignment operators such as += wherever possible,
28changing code of the form a[i] = a[i] + x to a[i] += x, since they result in
29fewer bytecode instructions; use shifts instead of multiplication by powers of
30two, etc.
31
32For example:
33
34 x ** 2 = x * x
35 2.0 * x = x + x
36 x / 2 = x * 0.5
37
38
39Induction Variable
40------------------
41
42A variable is called an induction variables of a loop if every time the variable
43changes values it is incremented or decrmented by some constant.
44Basic induction variables i whose only assignments within the loop is of the
45form i += c, where c is a constant.
46