| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| FormatVariadicDetails.h | 93 return std::forward<T>(Item);
100 return provider_format_adapter<T>(std::forward<T>(Item));
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| STLExtras.h | 99 std::forward<Params>(params)...);
111 return callback(callable, std::forward<Params>(params)...);
349 return make_range(FilterIteratorT(std::begin(std::forward<RangeT>(Range)),
350 std::end(std::forward<RangeT>(Range)),
352 FilterIteratorT(std::end(std::forward<RangeT>(Range))));
355 // forward declarations required by zip_shortest/zip_first
411 zip_common(Iters &&... ts) : iterators(std::forward<Iters>(ts)...) {}
440 zip_first(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {}
459 zip_shortest(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {}
484 zippy(Args &&... ts_) : ts(std::forward<Args>(ts_)...) {
1098 -> decltype(std::forward<F>(f)(std::get<I>(std::forward<Tuple>(t))...)) { function in namespace:llvm::detail
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| FormatVariadicDetails.h | 93 return std::forward<T>(Item);
100 return provider_format_adapter<T>(std::forward<T>(Item));
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| STLExtras.h | 99 std::forward<Params>(params)...);
111 return callback(callable, std::forward<Params>(params)...);
349 return make_range(FilterIteratorT(std::begin(std::forward<RangeT>(Range)),
350 std::end(std::forward<RangeT>(Range)),
352 FilterIteratorT(std::end(std::forward<RangeT>(Range))));
355 // forward declarations required by zip_shortest/zip_first
411 zip_common(Iters &&... ts) : iterators(std::forward<Iters>(ts)...) {}
440 zip_first(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {}
459 zip_shortest(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {}
484 zippy(Args &&... ts_) : ts(std::forward<Args>(ts_)...) {
1098 -> decltype(std::forward<F>(f)(std::get<I>(std::forward<Tuple>(t))...)) { function in namespace:llvm::detail
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| FormatVariadicDetails.h | 93 return std::forward<T>(Item);
100 return provider_format_adapter<T>(std::forward<T>(Item));
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/ia64/ |
| forward.d | 3 # name ia64 forward references
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| AdamsMoultonIntegrator.java | 214 final boolean forward = t > t0;
227 interpolator.reinitialize(y, forward);
272 hNew = filterStep(stepSize * factor, forward, false);
315 final boolean nextIsLast = forward ? (nextT >= t) : (nextT <= t);
316 hNew = filterStep(scaledH, forward, nextIsLast);
319 final boolean filteredNextIsLast = forward ? (filteredNextT >= t) : (filteredNextT <= t);
|
| AdaptiveStepsizeIntegrator.java | 207 * @param forward forward integration indicator
220 final boolean forward, final int order, final double[] scale,
227 return forward ? initialStep : -initialStep;
244 if (! forward) {
276 if (! forward) {
286 * @param forward forward integration indicator
293 protected double filterStep(final double h, final boolean forward, final boolean acceptSmall)
299 filteredH = forward ? minStep : -minStep
[all...] |
| GraggBulirschStoerIntegrator.java | 557 final boolean forward = t > t0;
619 yMidDots, forward);
621 interpolator = new DummyStepInterpolator(y, yDot1, forward);
653 hNew = initializeStep(equations, forward,
665 if ((forward && (stepStart + stepSize > t)) ||
666 ((! forward) && (stepStart + stepSize < t))) {
670 isLastStep = forward ? (nextT >= t) : (nextT <= t);
685 hNew = FastMath.abs(filterStep(stepSize * stabilityReduction, forward, false));
709 hNew = FastMath.abs(filterStep(stepSize * stabilityReduction, forward, false));
721 optimalStep[k] = FastMath.abs(filterStep(stepSize * fac, forward, true))
[all...] |
| /external/pdfium/core/fpdfapi/parser/ |
| cpdf_array.h | 64 Add(pdfium::MakeUnique<T>(std::forward<Args>(args)...)));
70 Add(pdfium::MakeUnique<T>(m_pPool, std::forward<Args>(args)...)));
77 SetAt(index, pdfium::MakeUnique<T>(std::forward<Args>(args)...)));
84 index, pdfium::MakeUnique<T>(m_pPool, std::forward<Args>(args)...)));
91 InsertAt(index, pdfium::MakeUnique<T>(std::forward<Args>(args)...)));
98 index, pdfium::MakeUnique<T>(m_pPool, std::forward<Args>(args)...)));
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractBiMap.java | 56 AbstractBiMap(Map<K, V> forward, Map<V, K> backward) {
57 setDelegates(forward, backward);
61 private AbstractBiMap(Map<K, V> backward, AbstractBiMap<V, K> forward) {
63 inverse = forward;
88 void setDelegates(Map<K, V> forward, Map<V, K> backward) {
91 checkArgument(forward.isEmpty());
93 checkArgument(forward != backward);
94 delegate = forward;
220 * iteration order so that it is consistent with the forward map.
354 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) {
[all...] |
| Sets.java | [all...] |
| /external/libcxx/test/support/ |
| nasty_containers.hpp | 91 void push_back(value_type&& x) { v_.push_back(std::forward<value_type&&>(x)); }
94 void emplace_back(Args&&... args) { v_.emplace_back(std::forward<Args>(args)...); }
102 { return v_.emplace(pos, std::forward<Args>(args)...); }
108 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); }
213 void push_back(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
214 void push_front(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
217 void emplace_back(Args&&... args) { l_.emplace_back(std::forward<Args>(args)...); }
219 void emplace_front(Args&&... args) { l_.emplace_front(std::forward<Args>(args)...); }
228 { return l_.emplace(pos, std::forward<Args>(args)...); }
234 iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<value_type>(x));
[all...] |
| uses_alloc_types.hpp | 243 std::forward<Args>(args)...))
289 : Base(tag, a, std::forward<Args>(args)...)
323 : Base(AllocLastTag{}, std::forward<Args>(args)...)
349 : Base(tag, alloc, std::forward<Args>(args)...)
355 : Base(AllocLastTag{}, std::forward<Args>(args)...)
380 : Base(tag, alloc, std::forward<Args>(args)...)
386 : Base(AllocLastTag{}, std::forward<Args>(args)...)
|
| /external/skia/src/core/ |
| SkBitmapProcState_matrixProcs.cpp | 398 // need to know our start, and our initial phase (forward or backward)
399 bool forward;
404 forward = false;
407 forward = true;
413 if (forward) {
418 forward = !forward;
423 if (forward) {
428 forward = !forward;
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/support/ |
| nasty_containers.hpp | 88 void push_back(value_type&& x) { v_.push_back(std::forward<value_type&&>(x)); }
91 void emplace_back(Args&&... args) { v_.emplace_back(std::forward<Args>(args)...); }
99 { return v_.emplace(pos, std::forward<Args>(args)...); }
105 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); }
205 void push_back(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
206 void push_front(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
209 void emplace_back(Args&&... args) { l_.emplace_back(std::forward<Args>(args)...); }
211 void emplace_front(Args&&... args) { l_.emplace_front(std::forward<Args>(args)...); }
220 { return l_.emplace(pos, std::forward<Args>(args)...); }
226 iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<value_type>(x));
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/support/ |
| nasty_containers.hpp | 89 void push_back(value_type&& x) { v_.push_back(std::forward<value_type&&>(x)); }
92 void emplace_back(Args&&... args) { v_.emplace_back(std::forward<Args>(args)...); }
100 { return v_.emplace(pos, std::forward<Args>(args)...); }
106 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); }
206 void push_back(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
207 void push_front(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
210 void emplace_back(Args&&... args) { l_.emplace_back(std::forward<Args>(args)...); }
212 void emplace_front(Args&&... args) { l_.emplace_front(std::forward<Args>(args)...); }
221 { return l_.emplace(pos, std::forward<Args>(args)...); }
227 iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<value_type>(x));
[all...] |
| /frameworks/support/v7/recyclerview/src/android/support/v7/util/ |
| DiffUtil.java | 121 // allocate forward and backward k-lines. K lines are diagonal lines in the matrix. (see the
124 final int[] forward = new int[max * 2]; local
132 range.newListStart, range.newListEnd, forward, backward, max);
184 return new DiffResult(cb, snakes, forward, backward, detectMoves);
189 int startNew, int endNew, int[] forward, int[] backward, int kOffset) {
199 Arrays.fill(forward, kOffset - dLimit - 1, kOffset + dLimit + 1, 0);
204 // find forward path
208 if (k == -d || (k != d && forward[kOffset + k - 1] < forward[kOffset + k + 1])) {
209 x = forward[kOffset + k + 1]
[all...] |
| /external/mesa3d/src/gallium/state_trackers/clover/util/ |
| functional.hpp | 286 return std::tuple<Ts...>(std::forward<Ts>(xs)...);
301 operator()(P &&p) const -> decltype(std::get<0>(std::forward<P>(p))) {
302 return std::get<0>(std::forward<P>(p));
309 operator()(P &&p) const -> decltype(std::get<1>(std::forward<P>(p))) {
310 return std::get<1>(std::forward<P>(p));
332 return { std::forward<T>(x) };
369 return { std::forward<T>(x) };
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/ |
| EventState.java | 76 private boolean forward; field in class:EventState
167 // direction (forward or backward). This explains what is done below.
203 forward = interpolator.isForward();
209 final double start = forward ? (t0 + convergence) : t0 - convergence;
252 final double epsilon = (forward ? 0.25 : -0.25) * convergence;
340 nextAction = handler.eventOccurred(t, y, !(increasing ^ forward));
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bidi/ |
| TestInverse.java | 192 forward = "\u200f\u0627\u064e\u0650\u0020\u0028\u0031\u0029", local
202 reverse = Bidi.writeReverse(forward, Bidi.KEEP_BASE_COMBINING);
209 reverse, forward, null, "KEEP_BASE_COMBINING", null);
212 reverse = Bidi.writeReverse(forward, Bidi.REMOVE_BIDI_CONTROLS |
220 reverse, forward, null,
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/bidi/ |
| TestInverse.java | 191 forward = "\u200f\u0627\u064e\u0650\u0020\u0028\u0031\u0029", local
201 reverse = Bidi.writeReverse(forward, Bidi.KEEP_BASE_COMBINING);
208 reverse, forward, null, "KEEP_BASE_COMBINING", null);
211 reverse = Bidi.writeReverse(forward, Bidi.REMOVE_BIDI_CONTROLS |
219 reverse, forward, null,
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/ |
| UnicodeSetClosure.java | 64 public static void generateSets(String label, boolean forward,
67 System.out.println("Generating " + label + (forward ? "" : " BACKWARD"));
69 out.println("# MINIMAL FILTER GENERATED FOR: " + label + (forward ? "" : " BACKWARD"));
71 + (forward ? "" : "( ")
73 + (forward ? "" : " )")
[all...] |
| /packages/apps/TvSettings/Settings/src/com/android/tv/settings/connectivity/ |
| WifiMultiPagedFormActivity.java | 47 boolean forward);
131 FormPageResultListener formPageResultListener, boolean forward, boolean emptyAllowed) {
134 formPageResultListener, forward, emptyAllowed);
173 protected void displayFragment(Fragment fragment, boolean forward) {
174 mFormPageDisplayer.displayFragment(fragment, forward);
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| AllocatorList.h | 38 template <class... Ts> Node(Ts &&... Vs) : V(std::forward<Ts>(Vs)...) {}
49 return new (getAlloc()) Node(std::forward<ArgTs>(Args)...);
174 return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...)));
207 emplace(end(), std::forward<Ts>(Vs)...);
210 emplace(begin(), std::forward<Ts>(Vs)...);
|
