Home
last modified time | relevance | path

Searched refs:excess (Results 1 – 25 of 165) sorted by relevance

1234567

/third_party/typescript/tests/baselines/reference/
DexcessPropertyCheckWithNestedArrayIntersection.types32 >{ dataType: { fields: [{ key: 'bla', // should be OK: Not excess value: null, }],…
36 >{ fields: [{ key: 'bla', // should be OK: Not excess value: null, }], } : { field…
40 >[{ key: 'bla', // should be OK: Not excess value: null, }] : { key: string; value: nu…
41 >{ key: 'bla', // should be OK: Not excess value: null, } : { key: string; value: null…
43 key: 'bla', // should be OK: Not excess
DexcessPropertyCheckWithMultipleDiscriminants.types40 >{ type: "number", value: 10, multipleOf: 5, // excess property format: "what?"} : { ty…
50 multipleOf: 5, // excess property
73 // This has excess error because variant three is the only applicable case.
96 // This has no excess error because variant one and three are both applicable.
119 // This has excess error because variant two is the only applicable case
DexcessPropertyCheckWithMultipleDiscriminants.errors.txt39 multipleOf: 5, // excess property
49 // This has excess error because variant three is the only applicable case.
60 // This has no excess error because variant one and three are both applicable.
68 // This has excess error because variant two is the only applicable case
DexcessPropertyCheckWithMultipleDiscriminants.symbols68 multipleOf: 5, // excess property
87 // This has excess error because variant three is the only applicable case.
106 // This has no excess error because variant one and three are both applicable.
125 // This has excess error because variant two is the only applicable case
DconditionalTypesExcessProperties.types20 sa = { test: 'hi', arg: a }; // not excess (but currently still not assignable)
29 sa = { test: 'bye', arg: a, arr: a } // excess
DconditionalTypesExcessProperties.symbols27 sa = { test: 'hi', arg: a }; // not excess (but currently still not assignable)
33 sa = { test: 'bye', arg: a, arr: a } // excess
DconditionalTypesExcessProperties.errors.txt15 sa = { test: 'hi', arg: a }; // not excess (but currently still not assignable)
19 sa = { test: 'bye', arg: a, arr: a } // excess
DobjectLiteralExcessProperties.types106 // No excess property checks on generic types
113 // No excess property checks on intersections involving generics
144 // No excess property checks when union includes 'object' type
DexcessPropertyCheckWithUnions.types106 // correctly error on excess property 'extra', even when ambiguous
221 // Nested excess property checks work with discriminated unions
240 >{ kind: "A", n: { a: "a", b: "b", // excess -- kind: "A" }} : { kind: "A"; …
248 >{ a: "a", b: "b", // excess -- kind: "A" } : { a: string; b: string; }
254 b: "b", // excess -- kind: "A"
DobjectLiteralExcessProperties.symbols99 // No excess property checks on generic types
105 // No excess property checks on intersections involving generics
130 // No excess property checks when union includes 'object' type
DspreadExcessProperty.types17 const a1: A = { ...extra1 }; // spread should not give excess property errors
DspreadExcessProperty.symbols13 const a1: A = { ...extra1 }; // spread should not give excess property errors
DexcessPropertyCheckWithNestedArrayIntersection.symbols47 key: 'bla', // should be OK: Not excess
DcheckJsxChildrenProperty15.errors.txt18 // Not OK (excess children)
/third_party/skia/src/gpu/
DGrProgramDesc.h42 uint32_t excess = fBitsUsed - 32; in addBits() local
43 fCurValue = excess ? (val >> (numBits - excess)) : 0; in addBits()
44 fBitsUsed = excess; in addBits()
/third_party/boost/boost/random/
Ddiscrete_distribution.hpp51 IntType excess = 0; in init_average() local
60 if(diff % n > excess) { in init_average()
62 excess += n - diff % n; in init_average()
64 excess -= diff % n; in init_average()
69 if(diff % n < n - excess) { in init_average()
70 excess += diff % n; in init_average()
73 excess -= n - diff % n; in init_average()
79 _excess = excess; in init_average()
/third_party/boost/boost/geometry/formulas/
Darea_formulas.hpp354 CT excess; in spherical() local
376 excess = alp2 - alp1; in spherical()
387 excess = CT(2.0) in spherical()
393 return excess; in spherical()
463 CT excess; in ellipsoidal() local
478 excess = CT(2) * atan2(sin_omg12 * (sin_bet1 * cos_bet2p1 + sin_bet2 * cos_bet1p1), in ellipsoidal()
489 excess = alp2 - alp1; in ellipsoidal()
492 result.spherical_term = excess; in ellipsoidal()
/third_party/boost/libs/math/doc/distributions/
Dnon_members.qbk312 (that includes a table of formulae for kurtosis excess for various distributions)
315 which treats "kurtosis" and "kurtosis excess" as the same quantity.
319 This subtraction of 3 is convenient so that the ['kurtosis excess]
327 [h4:kurtosis_excess Kurtosis excess]
332 Returns the kurtosis excess of the distribution /dist/.
334 kurtosis excess = [gamma][sub 2]= [mu][sub 4] / [mu][sub 2][super 2]- 3 = kurtosis - 3
339 The kurtosis excess is a measure of the "peakedness" of a distribution, and
341 the kurtosis excess of a normal distribution is zero.
344 a defined kurtosis excess.
346 Kurtosis excess can have a value from -2 to + infinity.
[all …]
/third_party/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_state_fs_linear_llvm.c266 LLVMValueRef excess; in llvmpipe_fs_variant_linear_llvm() local
452 excess = LLVMBuildAnd(builder, width, LLVMConstInt(int32t, 3, 0), ""); in llvmpipe_fs_variant_linear_llvm()
473 …lp_build_if(&ifstate, gallivm, LLVMBuildICmp(builder, LLVMIntNE, excess, LLVMConstInt(int32t, 0, 0… in llvmpipe_fs_variant_linear_llvm()
494 lp_build_loop_end_cond(&loop_read, excess, LLVMConstInt(int32t, 1, 0), LLVMIntUGE); in llvmpipe_fs_variant_linear_llvm()
510 lp_build_loop_end_cond(&loop_write, excess, LLVMConstInt(int32t, 1, 0), LLVMIntUGE); in llvmpipe_fs_variant_linear_llvm()
/third_party/ntfs-3g/ntfsprogs/
Dntfscp.c432 s64 excess; in merge_run() local
440 excess = alctx->gathered_clusters + count in merge_run()
444 replace = excess > (alctx->rl[0].length in merge_run()
448 replace = (excess > alctx->rl[0].length) in merge_run()
455 excess = alctx->gathered_clusters + count in merge_run()
459 && (alctx->rl[drop].length <= excess)) { in merge_run()
460 excess -= alctx->rl[drop].length; in merge_run()
478 alctx->gathered_clusters = alctx->wanted_clusters + excess; in merge_run()
/third_party/mesa3d/src/panfrost/bifrost/
Dbi_ra.c198 unsigned excess = count - 1; in bi_make_affinity() local
199 uint64_t mask = BITFIELD_MASK(excess); in bi_make_affinity()
200 clobbered |= mask << (64 - excess); in bi_make_affinity()
203 clobbered |= mask << (16 - excess); in bi_make_affinity()
/third_party/boost/boost/random/detail/
Dseed_impl.hpp148 unsigned_type excess = (range + 1) >> (bits - discarded_bits); in generate_from_int() local
149 if(excess != 0) { in generate_from_int()
150 int extra_bits = detail::integer_log2((excess - 1) ^ excess); in generate_from_int()
/third_party/typescript/tests/cases/conformance/jsx/
DcheckJsxChildrenProperty15.tsx15 // Not OK (excess children)
/third_party/jerryscript/tools/runners/
Drun-benchmarks.sh49 run ubench/function-excess-args
/third_party/curl/lib/
Dtransfer.c567 size_t excess = 0; /* excess bytes read */ in readwrite_data() local
785 excess = (size_t)(k->bytecount + nread - k->maxdownload); in readwrite_data()
786 if(excess > 0 && !k->ignorebody) { in readwrite_data()
793 excess, k->size, k->maxdownload, k->bytecount); in readwrite_data()
857 if(conn->handler->readwrite && excess) { in readwrite_data()
861 if(&k->str[excess] > &buf[data->set.buffer_size]) { in readwrite_data()
864 excess = &buf[data->set.buffer_size] - k->str; in readwrite_data()
866 nread = (ssize_t)excess; in readwrite_data()

1234567