Searched refs:dict (Results 1 - 25 of 1453) sorted by relevance

1234567891011>>

/external/libxml2/
H A Ddict.c2 * dict.c: dictionary of reusable strings, just used to avoid allocation
36 * Note2: the fast function used for a small dict won't protect very
56 #include <libxml/dict.h>
70 #define xmlDictComputeKey(dict, name, len) \
71 (((dict)->size == MIN_DICT_SIZE) ? \
72 xmlDictComputeFastKey(name, len, (dict)->seed) : \
73 xmlDictComputeBigKey(name, len, (dict)->seed))
75 #define xmlDictComputeQKey(dict, prefix, plen, name, len) \
77 (xmlDictComputeKey(dict, name, len)) : \
78 (((dict)
118 struct _xmlDictEntry *dict; member in struct:_xmlDict
241 xmlDictAddString(xmlDictPtr dict, const xmlChar *name, unsigned int namelen) argument
305 xmlDictAddQString(xmlDictPtr dict, const xmlChar *prefix, unsigned int plen, const xmlChar *name, unsigned int namelen) argument
569 xmlDictPtr dict; local
616 xmlDictPtr dict = xmlDictCreate(); local
638 xmlDictReference(xmlDictPtr dict) argument
660 xmlDictGrow(xmlDictPtr dict, size_t size) argument
793 xmlDictFree(xmlDictPtr dict) argument
858 xmlDictLookup(xmlDictPtr dict, const xmlChar *name, int len) argument
998 xmlDictExists(xmlDictPtr dict, const xmlChar *name, int len) argument
1106 xmlDictQLookup(xmlDictPtr dict, const xmlChar *prefix, const xmlChar *name) argument
1211 xmlDictOwns(xmlDictPtr dict, const xmlChar *str) argument
1237 xmlDictSize(xmlDictPtr dict) argument
1256 xmlDictSetLimit(xmlDictPtr dict, size_t limit) argument
1276 xmlDictGetUsage(xmlDictPtr dict) argument
[all...]
/external/skia/tests/
H A DRefDictTest.cpp20 SkRefDict dict; local
22 REPORTER_ASSERT(reporter, nullptr == dict.find(nullptr));
23 REPORTER_ASSERT(reporter, nullptr == dict.find("foo"));
24 REPORTER_ASSERT(reporter, nullptr == dict.find("bar"));
26 dict.set("foo", &data0);
27 REPORTER_ASSERT(reporter, &data0 == dict.find("foo"));
30 dict.set("foo", &data0);
31 REPORTER_ASSERT(reporter, &data0 == dict.find("foo"));
34 dict.set("foo", &data1);
35 REPORTER_ASSERT(reporter, &data1 == dict
[all...]
/external/skqp/tests/
H A DRefDictTest.cpp20 SkRefDict dict; local
22 REPORTER_ASSERT(reporter, nullptr == dict.find(nullptr));
23 REPORTER_ASSERT(reporter, nullptr == dict.find("foo"));
24 REPORTER_ASSERT(reporter, nullptr == dict.find("bar"));
26 dict.set("foo", &data0);
27 REPORTER_ASSERT(reporter, &data0 == dict.find("foo"));
30 dict.set("foo", &data0);
31 REPORTER_ASSERT(reporter, &data0 == dict.find("foo"));
34 dict.set("foo", &data1);
35 REPORTER_ASSERT(reporter, &data1 == dict
[all...]
/external/python/cpython2/Lib/test/crashers/
H A Dnasty_eq_vs_dict.py22 # leave dict alone
37 dict.clear()
39 dict[i] = i
40 dict[self] = "OK!"
43 dict = {y: "OK!"} variable
47 print dict[z]
/external/libxml2/os400/
H A Dtranscode.h13 #include <libxml/dict.h>
16 XMLPUBFUN void xmlZapDict(xmlDictPtr * dict);
18 const char * encoding, xmlDictPtr * dict,
21 const char * encoding, xmlDictPtr * dict);
23 const char * encoding, xmlDictPtr * dict);
25 const char * encoding, xmlDictPtr * dict);
40 XMLPUBFUN const char * xmlVasprintf(xmlDictPtr * dict, const char * encoding,
H A Dtranscode.c15 #include "libxml/dict.h"
24 xmlZapDict(xmlDictPtr * dict) argument
27 if (dict && *dict) {
28 xmlDictFree(*dict);
29 *dict = (xmlDictPtr) NULL;
47 xmlDictPtr * dict, void (*freeproc)(const void *))
71 if (!l && dict)
74 if (dict && !*dict)
46 xmlTranscodeResult(const xmlChar * s, const char * encoding, xmlDictPtr * dict, void (*freeproc)(const void *)) argument
136 inTranscode(const char * s, size_t l, const char * encoding, xmlDictPtr * dict) argument
205 xmlTranscodeString(const char * s, const char * encoding, xmlDictPtr * dict) argument
220 xmlTranscodeWString(const char * s, const char * encoding, xmlDictPtr * dict) argument
240 xmlTranscodeHString(const char * s, const char * encoding, xmlDictPtr * dict) argument
260 xmlVasprintf(xmlDictPtr * dict, const char * encoding, const xmlChar * fmt, va_list args) argument
[all...]
/external/autotest/client/site_tests/graphics_dEQP/scripts/
H A Dfailure_matrix.py64 def get_problem_count(dict, gpu):
65 if gpu in dict:
66 if not dict[gpu]:
69 for status in dict[gpu]:
71 count = count + len((dict[gpu])[status])
78 if status in dict[gpu]:
79 count = count + len((dict[gpu])[status])
81 print 'Warning: %s not found in dict!' % gpu
85 def get_problem_tests(dict):
87 for gpu in dict
109 dict = {} variable
[all...]
/external/python/cpython2/Mac/scripts/
H A Dmkestrres.py52 def writepython(fp, dict):
53 k = dict.keys()
56 fp.write("%s\t=\t%d\t#%s\n"%(dict[i][1], i, dict[i][0]))
59 def parse_errno_h(fp, dict):
68 if not dict.has_key(number):
69 dict[number] = desc, name
72 print '\t', dict[number]
75 def parse_errors_h(fp, dict):
95 if not dict
[all...]
/external/python/cpython2/Lib/
H A Dshelve.py76 'Marker for a closed dict. Access attempts raise a ValueError.'
92 def __init__(self, dict, protocol=None, writeback=False):
93 self.dict = dict
101 return self.dict.keys()
104 return len(self.dict)
107 return key in self.dict
110 return key in self.dict
113 if key in self.dict:
121 f = StringIO(self.dict[ke
[all...]
/external/skia/src/pdf/
H A DSkPDFFormXObject.cpp18 form->dict()->insertName("Type", "XObject");
19 form->dict()->insertName("Subtype", "Form");
22 form->dict()->insertObject("Matrix", std::move(mat));
24 form->dict()->insertObject("Resources", std::move(resourceDict));
25 form->dict()->insertObject("BBox", std::move(mediaBox));
37 form->dict()->insertObject("Group", std::move(group));
/external/skqp/src/pdf/
H A DSkPDFFormXObject.cpp18 form->dict()->insertName("Type", "XObject");
19 form->dict()->insertName("Subtype", "Form");
22 form->dict()->insertObject("Matrix", std::move(mat));
24 form->dict()->insertObject("Resources", std::move(resourceDict));
25 form->dict()->insertObject("BBox", std::move(mediaBox));
37 form->dict()->insertObject("Group", std::move(group));
/external/libxml2/include/libxml/
H A Ddict.h45 xmlDictSetLimit (xmlDictPtr dict,
48 xmlDictGetUsage (xmlDictPtr dict);
52 xmlDictReference(xmlDictPtr dict);
54 xmlDictFree (xmlDictPtr dict);
60 xmlDictLookup (xmlDictPtr dict,
64 xmlDictExists (xmlDictPtr dict,
68 xmlDictQLookup (xmlDictPtr dict,
72 xmlDictOwns (xmlDictPtr dict,
75 xmlDictSize (xmlDictPtr dict);
/external/autotest/frontend/migrations/
H A D044_rename_afe_tables.py27 RENAMES_UP = dict((name, 'afe_' + name) for name in ORIG_NAMES)
29 RENAMES_DOWN = dict((value, key) for key, value in RENAMES_UP.iteritems())
/external/swiftshader/third_party/LLVM/utils/
H A Dllvmbuild256 abbrevs = dict(zip(paths, [base for base in unique_bases]))
292 abbrevs = dict(zip(unique_bases, abbrevs))
314 self.component_abbrev = dict(
415 configure_flags = dict(
416 llvm=dict(debug=["--prefix=" + self.install_prefix,
434 llvm_gcc=dict(debug=["--prefix=" + self.install_prefix,
454 llvm2=dict(debug=["--prefix=" + self.install_prefix,
475 gcc=dict(debug=["--prefix=" + self.install_prefix,
480 dragonegg=dict(debug=[],
484 configure_env = dict(
[all...]
/external/e2fsprogs/lib/support/
H A Ddict.c17 * $Id: dict.c,v 1.40.2.7 2000/11/13 01:36:44 kaz Exp $
39 #include "dict.h"
42 static const char rcsid[] = "$Id: dict.c,v 1.40.2.7 2000/11/13 01:36:44 kaz Exp $";
49 * program which uses dict to define, for instance, a macro called ``parent''.
144 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil) argument
148 free_nodes(dict, node->left, nil);
149 free_nodes(dict, node->right, nil);
150 dict->freenode(node, dict->context);
162 static int verify_bintree(dict_t *dict) argument
286 dict_set_allocator(dict_t *dict, dnode_alloc_t al, dnode_free_t fr, void *context) argument
303 dict_destroy(dict_t *dict) argument
315 dict_free_nodes(dict_t *dict) argument
328 dict_free(dict_t *dict) argument
341 dict_init(dict_t *dict, dictcount_t maxcount, dict_comp_t comp) argument
362 dict_init_like(dict_t *dict, const dict_t *template) argument
383 dict_clear(dict_t *dict) argument
401 dict_verify(dict_t *dict) argument
460 dict_lookup(dict_t *dict, const void *key) argument
499 dict_lower_bound(dict_t *dict, const void *key) argument
531 dict_upper_bound(dict_t *dict, const void *key) argument
567 dict_insert(dict_t *dict, dnode_t *node, const void *key) argument
665 dict_delete(dict_t *dict, dnode_t *delete) argument
840 dict_alloc_insert(dict_t *dict, const void *key, void *data) argument
853 dict_delete_free(dict_t *dict, dnode_t *node) argument
865 dict_first(dict_t *dict) argument
881 dict_last(dict_t *dict) argument
899 dict_next(dict_t *dict, dnode_t *curr) argument
925 dict_prev(dict_t *dict, dnode_t *curr) argument
946 dict_allow_dupes(dict_t *dict) argument
958 dict_count(dict_t *dict) argument
963 dict_isempty(dict_t *dict) argument
968 dict_isfull(dict_t *dict) argument
973 dict_contains(dict_t *dict, dnode_t *node) argument
1040 dict_process(dict_t *dict, void *context, dnode_process_t function) argument
1054 load_begin_internal(dict_load_t *load, dict_t *dict) argument
1061 dict_load_begin(dict_load_t *load, dict_t *dict) argument
1069 dict_t *dict = load->dictptr; local
1093 dict_t *dict = load->dictptr; local
[all...]
/external/f2fs-tools/fsck/
H A Ddict.c17 * $Id: dict.c,v 1.40.2.7 2000/11/13 01:36:44 kaz Exp $
33 #include "dict.h"
37 static const char rcsid[] = "$Id: dict.c,v 1.40.2.7 2000/11/13 01:36:44 kaz Exp $";
44 * program which uses dict to define, for instance, a macro called ``parent''.
136 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil) argument
140 free_nodes(dict, node->left, nil);
141 free_nodes(dict, node->right, nil);
142 dict->freenode(node, dict->context);
154 static int verify_bintree(dict_t *dict) argument
272 dict_set_allocator(dict_t *dict, dnode_alloc_t al, dnode_free_t fr, void *context) argument
288 dict_destroy(dict_t *dict) argument
299 dict_free_nodes(dict_t *dict) argument
312 dict_free(dict_t *dict) argument
324 dict_init(dict_t *dict, dictcount_t maxcount, dict_comp_t comp) argument
344 dict_init_like(dict_t *dict, const dict_t *template) argument
364 dict_clear(dict_t *dict) argument
381 dict_verify(dict_t *dict) argument
439 dict_lookup(dict_t *dict, const void *key) argument
477 dict_lower_bound(dict_t *dict, const void *key) argument
508 dict_upper_bound(dict_t *dict, const void *key) argument
543 dict_insert(dict_t *dict, dnode_t *node, const void *key) argument
640 dict_delete(dict_t *dict, dnode_t *delete) argument
814 dict_alloc_insert(dict_t *dict, const void *key, void *data) argument
827 dict_delete_free(dict_t *dict, dnode_t *node) argument
838 dict_first(dict_t *dict) argument
853 dict_last(dict_t *dict) argument
870 dict_next(dict_t *dict, dnode_t *curr) argument
895 dict_prev(dict_t *dict, dnode_t *curr) argument
916 dict_allow_dupes(dict_t *dict) argument
928 dict_count(dict_t *dict) argument
933 dict_isempty(dict_t *dict) argument
938 dict_isfull(dict_t *dict) argument
943 dict_contains(dict_t *dict, dnode_t *node) argument
1010 dict_process(dict_t *dict, void *context, dnode_process_t function) argument
1024 load_begin_internal(dict_load_t *load, dict_t *dict) argument
1031 dict_load_begin(dict_load_t *load, dict_t *dict) argument
1039 dict_t *dict = load->dictptr; local
1063 dict_t *dict = load->dictptr; local
[all...]
H A Dmkquota.c21 #include "dict.h"
45 static void write_dquots(dict_t *dict, struct quota_handle *qh) argument
50 for (n = dict_first(dict); n; n = dict_next(dict, n)) {
68 dict_t *dict; local
79 dict = qctx->quota_dict[qtype];
80 if (dict) {
85 write_dquots(dict, h);
146 dict_t *dict; local
162 err = quota_get_mem(sizeof(dict_t), &dict);
179 dict_t *dict; local
200 get_dq(dict_t *dict, __u32 key) argument
226 dict_t *dict; local
248 dict_t *dict; local
269 dict_t *dict; enum quota_type qtype; local
367 dict_t *dict = qctx->quota_dict[qtype]; local
[all...]
/external/xz-embedded/linux/lib/xz/
H A Dxz_dec_lzma2.c264 struct dictionary dict; member in struct:xz_dec_lzma2
286 static void dict_reset(struct dictionary *dict, struct xz_buf *b) argument
288 if (DEC_IS_SINGLE(dict->mode)) {
289 dict->buf = b->out + b->out_pos;
290 dict->end = b->out_size - b->out_pos;
293 dict->start = 0;
294 dict->pos = 0;
295 dict->limit = 0;
296 dict->full = 0;
300 static void dict_limit(struct dictionary *dict, size_ argument
309 dict_has_space(const struct dictionary *dict) argument
320 dict_get(const struct dictionary *dict, uint32_t dist) argument
333 dict_put(struct dictionary *dict, uint8_t byte) argument
346 dict_repeat(struct dictionary *dict, uint32_t *len, uint32_t dist) argument
374 dict_uncompressed(struct dictionary *dict, struct xz_buf *b, uint32_t *left) argument
416 dict_flush(struct dictionary *dict, struct xz_buf *b) argument
[all...]
/external/tensorflow/tensorflow/examples/get_started/regression/
H A Dtest.py69 @test.mock.patch.dict(data.__dict__,
71 @test.mock.patch.dict(imports85.__dict__, {"_get_imports85": (lambda: None)})
72 @test.mock.patch.dict(linear_regression.__dict__, {"STEPS": 1})
76 @test.mock.patch.dict(data.__dict__,
78 @test.mock.patch.dict(imports85.__dict__, {"_get_imports85": (lambda: None)})
79 @test.mock.patch.dict(linear_regression_categorical.__dict__, {"STEPS": 1})
83 @test.mock.patch.dict(data.__dict__,
85 @test.mock.patch.dict(imports85.__dict__, {"_get_imports85": (lambda: None)})
86 @test.mock.patch.dict(dnn_regression.__dict__, {"STEPS": 1})
90 @test.mock.patch.dict(dat
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DArrayIterator.h59 + (ArrayIterator *) newIteratorForDictKey:(NSDictionary *)dict;
60 + (ArrayIterator *) newIteratorForDictObj:(NSDictionary *)dict;
63 - (id) initWithDictKey:(NSDictionary *)dict;
64 - (id) initWithDictObj:(NSDictionary *)dict;
/external/google-breakpad/src/common/
H A Dsimple_string_dictionary_unittest.cc65 SimpleStringDictionary dict; local
68 dict.SetKeyValue("key1", "value1");
69 dict.SetKeyValue("key2", "value2");
70 dict.SetKeyValue("key3", "value3");
72 EXPECT_NE(dict.GetValueForKey("key1"), "value1");
73 EXPECT_NE(dict.GetValueForKey("key2"), "value2");
74 EXPECT_NE(dict.GetValueForKey("key3"), "value3");
75 EXPECT_EQ(dict.GetCount(), 3u);
77 EXPECT_FALSE(dict.GetValueForKey("key4"));
80 dict
128 SimpleStringDictionary* dict = new SimpleStringDictionary(); local
[all...]
/external/markdown/markdown/extensions/
H A Dextra.py49 return ExtraExtension(configs=dict(configs))
/external/python/cpython2/Lib/test/leakers/
H A Dtest_dictself.py5 class LeakyDict(dict):
/external/python/cpython2/Lib/test/
H A Dtest_descrtut.py14 class defaultdict(dict):
16 dict.__init__(self)
21 return dict.__getitem__(self, key)
28 return dict.get(self, key, *args)
59 >>> a.merge({1:100, 2:200}) # use a dict method
104 class defaultdict2(dict):
108 dict.__init__(self)
113 return dict.__getitem__(self, key)
120 return dict.get(self, key, *args)
161 >>> isinstance([], dict)
[all...]
/external/python/cpython3/Lib/test/
H A Dtest_descrtut.py14 class defaultdict(dict):
16 dict.__init__(self)
21 return dict.__getitem__(self, key)
28 return dict.get(self, key, *args)
59 >>> a.merge({1:100, 2:200}) # use a dict method
102 class defaultdict2(dict):
106 dict.__init__(self)
111 return dict.__getitem__(self, key)
118 return dict.get(self, key, *args)
159 >>> isinstance([], dict)
[all...]

Completed in 1544 milliseconds

1234567891011>>