Home
last modified time | relevance | path

Searched refs:fact (Results 1 – 25 of 749) sorted by relevance

12345678910>>...30

/external/apache-http/src/org/apache/http/conn/routing/
DBasicRouteDirector.java69 public int nextStep(RouteInfo plan, RouteInfo fact) { in nextStep() argument
77 if ((fact == null) || (fact.getHopCount() < 1)) in nextStep()
80 step = proxiedStep(plan, fact); in nextStep()
82 step = directStep(plan, fact); in nextStep()
112 protected int directStep(RouteInfo plan, RouteInfo fact) { in directStep() argument
114 if (fact.getHopCount() > 1) in directStep()
116 if (!plan.getTargetHost().equals(fact.getTargetHost())) in directStep()
125 if (plan.isSecure() != fact.isSecure()) in directStep()
130 !plan.getLocalAddress().equals(fact.getLocalAddress()) in directStep()
147 protected int proxiedStep(RouteInfo plan, RouteInfo fact) { in proxiedStep() argument
[all …]
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/
Dtransform.c19 double fact, phase; in WebRtcIsac_InitTransform() local
21 fact = PI / (FRAMESAMPLES_HALF); in WebRtcIsac_InitTransform()
26 phase += fact; in WebRtcIsac_InitTransform()
29 fact = PI * ((double) (FRAMESAMPLES_HALF - 1)) / ((double) FRAMESAMPLES_HALF); in WebRtcIsac_InitTransform()
30 phase = 0.5 * fact; in WebRtcIsac_InitTransform()
34 phase += fact; in WebRtcIsac_InitTransform()
46 double tmp1r, tmp1i, xr, xi, yr, yi, fact; in WebRtcIsac_Time2Spec() local
54 fact = 0.5 / sqrt(FRAMESAMPLES_HALF); in WebRtcIsac_Time2Spec()
58 tmpre[k] = (inre1[k] * tmp1r + inre2[k] * tmp1i) * fact; in WebRtcIsac_Time2Spec()
59 tmpim[k] = (inre2[k] * tmp1r - inre1[k] * tmp1i) * fact; in WebRtcIsac_Time2Spec()
[all …]
/external/skia/tests/
DPathMeasureTest.cpp259 SkContourMeasureIter fact(path, false); in test_empty_contours() local
263 REPORTER_ASSERT(reporter, fact.next()); in test_empty_contours()
264 REPORTER_ASSERT(reporter, fact.next()); in test_empty_contours()
265 REPORTER_ASSERT(reporter, !fact.next()); in test_empty_contours()
276 SkContourMeasureIter fact(path, forceClosed); in test_MLM_contours() local
277 REPORTER_ASSERT(reporter, fact.next()); in test_MLM_contours()
278 REPORTER_ASSERT(reporter, !fact.next()); in test_MLM_contours()
287 SkContourMeasureIter fact(path, false); in DEF_TEST() local
290 auto cm0 = fact.next(); in DEF_TEST()
291 auto cm1 = fact.next(); in DEF_TEST()
[all …]
DOpChainTest.cpp31 static constexpr uint64_t fact(int n) { in fact() function
33 return n > 1 ? n * fact(n - 1) : 1; in fact()
46 static constexpr int kNumCombinableValues = fact(kNumOps) / fact(kNumOps - 2);
/external/eigen/unsupported/test/
Dlevenberg_marquardt.cpp434 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); in df() local
435 fjac(i,0) = 1.*fact; in df()
436 fjac(i,1) = x*fact; in df()
437 fjac(i,2) = xx*fact; in df()
438 fjac(i,3) = xxx*fact; in df()
439 fact = - (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) * fact * fact; in df()
440 fjac(i,4) = x*fact; in df()
441 fjac(i,5) = xx*fact; in df()
442 fjac(i,6) = xxx*fact; in df()
1206 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); in df() local
[all …]
DNonLinearOptimization.cpp823 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); in df() local
824 fjac(i,0) = 1.*fact; in df()
825 fjac(i,1) = x*fact; in df()
826 fjac(i,2) = xx*fact; in df()
827 fjac(i,3) = xxx*fact; in df()
828 fact = - (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) * fact * fact; in df()
829 fjac(i,4) = x*fact; in df()
830 fjac(i,5) = xx*fact; in df()
831 fjac(i,6) = xxx*fact; in df()
1579 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); in df() local
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/
DDfpMath.java294 Dfp fact = a.getOne(); in expInternal() local
299 fact = fact.divide(i); in expInternal()
300 y = y.add(x.multiply(fact)); in expInternal()
678 Dfp fact = a[0].getOne(); in sinInternal() local
685 fact = fact.divide((i-1)*i); // 1 over fact in sinInternal()
686 y = y.add(x.multiply(fact)); in sinInternal()
710 Dfp fact = one; in cosInternal() local
717 fact = fact.divide((i - 1) * i); // 1 over fact in cosInternal()
719 y = y.add(x.multiply(fact)); in cosInternal()
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue143/
DGenericMapTest.java26 BeanWithMap fact = new BeanWithMap(); in testMap() local
27 GenericMap<Integer> shash = fact.getMap(); in testMap()
/external/python/cpython2/Demo/scripts/
Dfact.py11 def fact(n): function
46 print n, fact(n)
/external/grpc-grpc/src/python/grpcio/grpc/_cython/_cygrpc/
Dgrpc.pxi146 # We don't care about the internals (and in fact don't know them)
150 # We don't care about the internals (and in fact don't know them)
154 # We don't care about the internals (and in fact don't know them)
158 # We don't care about the internals (and in fact don't know them)
450 # We don't care about the internals (and in fact don't know them)
454 # We don't care about the internals (and in fact don't know them)
458 # We don't care about the internals (and in fact don't know them)
462 # We don't care about the internals (and in fact don't know them)
502 # We don't care about the internals (and in fact don't know them)
514 # We don't care about the internals (and in fact don't know them)
/external/skqp/tests/
DOpChainTest.cpp31 static constexpr uint64_t fact(int n) { in fact() function
33 return n > 1 ? n * fact(n - 1) : 1; in fact()
46 static constexpr int kNumCombinableValues = fact(kNumOps) / fact(kNumOps - 2);
/external/swiftshader/third_party/subzero/tests_lit/reader_tests/
Dcall.ll41 define internal i32 @fact(i32 %n) {
48 %call = tail call i32 @fact(i32 %sub)
56 ; CHECK-NEXT: define internal i32 @fact(i32 %n) {
62 ; CHECK-NEXT: %call = call i32 @fact(i32 %sub)
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
Dtransform_neon.c34 int32_t fact = 16921 << 5; in ComplexMulAndFindMaxNeon() local
35 int32x4_t factq = vdupq_n_s32(fact); in ComplexMulAndFindMaxNeon()
365 int32x4_t fact = vdupq_n_s32(factQ19); in PostShiftAndDivideAndDemodulateNeon() local
439 outre1_0 = vqdmulhq_s32(outre1_0, fact); in PostShiftAndDivideAndDemodulateNeon()
440 outre2_0 = vqdmulhq_s32(outre2_0, fact); in PostShiftAndDivideAndDemodulateNeon()
441 outre1_1 = vqdmulhq_s32(outre1_1, fact); in PostShiftAndDivideAndDemodulateNeon()
442 outre2_1 = vqdmulhq_s32(outre2_1, fact); in PostShiftAndDivideAndDemodulateNeon()
/external/swiftshader/third_party/LLVM/docs/HistoricalNotes/
D2001-06-20-.NET-Differences.txt7 includes full information about classes and inheritance. In fact, I just
20 link-time code generation. In fact, he said that the .o file was nearly
/external/llvm/docs/HistoricalNotes/
D2001-06-20-.NET-Differences.txt7 includes full information about classes and inheritance. In fact, I just
20 link-time code generation. In fact, he said that the .o file was nearly
/external/skia/src/core/
DSkFlattenable.cpp102 const char* SkFlattenable::FactoryToName(Factory fact) { in FactoryToName() argument
107 if (entries[i].fFactory == fact) { in FactoryToName()
DSkMipMap.cpp314 SkMipMap* SkMipMap::Build(const SkPixmap& src, SkDiscardableFactoryProc fact) { in Build() argument
404 if (fact) { in Build()
405 SkDiscardableMemory* dm = fact(storageSize); in Build()
598 SkMipMap* SkMipMap::Build(const SkBitmap& src, SkDiscardableFactoryProc fact) { in Build() argument
603 return Build(srcPixmap, fact); in Build()
/external/swiftshader/third_party/llvm-7.0/llvm/docs/HistoricalNotes/
D2001-06-20-.NET-Differences.txt7 includes full information about classes and inheritance. In fact, I just
20 link-time code generation. In fact, he said that the .o file was nearly
/external/skqp/src/core/
DSkFlattenable.cpp102 const char* SkFlattenable::FactoryToName(Factory fact) { in FactoryToName() argument
107 if (entries[i].fFactory == fact) { in FactoryToName()
DSkMipMap.cpp314 SkMipMap* SkMipMap::Build(const SkPixmap& src, SkDiscardableFactoryProc fact) { in Build() argument
403 if (fact) { in Build()
404 SkDiscardableMemory* dm = fact(storageSize); in Build()
597 SkMipMap* SkMipMap::Build(const SkBitmap& src, SkDiscardableFactoryProc fact) { in Build() argument
602 return Build(srcPixmap, fact); in Build()
/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteLUT.h362 Scalar fact = u(jj) / ki_it.value(); in factorize() local
365 if(abs(fact) <= m_droptol) in factorize()
375 Scalar prod = fact * ki_it.value(); in factorize()
401 u(len) = fact; in factorize()
/external/swiftshader/third_party/llvm-7.0/llvm/test/Feature/OperandBundles/
Dbasic-aa-argmemonly.ll34 ; deoptimize the caller. This fact, combined with the fact that
/external/llvm/test/Feature/OperandBundles/
Dbasic-aa-argmemonly.ll34 ; deoptimize the caller. This fact, combined with the fact that
/external/python/cpython2/Lib/test/
Dtest_itertools.py51 def fact(n): function
126 …self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of com…
188 return fact(n+r-1) // fact(r) // fact(n-1)
274 … self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms
311 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r))
312 self.assertEqual(len(perm), 0 if r>n else fact(n) // fact(n-r))
313 self.assertEqual(len(comb), 0 if r>n else fact(n) // fact(r) // fact(n-r))
/external/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_Fact.pbtxt3 summary: "Output a fact about factorials."

12345678910>>...30