Searched refs:SortKey (Results 1 - 9 of 9) sorted by relevance
| /third_party/python/Lib/test/ |
| H A D | test_pstats.py | 5 from pstats import SortKey namespace
66 for member in SortKey:
89 _test_simple_enum(CheckedSortKey, SortKey)
94 SortKey.TIME)
96 SortKey.TIME,
119 self.assertEqual(SortKey.FILENAME, 'filename')
120 self.assertNotEqual(SortKey.FILENAME, SortKey.CALLS)
|
| /third_party/skia/experimental/sorttoy/ |
| H A D | SortKey.h | 15 class SortKey { class
45 SortKey() : fKey((kMaxDepth - 1) << kMaterialShift) {} in SortKey() function in SortKey
46 explicit SortKey(bool transparent, uint32_t depth, uint32_t material) { in SortKey() function in SortKey
99 bool operator>(const SortKey& other) const { return fKey > other.fKey; } in operator >()
100 bool operator<(const SortKey& other) const { return fKey < other.fKey; } in operator <()
|
| H A D | Cmds.h | 11 class SortKey;
29 virtual SortKey getKey() = 0;
52 SortKey getKey() override;
75 SortKey getKey() override;
102 SortKey getKey() override;
139 SortKey getKey() override;
|
| H A D | Cmds.cpp | 6 #include "experimental/sorttoy/SortKey.h"
17 SortKey SaveCmd::getKey() { in getKey()
31 SortKey RestoreCmd::getKey() { in getKey()
98 SortKey DrawCmd::getKey() { in getKey()
99 return SortKey(fPaint.isTransparent(), this->getSortZ(), fPaint.toID()); in getKey()
215 SortKey ClipCmd::getKey() { in getKey()
216 return SortKey(false, this->getSortZ(), kInvalidMat); in getKey()
|
| H A D | sorttoy.cpp | 6 #include "experimental/sorttoy/SortKey.h"
55 * the SortKey and then performs a kludgey z-buffered rasterization. The FakeCanvas also
115 // Exercise basic SortKey behavior
117 SortKey k; in key_test()
123 SortKey k1(false, 1, 3); in key_test()
129 SortKey k2(true, 2, 1); in key_test()
|
| /third_party/skia/experimental/graphite/src/ |
| H A D | DrawPass.cpp | 54 * Renderer), which can be sorted independently. Each (step, draw) pair produces its own SortKey.
69 * Last, the SortKey encodes an index into the set of uniform bindings accumulated for a DrawPass.
70 * This allows the SortKey to cluster draw steps that have both a compatible pipeline and do not
72 * the pipeline description index are packed into indices and not actual pointers, a given SortKey
75 class DrawPass::SortKey { class in skgpu::DrawPass
77 SortKey(const DrawList::Draw* draw, in SortKey() function in skgpu::DrawPass::SortKey
90 bool operator<(const SortKey& k) const { in operator <()
160 // NOTE: This assert is here to ensure SortKey is as tightly packed as possible. Any change to in Make()
164 // At 24 bytes (current), sorting is about 30% slower than if SortKey could be packed into just in Make()
174 static_assert(sizeof(DrawPass::SortKey) in Make()
[all...] |
| H A D | DrawPass.h | 76 class SortKey;
|
| /third_party/python/Lib/ |
| H A D | pstats.py | 34 __all__ = ["Stats", "SortKey", "FunctionProfile", "StatsProfile"]
37 class SortKey: class
95 arbitrary number of quoted strings or SortKey enum to select the sort
98 For example sort_stats('time', 'name') or sort_stats(SortKey.TIME,
99 SortKey.NAME) sorts on the major key of 'internal function time', and on
258 if isinstance(word, SortKey):
|
| /third_party/protobuf/src/google/protobuf/ |
| H A D | wire_format.cc | 1144 static std::vector<MapKey> SortKey(const Message& message, in SortKey() function in google::MapKeySorter
1237 MapKeySorter::SortKey(message, message_reflection, field); in InternalSerializeField()
|
Completed in 8 milliseconds