HomeSort by relevance Sort by last modified time
    Searched defs:dict (Results 26 - 50 of 389) sorted by null

12 3 4 5 6 7 8 91011>>

  /packages/inputmethods/LatinIME/tools/dicttool/src/com/android/inputmethod/latin/dicttool/
Info.java 39 private static void showInfo(final FusionDictionary dict, final boolean plumbing) {
41 System.out.print(dict.mOptions.toString(2, plumbing));
46 for (final WordProperty wordProperty : dict) {
67 private static void showWordInfo(final FusionDictionary dict, final String word) {
68 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
120 final FusionDictionary dict = BinaryDictOffdeviceUtils.getDictionary(filename, local
123 showInfo(dict, plumbing);
126 showWordInfo(dict, mArgs[i]);
CombinedInputOutput.java 94 final FusionDictionary dict = local
109 dict.add(word, probabilityInfo, shortcuts.isEmpty() ? null : shortcuts,
112 dict.setBigram(word, s.mWord, s.mProbabilityInfo);
203 dict.add(word, probabilityInfo, shortcuts.isEmpty() ? null : shortcuts, isNotAWord,
206 dict.setBigram(word, s.mWord, s.mProbabilityInfo);
210 return dict;
217 * @param dict the dictionary to write.
220 final FusionDictionary dict) throws IOException {
222 for (final WordProperty wordProperty : dict) {
226 destination.write(CombinedFormatUtils.formatAttributeMap(dict.mOptions.mAttributes))
    [all...]
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/
OpenWnnClauseConverterJAJP.java 85 * @param dict The dictionary for phrase conversion
87 public void setDictionary(WnnDictionary dict) {
89 mConnectMatrix = dict.getConnectMatrix();
92 mDictionary = dict;
93 dict.clearDictionary();
94 dict.clearApproxPattern();
102 mPosDefault = dict.getPOS(WnnDictionary.POS_TYPE_MEISI);
103 mPosEndOfClause1 = dict.getPOS(WnnDictionary.POS_TYPE_V1);
104 mPosEndOfClause2 = dict.getPOS(WnnDictionary.POS_TYPE_V2);
105 mPosEndOfClause3 = dict.getPOS(WnnDictionary.POS_TYPE_V3)
409 WnnDictionary dict = mDictionary; local
469 WnnDictionary dict = mDictionary; local
    [all...]
  /device/google/marlin/dataservices/datatop/src/
datatop_dual_line_poll.c 84 struct dt_procdict *dict = malloc(sizeof(struct dt_procdict) local
126 &dict[i]);
140 &dict[k]);
141 if (i >= 0 && i < dict[k].max &&
146 dict[k].val[i]);
153 free(dict);
225 struct dt_procdict *dict, *prefix_dict; local
235 dict = malloc(sizeof(struct dt_procdict) * (storage->line_count/2));
263 storage->line[(2*i)+1], line_len[(2*i)+1], &dict[i]);
271 for (i = 0; i < dict[j].max; i++
    [all...]
datatop_meminfo_file_poll.c 70 * @param dict Dictionary the keys and values are added to.
73 int l, struct dt_procdict *dict)
79 if (line1 == 0 || dict == 0)
83 dict->key[k] = &line1[0];
90 dict->val[k] = &line1[n];
98 dict->max = k;
116 struct dt_procdict dict; local
141 (dpg->priv))->line[i], line_len[i], i, &dict);
145 i = dt_find_dict_idx(dpg->data_points[j].name, &dict);
146 if (i >= 0 && i < dict.max)
225 struct dt_procdict dict; local
    [all...]
datatop_single_line_poll.c 77 struct dt_procdict dict; local
103 (dpg->priv))->line[i], line_len[i], i, &dict);
107 i = dt_find_dict_idx(dpg->data_points[j].name, &dict);
108 if (i >= 0 && i < dict.max)
110 dict.val[i]);
180 struct dt_procdict dict; local
205 line_len[i], i, &dict);
212 for (i = 0; i < dict.max; i++) {
213 if (dict.val[i][0] == '-')
217 data_points[i].name = dict.key[i]
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/
moduleobject.c 157 PyObject *dict, *name = Py_None, *doc = Py_None; local
161 dict = m->md_dict;
162 if (dict == NULL) {
163 dict = PyDict_New();
164 if (dict == NULL)
166 m->md_dict = dict;
168 if (PyDict_SetItemString(dict, "__name__", name) < 0)
170 if (PyDict_SetItemString(dict, "__doc__", doc) < 0)
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_mutants.py 5 # From SF bug #422121: Insecurities in dict comparison.
23 # So the dict comparison test here uses a black-box approach instead,
35 # lists to make it easy to pick a dict key at random.
42 # If global mutate is true, consider mutating a dict. May or may not
43 # mutate a dict even if mutate is true. If it does decide to mutate a
44 # dict, it picks one of {dict1, dict2} at random, and deletes a random
108 # Fill dict d with numentries (Horrid(i), Horrid(j)) key-value pairs,
120 # Note that dict comparison is trivial if they don't have the same number
121 # of entires (then the "shorter" dict is instantly considered to be the
197 dict = {} variable
229 dict = {} variable
255 dict = {} variable
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/
moduleobject.c 155 PyObject *dict, *name = Py_None, *doc = Py_None; local
159 dict = m->md_dict;
160 if (dict == NULL) {
161 dict = PyDict_New();
162 if (dict == NULL)
164 m->md_dict = dict;
166 if (PyDict_SetItemString(dict, "__name__", name) < 0)
168 if (PyDict_SetItemString(dict, "__doc__", doc) < 0)
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ACBTree.h 41 __strong AMutableDictionary *dict; /* The dictionary that this node belongs to */ variable
59 @property (retain) AMutableDictionary *dict; variable
  /external/autotest/client/site_tests/graphics_dEQP/scripts/
failure_matrix.py 64 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/brotli/c/enc/
static_dict.c 53 const uint8_t* dict = &dictionary->data[offset]; local
57 TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len);
61 return TO_BROTLI_BOOL(dict[0] >= 'a' && dict[0] <= 'z' &&
62 (dict[0] ^ 32) == data[0] &&
63 FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) ==
70 if (dict[i] >= 'a' && dict[i] <= 'z') {
71 if ((dict[i] ^ 32) != data[i]) return BROTLI_FALSE;
73 if (dict[i] != data[i]) return BROTLI_FALSE
    [all...]
  /external/freetype/src/cid/
cidobjs.c 143 CID_FaceDict dict = face->cid.font_dicts + face->root.face_index; local
144 PS_Private priv = &dict->private_dict;
  /external/google-breakpad/src/common/
simple_string_dictionary_unittest.cc 65 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.RemoveKey("key3")
128 SimpleStringDictionary* dict = new SimpleStringDictionary(); local
    [all...]
  /external/libchrome/base/json/
json_value_converter_unittest.cc 50 const base::DictionaryValue* dict = NULL; local
51 if (!value->GetAsDictionary(&dict))
54 if (!dict->GetString("val", result))
  /external/libchrome/base/trace_event/
trace_config_unittest.cc 288 DictionaryValue dict; local
289 TraceConfig tc_dict(dict);
337 DictionaryValue dict; local
338 TraceConfig tc(dict);
  /external/libxml2/
testdict.c 3 #include <libxml/dict.h>
151 xmlDictPtr dict; local
157 dict = xmlDictCreateSub(parent);
158 if (dict == NULL) {
171 test2[i] = xmlDictLookup(dict, strings2[i], -1);
181 test2[j] = xmlDictLookup(dict, strings2[j], xmlStrlen(strings2[j]));
191 test2[j] = xmlDictLookup(dict, strings2[j], xmlStrlen(strings2[j]));
207 test2[i] = xmlDictLookup(dict, strings2[i], -1);
217 * the dict, and that none of them was actually allocated in the parent
220 if (!xmlDictOwns(dict, test2[i]))
314 xmlDictPtr dict; local
    [all...]
  /external/ppp/pppd/plugins/radius/
dict.c 2 * $Id: dict.c,v 1.1 2004/11/14 07:26:26 paulus Exp $
298 VENDOR_DICT *dict; local
309 dict = rc_dict_getvendor(vendor);
310 if (!dict) {
313 attr = dict->attributes;
335 VENDOR_DICT *dict; local
348 dict = vendor_dictionaries;
349 while (dict) {
350 attr = dict->attributes;
357 dict = dict->next
420 VENDOR_DICT *dict; local
440 VENDOR_DICT *dict; local
    [all...]
  /external/python/cpython2/Lib/multiprocessing/dummy/
__init__.py 125 dict = dict variable
  /external/python/cpython2/Lib/test/
test_mutants.py 5 # From SF bug #422121: Insecurities in dict comparison.
23 # So the dict comparison test here uses a black-box approach instead,
35 # lists to make it easy to pick a dict key at random.
42 # If global mutate is true, consider mutating a dict. May or may not
43 # mutate a dict even if mutate is true. If it does decide to mutate a
44 # dict, it picks one of {dict1, dict2} at random, and deletes a random
108 # Fill dict d with numentries (Horrid(i), Horrid(j)) key-value pairs,
120 # Note that dict comparison is trivial if they don't have the same number
121 # of entires (then the "shorter" dict is instantly considered to be the
197 dict = { variable
229 dict = {} variable
255 dict = {} variable
    [all...]
  /external/python/cpython2/Objects/
moduleobject.c 157 PyObject *dict, *name = Py_None, *doc = Py_None; local
161 dict = m->md_dict;
162 if (dict == NULL) {
163 dict = PyDict_New();
164 if (dict == NULL)
166 m->md_dict = dict;
168 if (PyDict_SetItemString(dict, "__name__", name) < 0)
170 if (PyDict_SetItemString(dict, "__doc__", doc) < 0)
  /external/python/cpython3/Lib/multiprocessing/dummy/
__init__.py 91 dict = dict variable
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
DictionaryCollection.java 119 for (final Dictionary dict : mDictionaries)
120 dict.close();
133 public void removeDictionary(final Dictionary dict) {
134 if (mDictionaries.contains(dict)) {
135 mDictionaries.remove(dict);
137 Log.w(TAG, "This collection does not contain this dictionary: " + dict);
  /prebuilts/gdb/darwin-x86/lib/python2.7/multiprocessing/dummy/
__init__.py 125 dict = dict variable
  /prebuilts/gdb/darwin-x86/lib/python2.7/test/
test_mutants.py 5 # From SF bug #422121: Insecurities in dict comparison.
23 # So the dict comparison test here uses a black-box approach instead,
35 # lists to make it easy to pick a dict key at random.
42 # If global mutate is true, consider mutating a dict. May or may not
43 # mutate a dict even if mutate is true. If it does decide to mutate a
44 # dict, it picks one of {dict1, dict2} at random, and deletes a random
108 # Fill dict d with numentries (Horrid(i), Horrid(j)) key-value pairs,
120 # Note that dict comparison is trivial if they don't have the same number
121 # of entires (then the "shorter" dict is instantly considered to be the
197 dict = { variable
229 dict = {} variable
255 dict = {} variable
    [all...]

Completed in 535 milliseconds

12 3 4 5 6 7 8 91011>>