| /third_party/node/test/fixtures/ |
| H A D | tls-connect.js | 20 // Pre-load keys from common fixtures for ease of use by tests.
21 exports.keys = {
|
| /third_party/node/test/fixtures/wpt/common/ |
| H A D | PrefixedLocalStorage.js | 3 * by generating and using a unique prefix for keys. Why trounce on other
12 this.prefix = ''; // Prefix for localStorage keys
18 Object.keys(localStorage).forEach(sKey => {
|
| /third_party/node/benchmark/ |
| H A D | _cli.js | 91 this.items = Object.keys(benchmarks);
|
| /third_party/node/deps/acorn/acorn/dist/ |
| H A D | bin.js | 10 Object.keys(e).forEach(function (k) {
|
| /third_party/mesa3d/src/mapi/glapi/gen/ |
| H A D | gl_enums.py | 154 sorted_enum_values = sorted(self.enum_table.keys())
|
| /third_party/mesa3d/src/mesa/main/ |
| H A D | hash.h | 63 * pattern (in the case of glGen*()ed object IDs) is that the keys are unique
185 _mesa_HashFindFreeKeys(struct _mesa_HashTable *table, GLuint* keys, GLuint numKeys);
|
| /third_party/node/deps/npm/node_modules/@colors/colors/lib/ |
| H A D | colors.js | 99 Object.keys(ansiStyles).forEach(function(key) {
176 Object.keys(styles).forEach(function(name) {
|
| /third_party/node/deps/npm/node_modules/@npmcli/arborist/bin/lib/ |
| H A D | options.js | 83 // Camelcase all top level keys
91 // Set defaults on unset keys
105 for (const k of Object.keys(binOnlyOpts)) {
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/ |
| H A D | easy_xml.py | 156 _xml_escape_re = re.compile("(%s)" % "|".join(map(re.escape, _xml_escape_map.keys())))
|
| /third_party/node/deps/npm/node_modules/node-gyp/lib/ |
| H A D | node-gyp.js | 126 Object.keys(process.env).forEach((name) => {
|
| /third_party/rust/crates/cxx/gen/build/src/syntax/ |
| H A D | map.rs | 33 pub fn keys(&self) -> impl Iterator<Item = &K> { in keys() functions
136 pub fn keys(&self) -> UnorderedSet<K> in keys() functions
141 for key in self.0.keys() { in keys()
|
| /third_party/rust/crates/cxx/gen/lib/src/syntax/ |
| H A D | map.rs | 33 pub fn keys(&self) -> impl Iterator<Item = &K> { in keys() functions
136 pub fn keys(&self) -> UnorderedSet<K> in keys() functions
141 for key in self.0.keys() { in keys()
|
| /third_party/rust/crates/cxx/macro/src/syntax/ |
| H A D | map.rs | 33 pub fn keys(&self) -> impl Iterator<Item = &K> { in keys() functions
136 pub fn keys(&self) -> UnorderedSet<K> in keys() functions
141 for key in self.0.keys() { in keys()
|
| /third_party/rust/crates/cxx/syntax/ |
| H A D | map.rs | 33 pub fn keys(&self) -> impl Iterator<Item = &K> { in keys() functions
136 pub fn keys(&self) -> UnorderedSet<K> in keys() functions
141 for key in self.0.keys() { in keys()
|
| /third_party/python/Tools/demo/ |
| H A D | markov.py | 102 for key in m.trans.keys():
|
| /third_party/python/Tools/freeze/ |
| H A D | checkextensions.py | 31 for m in list(mods.keys()):
|
| /third_party/python/Tools/scripts/ |
| H A D | pickle2db.py | 21 Note that recno databases can only contain integer keys, so you can't dump a
23 database with %(prog)s unless your keys are integers.
131 for k in list(db.keys()):
|
| /third_party/rust/crates/cxx/gen/cmd/src/syntax/ |
| H A D | map.rs | 33 pub fn keys(&self) -> impl Iterator<Item = &K> { in keys() functions
136 pub fn keys(&self) -> UnorderedSet<K> in keys() functions
141 for key in self.0.keys() { in keys()
|
| /third_party/pulseaudio/src/pulse/ |
| H A D | context.h | 253 pa_operation *pa_context_proplist_remove(pa_context *c, const char *const keys[], pa_context_success_cb_t cb, void *userdata);
|
| H A D | proplist.h | 277 * as keys and arbitrary data as values. \since 0.9.11 */
362 /** Similar to pa_proplist_unset() but takes an array of keys to
367 int pa_proplist_unset_many(pa_proplist *p, const char * const keys[]);
376 * key string for the next entry. The keys in the property list do not
412 /** Return non-zero when a and b have the same keys and values.
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/scripts/ |
| H A D | pygenerator.py | 29 If printValues is False, just output keys with None values."""
69 # (e.g. a dictionary with each related type as keys).
73 for baseType in sorted(self.mapDict.keys()):
|
| /third_party/skia/third_party/externals/jinja2/ |
| H A D | _compat.py | 17 iterkeys = lambda d: iter(d.keys())
|
| /third_party/skia/third_party/externals/icu/source/python/icutools/databuilder/ |
| H A D | utils.py | 49 (", ".join("$%s" % v for v in LOCAL_DIRNAME_SUBSTITUTIONS.keys())),
|
| /third_party/python/Lib/test/ |
| H A D | test_pstats.py | 113 funcs_called = set(stats_profile.func_profiles.keys())
|
| /third_party/python/Lib/lib2to3/ |
| H A D | btm_matcher.py | 97 A dictionary of node matches with fixers as the keys
143 for subnode_key in node.transition_table.keys():
|