| /prebuilts/go/darwin-x86/src/cmd/internal/rsc.io/arm/armasm/ |
| ext_test.go | 316 // begins with any of the given prefixes.
|
| /prebuilts/go/darwin-x86/src/debug/macho/ |
| file.go | 236 // Each load command begins with uint32 command and length.
|
| /prebuilts/go/darwin-x86/src/html/template/ |
| transition.go | 510 // It returns an error if s[i:] does not look like it begins with an
|
| /prebuilts/go/darwin-x86/src/mime/multipart/ |
| multipart.go | 130 // next part (if any) begins.
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| pgen.go | 35 // where a complete initialization (definition) of a variable begins.
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| pgen.go | 32 // where a complete initialization (definition) of a variable begins.
|
| /prebuilts/go/linux-x86/src/cmd/doc/ |
| main.go | 137 // If it contains slashes, it begins with a package path.
|
| /prebuilts/go/linux-x86/src/cmd/internal/rsc.io/arm/armasm/ |
| ext_test.go | 316 // begins with any of the given prefixes.
|
| /prebuilts/go/linux-x86/src/debug/macho/ |
| file.go | 236 // Each load command begins with uint32 command and length.
|
| /prebuilts/go/linux-x86/src/html/template/ |
| transition.go | 510 // It returns an error if s[i:] does not look like it begins with an
|
| /prebuilts/go/linux-x86/src/mime/multipart/ |
| multipart.go | 130 // next part (if any) begins.
|
| /external/libvorbis/doc/ |
| 04-codec.tex | 19 A Vorbis bitstream begins with three header packets. The header
28 Each header packet begins with the same header fields.
|
| 03-codebook.tex | 36 A codebook begins with a 24 bit sync pattern, 0x564342:
|
| 08-residue.tex | 169 where, for coding purposes, the vector effectively begins at element
|
| /prebuilts/go/darwin-x86/src/encoding/xml/ |
| marshal.go | 113 // MarshalIndent works like Marshal, but each XML element begins on a new
139 // begins on a new indented line that starts with prefix and is followed by
|
| /prebuilts/go/darwin-x86/src/go/ast/ |
| ast.go | 524 // (that is, whether it begins with an upper-case letter).
532 // (that is, whether it begins with an uppercase letter).
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| malloc.go | 232 // allocated data will be found. The arena begins with a bitmap large
294 // following the bitmap (presumably the executable begins
|
| /prebuilts/go/linux-x86/src/encoding/xml/ |
| marshal.go | 113 // MarshalIndent works like Marshal, but each XML element begins on a new
139 // begins on a new indented line that starts with prefix and is followed by
|
| /prebuilts/go/linux-x86/src/go/ast/ |
| ast.go | 524 // (that is, whether it begins with an upper-case letter).
532 // (that is, whether it begins with an uppercase letter).
|
| /prebuilts/go/linux-x86/src/runtime/ |
| malloc.go | 232 // allocated data will be found. The arena begins with a bitmap large
294 // following the bitmap (presumably the executable begins
|
| /prebuilts/go/darwin-x86/src/go/printer/testdata/ |
| parser.go | [all...] |
| /prebuilts/go/darwin-x86/src/regexp/syntax/ |
| parse.go | 583 // leadingString returns the leading literal string that re begins with.
632 // leadingRegexp returns the leading regexp that re begins with.
932 // The caller must have ensured that s begins with "(?".
[all...] |
| /prebuilts/go/linux-x86/src/go/printer/testdata/ |
| parser.go | [all...] |
| /prebuilts/go/linux-x86/src/regexp/syntax/ |
| parse.go | 583 // leadingString returns the leading literal string that re begins with.
632 // leadingRegexp returns the leading regexp that re begins with.
932 // The caller must have ensured that s begins with "(?".
[all...] |
| /external/ImageMagick/www/api/ |
| quantize.php | 71 <p>Classification begins by initializing a color description tree of sufficient depth to represent each possible input color in a leaf. However, it is impractical to generate a fully-formed color description tree in the storage_class phase for realistic values of Cmax. If colors components in the input image are quantized to k-bit precision, so that Cmax= 2k-1, the tree would need k levels below the root node to allow representing each possible input color in a leaf. This becomes prohibitive because the tree's total number of nodes is 1 + sum(i=1, k, 8k).</p>
|
