| /third_party/skia/docs/examples/ |
| D | Canvas_drawTextRSXform.cpp | 9 char alphabet[iterations]; in draw() local
18 alphabet[i] = 'A' + i; in draw()
22 auto spiral = SkTextBlob::MakeFromRSXform(alphabet, sizeof(alphabet), transforms, font); in draw()
|
| /third_party/python/Doc/library/ |
| D | base64.rst | 35 <file object>`. It only supports the Base64 standard alphabet, and it adds
58 alphabet for the ``+`` and ``/`` characters. This allows an application to e.g.
60 which the standard Base64 alphabet is used.
70 alternative alphabet used instead of the ``+`` and ``/`` characters.
76 in the normal base-64 alphabet nor the alternative alphabet are
78 these non-alphabet characters in the input result in a
84 Encode :term:`bytes-like object` *s* using the standard Base64 alphabet
91 Base64 alphabet and return the decoded :class:`bytes`.
97 URL- and filesystem-safe alphabet, which
99 standard Base64 alphabet, and return the encoded :class:`bytes`. The result
[all …]
|
| D | secrets.rst | 149 alphabet = string.ascii_letters + string.digits
150 password = ''.join(secrets.choice(alphabet) for i in range(8))
169 alphabet = string.ascii_letters + string.digits
171 password = ''.join(secrets.choice(alphabet) for i in range(10))
|
| /third_party/skia/third_party/externals/brotli/research/ |
| D | brotlidump.py | 1424 def readPrefixCode(self, alphabet): argument
1430 mode, numberOfSymbols = self.verboseRead(PrefixCodeHeader(alphabet.name))
1433 self.readComplexCode(numberOfSymbols, alphabet)
1434 return alphabet
1444 alphabet.__class__.mnemonic(alphabet, index)
1446 alphabet.mnemonic = myMnemonic
1448 table.append(self.verboseRead(alphabet, skipExtra=True).index)
1450 del alphabet.mnemonic
1455 alphabet.setLength(dict(zip(table, lengths)))
1456 return alphabet
[all …]
|
| /third_party/python/Lib/ |
| D | base64.py | 165 def _b32encode(alphabet, s): argument
169 if alphabet not in _b32tab2:
170 b32tab = [bytes((i,)) for i in alphabet]
171 _b32tab2[alphabet] = [a + b for a in b32tab for b in b32tab]
182 b32tab2 = _b32tab2[alphabet]
201 def _b32decode(alphabet, s, casefold=False, map01=None): argument
205 if alphabet not in _b32rev:
206 _b32rev[alphabet] = {v: k for k, v in enumerate(alphabet)}
227 b32rev = _b32rev[alphabet]
|
| /third_party/skia/third_party/externals/icu/source/data/translit/ |
| D | ka_ka_Latn_BGN_1981.txt | 13 # names written in the Georgian alphabet. The alphabet shown here is
14 # known as the Mkhedruli alphabet and is the alphabet presently
|
| D | az_Cyrl_az_BGN.txt | 14 # Azerbaijani government adopted a Roman alphabet to replace the
15 # existing Cyrillic alphabet. The Azerbaijani Cyrillic alphabet
16 # contains nine letters not present in the Russian alphabet:
|
| D | mn_mn_Latn_BGN.txt | 14 # the Mongolian Cyrillic alphabet. The Mongolian Cyrillic alphabet
15 # contains two letters not present in the Russian alphabet, Өө
16 # and Үү. Names written in the indigenous Mongolian alphabet, which
|
| D | ky_ky_Latn_BGN.txt | 14 # romanizing names written in the Kirghiz Cyrillic alphabet.
15 # The Kirghiz Cyrillic alphabet contains three letters not present
16 # in the Russian alphabet: Ңң, Өө, and Үү.
|
| D | be_be_Latn_BGN.txt | 13 # Cyrillic alphabet. The Belarusian alphabet contains three
14 # letters not present in the Russian alphabet: Іі, Ўў, ’.
|
| /third_party/icu/icu4c/source/data/translit/ |
| D | ka_ka_Latn_BGN_1981.txt | 13 # names written in the Georgian alphabet. The alphabet shown here is
14 # known as the Mkhedruli alphabet and is the alphabet presently
|
| D | az_Cyrl_az_BGN.txt | 14 # Azerbaijani government adopted a Roman alphabet to replace the
15 # existing Cyrillic alphabet. The Azerbaijani Cyrillic alphabet
16 # contains nine letters not present in the Russian alphabet:
|
| D | mn_mn_Latn_BGN.txt | 14 # the Mongolian Cyrillic alphabet. The Mongolian Cyrillic alphabet
15 # contains two letters not present in the Russian alphabet, Өө
16 # and Үү. Names written in the indigenous Mongolian alphabet, which
|
| D | ky_ky_Latn_BGN.txt | 14 # romanizing names written in the Kirghiz Cyrillic alphabet.
15 # The Kirghiz Cyrillic alphabet contains three letters not present
16 # in the Russian alphabet: Ңң, Өө, and Үү.
|
| D | be_be_Latn_BGN.txt | 13 # Cyrillic alphabet. The Belarusian alphabet contains three
14 # letters not present in the Russian alphabet: Іі, Ўў, ’.
|
| D | uk_uk_Latn_BGN.txt | 14 # names written in the Ukrainian alphabet. The Ukrainian alphabet
15 # contains five letters not present in the Russian alphabet:
|
| D | uz_Cyrl_uz_BGN.txt | 14 # romanizing names written in the Uzbek alphabet.
15 # The Uzbek alphabet contains four letters not present
16 # in the Russian alphabet: Ўў, Ққ, Ғғ, and Ҳҳ.
|
| /third_party/ltp/testcases/network/nfsv4/acl/ |
| D | setacl_stress.py | 14 alphabet='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ123456789_-()' variable
15 t_alphabet=len(alphabet)
|
| D | random_gen.py | 6 alphabet = 'azertyuiopqsdfghjklmwxcvbnAZERTYUIOPQSDFGHJKLMWXCVBN123456789-_' variable
7 a_length = len(alphabet)
157 outputString =outputString + alphabet[a]
165 outputString = outputString + alphabet[a]
|
| D | test_long_acl.py | 14 alphabet='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ123456789_-() ~' variable
15 t_alphabet=len(alphabet)
|
| D | test_acl.py | 13 alphabet='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ123456789_-() ~' variable
14 t_alphabet=len(alphabet)
|
| /third_party/node/deps/uv/src/ |
| D | idna.c | 107 static const char alphabet[] = "abcdefghijklmnopqrstuvwxyz0123456789"; in uv__idna_toascii_label() local
236 *(*d)++ = alphabet[t]; in uv__idna_toascii_label()
240 *(*d)++ = alphabet[q]; in uv__idna_toascii_label()
|
| /third_party/libuv/src/ |
| D | idna.c | 107 static const char alphabet[] = "abcdefghijklmnopqrstuvwxyz0123456789"; in uv__idna_toascii_label() local
236 *(*d)++ = alphabet[t]; in uv__idna_toascii_label()
240 *(*d)++ = alphabet[q]; in uv__idna_toascii_label()
|
| /third_party/zlib/doc/ |
| D | rfc1951.txt | 316 alphabet by bit sequences (codes), one code for each symbol, in
324 labeled with) the symbols of the alphabet; then the code for a
358 Given an alphabet with known symbol frequencies, the Huffman
362 alphabet). Such a code is called a Huffman code. (See
374 The Huffman codes used for each alphabet in the "deflate"
400 follows, assuming that the order of the alphabet is ABCD:
412 Given this rule, we can define the Huffman code for an alphabet
414 the alphabet in order; this is sufficient to determine the
459 Consider the alphabet ABCDEFGH, with bit lengths (3, 3, 3, 3,
593 distinct alphabets: either literal bytes, from the alphabet of
[all …]
|
| /third_party/astc-encoder/Docs/ |
| D | FormatOverview.md | 139 alphabet containing N symbols if we choose quantize to N levels. An N symbol
140 alphabet contains `log2(N)` bits of information per character. If we have an
141 alphabet of 5 possible symbols then each character contains ~2.32 bits of
145 N symbol alphabet:
149 ... which shows for most alphabet sizes we waste a lot of our storage capacity
163 Instead of rounding up a 5 symbol alphabet - called a "quint" in BISE - to
165 Three characters in a 5-symbol alphabet have 5<sup>3</sup> (125) combinations,
173 We can similarly construct a 3-symbol alphabet - called a "trit" in BISE - and
183 arbitrary alphabets of up to 256 symbols, encoding each alphabet size in the
206 quints - BISE encodes an string of S characters in an N symbol alphabet using a
[all …]
|