| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| D | cross_op.cc | 50 std::vector<int64> starts(in0_shape.dims(), 0); in Compile() local
60 starts.back() = 0; in Compile()
62 auto u1 = xla::Slice(in0, starts, limits, strides); in Compile()
63 auto v1 = xla::Slice(in1, starts, limits, strides); in Compile()
64 starts.back() = 1; in Compile()
66 auto u2 = xla::Slice(in0, starts, limits, strides); in Compile()
67 auto v2 = xla::Slice(in1, starts, limits, strides); in Compile()
68 starts.back() = 2; in Compile()
70 auto u3 = xla::Slice(in0, starts, limits, strides); in Compile()
71 auto v3 = xla::Slice(in1, starts, limits, strides); in Compile()
|
| /external/tensorflow/tensorflow/python/ops/ragged/ |
| D | ragged_getitem.py | 163 starts = rt_input.row_splits[:-1]
182 if int(row_key) >= len(starts):
186 row = rt_input.values[starts[row_key]:limits[row_key]]
285 starts = rt_input.row_splits[:-1]
288 lower_bound = _if_ge_zero(step, lambda: starts, lambda: starts - 1)
292 inner_rt_starts = _if_ge_zero(step, lambda: starts, lambda: limits - 1)
294 start_offset = math_ops.cast(column_key.start, starts.dtype)
297 lambda: math_ops.minimum(starts + start_offset, upper_bound),
301 inner_rt_limits = _if_ge_zero(step, lambda: limits, lambda: starts - 1)
303 stop_offset = math_ops.cast(column_key.stop, starts.dtype)
[all …]
|
| /external/llvm-project/clang-tools-extra/test/clang-tidy/checkers/ |
| D | google-objc-global-variable-declaration.m | 6 …4: warning: const global variable 'myConstString' must have a name which starts with an appropriat…
10 …: warning: const global variable 'GlobalConstant' must have a name which starts with an appropriat…
13 …18: warning: non-const global variable 'MyString' must have a name which starts with 'g[A-Z]' [goo…
17 …warning: non-const global variable 'globalString' must have a name which starts with 'g[A-Z]' [goo…
21 …NE-1]]:18: warning: non-const global variable 'a' must have a name which starts with 'g[A-Z]' [goo…
25 …]]:18: warning: non-const global variable 'noDef' must have a name which starts with 'g[A-Z]' [goo…
29 …]]:24: warning: const global variable '_notAlpha' must have a name which starts with an appropriat…
33 …E-1]]:24: warning: const global variable 'notCap' must have a name which starts with an appropriat…
37 …-1]]:24: warning: const global variable 'k_Alpha' must have a name which starts with an appropriat…
41 …24: warning: const global variable 'SecondNotCap' must have a name which starts with an appropriat…
[all …]
|
| /external/tensorflow/tensorflow/core/ops/ |
| D | ragged_math_ops.cc | 47 ShapeHandle starts = c->input(0); in RaggedRangeShapeFn() local
50 TF_RETURN_IF_ERROR(c->WithRankAtMost(starts, 1, &starts)); in RaggedRangeShapeFn()
56 if (c->Rank(starts) == 1) { in RaggedRangeShapeFn()
57 TF_RETURN_IF_ERROR(c->Merge(c->Dim(starts, 0), dim, &dim)); in RaggedRangeShapeFn()
70 } else if (c->Rank(starts) == 0 && c->Rank(limits) == 0 && in RaggedRangeShapeFn()
|
| /external/exoplayer/tree/library/common/src/main/java/com/google/android/exoplayer2/util/ |
| D | CodecSpecificDataUtil.java | 118 List<Integer> starts = new ArrayList<>(); in splitNalUnits() local
121 starts.add(nalUnitIndex); in splitNalUnits()
124 byte[][] split = new byte[starts.size()][]; in splitNalUnits()
125 for (int i = 0; i < starts.size(); i++) { in splitNalUnits()
126 int startIndex = starts.get(i); in splitNalUnits()
127 int endIndex = i < starts.size() - 1 ? starts.get(i + 1) : data.length; in splitNalUnits()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| D | MultiStartMultivariateRealOptimizer.java | 59 private int starts; field in MultiStartMultivariateRealOptimizer
76 final int starts, in MultiStartMultivariateRealOptimizer() argument
81 this.starts = starts; in MultiStartMultivariateRealOptimizer()
167 optima = new RealPointValuePair[starts]; in optimize()
172 for (int i = 0; i < starts; ++i) { in optimize()
208 starts); in optimize()
|
| D | MultiStartDifferentiableMultivariateRealOptimizer.java | 62 private int starts; field in MultiStartDifferentiableMultivariateRealOptimizer
79 final int starts, in MultiStartDifferentiableMultivariateRealOptimizer() argument
85 this.starts = starts; in MultiStartDifferentiableMultivariateRealOptimizer()
177 optima = new RealPointValuePair[starts]; in optimize()
183 for (int i = 0; i < starts; ++i) { in optimize()
220 starts); in optimize()
|
| D | MultiStartDifferentiableMultivariateVectorialOptimizer.java | 65 private int starts; field in MultiStartDifferentiableMultivariateVectorialOptimizer
83 final int starts, in MultiStartDifferentiableMultivariateVectorialOptimizer() argument
89 this.starts = starts; in MultiStartDifferentiableMultivariateVectorialOptimizer()
181 optima = new VectorialPointValuePair[starts]; in optimize()
187 for (int i = 0; i < starts; ++i) { in optimize()
230 starts); in optimize()
|
| D | MultiStartUnivariateRealOptimizer.java | 60 private int starts; field in MultiStartUnivariateRealOptimizer
80 final int starts, in MultiStartUnivariateRealOptimizer() argument
84 this.starts = starts; in MultiStartUnivariateRealOptimizer()
231 optima = new double[starts]; in optimize()
232 optimaValues = new double[starts]; in optimize()
237 for (int i = 0; i < starts; ++i) { in optimize()
304 starts); in optimize()
|
| /external/perfetto/ui/src/tracks/process_scheduling/ |
| D | frontend.ts | 68 assertTrue(data.starts.length === data.ends.length);
69 assertTrue(data.starts.length === data.utids.length);
73 const startIdx = rawStartIdx === -1 ? data.starts.length : rawStartIdx;
75 const [, rawEndIdx] = searchSegment(data.starts, visibleWindowTime.end);
76 const endIdx = rawEndIdx === -1 ? data.starts.length : rawEndIdx;
81 const tStart = data.starts[i];
143 const [i, j] = searchRange(data.starts, t, searchEq(data.cpus, cpu));
144 if (i === j || i >= data.starts.length || t > data.ends[i]) {
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | reference_util.h | 335 std::array<int64, 2> starts, in Slice2D() argument
338 CHECK_LE(starts[0], input.n1()); in Slice2D()
339 CHECK_LE(starts[1], input.n2()); in Slice2D()
345 CeilOfRatio(limits[0] - starts[0], strides[0]), in Slice2D()
346 CeilOfRatio(limits[1] - starts[1], strides[1])); in Slice2D()
350 input(starts[0] + i0 * strides[0], starts[1] + i1 * strides[1]); in Slice2D()
358 std::array<int64, 3> starts, in Slice3D() argument
361 CHECK_LE(starts[0], input.n1()); in Slice3D()
362 CHECK_LE(starts[1], input.n2()); in Slice3D()
363 CHECK_LE(starts[2], input.n3()); in Slice3D()
[all …]
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | cluster_scoping_pass.cc | 101 std::vector<Node*> starts; in AddScopeToAllTransitivePredecessors() local
102 starts.push_back(start); in AddScopeToAllTransitivePredecessors()
104 ReverseDFSFrom(*graph_, starts, enter, /*leave=*/nullptr, in AddScopeToAllTransitivePredecessors()
111 std::vector<Node*> starts; in AddScopeToAllTransitiveSuccessors() local
112 starts.push_back(start); in AddScopeToAllTransitiveSuccessors()
114 DFSFrom(*graph_, starts, enter, /*leave=*/nullptr, in AddScopeToAllTransitiveSuccessors()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_RaggedRange.pbtxt | 5 name: "starts"
6 description: "The starts of each range."
31 `result[i] = range(starts[i], limits[i], deltas[i])`.
35 starts=[2, 5, 8], limits=[3, 5, 12], deltas=1)
41 The input tensors `starts`, `limits`, and `deltas` may be scalars or vectors.
|
| /external/tensorflow/tensorflow/python/keras/layers/preprocessing/benchmarks/ |
| D | hashing_benchmark.py | 52 starts = []
62 starts.append(time.time())
69 avg_time = np.mean(np.array(ends) - np.array(starts)) / num_batches
78 starts = []
88 starts.append(time.time())
95 avg_time = np.mean(np.array(ends) - np.array(starts)) / num_batches
|
| D | discretization_adapt_benchmark.py | 58 starts = []
66 starts.append(time.time())
75 avg_time = np.mean(np.array(ends) - np.array(starts))
85 starts = []
93 starts.append(time.time())
99 avg_time = np.mean(np.array(ends) - np.array(starts))
|
| D | category_crossing_benchmark.py | 50 starts = []
61 starts.append(time.time())
68 avg_time = np.mean(np.array(ends) - np.array(starts)) / num_batches
78 starts = []
89 starts.append(time.time())
96 avg_time = np.mean(np.array(ends) - np.array(starts)) / num_batches
|
| D | index_lookup_adapt_benchmark.py | 80 starts = []
83 starts.append(time.time())
87 avg_time = np.mean(np.array(ends) - np.array(starts))
104 starts = []
107 starts.append(time.time())
110 avg_time = np.mean(np.array(ends) - np.array(starts))
|
| D | index_lookup_forward_benchmark.py | 87 starts = []
91 starts.append(time.time())
94 avg_time = np.mean(np.array(ends) - np.array(starts))
119 starts = []
124 starts.append(time.time())
127 avg_time = np.mean(np.array(ends) - np.array(starts))
|
| D | normalization_adapt_benchmark.py | 69 starts = []
77 starts.append(time.time())
87 avg_time = np.mean(np.array(ends) - np.array(starts))
97 starts = []
105 starts.append(time.time())
111 avg_time = np.mean(np.array(ends) - np.array(starts))
|
| D | image_preproc_benchmark.py | 90 starts = []
101 starts.append(time.time())
110 avg_time = np.mean(np.array(ends) - np.array(starts)) / count
126 starts = []
134 starts.append(time.time())
143 avg_time = np.mean(np.array(ends) - np.array(starts)) / count
|
| /external/perfetto/ui/src/tracks/cpu_slices/ |
| D | frontend.ts | 76 assertTrue(data.starts.length === data.ends.length);
77 assertTrue(data.starts.length === data.utids.length);
87 const [, rawEndIdx] = searchSegment(data.starts, visibleWindowTime.end);
88 const endIdx = rawEndIdx === -1 ? data.starts.length : rawEndIdx;
91 const tStart = data.starts[i];
156 const tStart = data.starts[startIndex];
239 for (let i = 0; i < data.starts.length; i++) {
240 const tStart = data.starts[i];
265 const index = search(data.starts, time);
|
| /external/bcc/examples/lua/ |
| D | tracepoint-offcputime.lua | 25 local starts = assert(bpf.map('hash', 128, ffi.typeof('uint32_t'), ffi.typeof('uint64_t')))
34 starts[pid] = now
37 local from = starts[pid]
42 starts[pid] = nil
|
| /external/tensorflow/tensorflow/compiler/xla/tests/ |
| D | dynamic_ops_test.cc | 138 XlaOp starts; in RunR1() local
140 slice_starts[0], 0, "slice_starts", &builder, &starts); in RunR1()
143 DynamicSlice(input, absl::Span<const XlaOp>({starts}), slice_sizes); in RunR1()
164 std::vector<XlaOp> starts(2); in RunR2() local
168 slice_starts[i], i, "slice_starts", &builder, &starts[i]); in RunR2()
173 DynamicSlice(input, starts, slice_sizes); in RunR2()
199 std::vector<XlaOp> starts(3); in RunR3() local
203 slice_starts[i], i, "slice_starts", &builder, &starts[i]); in RunR3()
207 DynamicSlice(input, starts, slice_sizes); in RunR3()
421 XlaOp starts; in RunR1() local
[all …]
|
| /external/llvm-project/lld/test/ELF/linkerscript/ |
| D | lma-offset.s | 17 ## .b has AT(). It starts a PT_LOAD segment which also includes .c
20 ## .d has AT(). It starts a PT_LOAD segment, even if the difference between
24 ## The orphan section .text starts a PT_LOAD segment. The difference between
28 ## .data starts a PT_LOAD segment. The difference remains the same.
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/gl/kernels/ |
| D | slice_test.cc | 45 attr.starts = BHWC(0, 0, 0, 0); in TEST()
68 attr.starts = BHWC(0, 0, 0, 0); in TEST()
91 attr.starts = BHWC(0, 0, 1, 0); in TEST()
114 attr.starts = BHWC(0, 0, 0, 0); in TEST()
137 attr.starts = BHWC(0, 0, 1, 0); in TEST()
160 attr.starts = BHWC(0, 0, 0, 1); in TEST()
|