| /external/bison/doc/ |
| refcard.tex | 44 % produces two separate pages, each of which needs to be reduced to 80%.
|
| /external/bison/tests/ |
| testsuite | 697 105;reduce.at:271;Reduced Automaton;report;
[all...] |
| /prebuilts/go/darwin-x86/src/compress/bzip2/ |
| bzip2.go | 248 // the symbol set is reduced. The symbols used are stored as a
|
| /prebuilts/go/darwin-x86/src/crypto/cipher/ |
| gcm.go | 228 // irreducible polynomial so the result has to be reduced. The
|
| /prebuilts/go/darwin-x86/src/crypto/elliptic/ |
| p256_amd64.go | 190 // reduced modulo that order.
|
| p256_s390x.go | 176 // is equal or greater than the order of the group, it's reduced modulo that order.
|
| p224.go | 432 // overflowing and being reduced by the second carry chain, out[3] <=
|
| p256.go | 49 // reduced modulo that order.
[all...] |
| /prebuilts/go/linux-x86/src/compress/bzip2/ |
| bzip2.go | 248 // the symbol set is reduced. The symbols used are stored as a
|
| /prebuilts/go/linux-x86/src/crypto/cipher/ |
| gcm.go | 228 // irreducible polynomial so the result has to be reduced. The
|
| /prebuilts/go/linux-x86/src/crypto/elliptic/ |
| p256_amd64.go | 190 // reduced modulo that order.
|
| p256_s390x.go | 176 // is equal or greater than the order of the group, it's reduced modulo that order.
|
| p224.go | 432 // overflowing and being reduced by the second carry chain, out[3] <=
|
| p256.go | 49 // reduced modulo that order.
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| collections.py | 430 Note: If a count is set to zero or reduced to zero, it will remain
561 Counts can be reduced below zero. Both the inputs and outputs are
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| nat.go | 214 // It also assumes that x, y are already reduced mod m,
215 // or else the result will not be properly reduced.
|
| /prebuilts/go/linux-x86/src/math/big/ |
| nat.go | 214 // It also assumes that x, y are already reduced mod m,
215 // or else the result will not be properly reduced.
|
| /external/ImageMagick/www/api/ |
| quantize.php | 69 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
|
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 204 \item Bunching of IOs results in reduced time amongst IOs within a bunch.
|
| /prebuilts/go/darwin-x86/src/go/ast/ |
| ast.go | 93 // reduced to one, and trailing space on lines is trimmed. Unless the result
|
| /prebuilts/go/darwin-x86/src/image/png/ |
| reader.go | 75 // interlacing defines Adam7 interlacing, with 7 passes of reduced images.
|
| /prebuilts/go/linux-x86/src/go/ast/ |
| ast.go | 93 // reduced to one, and trailing space on lines is trimmed. Unless the result
|
| /prebuilts/go/linux-x86/src/image/png/ |
| reader.go | 75 // interlacing defines Adam7 interlacing, with 7 passes of reduced images.
|
| /prebuilts/go/darwin-x86/src/database/sql/ |
| sql.go | 671 // then the new MaxIdleConns will be reduced to match the MaxOpenConns limit
702 // MaxIdleConns, then MaxIdleConns will be reduced to match the new
[all...] |
| /prebuilts/go/linux-x86/src/database/sql/ |
| sql.go | 671 // then the new MaxIdleConns will be reduced to match the MaxOpenConns limit
702 // MaxIdleConns, then MaxIdleConns will be reduced to match the new
[all...] |
