HomeSort by relevance Sort by last modified time
    Searched refs:decay (Results 26 - 49 of 49) sorted by null

12

  /external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.hash/
hash_unique_ptr.pass.cpp 34 using RawDel = typename std::decay<Del>::type;
  /external/libbrillo/brillo/
any_internal_impl.h 269 using Type = typename std::decay<T>::type;
308 using DataType = internal_details::TypedData<typename std::decay<T>::type>;
313 using DataType = internal_details::TypedData<typename std::decay<T>::type>;
  /frameworks/av/media/libstagefright/codec2/include/
C2.h 181 typedef typename std::decay<T>::type wide_type;
194 typedef typename std::decay<
196 typedef typename std::decay<
  /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
decode_plc.c 44 int16_t decay,
74 /* decay the output signal; this is specific to plc */
75 *Out++ = (int16_t)((int16_t)o * decay >> 15);
77 /* change the decay */
78 decay -= reduceDecay;
79 if( decay < 0 )
80 decay = 0;
82 return( decay );
542 /* --- lower the muliplier (more decay at next sample) --- */
642 /* --- lower the muliplier (more decay at next sample) --- *
    [all...]
  /external/jemalloc/src/
arena.c 10 "decay",
    [all...]
  /external/libbrillo/brillo/dbus/
dbus_param_reader.h 87 // pop the value off the message buffer into. Using std::decay<> to get
90 using ParamValueType = typename std::decay<ParamType>::type;
  /external/webrtc/webrtc/modules/audio_processing/intelligibility/
intelligibility_utils.h 52 // * kStepDecaying uses a recursive exponential decay formula with a
73 // the number of blocks for kStepBlocked. |decay| is the forgetting factor
75 VarianceArray(size_t freqs, StepType type, size_t window_size, float decay);
intelligibility_utils.cc 57 float decay)
66 decay_(decay),
  /external/libchrome/base/
optional.h 132 typename std::enable_if<std::is_same<std::decay<U>, T>::value,
435 constexpr Optional<typename std::decay<T>::type> make_optional(T&& value) {
436 return Optional<typename std::decay<T>::type>(std::forward<T>(value));
  /external/libcxx/test/std/utilities/meta/meta.trans/meta.trans.other/
common_type.pass.cpp 61 using Decay = typename std::decay<Tp>::type;
68 static_assert(std::is_same<Decay<T1>, T1>::value, "must be same");
69 static_assert(std::is_same<Decay<T2>, T2>::value, "must be same");
70 using type = typename std::decay<
95 using DT = Decay<T>;
96 using DU = Decay<U>;
  /external/libopus/celt/
celt_decoder.c 461 opus_val16 decay; local
473 /* Energy decay */
474 decay = loss_count==0 ? QCONST16(1.5f, DB_SHIFT) : QCONST16(.5f, DB_SHIFT);
478 oldBandE[c*nbEBands+i] = MAX16(backgroundLogE[c*nbEBands+i], oldBandE[c*nbEBands+i] - decay);
526 opus_val16 decay; local
601 decay = celt_sqrt(frac_div32(SHR32(E1, 1), E2));
611 "decay". */
617 attenuation = MULT16_16_Q15(fade, decay);
623 attenuation = MULT16_16_Q15(attenuation, decay);
    [all...]
  /prebuilts/go/darwin-x86/src/math/rand/
example_test.go 64 // ExpFloat64 values have an average of 1 but decay exponentially.
  /prebuilts/go/linux-x86/src/math/rand/
example_test.go 64 // ExpFloat64 values have an average of 1 but decay exponentially.
  /external/llvm/tools/sancov/
sancov.cc 169 -> std::map<typename std::decay<decltype(F(*R.begin()))>::type,
170 std::vector<typename std::decay<decltype(*R.begin())>::type>> {
171 std::map<typename std::decay<decltype(F(*R.begin()))>::type,
172 std::vector<typename std::decay<decltype(*R.begin())>::type>>
    [all...]
  /frameworks/native/libs/binder/include/binder/
SafeInterface.h 339 using DecayedT = typename std::decay<FirstT>::type;
341 using DecayedU = typename std::decay<FirstU>::type;
347 // When comparing whether the argument types match the parameter types, we first decay them (see
381 using Decayed = typename std::decay<T>::type;
532 using Decayed = typename std::decay<ElementType>::type;
  /frameworks/native/libs/vr/libpdx/private/pdx/rpc/
type_operators.h 24 using Decay = typename std::decay<T>::type;
28 using IsEquivalent = typename std::is_same<Decay<A>, Decay<B>>::type;
60 : IsConvertible<Decay<A>, Decay<B>> {};
69 : And<IsConvertible<Decay<KeyA>, Decay<KeyB>>,
70 IsConvertible<Decay<ValueA>, Decay<ValueB>>> {}
    [all...]
remote_method.h 87 using ArgsTupleType = std::tuple<typename std::decay<Args>::type...>;
  /external/libvorbis/lib/
vorbisenc.c 72 float decay; member in struct:__anon24329
349 p->tone_decay=att[is].decay*(1.-ds)+att[is+1].decay*ds;
    [all...]
  /external/google-benchmark/include/benchmark/
benchmark_api.h 701 internal::LambdaBenchmark<typename std::decay<Lambda>::type>;
  /external/libcxx/utils/google-benchmark/include/benchmark/
benchmark_api.h 701 internal::LambdaBenchmark<typename std::decay<Lambda>::type>;
  /external/v8/benchmarks/spinning-balls/
v.js 85 Point.prototype.decay = function () { method in class:Point
343 // Decay the current point and remove it from the list
345 if (point.decay()) {
  /external/speex/libspeex/
mdf.c 488 spx_word16_t decay = SHR32(spx_exp(NEG16(DIV32_16(QCONST16(2.4,11),M))),1); local
493 st->prop[i] = MULT16_16_Q15(st->prop[i-1], decay);
    [all...]
  /frameworks/native/cmds/installd/
otapreopt.cpp 87 static constexpr T RoundDown(T x, typename std::decay<T>::type n) {
    [all...]
  /external/jemalloc/include/jemalloc/internal/
arena.h 33 /* Use the decay mode purge method.
41 /* Default decay time in seconds. */
288 * Time at which the current decay interval logically started. We do
307 * advancement we use the delta between arena->decay.ndirty and
314 * each of the past SMOOTHSTEP_NSTEPS decay epochs, where the last
460 /* Decay-based purging state. */
461 arena_decay_t decay; member in struct:arena_s
    [all...]

Completed in 742 milliseconds

12