| /third_party/protobuf/objectivec/ |
| D | GPBDictionary.h | 60 /** Number of entries stored in this dictionary. */
64 * Initializes this dictionary, copying the given values and keys.
66 * @param values The values to be placed in this dictionary.
68 * @param count The number of elements to copy into the dictionary.
70 * @return A newly initialized dictionary with a copy of the values and keys.
77 * Initializes this dictionary, copying the entries from the given dictionary.
79 * @param dictionary Dictionary containing the entries to add to this dictionary.
81 * @return A newly initialized dictionary with the entries of the given dictionary.
83 - (instancetype)initWithDictionary:(GPBUInt32UInt32Dictionary *)dictionary;
86 * Initializes this dictionary with the requested capacity.
[all …]
|
| /third_party/boost/libs/unordered/doc/src_code/ |
| D | dictionary.cpp | 42 dictionary; in main() local
45 BOOST_TEST(dictionary.empty()); in main()
47 dictionary["one"] = 1; in main()
48 BOOST_TEST(dictionary.size() == 1); in main()
49 BOOST_TEST(dictionary.find("ONE") == dictionary.end()); in main()
51 dictionary.insert(std::make_pair("ONE", 2)); in main()
52 BOOST_TEST(dictionary.size() == 2); in main()
53 BOOST_TEST(dictionary.find("ONE") != dictionary.end() && in main()
54 dictionary.find("ONE")->first == "ONE" && in main()
55 dictionary.find("ONE")->second == 2); in main()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | intersectionsAndEmptyObjects.types | 63 type Dictionary = { [name: string]: string };
64 >Dictionary : Dictionary
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 | 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 | 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/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/python/Doc/c-api/ |
| D | dict.rst | 5 Dictionary Objects
8 .. index:: 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/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/ |
| D | MapFieldTest.cs | 315 IDictionary dictionary = map; in IDictionary_Add()
316 dictionary.Add("a", "b"); in IDictionary_Add()
318 Assert.Throws<ArgumentException>(() => dictionary.Add("a", "duplicate")); in IDictionary_Add()
319 Assert.Throws<InvalidCastException>(() => dictionary.Add(new object(), "key is bad")); in IDictionary_Add()
320 Assert.Throws<InvalidCastException>(() => dictionary.Add("value is bad", new object())); in IDictionary_Add()
327 IDictionary dictionary = map; in IDictionary_Contains()
329 Assert.IsFalse(dictionary.Contains("a")); in IDictionary_Contains()
330 Assert.IsFalse(dictionary.Contains(5)); in IDictionary_Contains()
332 Assert.IsFalse(dictionary.Contains(new DictionaryEntry("x", "y"))); in IDictionary_Contains()
333 Assert.IsTrue(dictionary.Contains("x")); in IDictionary_Contains()
[all …]
|
| /third_party/ffmpeg/libavutil/ |
| D | dict.h | 21 * Public dictionary API.
46 * av_dict_set(). NULL can be used as an empty dictionary wherever
49 * entries and finally av_dict_free() to free the dictionary
53 AVDictionary *d = NULL; // "create" an empty dictionary
70 #define AV_DICT_IGNORE_SUFFIX 2 /**< Return first entry in a dictionary whose first part corres…
79 #define AV_DICT_MULTIKEY 64 /**< Allow to store several equal keys in the dictionary */
89 * Get a dictionary entry with matching key.
94 * To iterate through all the dictionary entries, you can set the matching key
101 * @return found entry or NULL in case no matching entry was found in the dictionary
107 * Get number of entries in dictionary.
[all …]
|
| /third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/ |
| D | MapFieldTest.cs | 316 IDictionary dictionary = map; in IDictionary_Add()
317 dictionary.Add("a", "b"); in IDictionary_Add()
319 Assert.Throws<ArgumentException>(() => dictionary.Add("a", "duplicate")); in IDictionary_Add()
320 Assert.Throws<InvalidCastException>(() => dictionary.Add(new object(), "key is bad")); in IDictionary_Add()
321 Assert.Throws<InvalidCastException>(() => dictionary.Add("value is bad", new object())); in IDictionary_Add()
328 IDictionary dictionary = map; in IDictionary_Contains()
330 Assert.IsFalse(dictionary.Contains("a")); in IDictionary_Contains()
331 Assert.IsFalse(dictionary.Contains(5)); in IDictionary_Contains()
333 Assert.IsFalse(dictionary.Contains(new DictionaryEntry("x", "y"))); in IDictionary_Contains()
334 Assert.IsTrue(dictionary.Contains("x")); in IDictionary_Contains()
[all …]
|
| /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/node/deps/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/tests/ut/python/dataset/ |
| D | test_datasets_imagefolder.py | 33 for item in data1.create_dict_iterator(num_epochs=1): # each data is a dictionary
34 # in this example, each dictionary has keys "image" and "label"
53 for item in data1.create_dict_iterator(num_epochs=1): # each data is a dictionary
54 # in this example, each dictionary has keys "image" and "label"
91 for item in data1.create_dict_iterator(num_epochs=1): # each data is a dictionary
92 # in this example, each dictionary has keys "image" and "label"
111 for item in data1.create_dict_iterator(num_epochs=1): # each data is a dictionary
112 # in this example, each dictionary has keys "image" and "label"
131 for item in data1.create_dict_iterator(num_epochs=1): # each data is a dictionary
132 # 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/boost/libs/multi_index/example/ |
| D | bimap.cpp | 89 /* a dictionary is a bidirectional map from strings to strings */
91 typedef bidirectional_map<std::string,std::string>::type dictionary; typedef
95 dictionary d; in main()
101 d.insert(dictionary::value_type("hola","hello")); in main()
102 d.insert(dictionary::value_type("adios","goodbye")); in main()
103 d.insert(dictionary::value_type("rosa","rose")); in main()
104 d.insert(dictionary::value_type("mesa","table")); in main()
113 dictionary::iterator it=get<from>(d).find(word); in main()
118 nth_index<dictionary,1>::type::iterator it2=get<1>(d).find(word); in main()
122 else std::cout<<"No such word in the dictionary"<<std::endl; in main()
[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/icu/icu4c/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/node/deps/icu-small/source/common/ |
| D | dictbe.h | 31 * dictionary to determine language-specific breaks.</p>
95 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
98 * @param rangeStart The start of the range of dictionary characters
99 * @param rangeEnd The end of the range of dictionary characters
118 * dictionary and heuristics to determine Thai-specific breaks.</p>
154 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
157 * @param rangeStart The start of the range of dictionary characters
158 * @param rangeEnd The end of the range of dictionary characters
177 * dictionary and heuristics to determine Lao-specific breaks.</p>
212 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
[all …]
|
| /third_party/flutter/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/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/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 …]
|
| /third_party/mindspore/tests/ut/python/dtype/ |
| D | test_dictionary.py | 38 def construct(self, dictionary): argument
39 a = self.max(dictionary["x"], dictionary["y"])
40 b = self.min(dictionary["x"], dictionary["y"])
43 …dictionary = {"x": Tensor(np.ones([3, 2, 3], np.float32)), "y": Tensor(np.ones([1, 2, 3], np.float…
47 net(dictionary)
58 …self.dictionary = {"x": Tensor(np.ones([3, 2, 3], np.float32)), "y": Tensor(np.ones([1, 2, 3], np.…
61 a = self.max(self.dictionary["x"], self.dictionary["y"])
62 b = self.min(self.dictionary["x"], self.dictionary["y"])
161 # if the dictionary item does not exist, create a new one
|
| /third_party/boost/libs/bimap/example/mi_to_b_path/ |
| D | mi_bidirectional_map.cpp | 58 // A dictionary is a bidirectional map from strings to strings
60 typedef bidirectional_map<std::string,std::string>::type dictionary; typedef
64 dictionary d; in main()
69 d.insert(dictionary::value_type("hola","hello")); in main()
70 d.insert(dictionary::value_type("adios","goodbye")); in main()
71 d.insert(dictionary::value_type("rosa","rose")); in main()
72 d.insert(dictionary::value_type("mesa","table")); in main()
80 dictionary::iterator it = d.get<from>().find(word); in main()
93 dictionary::index_iterator<to>::type it2 = d.get<to>().find(word); in main()
101 std::cout << "No such word in the dictionary" << std::endl; in main()
|