/external/tensorflow/tensorflow/python/grappler/ |
D | cluster_wrapper.cc | 218 std::set<std::string> feasible; in PYBIND11_MODULE() local 225 std::inserter(feasible, feasible.begin())); in PYBIND11_MODULE() 227 feasible = supported_dev.second; in PYBIND11_MODULE() 231 for (const std::string& type : feasible) { in PYBIND11_MODULE()
|
/external/llvm-project/llvm/test/Transforms/SCCP/ |
D | return-zapped.ll | 6 ; false branch to be feasible. We later discover that @testf actually
|
/external/freetype/docs/ |
D | PROBLEMS | 63 or newer. If this isn't feasible, apply the following patch.
|
/external/boringssl/src/ |
D | BREAKING-CHANGES.md | 39 In some cases, this kind of staged approach is not feasible: perhaps the same code cannot simultane… 60 If breaking the compile is not feasible, break at runtime, in the hope that consumers have some amo… 72 …ange to appear in consumers. This ensures that reverting the change is still feasible if necessary.
|
/external/clang/test/Analysis/ |
D | uninit-vals-ps-region.m | 15 if (global.data == 0) // When the true branch is feasible 'a = 3'.
|
/external/libchrome/mojo/public/cpp/platform/ |
D | README.md | 45 For cases where it is not feasible to transfer a `PlatformHandle` from one
|
/external/llvm-project/polly/lib/External/isl/ |
D | isl_tab_pip.c | 2594 int feasible; in context_lex_test_ineq() local 2609 feasible = !clex->tab->empty; in context_lex_test_ineq() 2613 return feasible; in context_lex_test_ineq() 3249 int feasible; in context_gbr_test_ineq() local 3266 feasible = !cgbr->tab->empty; in context_gbr_test_ineq() 3284 return feasible; in context_gbr_test_ineq() 3872 int feasible; in row_sign() local 3876 feasible = sol->context->op->test_ineq(sol->context, ineq->el); in row_sign() 3877 if (feasible < 0) in row_sign() 3879 if (!feasible) in row_sign() [all …]
|
/external/zstd/tests/ |
D | paramgrill.c | 550 static int feasible(const BMK_benchResult_t results, const constraint_t target) { in feasible() function 596 if(feasible(result1, target) && feasible(result2, target)) { in compareResultLT() 605 return feasible(result2, target) in compareResultLT() 606 || (!feasible(result1, target) in compareResultLT() 752 if(!feasible(r, targetConstraints)) { in insertWinner() 1745 if((feas && !feasible(resultMax, target)) || in allBench()
|
/external/llvm-project/llvm/docs/HistoricalNotes/ |
D | 2001-06-01-GCCOptimizations2.txt | 36 > feasible and should be fun. (Again, link time cost is the issue.)
|
/external/llvm/docs/HistoricalNotes/ |
D | 2001-06-01-GCCOptimizations2.txt | 36 > feasible and should be fun. (Again, link time cost is the issue.)
|
/external/llvm-project/lldb/docs/resources/ |
D | contributing.rst | 73 and only if error handling is not otherwise feasible. Specifically,
|
/external/angle/doc/ |
D | CompilingTranslatorWithEmscripten.md | 104 It's not feasible to interact with the translator's data structures, nor
|
/external/webrtc/docs/native-code/rtp-hdrext/inband-cn/ |
D | README.md | 22 …implementation, not even mentioning that decoding packets is not always feasible. This document pr…
|
/external/python/pybind11/docs/advanced/pycpp/ |
D | utilities.rst | 32 be feasible. This can be fixed using a guard around the library function that
|
/external/tensorflow/tensorflow/lite/experimental/quantization_debugger/ |
D | README.md | 14 This is now feasible using the TensorFlow Lite Quantization Debugger, as shown
|
/external/ruy/ruy/profiler/ |
D | README.md | 145 is likely being spent. When one has such a-priori knowledge, it is feasible to
|
/external/catch2/docs/ |
D | limitations.md | 98 …t suite that takes too long to run and you want to make it parallel, there are 2 feasible solutions
|
/external/ltp/doc/ |
D | nommu-notes.txt | 53 Since this isn't feasible without virtual memory, there is no fork() function.
|
/external/wycheproof/doc/ |
D | dsa.md | 62 be feasible to forge signatures with the values (r=1, s=0) or (r=1, s=q).
|
D | dh.md | 55 feasible [FGHT16]. Moreover some libraries use primes that are susceptible to
|
/external/tensorflow/tensorflow/python/keras/ |
D | metrics.py | 1546 feasible = array_ops.where(predicate(constrained, self.value)) 1547 feasible_exists = math_ops.greater(array_ops.size(feasible), 0) 1550 return math_ops.reduce_max(array_ops.gather(dependent, feasible))
|
/external/python/cpython3/Doc/distutils/ |
D | introduction.rst | 36 always feasible to expect them to create a multitude of built distributions. It
|
/external/python/cpython2/Doc/distutils/ |
D | introduction.rst | 34 always feasible to expect them to create a multitude of built distributions. It
|
/external/python/cpython3/Doc/library/ |
D | shelve.rst | 67 dictionary on disk, if feasible. This is called automatically when the shelf
|
/external/python/cpython2/Doc/library/ |
D | shelve.rst | 69 dictionary on disk, if feasible. This is called automatically when the shelf
|