Searched refs:hashable (Results 1 – 25 of 90) sorted by relevance
1234
140 for hashable in (m.Hashable, m.Hashable2):141 assert hashable(15) is not hashable(15)142 assert hashable(15) == hashable(15)144 assert hash(hashable(15)) == 15145 assert hash(hashable(15)) == hash(hashable(15))
101 enum class hashable { maybe, yes };103 constexpr const char* PropertyName(hashable v) {126 hashable HashableValue = hashable::maybe>174 static constexpr hashable hashable_support = HashableValue; // NOLINT216 HashableValue != hashable::maybe;232 swappable SwappableValue, hashable HashableValue> \259 ABSL_INTERNAL_CONFORMANCE_TESTING_DATA_MEMBER_DEF(hashable);331 static constexpr hashable hashable_support = // NOLINT
682 case ti::hashable::maybe: in TYPED_TEST_P()687 case ti::hashable::yes: in TYPED_TEST_P()962 ti::hashable::yes>>>;1174 ti::swappable::nothrow, ti::hashable::yes>>>;
360 enum class hashable { maybe, yes };362 constexpr const char* PropertyName(hashable v) {530 constexpr hashable hashable_support_of() {531 return type_traits_internal::IsHashable<T>::value ? hashable::yes532 : hashable::maybe;563 hashable HashableValue = hashable::maybe>611 static constexpr hashable hashable_support = HashableValue; // NOLINT653 HashableValue != hashable::maybe;668 static constexpr hashable Invoke() { return hashable::maybe; }673 static constexpr hashable Invoke() { return hashable_support_of<T>(); }[all …]
16 "mojo.test.TypemappedRect=mojo::test::RectChromium[hashable]",
16 "mojo.test.TypemappedRect=mojo::test::RectBlink[hashable]",
25 example, whether it is hashable or whether it is a mapping.264 and not requiring the set elements to be hashable. '''305 are hashable or immutable. To add set hashability using mixins,
20 Provides functionality to topologically sort a graph of hashable nodes.88 elements in *predecessors* must be hashable.
79 operations from that class. :class:`Fraction` instances are hashable,
849 def hashable(self): member in RelativeDistinguishedName934 def hashable(self): member in RDNSequence943 return '\x1E'.join(rdn.hashable for rdn in self)1043 def hashable(self): member in Name1049 return self.chosen.hashable
82 :term:`hashable`; if it isn't, :exc:`TypeError` will be raised. Return98 Remove the entry in dictionary *p* with key *key*. *key* must be hashable;
103 Weak references are :term:`hashable` if the *object* is hashable. They will maintain124 callable. Proxy objects are not :term:`hashable` regardless of the referent; this
66 :term:`hashable`; if it isn't, :exc:`TypeError` will be raised. Return83 Remove the entry in dictionary *p* with key *key*. *key* must be hashable;
640 Strings are hashable, and thus may be used as keys in a dictionary.746 Lists are not hashable, so may not be used in the keys of a dictionary.813 Tuples are hashable (assuming their elements are hashable),829 are implemented using hash tables, so keys must be hashable. Hashable831 composed from hashable values. Most mutable values, such as lists,832 dictionaries, and sets, are not hashable, even when frozen.833 Attempting to use a non-hashable value as a key in a dictionary930 elements of a set must be hashable.1509 a `set`. Attempting to use a non-hashable value as the key in a hash1514 A hashable value has the same hash throughout its lifetime.[all …]
99 Furthermore, many Starlark values are hashable in Starlark even though100 the Go values that represent them are not hashable in Go: big
73 functor implementations for hashable types in Abseil.