| /external/rust/crates/crossbeam-channel/benches/ |
| D | crossbeam.rs | 40 let steps = TOTAL_STEPS / threads; in par_inout() localVariable
49 for i in 0..steps { in par_inout()
73 let steps = TOTAL_STEPS; in spsc() localVariable
81 for i in 0..steps { in spsc()
90 for _ in 0..steps { in spsc()
103 let steps = TOTAL_STEPS / threads; in spmc() localVariable
112 for _ in 0..steps { in spmc()
124 for i in 0..steps * threads { in spmc()
139 let steps = TOTAL_STEPS / threads; in mpsc() localVariable
148 for i in 0..steps { in mpsc()
[all …]
|
| /external/tensorflow/tensorflow/python/keras/engine/ |
| D | training_distributed_v1.py | 143 steps_per_epoch: Total number of steps (batches of samples)
147 validation_steps: Number of steps to run validation for
211 count_mode='steps',
214 # Calculate the steps each time on the device.
271 steps=validation_steps,
296 steps=None, argument
304 steps: Total number of steps (batches of samples)
356 progbar = Progbar(target=steps)
368 steps_per_epoch=steps,
370 count_mode='steps',
[all …]
|
| D | training_generator_v1.py | 59 steps_name='steps',
68 steps_per_epoch: Total number of steps (batches of samples) before
81 validation_steps: Total number of steps (batches of samples) before
110 steps_name: The string name of the steps argument, either `steps`,
113 **kwargs: Additional arguments for backwards compatibility. `steps` is
124 if 'steps' in kwargs:
125 steps_per_epoch = kwargs['steps']
127 # Determine the number of steps per epoch and whether we should reset the
169 count_mode = 'steps' if use_steps else 'samples'
184 True, steps=steps_per_epoch)
[all …]
|
| D | training_arrays_v1.py | 65 steps_name='steps',
90 steps_per_epoch: Total number of steps (batches of samples) before
93 validation_steps: Number of steps to run validation for (only if doing
112 steps_name: The string name of the steps argument, either `steps`,
126 if 'steps' in kwargs:
127 steps_per_epoch = kwargs.pop('steps')
194 # that determines the number of steps required. To avoid this issue,
205 # Get num steps for printing.
216 count_mode = 'steps' if use_steps else 'samples'
242 steps=steps_per_epoch)
[all …]
|
| /external/python/cpython3/.azure-pipelines/ |
| D | ci.yml | 13 steps:
25 steps:
26 - template: ./docs-steps.yml
45 steps:
46 - template: ./macos-steps.yml
62 steps:
63 - template: ./posix-steps.yml
88 steps:
89 - template: ./posix-steps.yml
117 steps:
[all …]
|
| D | pr.yml | 13 steps:
25 steps:
26 - template: ./docs-steps.yml
43 steps:
44 - template: ./macos-steps.yml
62 steps:
63 - template: ./posix-steps.yml
88 steps:
89 - template: ./posix-steps.yml
120 steps:
[all …]
|
| /external/oss-fuzz/infra/build/functions/ |
| D | base_images.py | 39 """Returns build steps for given images."""
40 steps = [{
49 steps.append({
60 return steps
71 def run_build(steps, images): argument
72 """Execute the retrieved build steps in gcp."""
75 'steps': steps,
98 steps = _get_base_image_steps(BASE_IMAGES, tag_prefix)
101 run_build(steps, images)
105 """Get build steps for msan-libs-builder."""
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| D | ContinuousOutputModel.java | 38 * stores a copy of all steps information in a sorted collection for
64 * output model handles the steps of all integration phases, the user
78 * is large, if the integration interval is long or if the steps are
107 /** Steps table. */
108 private List<StepInterpolator> steps; field in ContinuousOutputModel
114 steps = new ArrayList<StepInterpolator>(); in ContinuousOutputModel()
129 if (model.steps.size() == 0) { in append()
133 if (steps.size() == 0) { in append()
149 final StepInterpolator lastInterpolator = steps.get(index); in append()
161 for (StepInterpolator interpolator : model.steps) { in append()
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | games_v1.achievements.html | 79 <p class="firstline">Increments the steps of the achievement with the given ID for the currently au…
90 <code><a href="#setStepsAtLeast">setStepsAtLeast(achievementId, steps)</a></code></p>
91 … the steps for the currently authenticated player towards unlocking an achievement. If the steps p…
101 …<pre>Increments the steps of the achievement with the given ID for the currently authenticated pla…
105 stepsToIncrement: integer, The number of steps to increment. (required)
112 "currentSteps": 42, # The current steps recorded for this incremental achievement.
113 …Unlocked": True or False, # Whether the current steps for the achievement has reached the number o…
148 "currentSteps": 42, # The current steps for an incremental achievement.
150 …"formattedCurrentStepsString": "A String", # The current steps for an incremental achievement as a…
192 <code class="details" id="setStepsAtLeast">setStepsAtLeast(achievementId, steps)</code>
[all …]
|
| /external/python/cpython3/Lib/ |
| D | pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
92 return '<Template instance, steps=%r>' % (self.steps,)
96 self.steps = []
102 t.steps = self.steps[:]
118 if self.steps and self.steps[-1][1] == SINK:
124 self.steps.append((cmd, kind))
134 if self.steps and self.steps[0][1] == SOURCE:
[all …]
|
| /external/python/cpython2/Lib/ |
| D | pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
90 return '<Template instance, steps=%r>' % (self.steps,)
94 self.steps = []
100 t.steps = self.steps[:]
119 if self.steps and self.steps[-1][1] == SINK:
128 self.steps.append((cmd, kind))
141 if self.steps and self.steps[0][1] == SOURCE:
[all …]
|
| /external/zstd/.github/workflows/ |
| D | generic-dev.yml | 27 steps:
34 steps:
41 steps:
55 steps:
66 steps:
77 steps:
89 steps:
100 steps:
109 steps:
118 steps:
[all …]
|
| /external/libhevc/decoder/ |
| D | ihevcd_statistics.h | 100 …l_size_hist[16][16]; /* PU Sizes [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
101 …st[16][16]; /* PU sizes for skip [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
102 …t[16][16]; /* PU sizes for inter [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
103 …t[16][16]; /* PU sizes for intra [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
104 …[16][16]; /* PU sizes for bipred [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
105 …t[16][16]; /* PU sizes for merge [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
106 …16][16]; /* PU sizes for Zero MV [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
107 …l less than +/- 1 full pel units [Width from 4 to 64 in steps of 4] [Height from 4 to 64 in steps …
|
| /external/skia/site/docs/user/ |
| D | color.md | 22 All color managed drawing is divided into six parts, three steps connecting the
23 source colors to that XYZ D50 space, then three symmetric steps connecting back
24 from XYZ D50 to the destination color space. Some of these steps can
27 the same. Here are the steps:
29 Color management steps
42 type called SkColorSpaceXformSteps. You'll see it as 5 steps there: we always
48 Whenever we're about to do some drawing we look at which of those steps we
66 whichever lets us skip more steps.
70 with that same color space, we'll notice we can skip all six steps. Sometimes
71 fewer steps are needed, sometimes more. In general if you need to do a gamut
[all …]
|
| /external/llvm-project/openmp/runtime/test/ompt/misc/ |
| D | api_calls_misc.c | 24 int steps = 0; in main() local
25 while (ompt_enumerate_states(state, &state, &state_name) && steps < 1000) { in main()
26 steps++; in main()
31 if (steps >= 1000) { in main()
32 // enumeration did not end after 1000 steps in main()
40 steps = 0; in main()
42 steps < 1000) { in main()
43 steps++; in main()
48 if (steps >= 1000) { in main()
49 // enumeration did not end after 1000 steps in main()
|
| /external/tensorflow/tensorflow/compiler/tests/ |
| D | ftrl_test.py | 42 def equivAdagradTest_FtrlPart(self, steps, dtype): argument
56 # Run Ftrl for a few steps
57 for _ in range(steps):
62 def equivAdagradTest_AdagradPart(self, steps, dtype): argument
71 # Run Adagrad for a few steps
72 for _ in range(steps):
77 def equivGradientDescentTest_FtrlPart(self, steps, dtype): argument
91 # Run Ftrl for a few steps
92 for _ in range(steps):
97 def equivGradientDescentTest_GradientDescentPart(self, steps, dtype): argument
[all …]
|
| /external/tensorflow/tensorflow/python/keras/distribute/ |
| D | multi_worker_callback_tf2_test.py | 65 A tuple of (model, saving_filepath, train_ds, steps) where train_ds is
69 steps = 2
74 batch_size, steps)
80 return model, saving_filepath, train_ds, steps
100 model, saving_filepath, train_ds, steps = _model_setup(
120 steps_per_epoch=steps,
122 validation_steps=steps,
152 model, _, train_ds, steps = _model_setup(test_obj, file_format='')
161 steps_per_epoch=steps,
194 model, _, train_ds, steps = _model_setup(test_obj, file_format='')
[all …]
|
| /external/skia/src/gpu/ |
| D | GrColorSpaceXform.h | 24 GrColorSpaceXform(const SkColorSpaceXformSteps& steps) : fSteps(steps) {} in GrColorSpaceXform() argument
31 const SkColorSpaceXformSteps& steps() const { return fSteps; } in steps() function
38 // Code generation depends on which steps we apply, in XformKey()
42 const SkColorSpaceXformSteps& steps(xform->fSteps); in XformKey()
43 uint32_t key = steps.flags.mask(); in XformKey()
44 if (steps.flags.linearize) { in XformKey()
45 key |= classify_transfer_fn(steps.srcTF) << 8; in XformKey()
47 if (steps.flags.encode) { in XformKey()
48 key |= classify_transfer_fn(steps.dstTFInv) << 16; in XformKey()
|
| /external/llvm-project/mlir/lib/Dialect/Linalg/Utils/ |
| D | Utils.cpp | 87 /// bounds and steps and put them into the corresponding vectors.
90 SmallVectorImpl<Value> &steps) { in unpackRanges() argument
94 steps.emplace_back(range.stride); in unpackRanges()
138 SmallVector<Value, 4> lbs, ubs, steps; in doit() local
139 unpackRanges(loopRanges, lbs, ubs, steps); in doit()
141 edsc::loopNestBuilder(lbs, ubs, steps, iterArgInitValues, bodyBuilderFn); in doit()
162 SmallVector<Value, 4> lbs, ubs, steps; in doit() local
163 unpackRanges(loopRanges, lbs, ubs, steps); in doit()
165 // Affine loops require constant steps. in doit()
167 constantSteps.reserve(steps.size()); in doit()
[all …]
|
| /external/llvm-project/libcxx/utils/libcxx/test/ |
| D | format.py | 158 separate compilation and linking steps in this case.
234 steps = [ ] # The steps are already in the script
235 return self._executeShTest(test, litConfig, steps)
237 steps = [
240 return self._executeShTest(test, litConfig, steps)
242 steps = [
245 return self._executeShTest(test, litConfig, steps)
247 steps = [
250 return self._executeShTest(test, litConfig, steps)
252 steps = [
[all …]
|
| /external/mesa3d/.gitlab-ci/ |
| D | traces-panfrost.yml | 85 - path: glmark2/conditionals-fragment-steps=0:vertex-steps=0.rdc
89 - path: glmark2/conditionals-fragment-steps=0:vertex-steps=5.rdc
93 - path: glmark2/conditionals-fragment-steps=5:vertex-steps=0.rdc
109 - path: glmark2/function-fragment-complexity=low:fragment-steps=5.rdc
113 - path: glmark2/function-fragment-complexity=medium:fragment-steps=5.rdc
129 - path: glmark2/loop-fragment-loop=false:fragment-steps=5:vertex-steps=5.rdc
133 - path: glmark2/loop-fragment-steps=5:fragment-uniform=false:vertex-steps=5.rdc
137 - path: glmark2/loop-fragment-steps=5:fragment-uniform=true:vertex-steps=5.rdc
|
| D | traces-radeonsi.yml | 73 - path: glmark2/conditionals-fragment-steps=0:vertex-steps=0.rdc
77 - path: glmark2/conditionals-fragment-steps=0:vertex-steps=5.rdc
81 - path: glmark2/conditionals-fragment-steps=5:vertex-steps=0.rdc
97 - path: glmark2/function-fragment-complexity=low:fragment-steps=5.rdc
101 - path: glmark2/function-fragment-complexity=medium:fragment-steps=5.rdc
117 - path: glmark2/loop-fragment-loop=false:fragment-steps=5:vertex-steps=5.rdc
121 - path: glmark2/loop-fragment-steps=5:fragment-uniform=false:vertex-steps=5.rdc
125 - path: glmark2/loop-fragment-steps=5:fragment-uniform=true:vertex-steps=5.rdc
|
| /external/llvm-project/debuginfo-tests/dexter/dex/heuristic/ |
| D | Heuristic.py | 79 '--penalty-misordered-steps',
82 help='set the penalty for differences in the order of steps'
101 def __init__(self, context, steps): argument
114 for command in steps.commands['DexExpectWatchType']:
115 command.eval(steps)
128 for command in steps.commands['DexExpectWatchValue']:
129 command.eval(steps)
143 for expect_state in steps.commands['DexExpectProgramState']:
144 success = expect_state.eval(steps)
167 for step in getattr(steps, 'steps'):
[all …]
|
| /external/llvm-project/clang/test/SemaCXX/ |
| D | constexpr-steps.cpp | 1 // RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s -DMAX=1234 -fconstexpr-steps 1234
2 // RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s -DMAX=10 -fconstexpr-steps 10
3 // RUN: %clang -std=c++1y -fsyntax-only -Xclang -verify %s -DMAX=12345 -fconstexpr-steps=12345
5 // This takes a total of n + 4 steps according to our current rules:
11 constexpr bool steps(int n) { in steps() function
16 static_assert(steps((MAX - 4)), ""); // ok
17 static_assert(steps((MAX - 3)), ""); // expected-error {{constant}} expected-note{{call}}
|
| /external/clang/test/SemaCXX/ |
| D | constexpr-steps.cpp | 1 // RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s -DMAX=1234 -fconstexpr-steps 1234
2 // RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s -DMAX=10 -fconstexpr-steps 10
3 // RUN: %clang -std=c++1y -fsyntax-only -Xclang -verify %s -DMAX=12345 -fconstexpr-steps=12345
5 // This takes a total of n + 4 steps according to our current rules:
11 constexpr bool steps(int n) { in steps() function
16 static_assert(steps((MAX - 4)), ""); // ok
17 static_assert(steps((MAX - 3)), ""); // expected-error {{constant}} expected-note{{call}}
|