Home
last modified time | relevance | path

Searched refs:alphabet (Results 1 – 25 of 67) sorted by relevance

123

/external/puffin/src/
Dhuffman_table.h81 inline bool CodeAlphabet(uint32_t bits, uint16_t* alphabet, size_t* nbits) { in CodeAlphabet() argument
84 *alphabet = hc & 0x7FFF; in CodeAlphabet()
85 *nbits = code_lens_[*alphabet]; in CodeAlphabet()
96 inline bool LitLenAlphabet(uint32_t bits, uint16_t* alphabet, size_t* nbits) { in LitLenAlphabet() argument
99 *alphabet = hc & 0x7FFF; in LitLenAlphabet()
100 *nbits = lit_len_lens_[*alphabet]; in LitLenAlphabet()
112 uint16_t* alphabet, in DistanceAlphabet() argument
116 *alphabet = hc & 0x7FFF; in DistanceAlphabet()
117 *nbits = distance_lens_[*alphabet]; in DistanceAlphabet()
127 inline bool CodeHuffman(uint16_t alphabet, uint16_t* huffman, size_t* nbits) { in CodeHuffman() argument
[all …]
/external/guava/guava-gwt/src-super/com/google/common/io/super/com/google/common/io/
DBaseEncoding.java508 private final Alphabet alphabet; field in BaseEncoding.StandardBaseEncoding
517 StandardBaseEncoding(Alphabet alphabet, @Nullable Character paddingChar) { in StandardBaseEncoding() argument
518 this.alphabet = checkNotNull(alphabet); in StandardBaseEncoding()
519 checkArgument(paddingChar == null || !alphabet.matches(paddingChar), in StandardBaseEncoding()
531 return alphabet.charsPerChunk * divide(bytes, alphabet.bytesPerChunk, CEILING); in maxEncodedSize()
547 while (bitBufferLength >= alphabet.bitsPerChar) { in encodingStream()
548 int charIndex = (bitBuffer >> (bitBufferLength - alphabet.bitsPerChar)) in encodingStream()
549 & alphabet.mask; in encodingStream()
550 out.write(alphabet.encode(charIndex)); in encodingStream()
552 bitBufferLength -= alphabet.bitsPerChar; in encodingStream()
[all …]
/external/guava/guava/src/com/google/common/io/
DBaseEncoding.java565 private final Alphabet alphabet;
574 StandardBaseEncoding(Alphabet alphabet, @Nullable Character paddingChar) {
575 this.alphabet = checkNotNull(alphabet);
576 checkArgument(paddingChar == null || !alphabet.matches(paddingChar),
588 return alphabet.charsPerChunk * divide(bytes, alphabet.bytesPerChunk, CEILING);
604 while (bitBufferLength >= alphabet.bitsPerChar) {
605 int charIndex = (bitBuffer >> (bitBufferLength - alphabet.bitsPerChar))
606 & alphabet.mask;
607 out.write(alphabet.encode(charIndex));
609 bitBufferLength -= alphabet.bitsPerChar;
[all …]
/external/python/cpython2/Doc/library/
Dbase64.rst22 well as strings, but only using the Base64 standard alphabet.
33 alphabet for the ``+`` and ``/`` characters. This allows an application to e.g.
35 which the standard Base64 alphabet is used.
46 alphabet used instead of the ``+`` and ``/`` characters.
50 in the normal base-64 alphabet nor the alternative alphabet are
56 Encode string *s* using the standard Base64 alphabet.
61 Decode string *s* using the standard Base64 alphabet.
67 alphabet, which substitutes ``-`` instead of
68 ``+`` and ``_`` instead of ``/`` in the standard Base64 alphabet. The result
75 alphabet, which substitutes ``-`` instead of
[all …]
/external/curl/tests/data/
Dtest190351 550 alphabet.txt
52 10 alphabet.txt
53 10 alphabet.txt
54 10 alphabet.txt
55 10 alphabet.txt
/external/puffin/
DREADME.md14 alphabet. Huffman codes can be created uniquely using Huffman code length
18 alphabet. Throughout the code, Huffman code arrays are identified by
21 alphabet and the array element in that index contains the Huffman code of
22 the alphabet. Throughout the code, The Huffman reverse code arrays are
26 index as the alphabet. Throughout the code, Huffman code length arrays
/external/python/cpython3/Doc/library/
Dbase64.rst35 <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 …]
Dsecrets.rst148 alphabet = string.ascii_letters + string.digits
149 password = ''.join(choice(alphabet) for i in range(8))
167 alphabet = string.ascii_letters + string.digits
169 password = ''.join(choice(alphabet) for i in range(10))
/external/brotli/research/
Dbrotlidump.py1424 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 …]
/external/icu/icu4c/source/data/translit/
Dka_ka_Latn_BGN_1981.txt12 # names written in the Georgian alphabet. The alphabet shown here is
13 # known as the Mkhedruli alphabet and is the alphabet presently
Daz_Cyrl_az_BGN.txt13 # Azerbaijani government adopted a Roman alphabet to replace the
14 # existing Cyrillic alphabet. The Azerbaijani Cyrillic alphabet
15 # contains nine letters not present in the Russian alphabet:
Dmn_mn_Latn_BGN.txt13 # the Mongolian Cyrillic alphabet. The Mongolian Cyrillic alphabet
14 # contains two letters not present in the Russian alphabet, Өө
15 # and Үү. Names written in the indigenous Mongolian alphabet, which
Dky_ky_Latn_BGN.txt13 # romanizing names written in the Kirghiz Cyrillic alphabet.
14 # The Kirghiz Cyrillic alphabet contains three letters not present
15 # in the Russian alphabet: Ңң, Өө, and Үү.
Dbe_be_Latn_BGN.txt12 # Cyrillic alphabet. The Belarusian alphabet contains three
13 # letters not present in the Russian alphabet: Іі, Ўў, ’.
Duz_Cyrl_uz_BGN.txt13 # romanizing names written in the Uzbek alphabet.
14 # The Uzbek alphabet contains four letters not present
15 # in the Russian alphabet: Ўў, Ққ, Ғғ, and Ҳҳ.
Duk_uk_Latn_BGN.txt13 # names written in the Ukrainian alphabet. The Ukrainian alphabet
14 # contains five letters not present in the Russian alphabet:
Dka_ka_Latn_BGN.txt11 # Georgian-language names written in the Mkhedruli alphabet.
/external/tensorflow/tensorflow/contrib/eager/python/examples/rnn_colorbot/
Drnn_colorbot_test.py36 alphabet = 50
39 [batch_size, time_steps], minval=0, maxval=alphabet, dtype=tf.int32),
40 alphabet)
/external/ltp/testcases/network/nfsv4/acl/
Dsetacl_stress.py13 alphabet='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ123456789_-()' variable
14 t_alphabet=len(alphabet)
Dtest_long_acl.py13 alphabet='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ123456789_-() ~' variable
14 t_alphabet=len(alphabet)
Drandom_gen.py5 alphabet = 'azertyuiopqsdfghjklmwxcvbnAZERTYUIOPQSDFGHJKLMWXCVBN123456789-_' variable
6 a_length = len(alphabet)
156 outputString =outputString + alphabet[a]
164 outputString = outputString + alphabet[a]
Dtest_acl.py12 alphabet='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ123456789_-() ~' variable
13 t_alphabet=len(alphabet)
/external/okhttp/benchmarks/src/main/java/com/squareup/okhttp/benchmarks/
DBenchmark.java210 String alphabet = "-abcdefghijklmnopqrstuvwxyz"; in randomString() local
213 result[i] = alphabet.charAt(random.nextInt(alphabet.length())); in randomString()
/external/zlib/src/doc/
Drfc1951.txt316 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 …]
/external/libchrome/base/strings/
Dstring_piece_unittest.cc138 TypeParam alphabet(TestFixture::as_string("abcdefghijklmnopqrstuvwxyz")); in TYPED_TEST() local
143 BasicStringPiece<TypeParam> a(alphabet); in TYPED_TEST()
200 TypeParam alphabet(TestFixture::as_string("abcdefghijklmnopqrstuvwxyz")); in TYPED_TEST() local
205 BasicStringPiece<TypeParam> a(alphabet); in TYPED_TEST()
612 TypeParam alphabet(TestFixture::as_string("abcdefghijklmnopqrstuvwxyz")); in TYPED_TEST() local
615 BasicStringPiece<TypeParam> abc(alphabet); in TYPED_TEST()
618 ASSERT_TRUE(abc == BasicStringPiece<TypeParam>(alphabet)); in TYPED_TEST()
619 ASSERT_EQ(abc.compare(BasicStringPiece<TypeParam>(alphabet)), 0); in TYPED_TEST()

123