| /external/fonttools/Tests/varLib/ |
| D | featureVars_test.py | 13 overlaps = overlayFeatureVariations(conds)
14 assert len(overlaps) == 2 * n - 1, overlaps
15 return conds, overlaps
24 overlaps = overlayFeatureVariations(conds)
25 assert len(overlaps) == n * (n + 1) // 2, overlaps
26 return conds, overlaps
34 def _match_condition(location, overlaps): argument
35 for box, substitutions in overlaps:
50 overlaps = overlayFeatureVariations(conds)
51 subst = _match_condition({'abcd': 0}, overlaps)
[all …]
|
| /external/libvpx/libvpx/vp8/decoder/ |
| D | error_concealment.c | 44 if (pbi->overlaps != NULL) { in vp8_alloc_overlap_lists()
45 vpx_free(pbi->overlaps); in vp8_alloc_overlap_lists()
46 pbi->overlaps = NULL; in vp8_alloc_overlap_lists()
49 pbi->overlaps = in vp8_alloc_overlap_lists()
52 if (pbi->overlaps == NULL) return -1; in vp8_alloc_overlap_lists()
58 vpx_free(pbi->overlaps); in vp8_de_alloc_overlap_lists()
59 pbi->overlaps = NULL; in vp8_de_alloc_overlap_lists()
63 static void assign_overlap(OVERLAP_NODE *overlaps, union b_mode_info *bmi, in assign_overlap() argument
70 if (overlaps[i].bmi == NULL) { in assign_overlap()
71 overlaps[i].bmi = bmi; in assign_overlap()
[all …]
|
| D | ec_types.h | 31 OVERLAP_NODE overlaps[MAX_OVERLAPS]; member
38 B_OVERLAP overlaps[16]; member
|
| D | onyxd_int.h | 109 MB_OVERLAP *overlaps; member
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | IntervalMapTest.cpp | 630 EXPECT_FALSE(map.overlaps(0, 9)); in TEST()
631 EXPECT_TRUE(map.overlaps(0, 10)); in TEST()
632 EXPECT_TRUE(map.overlaps(0, 15)); in TEST()
633 EXPECT_TRUE(map.overlaps(0, 25)); in TEST()
634 EXPECT_TRUE(map.overlaps(0, 45)); in TEST()
635 EXPECT_TRUE(map.overlaps(10, 45)); in TEST()
636 EXPECT_TRUE(map.overlaps(30, 45)); in TEST()
637 EXPECT_TRUE(map.overlaps(35, 36)); in TEST()
638 EXPECT_TRUE(map.overlaps(40, 45)); in TEST()
639 EXPECT_FALSE(map.overlaps(45, 45)); in TEST()
[all …]
|
| /external/llvm-project/clang-tools-extra/test/clang-apply-replacements/Inputs/conflict/ |
| D | expected.txt | 1 The new replacement overlaps with an existing replacement.
4 The new replacement overlaps with an existing replacement.
7 The new replacement overlaps with an existing replacement.
10 The new replacement overlaps with an existing replacement.
|
| /external/crosvm/devices/src/ |
| D | bus.rs | 133 pub fn overlaps(&self, base: u64, len: u64) -> bool { in overlaps() method
222 .any(|(range, _dev)| range.overlaps(base, len)) in insert()
255 .any(|(range, _dev)| range.overlaps(base, len)) in insert_sync()
472 assert!(a.overlaps(0x1000, 0x400)); in bus_range_overlap()
473 assert!(a.overlaps(0xf00, 0x400)); in bus_range_overlap()
474 assert!(a.overlaps(0x1000, 0x01)); in bus_range_overlap()
475 assert!(a.overlaps(0xfff, 0x02)); in bus_range_overlap()
476 assert!(a.overlaps(0x1100, 0x100)); in bus_range_overlap()
477 assert!(a.overlaps(0x13ff, 0x100)); in bus_range_overlap()
478 assert!(!a.overlaps(0x1400, 0x100)); in bus_range_overlap()
[all …]
|
| /external/exoplayer/tree/testdata/src/test/assets/ssa/ |
| D | overlapping_timecodes | 6 Dialogue: 0:00:01.00,0:00:04.23,First subtitle - end overlaps second
7 Dialogue: 0:00:02.00,0:00:05.23,Second subtitle - beginning overlaps first
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCommon.cpp | 303 SkOpCoincidence overlaps(globalState); in HandleCoincidence() local
306 SkOpCoincidence* pairs = overlaps.isEmpty() ? coincidence : &overlaps; in HandleCoincidence()
313 if (!pairs->findOverlaps(&overlaps DEBUG_ITER_PARAMS(SAFETY_COUNT - safetyHatch))) { in HandleCoincidence()
320 } while (!overlaps.isEmpty()); in HandleCoincidence()
|
| D | SkOpCoincidence.cpp | 571 SkTDArray<SkCoincidentSpans*>* overlaps) const { in checkOverlap()
575 overlaps); in checkOverlap()
577 return this->checkOverlap(check, oppSeg, coinSeg, oppTe, oppTs, coinTe, coinTs, overlaps); in checkOverlap()
612 *overlaps->append() = check; // partial overlap, extend existing entry in checkOverlap()
662 SkTDArray<SkCoincidentSpans*> overlaps; in addOrOverlap() local
664 if (!this->checkOverlap(fTop, coinSeg, oppSeg, coinTs, coinTe, oppTs, oppTe, &overlaps)) { in addOrOverlap()
668 coinTe, oppTs, oppTe, &overlaps)) { in addOrOverlap()
671 SkCoincidentSpans* overlap = overlaps.count() ? overlaps[0] : nullptr; in addOrOverlap()
672 for (int index = 1; index < overlaps.count(); ++index) { // combine overlaps before continuing in addOrOverlap()
673 SkCoincidentSpans* test = overlaps[index]; in addOrOverlap()
[all …]
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsCommon.cpp | 303 SkOpCoincidence overlaps(globalState); in HandleCoincidence() local
306 SkOpCoincidence* pairs = overlaps.isEmpty() ? coincidence : &overlaps; in HandleCoincidence()
313 if (!pairs->findOverlaps(&overlaps DEBUG_ITER_PARAMS(SAFETY_COUNT - safetyHatch))) { in HandleCoincidence()
320 } while (!overlaps.isEmpty()); in HandleCoincidence()
|
| D | SkOpCoincidence.cpp | 571 SkTDArray<SkCoincidentSpans*>* overlaps) const { in checkOverlap()
575 overlaps); in checkOverlap()
577 return this->checkOverlap(check, oppSeg, coinSeg, oppTe, oppTs, coinTe, coinTs, overlaps); in checkOverlap()
612 *overlaps->append() = check; // partial overlap, extend existing entry in checkOverlap()
662 SkTDArray<SkCoincidentSpans*> overlaps; in addOrOverlap() local
664 if (!this->checkOverlap(fTop, coinSeg, oppSeg, coinTs, coinTe, oppTs, oppTe, &overlaps)) { in addOrOverlap()
668 coinTe, oppTs, oppTe, &overlaps)) { in addOrOverlap()
671 SkCoincidentSpans* overlap = overlaps.count() ? overlaps[0] : nullptr; in addOrOverlap()
672 for (int index = 1; index < overlaps.count(); ++index) { // combine overlaps before continuing in addOrOverlap()
673 SkCoincidentSpans* test = overlaps[index]; in addOrOverlap()
[all …]
|
| /external/tensorflow/tensorflow/python/ops/signal/ |
| D | spectral_ops.py | 148 overlaps = -(-frame_length // frame_step_) # Ceiling division.
149 denom = array_ops.pad(denom, [(0, overlaps * frame_step_ - frame_length)])
150 denom = array_ops.reshape(denom, [overlaps, frame_step_])
152 denom = array_ops.tile(denom, [overlaps, 1])
153 denom = array_ops.reshape(denom, [overlaps * frame_step_])
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_NonMaxSuppressionWithOverlaps.pbtxt | 4 name: "overlaps"
47 pruning away boxes that have high overlaps
59 overlaps, scores, max_output_size, overlap_threshold, score_threshold)
|
| /external/tensorflow/tensorflow/core/kernels/image/ |
| D | non_max_suppression_op.cc | 57 const Tensor& overlaps, in ParseAndCheckOverlapSizes() argument
60 OP_REQUIRES(context, overlaps.dims() == 2, in ParseAndCheckOverlapSizes()
62 overlaps.shape().DebugString())); in ParseAndCheckOverlapSizes()
64 *num_boxes = overlaps.dim_size(0); in ParseAndCheckOverlapSizes()
65 OP_REQUIRES(context, overlaps.dim_size(1) == *num_boxes, in ParseAndCheckOverlapSizes()
67 overlaps.shape().DebugString())); in ParseAndCheckOverlapSizes()
139 static inline T Overlap(typename TTypes<T, 2>::ConstTensor overlaps, int i, in Overlap() argument
141 return overlaps(i, j); in Overlap()
154 const Tensor& overlaps) { in CreateOverlapSimilarityFn() argument
156 overlaps.tensor<float, 2>(); in CreateOverlapSimilarityFn()
[all …]
|
| /external/llvm-project/lld/test/ELF/linkerscript/ |
| D | overlapping-sections.s | 9 # LMA-OVERLAP-ERR: error: section .sec1 load address range overlaps with .sec2
19 # overlaps with where .sec1 is loaded:
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.cpp | 30 bool HexagonBlockRanges::IndexRange::overlaps(const IndexRange &A) const { in overlaps() function in HexagonBlockRanges::IndexRange
58 assert(end() == A.start() || overlaps(A)); in merge()
95 if (Merge || Iter->overlaps(*Next)) { in unionize()
110 if (!A.overlaps(B)) { in addsub()
149 if (Rg.overlaps(Range)) { in subtract()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.cpp | 34 bool HexagonBlockRanges::IndexRange::overlaps(const IndexRange &A) const { in overlaps() function in HexagonBlockRanges::IndexRange
60 assert(end() == A.start() || overlaps(A)); in merge()
95 if (Merge || Iter->overlaps(*Next)) { in unionize()
109 if (!A.overlaps(B)) { in addsub()
147 if (Rg.overlaps(Range)) { in subtract()
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.cpp | 34 bool HexagonBlockRanges::IndexRange::overlaps(const IndexRange &A) const { in overlaps() function in HexagonBlockRanges::IndexRange
60 assert(end() == A.start() || overlaps(A)); in merge()
95 if (Merge || Iter->overlaps(*Next)) { in unionize()
109 if (!A.overlaps(B)) { in addsub()
147 if (Rg.overlaps(Range)) { in subtract()
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v2/ |
| D | NonMaxSuppressionWithOverlaps.pbtxt | 4 name: "overlaps"
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v1/ |
| D | NonMaxSuppressionWithOverlaps.pbtxt | 4 name: "overlaps"
|
| /external/llvm-project/llvm/test/CodeGen/AArch64/ |
| D | machine-dead-copy.mir | 70 # Don't try to erase any COPY which overlaps itself.
85 # Don't try to analyze any COPY which overlaps itself.
|
| /external/llvm-project/llvm/test/tools/llvm-objdump/MachO/ |
| D | malformed-machos.test | 14 …r malformed object (section contents at offset 4128 with a size of 176, overlaps section contents …
20 …or malformed object (section contents at offset 4320 with a size of 80, overlaps section contents …
41 …rmed object (section relocation entries at offset 0 with a size of 512, overlaps Mach-O headers at…
|
| /external/llvm-project/lldb/scripts/ |
| D | analyze-project-deps.py | 196 overlaps = [x for x in islands if not this_cycle.isdisjoint(x)] variable
197 islands = disjoints + [set.union(this_cycle, *overlaps)]
|
| /external/llvm-project/llvm/include/llvm/CodeGen/ |
| D | ScheduleDAG.h | 129 bool overlaps(const SDep &Other) const;
132 return overlaps(Other) && Latency == Other.Latency;
465 inline bool SDep::overlaps(const SDep &Other) const { in overlaps() function
|