Searched defs:ordered (Results 1 - 25 of 40) sorted by relevance

12

/external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/
H A DShadowBroadcastPendingResult.java21 static BroadcastReceiver.PendingResult create(int resultCode, String resultData, Bundle resultExtras, boolean ordered) { argument
31 ordered,
42 ordered,
53 ordered,
/external/autotest/tko/perf_upload/
H A Dperf_uploader_unittest.py299 def ordered(obj): function in function:test_format_for_upload._verify_result_string
301 return sorted((k, ordered(v)) for k, v in obj.items())
303 return sorted(ordered(x) for x in obj)
307 self.assertEqual(ordered(expected), ordered(actual), msg=fail_msg)
/external/freetype/src/sfnt/
H A Dttkern.c52 FT_UInt32 avail = 0, ordered = 0; local
130 * Now check whether the pairs in this table are ordered.
156 ordered |= mask;
165 face->kern_order_bits = ordered;
/external/webrtc/talk/app/webrtc/
H A Ddatachannelinterface.h47 ordered(true),
55 bool ordered; // True if ordered delivery is required. member in struct:webrtc::DataChannelInit
137 virtual bool ordered() const { return false; } function in class:webrtc::DataChannelInterface
H A Ddatachannel.h139 virtual bool ordered() const { return config_.ordered; } function in class:webrtc::DataChannel
285 PROXY_CONSTMETHOD0(bool, ordered)
/external/webrtc/talk/app/webrtc/java/src/org/webrtc/
H A DDataChannel.java36 public boolean ordered = true; field in class:DataChannel.Init
50 boolean ordered, int maxRetransmitTimeMs, int maxRetransmits,
52 this.ordered = ordered;
49 Init( boolean ordered, int maxRetransmitTimeMs, int maxRetransmits, String protocol, boolean negotiated, int id) argument
/external/mesa3d/src/gallium/auxiliary/gallivm/
H A Dlp_bld_logic.c72 * If the ordered argument is true the function will use LLVM's ordered
82 boolean ordered)
106 op = ordered ? LLVMRealOEQ : LLVMRealUEQ;
109 op = ordered ? LLVMRealONE : LLVMRealUNE;
112 op = ordered ? LLVMRealOLT : LLVMRealULT;
115 op = ordered ? LLVMRealOLE : LLVMRealULE;
118 op = ordered ? LLVMRealOGT : LLVMRealUGT;
121 op = ordered ? LLVMRealOGE : LLVMRealUGE;
216 * ordered compariso
77 lp_build_compare_ext(struct gallivm_state *gallivm, const struct lp_type type, unsigned func, LLVMValueRef a, LLVMValueRef b, boolean ordered) argument
[all...]
/external/mesa3d/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_bb.cpp453 Pass::run(Program *prog, bool ordered, bool skipPhi) argument
457 return doRun(prog, ordered, skipPhi);
461 Pass::doRun(Program *prog, bool ordered, bool skipPhi) argument
466 if (!doRun(Function::get(n), ordered, skipPhi))
473 Pass::run(Function *func, bool ordered, bool skipPhi) argument
477 return doRun(func, ordered, skipPhi);
481 Pass::doRun(Function *func, bool ordered, bool skipPhi) argument
491 bbIter = ordered ? func->cfg.iteratorCFG() : func->cfg.iteratorDFS();
/external/skia/src/pathops/
H A DSkOpSpan.cpp400 bool SkOpSpan::insertCoincidence(const SkOpSegment* segment, bool flipped, bool ordered) { argument
409 if (!ordered) {
H A DSkOpCoincidence.cpp151 bool SkCoincidentSpans::ordered(bool* result) const { function in class:SkCoincidentSpans
611 // note that over1s, over1e, over2s, over2e are ordered
1339 bool ordered; local
1340 FAIL_IF(!coin->ordered(&ordered));
1343 FAIL_IF(!next->upCast()->insertCoincidence(oSegment, flipped, ordered));
1347 FAIL_IF(!oNext->upCast()->insertCoincidence(segment, flipped, ordered));
H A DSkPathOpsDebug.cpp1719 // note that over1s, over1e, over2s, over2e are ordered
2067 bool ordered; local
2068 FAIL_IF(!coin->ordered(&ordered), coin);
2071 if (next->upCast()->debugInsertCoincidence(log, oSegment, flipped, ordered), false) {
2077 if (oNext->upCast()->debugInsertCoincidence(log, segment, flipped, ordered), false) {
2651 void SkOpSpan::debugInsertCoincidence(SkPathOpsDebug::GlitchLog* log, const SkOpSegment* segment, bool flipped, bool ordered) const {
2660 if (!ordered) {
/external/skqp/src/pathops/
H A DSkOpSpan.cpp400 bool SkOpSpan::insertCoincidence(const SkOpSegment* segment, bool flipped, bool ordered) { argument
409 if (!ordered) {
H A DSkOpCoincidence.cpp151 bool SkCoincidentSpans::ordered(bool* result) const { function in class:SkCoincidentSpans
611 // note that over1s, over1e, over2s, over2e are ordered
1339 bool ordered; local
1340 FAIL_IF(!coin->ordered(&ordered));
1343 FAIL_IF(!next->upCast()->insertCoincidence(oSegment, flipped, ordered));
1347 FAIL_IF(!oNext->upCast()->insertCoincidence(segment, flipped, ordered));
H A DSkPathOpsDebug.cpp1719 // note that over1s, over1e, over2s, over2e are ordered
2067 bool ordered; local
2068 FAIL_IF(!coin->ordered(&ordered), coin);
2071 if (next->upCast()->debugInsertCoincidence(log, oSegment, flipped, ordered), false) {
2077 if (oNext->upCast()->debugInsertCoincidence(log, segment, flipped, ordered), false) {
2651 void SkOpSpan::debugInsertCoincidence(SkPathOpsDebug::GlitchLog* log, const SkOpSegment* segment, bool flipped, bool ordered) const {
2660 if (!ordered) {
/external/tensorflow/tensorflow/core/kernels/
H A Dword2vec_kernels.cc196 std::vector<WordFreq> ordered; local
198 if (p.second >= min_count_) ordered.push_back(p);
202 << " unique words, " << ordered.size()
205 std::sort(ordered.begin(), ordered.end(),
209 vocab_size_ = static_cast<int32>(1 + ordered.size());
216 for (std::size_t i = 0; i < ordered.size(); ++i) {
217 const auto& w = ordered[i].first;
220 auto word_count = ordered[i].second;
/external/ImageMagick/MagickCore/
H A Dxml-tree.c93 *ordered,
490 *ordered;
492 ordered=xml_info->ordered;
493 while(ordered != (XMLTreeInfo *) NULL)
495 node=ordered;
496 ordered=node->ordered;
497 node->ordered=(XMLTreeInfo *) NULL;
972 % GetXMLTreeOrdered() returns the next ordered nod
90 *ordered, member in struct:_XMLTreeInfo
482 *ordered; local
2767 *ordered, local
[all...]
/external/opencv/cv/src/
H A Dcvcalibinit.cpp116 bool ordered; // true if corners/neighbors are ordered counter-clockwise member in struct:CvCBQuad
401 if (quads[i].ordered)
532 // but all other quads are ordered consistently
575 start->ordered = true;
611 if (neighbor && neighbor->ordered == false && neighbor->count == 4)
615 neighbor->ordered = true;
708 if (neighbor && !neighbor->ordered && // is it an inner quad?
716 neighbor->ordered = true;
731 if (quads[i]->count < 4 && quads[i]->ordered)
[all...]
/external/protobuf/src/google/protobuf/compiler/js/
H A Djs_generator.cc1303 vector<const FileDescriptor*>* ordered) {
1307 ordered->clear();
1311 DepthFirstSearch(input[i], ordered, &seen);
1316 ordered->erase(
1317 std::remove_if(ordered->begin(), ordered->end(), NotInSet(input_set)),
1318 ordered->end());
1302 GenerateJspbFileOrder(const vector<const FileDescriptor*>& input, vector<const FileDescriptor*>* ordered) argument
/external/v8/src/ppc/
H A Dconstants-ppc.h58 ordered = 7, enumerator in enum:v8::internal::Condition
/external/webrtc/webrtc/base/
H A Dvirtualsocketserver.cc873 bool ordered) {
898 if (ordered) {
867 AddPacketToNetwork(VirtualSocket* sender, VirtualSocket* recipient, uint32_t cur_time, const char* data, size_t data_size, size_t header_size, bool ordered) argument
/external/selinux/libsepol/cil/src/
H A Dcil_resolve_ast.c1176 void __cil_ordered_list_init(struct cil_ordered_list **ordered) argument
1178 *ordered = cil_malloc(sizeof(**ordered));
1180 (*ordered)->merged = CIL_FALSE;
1181 (*ordered)->list = NULL;
1182 (*ordered)->node = NULL;
1185 void __cil_ordered_list_destroy(struct cil_ordered_list **ordered) argument
1187 cil_list_destroy(&(*ordered)->list, CIL_FALSE);
1188 (*ordered)->node = NULL;
1189 free(*ordered);
1204 struct cil_ordered_list *ordered = item->data; local
1516 struct cil_ordered_list *ordered = NULL; local
1564 struct cil_ordered_list *ordered = NULL; local
1605 struct cil_ordered_list *ordered = NULL; local
[all...]
H A Dcil_internal.h372 uint32_t ordered; /* Only used for kernel class */ member in struct:cil_class
425 uint32_t ordered; member in struct:cil_sid
662 uint32_t ordered; member in struct:cil_sens
671 uint32_t ordered; member in struct:cil_cat
/external/swiftshader/third_party/LLVM/lib/Target/CellSPU/
H A DSPUISelLowering.cpp2623 SDValue ordered = DAG.getNode(ISD::AND, dl, ccResultVT, lhsNaN, rhsNaN); local
2625 result = DAG.getNode(ISD::AND, dl, ccResultVT, ordered, result);
/external/v8/src/s390/
H A Dconstants-s390.h69 ordered = CC_NOF, // floating-point ordered enumerator in enum:v8::internal::Condition
/external/webrtc/talk/media/base/
H A Dmediachannel.h1138 // For SCTP, whether to send messages flagged as ordered or not.
1140 bool ordered; member in struct:cricket::SendDataParams
1157 ordered(false),

Completed in 3968 milliseconds

12