Searched refs:pred (Results 1 - 5 of 5) sorted by relevance

/system/security/keystore/
H A Dauth_token_table.cpp61 typename Container::iterator find_if(Container& container, Predicate pred) { argument
62 return std::find_if(container.begin(), container.end(), pred);
66 typename Container::iterator remove_if(Container& container, Predicate pred) { argument
67 return std::remove_if(container.begin(), container.end(), pred);
/system/core/adb/
H A Djdwp_service.cpp173 auto pred = [this](const auto& proc) { return proc.get() == this; }; local
174 _jdwp_list.remove_if(pred);
554 auto pred = [s](const auto& tracker) { return tracker.get() == s; }; local
555 _jdwp_trackers.erase(std::remove_if(_jdwp_trackers.begin(), _jdwp_trackers.end(), pred),
H A Dadb_listeners.cpp172 auto pred = [](const std::unique_ptr<alistener>& listener) { local
175 listener_list.erase(std::remove_if(listener_list.begin(), listener_list.end(), pred));
H A Dtransport.cpp904 auto pred = alphanumeric ? [](const char c) { return !isalnum(c); } local
906 std::replace_if(str.begin(), str.end(), pred, '_');
/system/media/camera/docs/
H A Dmetadata_model.py64 def find_all(self, pred):
69 pred: a predicate function that acts as a filter for a Node
72 A sequence of all descendants for which pred(node) is true,
75 if pred(self):
82 for j in i.find_all(pred):
85 def find_first(self, pred):
90 pred: a predicate function that acts as a filter for a Node
93 The first Node from find_all(pred), or None if there were no results.
95 for i in self.find_all(pred):
100 def find_parent_first(self, pred)
[all...]

Completed in 140 milliseconds