Home
last modified time | relevance | path

Searched refs:Key (Results 1 - 25 of 584) sorted by relevance

12345678910>>...24

/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DITypVectorTests.cpp22 using Key = TypedInteger<struct KeyT, uint32_t>;
25 using Vector = ityp::vector<Key, Val>;
33 ASSERT_EQ(vec.size(), Key(0)); in TEST_F()
38 Vector vec(Key(10)); in TEST_F()
39 ASSERT_EQ(vec.size(), Key(10)); in TEST_F()
41 for (Key i(0); i < Key(10); ++i) { in TEST_F()
48 Vector vec(Key(10), Val(7)); in TEST_F()
49 ASSERT_EQ(vec.size(), Key(10)); in TEST_F()
51 for (Key in TEST_F()
[all...]
H A DITypArrayTests.cpp22 using Key = TypedInteger<struct KeyT, uint32_t>;
24 using Array = ityp::array<Key, Val, 10>;
31 static_assert(kArr[Key(3)] == Val(3), "");
32 static_assert(kArr.at(Key(7)) == Val(7), "");
33 static_assert(kArr.size() == Key(10), "");
41 arr[Key(2)] = Val(5); in TEST_F()
42 arr[Key(1)] = Val(9); in TEST_F()
43 arr[Key(9)] = Val(2); in TEST_F()
45 ASSERT_EQ(arr[Key(2)], Val(5)); in TEST_F()
46 ASSERT_EQ(arr[Key( in TEST_F()
[all...]
H A DITypBitsetTests.cpp24 using Key = TypedInteger<struct KeyT, size_t>;
25 using Bitset = ityp::bitset<Key, 9>;
31 static_assert(kBitset[Key(0)] == true, "");
32 static_assert(kBitset[Key(1)] == false, "");
33 static_assert(kBitset[Key(2)] == false, "");
34 static_assert(kBitset[Key(3)] == true, "");
35 static_assert(kBitset[Key(4)] == false, "");
36 static_assert(kBitset[Key(5)] == false, "");
37 static_assert(kBitset[Key(6)] == false, "");
38 static_assert(kBitset[Key(
[all...]
H A DITypSpanTests.cpp24 using Key = TypedInteger<struct KeyT, size_t>;
26 using Span = ityp::span<Key, Val>;
32 Span span(arr.data(), Key(arr.size())); in TEST_F()
34 span[Key(2)] = Val(5); in TEST_F()
35 span[Key(1)] = Val(9); in TEST_F()
36 span[Key(9)] = Val(2); in TEST_F()
38 ASSERT_EQ(span[Key(2)], Val(5)); in TEST_F()
39 ASSERT_EQ(span[Key(1)], Val(9)); in TEST_F()
40 ASSERT_EQ(span[Key(9)], Val(2)); in TEST_F()
47 Span span(arr.data(), Key(ar in TEST_F()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DStaticUnicodeSets.java24 public static enum Key { enum in StaticUnicodeSets
68 private static final Map<Key, UnicodeSet> unicodeSets = new EnumMap<>(Key.class);
78 public static UnicodeSet get(Key key) { in get()
95 public static Key chooseFrom(String str, Key key1) { in chooseFrom()
113 public static Key chooseFrom(String str, Key key1, Key key2) { in chooseFrom()
121 public static Key chooseCurrenc
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DStaticUnicodeSets.java31 public static enum Key { enum in StaticUnicodeSets
75 private static final Map<Key, UnicodeSet> unicodeSets = new EnumMap<>(Key.class);
85 public static UnicodeSet get(Key key) { in get()
102 public static Key chooseFrom(String str, Key key1) { in chooseFrom()
120 public static Key chooseFrom(String str, Key key1, Key key2) { in chooseFrom()
128 public static Key chooseCurrenc
[all...]
/third_party/typescript/tests/baselines/reference/
H A DlocalImportNameVsGlobalName.js3 export enum Key { UP, DOWN, LEFT, RIGHT }
7 import Key = Keyboard.Key;
9 export function foo(key: Key): void {}
11 foo(Key.UP);
12 foo(Key.DOWN);
13 foo(Key.LEFT);
19 var Key;
20 (function (Key) {
21 Key[Ke
[all...]
H A DdeclarationEmitComputedNameCausesImportToBePainted.js4 export const Key = Symbol();
6 [Key]: string;
9 import { Key, Context } from "./context";
12 [Key]: 'bar',
15 export const withContext = ({ [Key]: value }: Context) => value;
20 exports.Key = void 0;
21 exports.Key = Symbol();
29 _a[context_1.Key] = 'bar',
32 var _b = context_1.Key, value = _a[_b];
39 export declare const Key
[all...]
/third_party/protobuf/src/google/protobuf/
H A Dmap_field_inl.h105 template <typename Key, typename T>
106 typename Map<Key, T>::const_iterator&
107 TypeDefinedMapFieldBase<Key, T>::InternalGetIterator( in InternalGetIterator()
109 return *reinterpret_cast<typename Map<Key, T>::const_iterator*>( in InternalGetIterator()
113 template <typename Key, typename T>
114 void TypeDefinedMapFieldBase<Key, T>::MapBegin(MapIterator* map_iter) const { in MapBegin()
119 template <typename Key, typename T>
120 void TypeDefinedMapFieldBase<Key, T>::MapEnd(MapIterator* map_iter) const { in MapEnd()
124 template <typename Key, typename T>
125 bool TypeDefinedMapFieldBase<Key,
[all...]
/third_party/rust/crates/log/src/kv/
H A Dkey.rs8 /// A type that can be converted into a [`Key`](struct.Key.html).
11 fn to_key(&self) -> Key; in to_key()
18 fn to_key(&self) -> Key { in to_key()
23 impl<'k> ToKey for Key<'k> {
24 fn to_key(&self) -> Key { in to_key()
25 Key { key: self.key } in to_key()
30 fn to_key(&self) -> Key { in to_key()
31 Key::from_str(self) in to_key()
37 pub struct Key<' structure names
41 impl<'k> Key<'k> { global() impls
[all...]
/third_party/gn/src/base/containers/
H A Dflat_tree.h74 // contained (in the case of map it's a <Kay, Mapped> pair). The Key is how
75 // things are looked up. In the case of a set, Key == Value. In the case of
76 // a map, the Key is a component of a Value.
80 // const Key& operator()(const Value&).
81 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
90 using key_type = Key;
499 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
500 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree() = default;
502 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
503 flat_tree<Key, Valu
[all...]
H A Dflat_map.h22 template <class Key, class Mapped>
24 const Key& operator()(const std::pair<Key, Mapped>& p) const { in operator ()()
151 template <class Key, class Mapped, class Compare = std::less<>>
153 Key,
154 std::pair<Key, Mapped>,
155 ::base::internal::GetKeyFromValuePairFirst<Key, Mapped>,
159 Key,
160 std::pair<Key, Mapped>,
161 ::base::internal::GetKeyFromValuePairFirst<Key, Mappe
[all...]
/third_party/node/deps/v8/src/base/
H A Dhashmap.h34 template <typename Key, typename Value, class MatchFun, class AllocationPolicy>
37 using Entry = TemplateHashMapEntry<Key, Value>;
66 Entry* Lookup(const Key& key, uint32_t hash) const;
71 Entry* LookupOrInsert(const Key& key, uint32_t hash);
77 Entry* LookupOrInsert(const Key& key, uint32_t hash, const Func& value_func);
83 // operator()(const LookupKey& lookup_key, const Key& entry_key)
93 Entry* InsertNew(const Key& key, uint32_t hash);
98 Value Remove(const Key& key, uint32_t hash);
138 Entry* FillEmptyEntry(Entry* entry, const Key& key, const Value& value,
183 template <typename Key, typenam
365 DCHECK(i < capacity()); DCHECK(occupancy() < capacity()); Entry* map = impl_.map_; while (map[i].exists() && !impl_.match()(hash, map[i].hash, key, map[i].key)) { i = (i + 1) & (capacity() - 1); } return &map[i]; } template <typename Key, typename Value, typename MatchFun, class AllocationPolicy> typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry* TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::FillEmptyEntry( Entry* entry, const Key& key, const Value& value, uint32_t hash) { DCHECK(!entry->exists()); new (entry) Entry(key, value, hash); impl_.occupancy_++; if (occupancy() + occupancy() / 4 >= capacity()) Probe() argument
[all...]
H A Dhashmap-entry.h24 template <typename Key, typename Value>
28 Key key;
32 TemplateHashMapEntry(Key key, Value value, uint32_t hash) in TemplateHashMapEntry()
44 template <typename Key, typename Value>
45 struct TemplateHashMapEntry<Key*, Value> {
48 Key* key;
52 TemplateHashMapEntry(Key* key, Value value, uint32_t hash) in TemplateHashMapEntry()
61 template <typename Key>
62 struct TemplateHashMapEntry<Key, NoHashMapValue> {
64 Key ke
[all...]
/third_party/jerryscript/jerry-core/ext/
H A Dheapdump.c96 static void Key(const char* key) in Key() function
110 Key("type"); in Type()
117 Key("addr"); in Addr()
124 Key("outer"); in DumpInfoLexEnv()
133 Key("subtype"); in DumpInfoLexEnv()
138 Key("binding"); in DumpInfoLexEnv()
148 Key("is_builtin"); in DumpInfoFunction()
154 Key("is_routine"); in DumpInfoFunction()
162 Key("id"); in DumpInfoFunction()
165 Key("routine_i in DumpInfoFunction()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DAMDGPUMetadata.cpp95 YIO.mapOptional(Kernel::Attrs::Key::ReqdWorkGroupSize, in mapping()
97 YIO.mapOptional(Kernel::Attrs::Key::WorkGroupSizeHint, in mapping()
99 YIO.mapOptional(Kernel::Attrs::Key::VecTypeHint, in mapping()
101 YIO.mapOptional(Kernel::Attrs::Key::RuntimeHandle, MD.mRuntimeHandle, in mapping()
109 YIO.mapOptional(Kernel::Arg::Key::Name, MD.mName, std::string()); in mapping()
110 YIO.mapOptional(Kernel::Arg::Key::TypeName, MD.mTypeName, std::string()); in mapping()
111 YIO.mapRequired(Kernel::Arg::Key::Size, MD.mSize); in mapping()
112 YIO.mapRequired(Kernel::Arg::Key::Align, MD.mAlign); in mapping()
113 YIO.mapRequired(Kernel::Arg::Key::ValueKind, MD.mValueKind); in mapping()
114 YIO.mapRequired(Kernel::Arg::Key in mapping()
[all...]
/third_party/skia/third_party/externals/swiftshader/src/Renderer/
H A DLRUCache.hpp25 template<class Key, class Data>
33 Data query(const Key &key) const;
34 Data add(const Key &key, const Data &data);
37 Key &getKey(int i) {return key[i];} in getKey()
45 Key *key;
46 Key **ref;
93 template<class Key, class Data>
94 LRUCache<Key, Data>::LRUCache(int n) in LRUCache()
101 key = new Key[size]; in LRUCache()
102 ref = new Key*[siz in LRUCache()
[all...]
/third_party/json/tests/thirdparty/fifo_map/
H A Dfifo_map.hpp46 template<class Key>
51 fifo_map_compare(std::unordered_map<Key, std::size_t>* k) : keys(k) {} in fifo_map_compare()
57 bool operator()(const Key& lhs, const Key& rhs) const in operator ()()
79 void add_key(const Key& key) in add_key()
84 void remove_key(const Key& key) in remove_key()
91 std::unordered_map<Key, std::size_t>* keys = nullptr;
98 class Key,
100 class Compare = fifo_map_compare<Key>,
101 class Allocator = std::allocator<std::pair<const Key,
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dpersistent-map.h34 template <class Key, class Value, class Hasher = base::hash<Key>>
37 using key_type = Key;
39 using value_type = std::pair<Key, Value>;
50 struct KeyValue : std::pair<Key, Value> {
51 const Key& key() const { return this->first; } in key()
53 using std::pair<Key, Value>::pair;
69 const Value& Get(const Key& key) const { in Get()
76 void Set(Key key, Value value);
81 for (std::tuple<Key, Valu in operator ==()
341 DCHECK(old_first < first_); } if (second_current_) { ++second_; DCHECK(old_second < second_); } return *this = double_iterator(first_, second_); } double_iterator(iterator first, iterator second) : first_(first), second_(second) { if (first_ == second_) { first_current_ = second_current_ = true; } else if (first_ < second_) { first_current_ = true; second_current_ = false; } else { DCHECK(second_ < first_); first_current_ = false; second_current_ = true; } } bool operator!=(const double_iterator& other) { return first_ != other.first_ || second_ != other.second_; } bool is_end() const { return first_.is_end() && second_.is_end(); } private: iterator first_; iterator second_; bool first_current_; bool second_current_; }; template <class Key, class Value, class Hasher> void PersistentMap<Key, Value, Hasher>::Set(Key key, Value value) { HashValue key_hash = HashValue(Hasher()(key)); std::array<const FocusedTree*, kHashBits> path; int length = 0; const FocusedTree* old = FindHash(key_hash, &path, &length); ZoneMap<Key, Value>* more = nullptr; if (!(GetFocusedValue(old, key) != value)) return; if (old && !(old->more == nullptr && old->key_value.key() == key)) { more = zone_->New<ZoneMap<Key, Value>>(zone_); if (old->more) operator ++() argument
[all...]
/third_party/skia/src/gpu/vk/
H A DGrVkSamplerYcbcrConversion.h26 struct Key { struct in GrVkSamplerYcbcrConversion
27 Key() : fVkFormat(VK_FORMAT_UNDEFINED), fExternalFormat(0), fConversionKey(0) {} in Key() function
28 Key(VkFormat vkFormat, uint64_t externalFormat, uint8_t conversionKey) { in Key() function
29 memset(this, 0, sizeof(Key)); in Key()
39 bool operator==(const Key& that) const { in operator ==()
47 static Key GenerateKey(const GrVkYcbcrConversionInfo& ycbcrInfo);
49 static const Key& GetKey(const GrVkSamplerYcbcrConversion& ycbcrConversion) { in GetKey()
52 static uint32_t Hash(const Key& key) { in Hash()
53 return SkOpts::hash(reinterpret_cast<const uint32_t*>(&key), sizeof(Key)); in Hash()
65 Key ke in GrVkSamplerYcbcrConversion()
[all...]
H A DGrVkSampler.h29 struct Key { struct in GrVkSampler
30 Key(uint8_t samplerKey, const GrVkSamplerYcbcrConversion::Key& ycbcrKey) { in Key() function
32 // force alignment padding to occur in the middle of the Key struct. in Key()
33 memset(this, 0, sizeof(Key)); in Key()
38 GrVkSamplerYcbcrConversion::Key fYcbcrKey;
40 bool operator==(const Key& that) const { in operator ==()
47 static Key GenerateKey(GrSamplerState, const GrVkYcbcrConversionInfo&);
49 static const Key& GetKey(const GrVkSampler& sampler) { return sampler.fKey; } in GetKey()
50 static uint32_t Hash(const Key in GetKey()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/
H A DBaseLocale.java60 Key key = new Key(language, script, region, variant); in getInstance()
150 private static class Key implements Comparable<Key> { class in BaseLocale
158 public Key(String language, String script, String region, String variant) { in Key() method in BaseLocale.Key
177 (obj instanceof Key) in equals()
178 && AsciiUtil.caseIgnoreMatch(((Key)obj)._lang, this._lang) in equals()
179 && AsciiUtil.caseIgnoreMatch(((Key)obj)._scrt, this._scrt) in equals()
180 && AsciiUtil.caseIgnoreMatch(((Key)obj)._regn, this._regn) in equals()
181 && ((Key)ob in equals()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/locale/
H A DBaseLocale.java64 Key key = new Key(language, script, region, variant); in getInstance()
154 private static class Key implements Comparable<Key> { class in BaseLocale
162 public Key(String language, String script, String region, String variant) { in Key() method in BaseLocale.Key
181 (obj instanceof Key) in equals()
182 && AsciiUtil.caseIgnoreMatch(((Key)obj)._lang, this._lang) in equals()
183 && AsciiUtil.caseIgnoreMatch(((Key)obj)._scrt, this._scrt) in equals()
184 && AsciiUtil.caseIgnoreMatch(((Key)obj)._regn, this._regn) in equals()
185 && ((Key)ob in equals()
[all...]
/third_party/skia/tools/viewer/
H A DImGuiLayer.cpp45 io.KeyMap[ImGuiKey_Tab] = (int)skui::Key::kTab; in ImGuiLayer()
46 io.KeyMap[ImGuiKey_LeftArrow] = (int)skui::Key::kLeft; in ImGuiLayer()
47 io.KeyMap[ImGuiKey_RightArrow] = (int)skui::Key::kRight; in ImGuiLayer()
48 io.KeyMap[ImGuiKey_UpArrow] = (int)skui::Key::kUp; in ImGuiLayer()
49 io.KeyMap[ImGuiKey_DownArrow] = (int)skui::Key::kDown; in ImGuiLayer()
50 io.KeyMap[ImGuiKey_PageUp] = (int)skui::Key::kPageUp; in ImGuiLayer()
51 io.KeyMap[ImGuiKey_PageDown] = (int)skui::Key::kPageDown; in ImGuiLayer()
52 io.KeyMap[ImGuiKey_Home] = (int)skui::Key::kHome; in ImGuiLayer()
53 io.KeyMap[ImGuiKey_End] = (int)skui::Key::kEnd; in ImGuiLayer()
54 io.KeyMap[ImGuiKey_Delete] = (int)skui::Key in ImGuiLayer()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
H A DDiagnosticInfo.cpp163 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, const Value *V) in Argument() argument
164 : Key(Key) { in Argument()
183 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, const Type *T) in Argument() argument
184 : Key(Key) { in Argument()
189 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, StringRef S) in Argument() argument
190 : Key(Key), Val(S.str()) {} in Argument()
192 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, in argument
195 Argument(StringRef Key, float N) Argument() argument
198 Argument(StringRef Key, long N) Argument() argument
201 Argument(StringRef Key, long long N) Argument() argument
204 Argument(StringRef Key, unsigned N) Argument() argument
207 Argument(StringRef Key, unsigned long N) Argument() argument
211 Argument(StringRef Key, unsigned long long N) Argument() argument
215 Argument(StringRef Key, DebugLoc Loc) Argument() argument
[all...]

Completed in 10 milliseconds

12345678910>>...24