| /external/apache-http/src/org/apache/http/conn/routing/ |
| BasicRouteDirector.java | 62 * @param fact the currently established route, or
69 public int nextStep(RouteInfo plan, RouteInfo fact) {
77 if ((fact == null) || (fact.getHopCount() < 1))
80 step = proxiedStep(plan, fact);
82 step = directStep(plan, fact);
107 * @param fact the currently established route
112 protected int directStep(RouteInfo plan, RouteInfo fact) {
114 if (fact.getHopCount() > 1)
116 if (!plan.getTargetHost().equals(fact.getTargetHost())
[all...] |
| HttpRouteDirector.java | 82 * @param fact the currently established route, or
89 public int nextStep(RouteInfo plan, RouteInfo fact)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Lua/scripts/ |
| Fact.lua | 2 function fact (n)
6 return n * fact(n-1)
12 print(fact(a))
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/ |
| transform.c | 19 double fact, phase; local
21 fact = PI / (FRAMESAMPLES_HALF);
26 phase += fact;
29 fact = PI * ((double) (FRAMESAMPLES_HALF - 1)) / ((double) FRAMESAMPLES_HALF);
30 phase = 0.5 * fact;
34 phase += fact;
46 double tmp1r, tmp1i, xr, xi, yr, yi, fact; local
54 fact = 0.5 / sqrt(FRAMESAMPLES_HALF);
58 tmpre[k] = (inre1[k] * tmp1r + inre2[k] * tmp1i) * fact;
59 tmpim[k] = (inre2[k] * tmp1r - inre1[k] * tmp1i) * fact;
89 double tmp1r, tmp1i, xr, xi, yr, yi, fact; local
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue143/ |
| GenericMapTest.java | 26 BeanWithMap fact = new BeanWithMap(); local
27 GenericMap<Integer> shash = fact.getMap();
32 // String txt = yaml.dump(fact);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/scripts/ |
| fact.py | 11 def fact(n):
function
13 raise ValueError('fact() argument should be >= 1')
46 print n, fact(n)
|
| /external/python/cpython2/Demo/scripts/ |
| fact.py | 11 def fact(n): function
13 raise ValueError('fact() argument should be >= 1')
46 print n, fact(n)
|
| /external/tensorflow/tensorflow/python/user_ops/ |
| user_ops.py | 32 return _gen_user_ops.fact()
|
| /external/skia/tests/ |
| PathMeasureTest.cpp | 259 SkContourMeasureIter fact(path, false);
263 REPORTER_ASSERT(reporter, fact.next());
264 REPORTER_ASSERT(reporter, fact.next());
265 REPORTER_ASSERT(reporter, !fact.next());
276 SkContourMeasureIter fact(path, forceClosed);
277 REPORTER_ASSERT(reporter, fact.next());
278 REPORTER_ASSERT(reporter, !fact.next());
287 SkContourMeasureIter fact(path, false);
290 auto cm0 = fact.next();
291 auto cm1 = fact.next()
[all...] |
| OpChainTest.cpp | 31 static constexpr uint64_t fact(int n) { function in namespace:__anon38355
33 return n > 1 ? n * fact(n - 1) : 1;
46 static constexpr int kNumCombinableValues = fact(kNumOps) / fact(kNumOps - 2);
|
| /external/skia/src/core/ |
| SkFlattenable.cpp | 102 const char* SkFlattenable::FactoryToName(Factory fact) {
107 if (entries[i].fFactory == fact) {
|
| SkMipMap.cpp | 314 SkMipMap* SkMipMap::Build(const SkPixmap& src, SkDiscardableFactoryProc fact) {
404 if (fact) {
405 SkDiscardableMemory* dm = fact(storageSize);
598 SkMipMap* SkMipMap::Build(const SkBitmap& src, SkDiscardableFactoryProc fact) {
603 return Build(srcPixmap, fact);
|
| /external/skqp/src/core/ |
| SkFlattenable.cpp | 102 const char* SkFlattenable::FactoryToName(Factory fact) {
107 if (entries[i].fFactory == fact) {
|
| SkMipMap.cpp | 314 SkMipMap* SkMipMap::Build(const SkPixmap& src, SkDiscardableFactoryProc fact) {
403 if (fact) {
404 SkDiscardableMemory* dm = fact(storageSize);
597 SkMipMap* SkMipMap::Build(const SkBitmap& src, SkDiscardableFactoryProc fact) {
602 return Build(srcPixmap, fact);
|
| /external/skqp/tests/ |
| OpChainTest.cpp | 31 static constexpr uint64_t fact(int n) { function in namespace:__anon39151
33 return n > 1 ? n * fact(n - 1) : 1;
46 static constexpr int kNumCombinableValues = fact(kNumOps) / fact(kNumOps - 2);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/ |
| DfpMath.java | 294 Dfp fact = a.getOne(); local
299 fact = fact.divide(i);
300 y = y.add(x.multiply(fact));
678 Dfp fact = a[0].getOne(); local
685 fact = fact.divide((i-1)*i); // 1 over fact
686 y = y.add(x.multiply(fact));
710 Dfp fact = one local
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| transform_neon.c | 34 int32_t fact = 16921 << 5; local
35 int32x4_t factq = vdupq_n_s32(fact);
365 int32x4_t fact = vdupq_n_s32(factQ19); local
439 outre1_0 = vqdmulhq_s32(outre1_0, fact);
440 outre2_0 = vqdmulhq_s32(outre2_0, fact);
441 outre1_1 = vqdmulhq_s32(outre1_1, fact);
442 outre2_1 = vqdmulhq_s32(outre2_1, fact);
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 362 Scalar fact = u(jj) / ki_it.value(); local
365 if(abs(fact) <= m_droptol)
375 Scalar prod = fact * ki_it.value();
401 u(len) = fact;
|
| /external/eigen/unsupported/test/ |
| NonLinearOptimization.cpp | 823 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); local
824 fjac(i,0) = 1.*fact;
825 fjac(i,1) = x*fact;
826 fjac(i,2) = xx*fact;
827 fjac(i,3) = xxx*fact;
828 fact = - (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) * fact * fact;
829 fjac(i,4) = x*fact;
830 fjac(i,5) = xx*fact;
1579 double fact = 1.\/(1.+b[4]*x+b[5]*xx+b[6]*xxx); local
[all...] |
| levenberg_marquardt.cpp | 434 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); local
435 fjac(i,0) = 1.*fact;
436 fjac(i,1) = x*fact;
437 fjac(i,2) = xx*fact;
438 fjac(i,3) = xxx*fact;
439 fact = - (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) * fact * fact;
440 fjac(i,4) = x*fact;
441 fjac(i,5) = xx*fact;
1206 double fact = 1.\/(1.+b[4]*x+b[5]*xx+b[6]*xxx); local
[all...] |
| /cts/tests/tests/networksecurityconfig/networksecurityconfig-downloadmanager/src/android/security/net/config/cts/ |
| DownloadManagerTest.java | 134 CertificateFactory fact = CertificateFactory.getInstance("X.509"); local
137 certs = fact.generateCertificates(is);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_scope.py | 170 def fact(n):
function in function:ScopeTests.testRecursion.f
174 return n * fact(n - 1)
176 return fact(x)
|
| test_itertools.py | 51 def fact(n):
function
126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs
182 return fact(n+r-1) // fact(r) // fact(n-1)
261 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms
292 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r))
[all...] |
| /external/autotest/client/deps/iwcap/src/ |
| iwcap.c | 330 int fact = (1<<(13+factor))-1; local
331 if (fact > ampdu_fact)
332 ampdu_fact = fact;
|
| /external/python/cpython2/Lib/test/ |
| test_scope.py | 170 def fact(n): function in function:ScopeTests.testRecursion.f
174 return n * fact(n - 1)
176 return fact(x)
|
