| /external/skqp/src/pathops/ |
| D | SkPathOpsCommon.cpp | 106 bool sortable; in FindChase() local
107 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable); in FindChase()
115 if (sortable) { in FindChase()
126 if (sortable) { in FindChase()
130 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in FindChase()
136 if (sortable) { in FindChase()
|
| D | SkPathOpsOp.cpp | 40 bool sortable; in findChaseOp() local
41 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable); in findChaseOp()
50 if (sortable) { in findChaseOp()
76 if (sortable) { in findChaseOp()
81 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in findChaseOp()
87 if (sortable) { in findChaseOp()
|
| D | SkPathOpsCommon.h | 18 bool* sortable);
|
| D | SkOpSegment.cpp | 567 bool sortable = calcWinding != SK_NaN32; in findNextOp() local
568 if (!sortable) { in findNextOp()
673 bool sortable = calcWinding != SK_NaN32; in findNextWinding() local
674 if (!sortable) { in findNextWinding()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCommon.cpp | 106 bool sortable; in FindChase() local
107 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable); in FindChase()
115 if (sortable) { in FindChase()
126 if (sortable) { in FindChase()
130 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in FindChase()
136 if (sortable) { in FindChase()
|
| D | SkPathOpsOp.cpp | 40 bool sortable; in findChaseOp() local
41 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable); in findChaseOp()
50 if (sortable) { in findChaseOp()
76 if (sortable) { in findChaseOp()
81 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in findChaseOp()
87 if (sortable) { in findChaseOp()
|
| D | SkPathOpsCommon.h | 18 bool* sortable);
|
| D | SkOpSegment.cpp | 567 bool sortable = calcWinding != SK_NaN32; in findNextOp() local
568 if (!sortable) { in findNextOp()
673 bool sortable = calcWinding != SK_NaN32; in findNextWinding() local
674 if (!sortable) { in findNextWinding()
|
| /external/junit/src/main/java/org/junit/runner/manipulation/ |
| D | Sorter.java | 40 Sortable sortable = (Sortable) object; in apply() local
41 sortable.sort(this); in apply()
|
| /external/grpc-grpc/third_party/address_sorting/ |
| D | address_sorting.c | 339 const address_sorting_sortable* sortable) { in sanity_check_private_fields_are_unused() argument
342 if (memcmp(&expected_source_addr, &sortable->source_addr, in sanity_check_private_fields_are_unused()
344 sortable->original_index || sortable->source_addr_exists) { in sanity_check_private_fields_are_unused()
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | PrettyPath.java | 54 public String getPrettyPath(String path, boolean sortable) { in getPrettyPath() argument
77 if (!sortable) return getOutputForm(prettyString); in getPrettyPath()
|
| /external/autotest/frontend/client/src/autotest/public/ |
| D | afeclient.css | 168 .data-row-header-sortable {
172 .data-row-header-sortable td:hover {
|
| /external/selinux/mcstrans/src/ |
| D | mcstrans.c | 998 char **sortable = calloc(n_el, sizeof(char *)); in build_regexps() local
999 if (!sortable) { in build_regexps()
1005 sortable[i++] = bc->trans; in build_regexps()
1008 qsort(sortable, n_el, sizeof(char *), string_size); in build_regexps()
1011 strcat(buffer, sortable[i]); in build_regexps()
1015 free(sortable); in build_regexps()
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/resources/ |
| D | report.css | 167 table.coverage thead td.sortable {
|
| /external/python/cpython3/Doc/library/ |
| D | ipaddress.rst | 895 and Network objects are not sortable by default; they're fundamentally
|
| /external/doclava/res/assets/templates-sdk/assets/js/ |
| D | android_3p-bundle.js | 2678 …ositionAbs,item:c.currentItem,sender:b?b.element:null}}}),a.extend(a.ui.sortable,{version:"1.8.23"…
|
| /external/strace/ |
| D | ChangeLog | 8574 bit in order to make it lexicographically sortable and add two
|