| /system/chre/util/tests/ |
| D | heap_test.cc | 12 std::less<int> comp; in TEST()
18 std::less<int> comp; in TEST()
24 std::less<int> comp; in TEST()
56 std::less<int> comp; in TEST()
65 std::less<int> comp; in TEST()
|
| /system/tools/hidl/ |
| D | Scope.cpp | 138 auto less = [&](const Type* lhs, const Type* rhs) { in topologicalReorder() local
142 if (std::is_sorted(mTypes.begin(), mTypes.end(), less)) return; in topologicalReorder()
145 std::sort(mTypes.begin(), mTypes.end(), less); in topologicalReorder()
|
| /system/security/keystore/ |
| D | grant_store.h | 77 std::unordered_map<uid_t, std::set<Grant, std::less<>>> grants_;
|
| D | grant_store.cpp | 49 std::set<Grant, std::less<>>& uid_grant_list = grants_[uid]; in put()
|
| /system/chre/util/include/chre/util/ |
| D | priority_queue.h | 33 typename CompareFunction = std::less<ElementType>>
|
| /system/memory/libmemunreachable/ |
| D | Allocator.h | 200 template <class Key, class T, class Compare = std::less<Key>>
210 template <class Key, class Compare = std::less<Key>>
|
| /system/sepolicy/prebuilts/api/28.0/public/ |
| D | bootstat.te | 50 # ... and refine ... for a ro propertly no less ... keep this _tight_
|
| /system/sepolicy/prebuilts/api/29.0/public/ |
| D | bootstat.te | 53 # ... and refine ... for a ro propertly no less ... keep this _tight_
|
| /system/sepolicy/prebuilts/api/30.0/public/ |
| D | bootstat.te | 57 # ... and refine ... for a ro propertly no less ... keep this _tight_
|
| /system/sepolicy/public/ |
| D | bootstat.te | 57 # ... and refine ... for a ro propertly no less ... keep this _tight_
|
| /system/libsysprop/srcs/android/sysprop/ |
| D | ContactsProperties.sysprop | 50 # We can't spell it out because a property name must be less than 32 chars.
|
| /system/incremental_delivery/incfs/include/ |
| D | MountRegistry.h | 39 using BindMap = std::map<std::string, std::pair<std::string, int>, std::less<>>;
|
| /system/sepolicy/prebuilts/api/29.0/private/ |
| D | seapp_contexts | 55 # more specific user= string before less specific user= string.
58 # more specific name= string before less specific name= string.
60 # more specific name= string before less specific name= string.
|
| /system/core/libutils/include/utils/ |
| D | RefBase.h | 403 COMPARE_WEAK_FUNCTIONAL(<, std::less)
440 return _wp_compare_<std::less>(m_refs, o.m_refs);
442 return _wp_compare_<std::less>(m_ptr, o.m_ptr);
|
| D | StrongPointer.h | 139 COMPARE_STRONG_FUNCTIONAL(<, std::less)
|
| /system/core/base/ |
| D | README.md | 6 easier and less error-prone.
|
| /system/sepolicy/private/ |
| D | seapp_contexts | 55 # more specific user= string before less specific user= string.
58 # more specific name= string before less specific name= string.
60 # more specific name= string before less specific name= string.
|
| /system/sepolicy/prebuilts/api/30.0/private/ |
| D | seapp_contexts | 55 # more specific user= string before less specific user= string.
58 # more specific name= string before less specific name= string.
60 # more specific name= string before less specific name= string.
|
| /system/bt/doc/ |
| D | style_guide.md | 4 are consistent with one another and spend less time debating style.
157 integer. It's more transparent and readable, and less error prone.
260 This form is used over traditional `#define`-based include guards as it is less
|
| /system/core/init/ |
| D | init.cpp | 368 static const std::map<std::string, ControlMessageFunction, std::less<>>& GetControlMessageMap() { in GetControlMessageMap()
370 …static const std::map<std::string, ControlMessageFunction, std::less<>> control_message_functions … in GetControlMessageMap()
|
| /system/iorap/src/compiler/ |
| D | compiler.cc | 629 using std::less; // ADL in multiless_one()
630 return less<std::decay_t<T>>{}(std::forward<T>(a), std::forward<T>(b)); in multiless_one()
|
| /system/core/fs_mgr/libsnapshot/android/snapshot/ |
| D | snapshot.proto | 50 // This must be less than or equal to |device_size|.
|
| /system/chre/doc/ |
| D | framework_overview.md | 177 platform-specific code is less restricted, and can refer to common code, as well
204 less effort (potentially using those libraries if they are known to be
|
| /system/extras/partition_tools/ |
| D | README.md | 23 … can be a normal file or a sparse image, but the destination size must be less than or equal to th…
|
| /system/update_engine/payload_generator/ |
| D | inplace_generator.cc | 266 SortCutsByTopoOrderLess less(table); in SortCutsByTopoOrder() local
267 sort(cuts->begin(), cuts->end(), less); in SortCutsByTopoOrder()
|