| /external/sdv/vsomeip/third_party/boost/numeric/odeint/include/boost/numeric/odeint/stepper/detail/ |
| D | adams_bashforth_call_algebra.hpp | 36 …Algebra &algebra , const StateIn &in , StateOut &out , const StepStorage &steps , const Coefficien… in operator ()()
39 …algebra.for_each3( out , in , steps[0].m_v , typename Operations::template scale_sum2< value_type … in operator ()()
48 …Algebra &algebra , const StateIn &in , StateOut &out , const StepStorage &steps , const Coefficien… in operator ()()
51 algebra.for_each4( out , in , steps[0].m_v , steps[1].m_v , in operator ()()
61 …Algebra &algebra , const StateIn &in , StateOut &out , const StepStorage &steps , const Coefficien… in operator ()()
64 algebra.for_each5( out , in , steps[0].m_v , steps[1].m_v , steps[2].m_v , in operator ()()
74 …Algebra &algebra , const StateIn &in , StateOut &out , const StepStorage &steps , const Coefficien… in operator ()()
77 algebra.for_each6( out , in , steps[0].m_v , steps[1].m_v , steps[2].m_v , steps[3].m_v , in operator ()()
88 …Algebra &algebra , const StateIn &in , StateOut &out , const StepStorage &steps , const Coefficien… in operator ()()
91 …algebra.for_each7( out , in , steps[0].m_v , steps[1].m_v , steps[2].m_v , steps[3].m_v , steps[4]… in operator ()()
[all …]
|
| D | adams_moulton_call_algebra.hpp | 35 …StateIn &in , StateOut &out , const DerivIn &dxdt , const StepStorage& /* steps */ , const Coeffic… in operator ()()
47 …st StateIn &in , StateOut &out , const DerivIn &dxdt , const StepStorage &steps , const Coefficien… in operator ()()
50 algebra.for_each4( out , in , dxdt , steps[0].m_v , in operator ()()
60 …st StateIn &in , StateOut &out , const DerivIn &dxdt , const StepStorage &steps , const Coefficien… in operator ()()
63 algebra.for_each5( out , in , dxdt , steps[0].m_v , steps[1].m_v , in operator ()()
73 …st StateIn &in , StateOut &out , const DerivIn &dxdt , const StepStorage &steps , const Coefficien… in operator ()()
76 algebra.for_each6( out , in , dxdt , steps[0].m_v , steps[1].m_v , steps[2].m_v , in operator ()()
87 …st StateIn &in , StateOut &out , const DerivIn &dxdt , const StepStorage &steps , const Coefficien… in operator ()()
90 … algebra.for_each7( out , in , dxdt , steps[0].m_v , steps[1].m_v , steps[2].m_v , steps[3].m_v , in operator ()()
101 …st StateIn &in , StateOut &out , const DerivIn &dxdt , const StepStorage &steps , const Coefficien… in operator ()()
[all …]
|
| /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 | 138 steps_per_epoch: Total number of steps (batches of samples)
142 validation_steps: Number of steps to run validation for
206 count_mode='steps',
209 # Calculate the steps each time on the device.
266 steps=validation_steps,
291 steps=None, argument
299 steps: Total number of steps (batches of samples)
351 progbar = Progbar(target=steps)
363 steps_per_epoch=steps,
365 count_mode='steps',
[all …]
|
| D | training_generator_v1.py | 56 steps_name='steps',
65 steps_per_epoch: Total number of steps (batches of samples) before
78 validation_steps: Total number of steps (batches of samples) before
107 steps_name: The string name of the steps argument, either `steps`,
110 **kwargs: Additional arguments for backwards compatibility. `steps` is
121 if 'steps' in kwargs:
122 steps_per_epoch = kwargs['steps']
124 # Determine the number of steps per epoch and whether we should reset the
166 count_mode = 'steps' if use_steps else 'samples'
181 True, steps=steps_per_epoch)
[all …]
|
| /external/ComputeLibrary/src/core/helpers/ |
| D | WindowHelpers.h | 28 #include "arm_compute/core/Steps.h"
98 * @param[in] steps (Optional) Number of elements processed for each step.
104 Window calculate_max_window(const ValidRegion &valid_region, const Steps &steps = Steps(), bool ski…
109 * @param[in] steps (Optional) Number of elements processed for each step.
115 Window calculate_max_window(const TensorShape &shape, const Steps &steps = Steps(), bool skip_borde…
120 * @param[in] steps (Optional) Number of elements processed for each step.
126 inline Window calculate_max_window(const ITensorInfo &info, const Steps &steps = Steps(), bool skip…
128 return calculate_max_window(info.tensor_shape(), steps, skip_border, border_size);
134 * @param[in] steps (Optional) Number of elements processed for each step.
140 Window calculate_max_window_horizontal(const ValidRegion &valid_region, const Steps &steps = Steps(…
[all …]
|
| D | WindowHelpers.cpp | 28 Window calculate_max_window(const ValidRegion &valid_region, const Steps &steps, bool skip_border, … in calculate_max_window() argument
45 …>(shape[0]) - static_cast<int>(border_size.left) - static_cast<int>(border_size.right)), steps[0]), in calculate_max_window()
46 steps[0])); in calculate_max_window()
56 …>(shape[1]) - static_cast<int>(border_size.top) - static_cast<int>(border_size.bottom)), steps[1]), in calculate_max_window()
57 steps[1])); in calculate_max_window()
64 window.set(2, Window::Dimension(anchor[2], std::max<size_t>(1, shape[2]), steps[2])); in calculate_max_window()
82 Window calculate_max_window(const TensorShape &shape, const Steps &steps, bool skip_border, BorderS… in calculate_max_window() argument
96 …>(shape[0]) - static_cast<int>(border_size.left) - static_cast<int>(border_size.right)), steps[0]), in calculate_max_window()
97 steps[0])); in calculate_max_window()
107 …>(shape[1]) - static_cast<int>(border_size.top) - static_cast<int>(border_size.bottom)), steps[1]), in calculate_max_window()
[all …]
|
| /external/ComputeLibrary/arm_compute/core/ |
| D | Steps.h | 40 class Steps : public Dimensions<uint32_t>
43 /** Constructor to initialize the steps.
45 * @param[in] steps Values to initialize the steps.
48 Steps(Ts... steps) in Steps() function
49 : Dimensions{ steps... } in Steps()
55 constexpr Steps(const Steps &) = default;
57 Steps &operator=(const Steps &) = default;
59 constexpr Steps(Steps &&) = default;
61 Steps &operator=(Steps &&) = default;
63 ~Steps() = default;
|
| /external/curl/.circleci/ |
| D | config.yml | 35 steps:
42 steps:
49 steps:
56 steps:
63 steps:
70 steps:
77 steps:
84 steps:
91 steps:
98 steps:
[all …]
|
| /external/google-cloud-java/java-network-management/proto-google-cloud-network-management-v1/src/main/java/com/google/cloud/networkmanagement/v1/ |
| D | TraceOrBuilder.java | 74 * A trace of a test contains multiple steps from the initial state to the
76 * The steps are ordered by the processing sequence within the simulated
77 * network state machine. It is critical to preserve the order of the steps
81 * <code>repeated .google.cloud.networkmanagement.v1.Step steps = 2;</code>
88 * A trace of a test contains multiple steps from the initial state to the
90 * The steps are ordered by the processing sequence within the simulated
91 * network state machine. It is critical to preserve the order of the steps
95 * <code>repeated .google.cloud.networkmanagement.v1.Step steps = 2;</code>
102 * A trace of a test contains multiple steps from the initial state to the
104 * The steps are ordered by the processing sequence within the simulated
[all …]
|
| D | Trace.java | 26 * * Each trace contains multiple ordered steps.
146 * A trace of a test contains multiple steps from the initial state to the
148 * The steps are ordered by the processing sequence within the simulated
149 * network state machine. It is critical to preserve the order of the steps
153 * <code>repeated .google.cloud.networkmanagement.v1.Step steps = 2;</code>
163 * A trace of a test contains multiple steps from the initial state to the
165 * The steps are ordered by the processing sequence within the simulated
166 * network state machine. It is critical to preserve the order of the steps
170 * <code>repeated .google.cloud.networkmanagement.v1.Step steps = 2;</code>
181 * A trace of a test contains multiple steps from the initial state to the
[all …]
|
| /external/google-cloud-java/java-network-management/proto-google-cloud-network-management-v1beta1/src/main/java/com/google/cloud/networkmanagement/v1beta1/ |
| D | TraceOrBuilder.java | 74 * A trace of a test contains multiple steps from the initial state to the
76 * The steps are ordered by the processing sequence within the simulated
77 * network state machine. It is critical to preserve the order of the steps
81 * <code>repeated .google.cloud.networkmanagement.v1beta1.Step steps = 2;</code>
88 * A trace of a test contains multiple steps from the initial state to the
90 * The steps are ordered by the processing sequence within the simulated
91 * network state machine. It is critical to preserve the order of the steps
95 * <code>repeated .google.cloud.networkmanagement.v1beta1.Step steps = 2;</code>
102 * A trace of a test contains multiple steps from the initial state to the
104 * The steps are ordered by the processing sequence within the simulated
[all …]
|
| D | Trace.java | 26 * * Each trace contains multiple ordered steps.
147 * A trace of a test contains multiple steps from the initial state to the
149 * The steps are ordered by the processing sequence within the simulated
150 * network state machine. It is critical to preserve the order of the steps
154 * <code>repeated .google.cloud.networkmanagement.v1beta1.Step steps = 2;</code>
164 * A trace of a test contains multiple steps from the initial state to the
166 * The steps are ordered by the processing sequence within the simulated
167 * network state machine. It is critical to preserve the order of the steps
171 * <code>repeated .google.cloud.networkmanagement.v1beta1.Step steps = 2;</code>
182 * A trace of a test contains multiple steps from the initial state to the
[all …]
|
| /external/zstd/.github/workflows/ |
| D | dev-long-tests.yml | 17 steps:
28 steps:
36 steps:
47 steps:
57 steps:
64 steps:
71 steps:
79 steps:
87 steps:
98 steps:
[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/fsverity-utils/.github/workflows/ |
| D | ci.yml | 15 steps:
22 steps:
29 steps:
36 steps:
43 steps:
50 steps:
57 steps:
64 steps:
75 steps:
87 steps:
[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/sdv/vsomeip/third_party/boost/numeric/odeint/include/boost/numeric/odeint/stepper/ |
| D | adams_bashforth.hpp | 72 size_t Steps ,
80 class InitializingStepper = extrapolation_stepper< order_helper<Steps>::value,
88 BOOST_STATIC_ASSERT(( Steps > 0 ));
89 BOOST_STATIC_ASSERT(( Steps < 9 ));
109 …typedef adams_bashforth< Steps , State , Value , Deriv , Time , Algebra , Operations , Resizer , I…
111 static const size_t steps = Steps; member in boost::numeric::odeint::adams_bashforth
116 static const order_type order_value = steps;
118 typedef detail::rotating_buffer< wrapped_deriv_type , steps > step_storage_type;
200 for( size_t i=0 ; i+1<steps ; ++i ) in initialize()
208 m_steps_initialized = steps; in initialize()
[all …]
|
| D | adams_bashforth_moulton.hpp | 45 size_t Steps ,
59 BOOST_STATIC_ASSERT(( Steps > 0 ));
60 BOOST_STATIC_ASSERT(( Steps < 9 ));
77 static const size_t steps = Steps; member in boost::numeric::odeint::adams_bashforth_moulton
79 …typedef adams_bashforth< steps , state_type , value_type , deriv_type , time_type , algebra_type ,…
80 …typedef adams_moulton< steps , state_type , value_type , deriv_type , time_type , algebra_type , o…
81 …typedef adams_bashforth_moulton< steps , state_type , value_type , deriv_type , time_type , algebr…
84 static const order_type order_value = steps;
214 * parameter Steps and it then uses the result from the previous Steps steps.
217 * Currently, a maximum of Steps=8 is supported.
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/ode/ |
| D | ContinuousOutputFieldModel.java | 37 * during the integration process and stores a copy of all steps information in a sorted collection
55 * maneuver. If the same continuous output model handles the steps of all integration phases, the
61 * steps are small (which can result from small tolerance settings in {@link
85 /** Steps table. */
86 private List<FieldStepInterpolator<T>> steps; field in ContinuousOutputFieldModel
90 steps = new ArrayList<FieldStepInterpolator<T>>(); in ContinuousOutputFieldModel()
111 if (model.steps.size() == 0) { in append()
115 if (steps.size() == 0) { in append()
121 final FieldODEStateAndDerivative<T> s1 = steps.get(0).getPreviousState(); in append()
122 final FieldODEStateAndDerivative<T> s2 = model.steps.get(0).getPreviousState(); in append()
[all …]
|
| D | ContinuousOutputModel.java | 37 * during the integration process and stores a copy of all steps information in a sorted collection
55 * maneuver. If the same continuous output model handles the steps of all integration phases, the
66 * important if the state vector is large, if the integration interval is long or if the steps are
92 /** Steps table. */
93 private List<StepInterpolator> steps; field in ContinuousOutputModel
97 steps = new ArrayList<StepInterpolator>(); in ContinuousOutputModel()
116 if (model.steps.size() == 0) { in append()
120 if (steps.size() == 0) { in append()
135 final StepInterpolator lastInterpolator = steps.get(index); in append()
146 for (StepInterpolator interpolator : model.steps) { in append()
[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
95 return '<Template instance, steps=%r>' % (self.steps,)
99 self.steps = []
105 t.steps = self.steps[:]
121 if self.steps and self.steps[-1][1] == SINK:
127 self.steps.append((cmd, kind))
137 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/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 …
|