| /system/media/mca/filterfw/java/android/filterfw/core/ |
| RandomScheduler.java | 43 Vector<Filter> candidates = new Vector<Filter>(); local
46 candidates.add(filter);
48 if (candidates.size() > 0) {
49 int r = mRand.nextInt(candidates.size());
50 return candidates.elementAt(r);
|
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| rawtransportchannel.cc | 175 PortAllocatorSession *session, const std::vector<Candidate>& candidates) {
177 ASSERT(candidates.size() >= 1);
180 Candidate c = candidates[candidates.size() - 1];
187 if (stun_port_->candidates().size() < 2)
192 if (stun_port_->candidates()[0].address() ==
193 stun_port_->candidates()[1].address()) {
209 if (relay_port_->candidates().size() > 0)
235 ASSERT(port_->candidates().size() >= 1);
236 ASSERT(port_->candidates()[0].protocol() == "udp")
[all...] |
| p2ptransport.h | 62 Candidates* candidates,
65 const Candidates& candidates,
|
| rawtransport.h | 49 Candidates* candidates,
52 const Candidates& candidates,
|
| rawtransport.cc | 56 Candidates* candidates,
70 candidates->push_back(candidate);
77 const Candidates& candidates,
81 cand = candidates.begin();
82 cand != candidates.end();
|
| p2ptransport.cc | 81 Candidates* candidates,
84 // candidates according to XEP-176.
94 candidates->push_back(candidate);
157 const Candidates& candidates,
161 // candidates according to XEP-176.
162 for (std::vector<Candidate>::const_iterator iter = candidates.begin();
163 iter != candidates.end(); ++iter) {
|
| transport.h | 78 typedef std::vector<Candidate> Candidates;
80 // Used to parse and serialize (write) transport candidates. For
88 Candidates* candidates,
91 const Candidates& candidates,
171 // Handles sending of ready candidates and receiving of remote candidates.
174 void OnRemoteCandidates(const std::vector<Candidate>& candidates);
|
| rawtransportchannel.h | 82 // We don't actually worry about signaling since we can't send new candidates.
108 const std::vector<Candidate>& candidates);
|
| sessionmessages.h | 49 typedef std::vector<Candidate> Candidates;
110 const Candidates& candidates)
113 candidates(candidates) {}
117 Candidates candidates; member in struct:cricket::TransportInfo
|
| transport.cc | 283 void Transport::OnRemoteCandidates(const std::vector<Candidate>& candidates) {
284 for (std::vector<Candidate>::const_iterator iter = candidates.begin();
285 iter != candidates.end();
383 std::vector<Candidate> candidates; local
386 candidates.swap(ready_candidates_);
391 if (!candidates.empty()) {
392 SignalCandidatesReady(this, candidates);
|
| sessionmessages.cc | 282 Candidates* candidates,
290 candidates, error);
298 TransportInfo tinfo(CN_OTHER, NS_GINGLE_P2P, Candidates());
301 &tinfo.candidates, error))
307 // If we don't have media, no need to separate the candidates.
313 // If we have media, separate the candidates. Create the
314 // TransportInfo here to avoid copying the candidates.
315 TransportInfo audio_tinfo(CN_AUDIO, NS_GINGLE_P2P, Candidates());
316 TransportInfo video_tinfo(CN_VIDEO, NS_GINGLE_P2P, Candidates());
[all...] |
| p2ptransportchannel.h | 30 // connections which are combinations of candidates from each end (Alice and
31 // Bob each have candidates, one candidate from Alice and one candidate from
35 // kick off a process of determining more candidates and more connections.
65 // P2PTransportChannel manages the candidates and connection process to keep
124 const std::vector<Candidate>& candidates);
|
| session.cc | 126 void TransportProxy::AddSentCandidates(const Candidates& candidates) {
127 for (Candidates::const_iterator cand = candidates.begin();
128 cand != candidates.end(); ++cand) {
412 TransportInfo(content->name, transport_type_, Candidates()));
427 // Must complete negotiation before sending remote candidates, or
430 for (Candidates::const_iterator cand = tinfo->candidates.begin();
431 cand != tinfo->candidates.end(); ++cand)
[all...] |
| /external/icu4c/common/ |
| dictbe.cpp | 111 int count; // Count of candidates
113 int32_t offset; // Offset in the text of these candidates
121 // Fill the list of candidates if needed, select the longest, and return the number found
122 int candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd );
148 PossibleWord::candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd ) { function in class:PossibleWord
265 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
268 if (candidates == 1) {
274 else if (candidates > 1) {
281 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
342 int candidates = words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
[all...] |
| /frameworks/base/core/java/android/text/method/ |
| LinkMovementMethod.java | 105 ClickableSpan[] candidates = buffer.getSpans(first, last, ClickableSpan.class); local
144 for (int i = 0; i < candidates.length; i++) {
145 int end = buffer.getSpanEnd(candidates[i]);
149 beststart = buffer.getSpanStart(candidates[i]);
166 for (int i = 0; i < candidates.length; i++) {
167 int start = buffer.getSpanStart(candidates[i]);
172 bestend = buffer.getSpanEnd(candidates[i]);
|
| /external/webkit/Tools/CodeCoverage/ |
| run-generate-coverage-data | 173 def generate_covs(candidates):
181 print candidates.keys()
182 for dir in candidates.keys():
184 for dep in candidates[dir].keys():
217 candidates = map(lambda x: parse_dependency_file(x,base_dir,[]), depends) variable
219 # Build a number of sources from the candidates. This is a Set for the poor
223 for (_,dir,deps) in candidates:
234 print "Found %d candidates" % (len(sources))
|
| /libcore/luni/src/main/java/org/apache/harmony/security/utils/ |
| JarUtils.java | 178 private static X509Certificate[] createChain(X509Certificate signer, X509Certificate[] candidates) {
191 issuerCert = findCert(issuer, candidates);
205 private static X509Certificate findCert(Principal issuer, X509Certificate[] candidates) {
206 for (int i = 0; i < candidates.length; i++) {
207 if (issuer.equals(candidates[i].getSubjectDN())) {
208 return candidates[i];
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| ContactAggregator.java | 586 MatchCandidateList candidates = new MatchCandidateList(); local
609 candidates, matcher);
648 long currentContactId, MatchCandidateList candidates, ContactMatcher matcher) {
661 candidates.clear();
671 contactId = pickBestMatchBasedOnData(db, rawContactId, candidates, matcher);
2274 MatchCandidateList candidates = new MatchCandidateList(); local
[all...] |
| /external/webkit/Source/WebKit/mac/Plugins/ |
| WebPluginDatabase.mm | 161 PluginPackageCandidates candidates;
168 candidates.update(plugin);
171 return candidates.bestCandidate();
176 PluginPackageCandidates candidates;
183 candidates.update(plugin);
186 WebBasePluginPackage *plugin = candidates.bestCandidate();
|
| /libcore/luni/src/main/java/java/lang/ |
| Runtime.java | 376 List<String> candidates = new ArrayList<String>(); local
380 candidates.add(candidate);
393 throw new UnsatisfiedLinkError("Library " + libraryName + " not found; tried " + candidates);
|
| /external/chromium/third_party/libjingle/source/talk/p2p/client/ |
| basicportallocator.cc | 436 // Only accumulate the candidates whose protocol has been enabled
437 std::vector<Candidate> candidates; local
438 const std::vector<Candidate>& potentials = port->candidates();
444 candidates.push_back(potentials[i]);
447 if (!candidates.empty()) {
448 SignalCandidatesReady(this, candidates);
454 std::vector<Candidate> candidates; local
460 const std::vector<Candidate>& potentials = it->port->candidates();
466 candidates.push_back(potentials[i]);
470 if (!candidates.empty())
[all...] |
| /external/chromium/chrome/browser/chromeos/login/ |
| login_utils.cc | 498 std::vector<std::string> candidates; local
500 input_method_ids, &candidates);
501 for (size_t i = 0; i < candidates.size(); ++i) {
502 const std::string& candidate = candidates[i];
|
| /external/chromium/chrome/browser/chromeos/input_method/ |
| input_method_util.cc | 660 std::vector<std::string> candidates; local
662 GetInputMethodIdsFromLanguageCode(language_code, type, &candidates);
665 candidates.push_back(GetHardwareInputMethodId());
675 // Add candidates to input_method_ids, while skipping duplicates.
676 for (size_t i = 0; i < candidates.size(); ++i) {
677 const std::string& candidate = candidates[i];
|
| candidate_window.cc | 57 // too narrow when all candidates are short.
61 // too wide when one of candidates are long.
263 for (size_t i = 0; i + start_from < lookup_table.candidates.size(); ++i) {
267 UTF8ToWide(lookup_table.candidates[index]));
363 // instance, if we are going to show the same candidates as before, we
370 // Updates candidates of the candidate window from |lookup_table|.
371 // Candidates are arranged per |orientation|.
441 // The lookup table (candidates).
456 // The candidate area is where candidates are rendered.
474 // The candidate views are used for rendering candidates
[all...] |
| /packages/apps/Mms/src/com/android/mms/data/ |
| Contact.java | 387 * The min_match is used to narrow down the candidates for the final
1076 ArrayList<Contact> candidates = mContactsHash.get(key); local
[all...] |
