| /third_party/protobuf/objectivec/ |
| D | GPBDictionary.h | 40 /** Number of entries stored in this dictionary. */
44 * Initializes this dictionary, copying the given values and keys.
46 * @param values The values to be placed in this dictionary.
48 * @param count The number of elements to copy into the dictionary.
50 * @return A newly initialized dictionary with a copy of the values and keys.
57 * Initializes this dictionary, copying the entries from the given dictionary.
59 * @param dictionary Dictionary containing the entries to add to this dictionary.
61 * @return A newly initialized dictionary with the entries of the given dictionary.
63 - (instancetype)initWithDictionary:(GPBUInt32UInt32Dictionary *)dictionary;
66 * Initializes this dictionary with the requested capacity.
[all …]
|
| /third_party/tex-hyphen/hyph-utf8/source/generic/hyph-utf8/ |
| D | language-data.rb | 38 "type" => "dictionary",
42 "type" => "dictionary",
46 "type" => "dictionary",
50 "type" => "dictionary",
58 "type" => "dictionary",
67 "type" => "dictionary",
80 "type" => "dictionary",
85 "type" => "dictionary",
89 "type" => "dictionary",
98 "type" => "dictionary",
[all …]
|
| /third_party/skia/third_party/externals/brotli/fetch-spec/ |
| D | shared-brotli-fetch-spec.txt | 8 The goal is to add support for custom dictionaries for Brotli. A dictionary is used
9 to improve compression. A client can download a dictionary from a server and then
10 use it to decompress resources compressed with this dictionary.
12 This document specifies how the client and server negotiate the dictionary over HTTP.
14 with a URL of the dictionary. The browser downloads the dictionary from the URL and
16 which the client uses to verify the dictionary. Caching, CORS, and other existing
17 mechanisms are used. A dictionary can be a pre-made static dictionary, but does not
31 shared dictionary.
48 Shared-Brotli-dictionary fetch given dictionaryId and request.
55 [NOTE-BOX] If the dictionary is still being fetched, which happens in
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | emptyObjectNotSubtypeOfIndexSignatureContainingObject2.types | 4 interface Dictionary<T> {
28 type DictionaryIterator<T, TResult> = ObjectIterator<Dictionary<T>, TResult>;
33 …: <T, TResult>(obj: Dictionary<T> | NumericDictionary<T> | null | undefined, callback: DictionaryI…
35 obj: Dictionary<T> | NumericDictionary<T> | null | undefined,
36 >obj : Dictionary<T> | NumericDictionary<T>
42 ): Dictionary<TResult> {
69 >wat : Dictionary<string>
70 >mapValues(foos, f => f.foo) : Dictionary<string>
71 …mapValues : <T, TResult>(obj: Dictionary<T> | NumericDictionary<T>, callback: DictionaryIterator<T…
80 >result : Dictionary<string>
[all …]
|
| D | intersectionsAndEmptyObjects.types | 63 type Dictionary = { [name: string]: string };
64 >Dictionary : { [name: string]: string; }
67 const intersectDictionaries = <F1 extends Dictionary, F2 extends Dictionary>(
68 >intersectDictionaries : <F1 extends Dictionary, F2 extends Dictionary>(d1: F1, d2: F2) => F1 & F2
69 …tends Dictionary, F2 extends Dictionary>( d1: F1, d2: F2,): F1 & F2 => Object.assign({}, d1, d2)…
86 const testDictionary = <T extends Dictionary>(_value: T) => { };
87 >testDictionary : <T extends Dictionary>(_value: T) => void
88 ><T extends Dictionary>(_value: T) => { } : <T extends Dictionary>(_value: T) => void
97 >testDictionary : <T extends Dictionary>(_value: T) => void
103 >intersectDictionaries : <F1 extends Dictionary, F2 extends Dictionary>(d1: F1, d2: F2) => F1 & F2
[all …]
|
| D | emptyObjectNotSubtypeOfIndexSignatureContainingObject1.types | 4 interface Dictionary<T> {
28 type DictionaryIterator<T, TResult> = ObjectIterator<Dictionary<T>, TResult>;
33 …: <T, TResult>(obj: Dictionary<T> | NumericDictionary<T> | null | undefined, callback: DictionaryI…
35 obj: Dictionary<T> | NumericDictionary<T> | null | undefined,
36 >obj : Dictionary<T> | NumericDictionary<T>
42 ): Dictionary<TResult> {
69 >result : Dictionary<string>
70 >foos == null ? {} : mapValues(foos, f => f.foo) : Dictionary<string>
75 >mapValues(foos, f => f.foo) : Dictionary<string>
76 …mapValues : <T, TResult>(obj: Dictionary<T> | NumericDictionary<T>, callback: DictionaryIterator<T…
[all …]
|
| D | incrementOnNullAssertion.types | 2 interface Dictionary<T> {
10 let foo: Dictionary<number> = {}
11 >foo : Dictionary<number>
17 >foo : Dictionary<number>
24 >foo : Dictionary<number>
32 >foo : Dictionary<number>
38 >foo : Dictionary<number>
45 >foo : Dictionary<number>
|
| D | underscoreTest1.types | 13 >_.each : { <T>(list: T[], iterator: Iterator_<T, void>, context?: any): void; <T>(list: Dictionary…
15 >each : { <T>(list: T[], iterator: Iterator_<T, void>, context?: any): void; <T>(list: Dictionary<T…
31 >_.each : { <T>(list: T[], iterator: Iterator_<T, void>, context?: any): void; <T>(list: Dictionary…
33 >each : { <T>(list: T[], iterator: Iterator_<T, void>, context?: any): void; <T>(list: Dictionary<T…
53 …ist: T[], iterator: Iterator_<T, U>, context?: any): U[]; <T, U>(list: Dictionary<T>, iterator: It…
55 >map : { <T, U>(list: T[], iterator: Iterator_<T, U>, context?: any): U[]; <T, U>(list: Dictionary<…
68 …ist: T[], iterator: Iterator_<T, U>, context?: any): U[]; <T, U>(list: Dictionary<T>, iterator: It…
70 >map : { <T, U>(list: T[], iterator: Iterator_<T, U>, context?: any): U[]; <T, U>(list: Dictionary<…
88 …text?: any): U; <T>(list: Dictionary<T>, iterator: Reducer<T, T>, initialValue?: T, context?: any)…
90 …text?: any): U; <T>(list: Dictionary<T>, iterator: Reducer<T, T>, initialValue?: T, context?: any)…
[all …]
|
| /third_party/python/Doc/c-api/ |
| D | dict.rst | 5 Dictionary Objects
8 .. index:: pair: object; dictionary
13 This subtype of :c:type:`PyObject` represents a Python dictionary object.
18 This instance of :c:type:`PyTypeObject` represents the Python dictionary
36 Return a new empty dictionary, or ``NULL`` on failure.
43 prevent modification of the dictionary for non-dynamic class types.
48 Empty an existing dictionary of all key-value pairs.
53 Determine if dictionary *p* contains *key*. If an item in *p* is matches
60 Return a new dictionary that contains the same key-value pairs as *p*.
65 Insert *val* into the dictionary *p* with a key of *key*. *key* must be
[all …]
|
| /third_party/brotli/c/include/brotli/ |
| D | shared_dictionary.h | 7 /* (Opaque) Shared Dictionary definition and utilities. */
25 * Opaque structure that holds shared dictionary data.
36 /** Raw LZ77 prefix dictionary. */
38 /** Serialized shared dictionary.
48 * Fresh instance has default word dictionary and transforms
49 * and no LZ77 prefix dictionary.
68 * @param dict shared dictionary instance to be cleaned up and deallocated
74 * Attaches dictionary to a given instance of ::BrotliSharedDictionary.
76 * Dictionary to be attached is represented in a serialized format as a region
79 * Provided data it partially referenced by a resulting (compound) dictionary,
[all …]
|
| /third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/ |
| D | MapFieldTest.cs | 292 IDictionary dictionary = map; in IDictionary_Add()
293 dictionary.Add("a", "b"); in IDictionary_Add()
295 Assert.Throws<ArgumentException>(() => dictionary.Add("a", "duplicate")); in IDictionary_Add()
296 Assert.Throws<InvalidCastException>(() => dictionary.Add(new object(), "key is bad")); in IDictionary_Add()
297 Assert.Throws<InvalidCastException>(() => dictionary.Add("value is bad", new object())); in IDictionary_Add()
304 IDictionary dictionary = map; in IDictionary_Contains()
306 Assert.IsFalse(dictionary.Contains("a")); in IDictionary_Contains()
307 Assert.IsFalse(dictionary.Contains(5)); in IDictionary_Contains()
309 Assert.IsFalse(dictionary.Contains(new DictionaryEntry("x", "y"))); in IDictionary_Contains()
310 Assert.IsTrue(dictionary.Contains("x")); in IDictionary_Contains()
[all …]
|
| /third_party/brotli/c/enc/ |
| D | encoder_dict.h | 13 #include "../common/dictionary.h"
24 Dictionary hierarchy for Encoder:
28 = prefix dictionary with precomputed hashes
31 = for each context, precomputed static dictionary with words + transforms
33 Dictionary hiearchy from common: similar, but without precomputed hashes
60 /* Dictionary data (words and transforms) for 1 possible context */
77 Contains every possible transformed dictionary word in a trie. It encodes
96 /* Dictionary data for all 64 contexts */
115 /* LZ77 prefix, compound dictionary */
118 /* Custom static dictionary (optionally context-based) */
[all …]
|
| D | static_dict.c | 9 #include "../common/dictionary.h"
32 static BROTLI_INLINE size_t DictMatchLength(const BrotliDictionary* dictionary, in DictMatchLength() argument
37 const size_t offset = dictionary->offsets_by_length[len] + len * id; in DictMatchLength()
38 return FindMatchLengthWithLimit(&dictionary->data[offset], data, in DictMatchLength()
42 static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary, in IsMatch() argument
47 const size_t offset = dictionary->offsets_by_length[w.len] + in IsMatch()
49 const uint8_t* dict = &dictionary->data[offset]; in IsMatch()
51 /* Match against base dictionary word. */ in IsMatch()
77 /* Finds matches for a single static dictionary */
79 const BrotliEncoderDictionary* dictionary, const uint8_t* data, in BrotliFindAllStaticDictionaryMatchesFor() argument
[all …]
|
| /third_party/ffmpeg/libavutil/ |
| D | dict.h | 21 * Public dictionary API.
44 * av_dict_set(). NULL can be used as an empty dictionary wherever
47 * entries and finally av_dict_free() to free the dictionary
51 AVDictionary *d = NULL; // "create" an empty dictionary
68 #define AV_DICT_IGNORE_SUFFIX 2 /**< Return first entry in a dictionary whose first part corres…
77 #define AV_DICT_MULTIKEY 64 /**< Allow to store several equal keys in the dictionary */
87 * Get a dictionary entry with matching key.
92 * To iterate through all the dictionary entries, you can set the matching key
99 * @return found entry or NULL in case no matching entry was found in the dictionary
105 * Get number of entries in dictionary.
[all …]
|
| /third_party/brotli/c/common/ |
| D | dictionary.h | 7 /* Collection of static dictionary words. */
21 * Number of bits to encode index of dictionary word in a bucket.
23 * Specification: Appendix A. Static Dictionary Data
25 * Words in a dictionary are bucketed by length.
27 * Dictionary consists of words with length of [4..24] bytes.
39 Specified size matches default (RFC 7932) dictionary. Its size is
47 * Sets dictionary data.
49 * When dictionary data is already set / present, this method is no-op.
51 * Dictionary data MUST be provided before BrotliGetDictionary is invoked.
53 * to reduce storage by sharing single dictionary between implementations.
|
| /third_party/skia/third_party/externals/brotli/c/common/ |
| D | dictionary.h | 7 /* Collection of static dictionary words. */
21 * Number of bits to encode index of dictionary word in a bucket.
23 * Specification: Appendix A. Static Dictionary Data
25 * Words in a dictionary are bucketed by length.
27 * Dictionary consists of words with length of [4..24] bytes.
39 Specified size matches default (RFC 7932) dictionary. Its size is
47 * Sets dictionary data.
49 * When dictionary data is already set / present, this method is no-op.
51 * Dictionary data MUST be provided before BrotliGetDictionary is invoked.
53 * to reduce storage by sharing single dictionary between implementations.
|
| /third_party/mindspore/mindspore-src/source/tests/ut/python/dataset/ |
| D | test_datasets_lsun.py | 42 # each data is a dictionary
44 # in this example, each dictionary has keys "image" and "label"
68 # each data is a dictionary
70 # in this example, each dictionary has keys "image" and "label"
112 # each data is a dictionary
114 # in this example, each dictionary has keys "image" and "label"
137 # each data is a dictionary
139 # in this example, each dictionary has keys "image" and "label"
162 # each data is a dictionary
164 # in this example, each dictionary has keys "image" and "label"
[all …]
|
| D | test_datasets_lfw.py | 39 # each data is a dictionary.
41 # in this example, each dictionary has keys "image" and "label".
65 # each data is a dictionary.
67 # in this example, each dictionary has keys "image" and "label".
92 # each data is a dictionary.
94 # in this example, each dictionary has keys "image" and "label".
118 # each data is a dictionary.
120 # in this example, each dictionary has keys "image" and "label".
144 # each data is a dictionary.
146 # in this example, each dictionary has keys "image" and "label".
[all …]
|
| /third_party/skia/third_party/externals/brotli/scripts/dictionary/ |
| D | step-02-rfc-to-bin.py | 3 # Static dictionary is described in "Appendix A" section in a hexadecimal form.
4 # This tool locates dictionary data in RFC and converts it to raw binary format.
16 dictionary = [] variable
22 dictionary.append(int(data[2 * i : 2 * i + 2], 16))
23 if len(dictionary) == 122784:
29 bin_path = "dictionary.bin"
32 output.write(bytearray(dictionary))
34 print("Parsed and saved " + str(len(dictionary)) + " bytes to " + bin_path)
|
| /third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/ |
| D | MapFieldTest.cs | 302 IDictionary dictionary = map; in IDictionary_Add()
303 dictionary.Add("a", "b"); in IDictionary_Add()
305 Assert.Throws<ArgumentException>(() => dictionary.Add("a", "duplicate")); in IDictionary_Add()
306 Assert.Throws<InvalidCastException>(() => dictionary.Add(new object(), "key is bad")); in IDictionary_Add()
307 Assert.Throws<InvalidCastException>(() => dictionary.Add("value is bad", new object())); in IDictionary_Add()
314 IDictionary dictionary = map; in IDictionary_Contains()
316 Assert.IsFalse(dictionary.Contains("a")); in IDictionary_Contains()
317 Assert.IsFalse(dictionary.Contains(5)); in IDictionary_Contains()
319 Assert.IsFalse(dictionary.Contains(new DictionaryEntry("x", "y"))); in IDictionary_Contains()
320 Assert.IsTrue(dictionary.Contains("x")); in IDictionary_Contains()
[all …]
|
| /third_party/skia/third_party/externals/brotli/java/org/brotli/dec/ |
| D | Dictionary.java | 12 * Collection of static dictionary words.
14 * <p>Dictionary content is loaded from binary resource when {@link #getData()} is executed for the
15 * first time. Consequently, it saves memory and CPU in case dictionary is not required.
17 * <p>One possible drawback is that multiple threads that need dictionary data may be blocked (only
20 public final class Dictionary { class
34 Class.forName(Dictionary.class.getPackage().getName() + ".DictionaryData");
56 int[] dictionaryOffsets = Dictionary.offsets; in setData()
57 int[] dictionarySizeBits = Dictionary.sizeBits; in setData()
80 Dictionary.data = data; in setData()
88 throw new BrotliRuntimeException("brotli dictionary is not set"); in getData()
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| D | dictbe.h | 31 * dictionary to determine language-specific breaks.</p>
93 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
96 * @param rangeStart The start of the range of dictionary characters
97 * @param rangeEnd The end of the range of dictionary characters
114 * dictionary and heuristics to determine Thai-specific breaks.</p>
150 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
153 * @param rangeStart The start of the range of dictionary characters
154 * @param rangeEnd The end of the range of dictionary characters
171 * dictionary and heuristics to determine Lao-specific breaks.</p>
206 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
[all …]
|
| /third_party/skia/m133/third_party/externals/icu/source/common/ |
| D | dictbe.h | 34 * dictionary to determine language-specific breaks.</p>
100 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
103 * @param rangeStart The start of the range of dictionary characters
104 * @param rangeEnd The end of the range of dictionary characters
124 * dictionary and heuristics to determine Thai-specific breaks.</p>
159 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
162 * @param rangeStart The start of the range of dictionary characters
163 * @param rangeEnd The end of the range of dictionary characters
183 * dictionary and heuristics to determine Lao-specific breaks.</p>
217 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
[all …]
|
| /third_party/icu/icu4c/source/common/ |
| D | dictbe.h | 32 * dictionary to determine language-specific breaks.</p>
97 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
100 * @param rangeStart The start of the range of dictionary characters
101 * @param rangeEnd The end of the range of dictionary characters
121 * dictionary and heuristics to determine Thai-specific breaks.</p>
156 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
159 * @param rangeStart The start of the range of dictionary characters
160 * @param rangeEnd The end of the range of dictionary characters
180 * dictionary and heuristics to determine Lao-specific breaks.</p>
214 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
[all …]
|
| /third_party/skia/third_party/externals/brotli/java/org/brotli/wrapper/common/ |
| D | BrotliCommon.java | 40 * Checks if the given checksum matches MD5 checksum of the RFC dictionary.
47 * Checks if the given checksum matches SHA-1 checksum of the RFC dictionary.
54 * Checks if the given checksum matches SHA-256 checksum of the RFC dictionary.
72 * Copies data and sets it to be brotli dictionary.
76 throw new IllegalArgumentException("invalid dictionary size"); in setDictionaryData()
87 * Reads data and sets it to be brotli dictionary.
99 throw new IllegalArgumentException("invalid dictionary size"); in setDictionaryData()
104 throw new IllegalArgumentException("invalid dictionary size " + copy.remaining()); in setDictionaryData()
111 * Sets data to be brotli dictionary.
118 throw new IllegalArgumentException("invalid dictionary size"); in setDictionaryData()
[all …]
|