| /external/cronet/third_party/libc++/src/test/std/strings/basic.string/string.modifiers/string_replace/ |
| D | replace_with_range.pass.cpp | 44 StrBuffer initial; member 52 // - initial string: empty / one-element / n elements; 60 .initial = "", .from = 0, .to = 0, .input = "", .expected = ""}; 63 .initial = "", .from = 0, .to = 0, .input = "a", .expected = "a"}; 66 .initial = "", .from = 0, .to = 0, .input = "aeiou", .expected = "aeiou"}; 69 .initial = "", 78 .initial = "B", .from = 0, .to = 0, .input = "", .expected = "B"}; 81 .initial = "B", .from = 0, .to = 0, .input = "a", .expected = "aB"}; 84 .initial = "B", .from = 0, .to = 0, .input = "aeiou", .expected = "aeiouB"}; 87 .initial = "B", [all …]
|
| /external/harfbuzz_ng/src/ |
| D | ArabicPUATraditional.txt | 37 0xF210 0xFD88 # ARABIC LIGATURE LAM WITH MEEM WITH HAH INITIAL FORM 44 0xF218 0xFCB0 # ARABIC LIGATURE SEEN WITH MEEM INITIAL FORM 45 0xF219 0xFD30 # ARABIC LIGATURE SHEEN WITH MEEM INITIAL FORM 46 0xF21A 0xFCCD # ARABIC LIGATURE LAM WITH HEH INITIAL FORM 97 0xF249 0xFE91 # ARABIC LETTER BEH INITIAL FORM 102 0xF24D 0xFE97 # ARABIC LETTER TEH INITIAL FORM 107 0xF251 0xFE9B # ARABIC LETTER THEH INITIAL FORM 112 0xF255 0xFE9F # ARABIC LETTER JEEM INITIAL FORM 117 0xF259 0xFEA3 # ARABIC LETTER HAH INITIAL FORM 128 0xF261 0xFEA7 # ARABIC LETTER KHAH INITIAL FORM [all …]
|
| D | ArabicPUASimplified.txt | 78 0xF149 0xFE91 # ARABIC LETTER BEH INITIAL FORM 83 0xF14B 0xFE97 # ARABIC LETTER TEH INITIAL FORM 88 0xF14D 0xFE9B # ARABIC LETTER THEH INITIAL FORM 93 0xF14F 0xFE9F # ARABIC LETTER JEEM INITIAL FORM 98 0xF152 0xFEA3 # ARABIC LETTER HAH INITIAL FORM 103 0xF155 0xFEA7 # ARABIC LETTER KHAH INITIAL FORM 127 0xF161 0xFEB3 # ARABIC LETTER SEEN INITIAL FORM 132 0xF163 0xFEB7 # ARABIC LETTER SHEEN INITIAL FORM 137 0xF165 0xFEBB # ARABIC LETTER SAD INITIAL FORM 142 0xF167 0xFEBF # ARABIC LETTER DAD INITIAL FORM [all …]
|
| /external/llvm/test/tools/llvm-readobj/ |
| D | mips-got.test | 20 GOT-EXE-NEXT: Initial: 0x0 26 GOT-EXE-NEXT: Initial: 0x80000000 34 GOT-EXE-NEXT: Initial: 0x400418 39 GOT-EXE-NEXT: Initial: 0x410840 44 GOT-EXE-NEXT: Initial: 0x0 51 GOT-EXE-NEXT: Initial: 0x0 67 GOT-SO-NEXT: Initial: 0x0 73 GOT-SO-NEXT: Initial: 0x80000000 81 GOT-SO-NEXT: Initial: 0x108E0 86 GOT-SO-NEXT: Initial: 0x10000 [all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/analysis/solvers/ |
| D | LaguerreSolver.java | 38 * Laguerre's method is global in the sense that it can start with any initial 97 final double initial = getStartValue(); in doSolve() local 100 verifySequence(min, initial, max); in doSolve() 102 // Return the initial guess if it is good enough. in doSolve() 103 final double yInitial = computeObjectiveValue(initial); in doSolve() 105 return initial; in doSolve() 114 // Reduce interval if min and initial bracket the root. in doSolve() 116 return laguerre(min, initial, yMin, yInitial); in doSolve() 125 // Reduce interval if initial and max bracket the root. in doSolve() 127 return laguerre(initial, max, yInitial, yMax); in doSolve() [all …]
|
| D | UnivariateSolverUtils.java | 176 …* double, double, int) bracket(function, initial, lowerBound, upperBound, q, r, maximumIterations)} 182 * {@code upperBound} near {@code initial}, it is better to use 184 * bracket(function, initial, lowerBound, upperBound, q, r, maximumIterations)}, 188 * @param initial Initial midpoint of interval being expanded to 199 double initial, in bracket() argument 204 return bracket(function, initial, lowerBound, upperBound, 1.0, 1.0, Integer.MAX_VALUE); in bracket() 209 …* double, double, int) bracket(function, initial, lowerBound, upperBound, q, r, maximumIterations)} 212 * @param initial Initial midpoint of interval being expanded to 225 double initial, in bracket() argument 231 return bracket(function, initial, lowerBound, upperBound, 1.0, 1.0, maximumIterations); in bracket() [all …]
|
| /external/cronet/third_party/libc++/src/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| D | insert_range_after.pass.cpp | 60 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 72 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 84 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 98 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 110 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 122 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 134 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 146 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 158 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() 172 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after() [all …]
|
| /external/cronet/third_party/libc++/src/test/std/containers/sequences/ |
| D | insert_range_sequence_containers.h | 121 .initial = {}, .index = 0, .input = {}, .expected = {} 126 .initial = {}, .index = 0, .input = {}, .expected = {} 131 .initial = {}, .index = 0, .input = {5}, .expected = {5} 134 .initial = {}, .index = 0, .input = "a", .expected = "a" 137 .initial = {}, .index = 0, .input = {true}, .expected = {true} 142 .initial = {}, .index = 0, .input = {5, 3, 1, 7, 9}, .expected = {5, 3, 1, 7, 9} 145 .initial = {}, .index = 0, .input = "aeiou", .expected = "aeiou" 148 .initial = {}, .index = 0, .input = {1, 1, 0, 1, 1}, .expected = {1, 1, 0, 1, 1} 155 .initial = {3}, .index = 0, .input = {}, .expected = {3} 158 .initial = "B", .index = 0, .input = {}, .expected = "B" [all …]
|
| /external/linux-kselftest/tools/testing/selftests/uevent/ |
| D | uevent_filtering.c | 380 * - Open uevent listening socket in initial network namespace owned by in TEST() 381 * initial user namespace. in TEST() 382 * - Trigger uevent in initial network namespace owned by initial user in TEST() 394 * - Open uevent listening socket in non-initial network namespace in TEST() 395 * owned by initial user namespace. in TEST() 396 * - Trigger uevent in initial network namespace owned by initial user in TEST() 409 * - Open uevent listening socket in initial network namespace in TEST() 410 * owned by initial user namespace. in TEST() 411 * - Trigger uevent in initial network namespace owned by initial user in TEST() 423 * - Open uevent listening socket in non-initial network namespace in TEST() [all …]
|
| /external/python/cpython3/Lib/encodings/ |
| D | cp864.py | 116 0x00c6: 0xfe8b, # ARABIC LETTER YEH WITH HAMZA ABOVE INITIAL FORM 118 0x00c8: 0xfe91, # ARABIC LETTER BEH INITIAL FORM 120 0x00ca: 0xfe97, # ARABIC LETTER TEH INITIAL FORM 121 0x00cb: 0xfe9b, # ARABIC LETTER THEH INITIAL FORM 122 0x00cc: 0xfe9f, # ARABIC LETTER JEEM INITIAL FORM 123 0x00cd: 0xfea3, # ARABIC LETTER HAH INITIAL FORM 124 0x00ce: 0xfea7, # ARABIC LETTER KHAH INITIAL FORM 129 0x00d3: 0xfeb3, # ARABIC LETTER SEEN INITIAL FORM 130 0x00d4: 0xfeb7, # ARABIC LETTER SHEEN INITIAL FORM 131 0x00d5: 0xfebb, # ARABIC LETTER SAD INITIAL FORM [all …]
|
| D | cp1006.py | 228 '\ufe91' # 0xB4 -> ARABIC LETTER BEH INITIAL FORM 230 '\ufb58' # 0xB6 -> ARABIC LETTER PEH INITIAL FORM 233 '\ufe97' # 0xB9 -> ARABIC LETTER TEH INITIAL FORM 235 '\ufb68' # 0xBB -> ARABIC LETTER TTEH INITIAL FORM 237 '\ufe9b' # 0xBD -> ARABIC LETTER THEH INITIAL FORM 239 '\ufe9f' # 0xBF -> ARABIC LETTER JEEM INITIAL FORM 241 '\ufb7c' # 0xC1 -> ARABIC LETTER TCHEH INITIAL FORM 243 '\ufea3' # 0xC3 -> ARABIC LETTER HAH INITIAL FORM 245 '\ufea7' # 0xC5 -> ARABIC LETTER KHAH INITIAL FORM 254 '\ufeb3' # 0xCE -> ARABIC LETTER SEEN INITIAL FORM [all …]
|
| /external/python/cpython2/Lib/encodings/ |
| D | cp864.py | 116 0x00c6: 0xfe8b, # ARABIC LETTER YEH WITH HAMZA ABOVE INITIAL FORM 118 0x00c8: 0xfe91, # ARABIC LETTER BEH INITIAL FORM 120 0x00ca: 0xfe97, # ARABIC LETTER TEH INITIAL FORM 121 0x00cb: 0xfe9b, # ARABIC LETTER THEH INITIAL FORM 122 0x00cc: 0xfe9f, # ARABIC LETTER JEEM INITIAL FORM 123 0x00cd: 0xfea3, # ARABIC LETTER HAH INITIAL FORM 124 0x00ce: 0xfea7, # ARABIC LETTER KHAH INITIAL FORM 129 0x00d3: 0xfeb3, # ARABIC LETTER SEEN INITIAL FORM 130 0x00d4: 0xfeb7, # ARABIC LETTER SHEEN INITIAL FORM 131 0x00d5: 0xfebb, # ARABIC LETTER SAD INITIAL FORM [all …]
|
| D | cp1006.py | 228 u'\ufe91' # 0xB4 -> ARABIC LETTER BEH INITIAL FORM 230 u'\ufb58' # 0xB6 -> ARABIC LETTER PEH INITIAL FORM 233 u'\ufe97' # 0xB9 -> ARABIC LETTER TEH INITIAL FORM 235 u'\ufb68' # 0xBB -> ARABIC LETTER TTEH INITIAL FORM 237 u'\ufe9b' # 0xBD -> ARABIC LETTER THEH INITIAL FORM 239 u'\ufe9f' # 0xBF -> ARABIC LETTER JEEM INITIAL FORM 241 u'\ufb7c' # 0xC1 -> ARABIC LETTER TCHEH INITIAL FORM 243 u'\ufea3' # 0xC3 -> ARABIC LETTER HAH INITIAL FORM 245 u'\ufea7' # 0xC5 -> ARABIC LETTER KHAH INITIAL FORM 254 u'\ufeb3' # 0xCE -> ARABIC LETTER SEEN INITIAL FORM [all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| D | LaguerreSolver.java | 35 * Laguerre's method is global in the sense that it can start with any initial 99 public double solve(final double min, final double max, final double initial) in solve() argument 101 return solve(p, min, max, initial); in solve() 105 * Find a real root in the given interval with initial value. 112 * @param initial the start value to use 122 final double min, final double max, final double initial) in solve() argument 125 return solve(f, min, max, initial); in solve() 129 * Find a real root in the given interval with initial value. 136 * @param initial the start value to use 146 final double min, final double max, final double initial) in solve() argument [all …]
|
| D | UnivariateRealSolverUtils.java | 87 * <li> <code> lowerBound <= a < initial < b <= upperBound</code> </li> 94 * <code>a := initial -1; b := initial +1,</code> examines the value of the 109 * near <code>initial,</code> it is better to use 114 * @param initial initial midpoint of interval being expanded to 123 * is not positive, or initial is not between lowerBound and upperBound 126 double initial, double lowerBound, double upperBound) in bracket() argument 128 return bracket( function, initial, lowerBound, upperBound, in bracket() 134 * <li> <code> lowerBound <= a < initial < b <= upperBound</code> </li> 141 * <code>a := initial -1; b := initial +1,</code> examines the value of the 152 * @param initial initial midpoint of interval being expanded to [all …]
|
| D | BrentSolver.java | 104 public double solve(double min, double max, double initial) in solve() argument 106 return solve(f, min, max, initial); in solve() 110 * Find a zero in the given interval with an initial guess. 113 * allowed to have endpoints with the same sign if the initial point has 119 * @param initial the start value to use (must be set to min if no 120 * initial point is known). 124 * @throws IllegalArgumentException if initial is not between min and max 130 final double min, final double max, final double initial) in solve() argument 134 if ((initial < min) || (initial > max)) { in solve() 137 min, initial, max); in solve() [all …]
|
| /external/cronet/net/base/ |
| D | host_mapping_rules_unittest.cc | 92 rules.AddRuleFromString("MAP initial.test replacement.test:1000"); in TEST() 94 GURL url("http://initial.test:111"); in TEST() 101 rules.AddRuleFromString("MAP initial.test [2345:6789::0abc]:1112"); in TEST() 103 GURL url("http://initial.test:111"); in TEST() 110 rules.AddRuleFromString("MAP initial.test replacement.test:1000"); in TEST() 112 GURL url("wss://initial.test:222"); in TEST() 119 rules.AddRuleFromString("MAP initial.test replacement.test:1000"); in TEST() 122 GURL url("file://initial.test/file.txt"); in TEST() 136 rules.AddRuleFromString("MAP initial.test replacement.test:1000"); in TEST() 138 GURL url("foo://initial.test:100"); in TEST() [all …]
|
| /external/cronet/net/third_party/nist-pkits/ |
| D | generate_tests.py | 264 # 1. default settings, but with initial-explicit-policy set. The path 269 # 2. default settings, but with initial-explicit-policy set and 270 # initial-policy-set = {NIST-test-policy-1}. The path should validate 276 # 3. default settings, but with initial-explicit-policy set and 277 # initial-policy-set = {NIST-test-policy-2}. The path should not validate 283 # 4. default settings, but with initial-explicit-policy set and 284 # initial-policy-set = {NIST-test-policy-1, NIST-test-policy-2}. The path 295 # 2. default settings, but with initial-explicit-policy set. The path 305 # 2. default settings, but with initial-explicit-policy set. The path 309 # 3. default settings, but with initial-explicit-policy set and [all …]
|
| /external/cronet/third_party/boringssl/src/pki/testdata/nist-pkits/ |
| D | generate_tests.py | 264 # 1. default settings, but with initial-explicit-policy set. The path 269 # 2. default settings, but with initial-explicit-policy set and 270 # initial-policy-set = {NIST-test-policy-1}. The path should validate 276 # 3. default settings, but with initial-explicit-policy set and 277 # initial-policy-set = {NIST-test-policy-2}. The path should not validate 283 # 4. default settings, but with initial-explicit-policy set and 284 # initial-policy-set = {NIST-test-policy-1, NIST-test-policy-2}. The path 295 # 2. default settings, but with initial-explicit-policy set. The path 305 # 2. default settings, but with initial-explicit-policy set. The path 309 # 3. default settings, but with initial-explicit-policy set and [all …]
|
| /external/licenseclassifier/licenses/ |
| D | CDDL-1.0.txt | 21 1.5. “Initial Developer” means the individual or entity that first makes 30 possible, whether at the time of the initial grant or subsequently acquired, 67 2.1. The Initial Developer Grant. 70 party intellectual property claims, the Initial Developer hereby grants You a 74 Licensable by Initial Developer, to use, reproduce, modify, display, perform, 83 Initial Developer first distributes or otherwise makes the Original Software 149 Contributor or the Initial Developer. 158 behalf, and not on behalf of the Initial Developer or any Contributor. You 161 indemnify the Initial Developer and every Contributor for any liability 162 incurred by the Initial Developer or such Contributor as a result of warranty, [all …]
|
| D | CDDL-1.1.txt | 21 1.5. “Initial Developer” means the individual or entity that first makes 30 possible, whether at the time of the initial grant or subsequently acquired, 67 2.1. The Initial Developer Grant. 70 party intellectual property claims, the Initial Developer hereby grants You a 74 Licensable by Initial Developer, to use, reproduce, modify, display, perform, 83 Initial Developer first distributes or otherwise makes the Original Software 149 Contributor or the Initial Developer. 158 behalf, and not on behalf of the Initial Developer or any Contributor. You 161 indemnify the Initial Developer and every Contributor for any liability 162 incurred by the Initial Developer or such Contributor as a result of warranty, [all …]
|
| /external/licenseclassifier/v2/assets/License/CDDL-1.0/ |
| D | license.txt | 21 1.5. “Initial Developer” means the individual or entity that first makes 30 possible, whether at the time of the initial grant or subsequently acquired, 67 2.1. The Initial Developer Grant. 70 party intellectual property claims, the Initial Developer hereby grants You a 74 Licensable by Initial Developer, to use, reproduce, modify, display, perform, 83 Initial Developer first distributes or otherwise makes the Original Software 149 Contributor or the Initial Developer. 158 behalf, and not on behalf of the Initial Developer or any Contributor. You 161 indemnify the Initial Developer and every Contributor for any liability 162 incurred by the Initial Developer or such Contributor as a result of warranty, [all …]
|
| /external/kotlinx.atomicfu/atomicfu/src/jsMain/kotlin/kotlinx/atomicfu/ |
| D | AtomicFU.kt | 13 public actual fun <T> atomic(initial: T, trace: TraceBase): AtomicRef<T> = AtomicRef<T>(initial) in atomic() 16 public actual fun <T> atomic(initial: T): AtomicRef<T> = atomic(initial, None) in atomic() 19 public actual fun atomic(initial: Int, trace: TraceBase): AtomicInt = AtomicInt(initial) in atomic() 22 public actual fun atomic(initial: Int): AtomicInt = atomic(initial, None) in atomic() 25 public actual fun atomic(initial: Long, trace: TraceBase): AtomicLong = AtomicLong(initial) in atomic() 28 public actual fun atomic(initial: Long): AtomicLong = atomic(initial, None) in atomic() 31 public actual fun atomic(initial: Boolean, trace: TraceBase): AtomicBoolean = AtomicBoolean(initial) in atomic() 34 public actual fun atomic(initial: Boolean): AtomicBoolean = atomic(initial, None) in atomic()
|
| /external/licenseclassifier/v2/assets/License/CDDL-1.1/ |
| D | license.txt | 21 1.5. “Initial Developer” means the individual or entity that first makes 30 possible, whether at the time of the initial grant or subsequently acquired, 67 2.1. The Initial Developer Grant. 70 party intellectual property claims, the Initial Developer hereby grants You a 74 Licensable by Initial Developer, to use, reproduce, modify, display, perform, 83 Initial Developer first distributes or otherwise makes the Original Software 149 Contributor or the Initial Developer. 158 behalf, and not on behalf of the Initial Developer or any Contributor. You 161 indemnify the Initial Developer and every Contributor for any liability 162 incurred by the Initial Developer or such Contributor as a result of warranty, [all …]
|
| /external/rust/crates/ring/tests/ |
| D | constant_time_tests.rs | 27 let initial: [u8; 256] = rand::generate(&rand::SystemRandom::new()).unwrap().expose(); in test_verify_slices_are_equal() localVariable 30 let copy = initial; in test_verify_slices_are_equal() 34 constant_time::verify_slices_are_equal(&initial, ©[..len]), in test_verify_slices_are_equal() 39 constant_time::verify_slices_are_equal(&initial[..len], ©[..len]), in test_verify_slices_are_equal() 45 constant_time::verify_slices_are_equal(&initial, ©), in test_verify_slices_are_equal() 50 for i in 0..initial.len() { in test_verify_slices_are_equal() 52 let mut copy = initial; in test_verify_slices_are_equal() 55 for len in 0..=initial.len() { in test_verify_slices_are_equal() 57 assert_ne!(&initial[..], ©[..]); in test_verify_slices_are_equal() 59 let a = &initial[..len]; in test_verify_slices_are_equal()
|