Home
last modified time | relevance | path

Searched refs:Let (Results 1 – 25 of 5765) sorted by relevance

12345678910>>...231

/dports/print/qpdf/qpdf-10.5.0/libtests/qtest/lzw/
H A Dlzw1.out3 Let's make something very long.
4 Let's make something very long.
5 Let's make something very long.
6 Let's make something very long.
7 Let's make something very long.
8 Let's make something very long.
9 Let's make something very long.
10 Let's make something very long.
11 Let's make something very long.
12 Let's make something very long.
[all …]
/dports/converters/p5-LaTeXML/LaTeXML-0.8.6/lib/LaTeXML/Package/
H A Dmathdots.sty.ltxml28 Let('\fixedddots', '\ddots');
29 Let('\fixedvdots', '\vdots');
30 Let('\fixediddots', '\iddots');
31 Let('originalddots', '\ddots');
32 Let('originalvdots', '\vdots');
33 Let('originaliddots', '\iddots');
34 Let('originaldddot', '\dddot');
35 Let('originalddddot', '\ddddot');
36 Let('MDoddots', '\ddots');
37 Let('MDovdots', '\vdots');
[all …]
H A Dmathptmx.sty.ltxml21 Let('\upDelta', '\Delta');
22 Let('\upGamma', '\Gamma');
23 Let('\upLambda', '\Lambda');
24 Let('\upOmega', '\Omega');
25 Let('\upPhi', '\Phi');
26 Let('\upPi', '\Pi');
27 Let('\upPsi', '\Psi');
28 Let('\upSigma', '\Sigma');
29 Let('\upTheta', '\Theta');
30 Let('\upUpsilon', '\Upsilon');
[all …]
H A Dmathpazo.sty.ltxml20 Let('\upDelta', '\Delta');
21 Let('\upGamma', '\Gamma');
22 Let('\upLambda', '\Lambda');
23 Let('\upOmega', '\Omega');
24 Let('\upPhi', '\Phi');
25 Let('\upPi', '\Pi');
26 Let('\upPsi', '\Psi');
27 Let('\upSigma', '\Sigma');
28 Let('\upTheta', '\Theta');
29 Let('\upUpsilon', '\Upsilon');
[all …]
H A Dmarvosym.sty.ltxml58 Let('\Force', '\MVArrowDown');
124 Let('\Cutright', '\CutLeft');
155 Let('\Dontwash', '\NoWash');
209 Let('\EurDig', '\EURdig');
210 Let('\EurHv', '\EURhv');
211 Let('\EurCr', '\EURcr');
212 Let('\EurTm', '\EURtm');
229 Let('\CEsign', '\CESign');
371 Let('\BOLogoL', '\BOLogo');
372 Let('\BOLogoP', '\BOLogo');
[all …]
H A DIEEEtran.cls.ltxml138 Let('\IEEEpeerreviewmaketitle', '\maketitle');
191 Let('\IEEEQEDopen', '\IEEEQEDclosed');
192 Let('\IEEEQED', '\IEEEQEDclosed');
328 Let(T_CS('\appendices'), T_CS('\appendix'));
362 Let('\PARstart', '\IEEEPARstart');
363 Let('\pubid', '\IEEEpubid');
387 Let('\QED', '\IEEEQED');
388 Let('\QEDclosed', '\IEEEQEDclosed');
389 Let('\QEDopen', '\IEEEQEDopen');
392 Let('\proof', '\IEEEproof');
[all …]
/dports/deskutils/cairo-dock-plugins/cairo-dock-plug-ins-3.4.1/Dbus/data/
H A DDbus.conf.in6 #b Let external applications pop up dialogs in the dock?
9 #b Let external applications reboot the dock?
12 #b Let external applications quit the dock?
15 #b Let external applications show/hide desklets?
18 #b Let external applications reload applets?
21 #b Let external applications show/hide docks?
24 #b Let extern applications add launchers to the docks?
27 #b Let external applications modify the labels of icons?
30 #b Let extern applications modify the quick-infos on icons?
33 #b Let extern applications modify the icons' image?
[all …]
/dports/lang/v8/v8-9.6.180.12/src/builtins/
H A Dstring-replaceall.tq37 // 1. Let O be ? RequireObjectCoercible(this value).
42 // a. Let isRegExp be ? IsRegExp(searchString).
44 // i. Let flags be ? Get(searchValue, "flags").
64 // 3. Let string be ? ToString(O).
67 // 4. Let searchString be ? ToString(searchValue).
76 // a. Let replaceValue be ? ToString(replaceValue).
83 // 8. Let advanceBy be max(1, searchLength).
89 // 9. Let matchPositions be a new empty List.
95 // 12. Let endOfLastMatch be 0.
96 // 13. Let result be the empty string value.
[all …]
H A Darray-copywithin.tq13 // 1. Let O be ? ToObject(this value).
44 // 9. Let count be min(final-from, len-to).
51 // a. Let direction be -1.
54 // b. Let from be from + count - 1.
57 // c. Let to be to + count - 1.
63 // a. Let fromKey be ! ToString(from).
64 // b. Let toKey be ! ToString(to).
70 // i. Let fromVal be ? Get(O, fromKey).
80 // f. Let from be from + direction.
83 // g. Let to be to + direction.
[all …]
H A Darray-from.tq28 // 1. Let C be the this value.
40 // b. Let mapping be true.
54 // i. Let A be ? Construct(C).
58 // i. Let A be ? ArrayCreate(0).
68 // d. Let k be 0.
84 // ii. Let Pk be ! ToString(k).
120 // viii. Let defineStatus be
136 // 7. Let arrayLike be ! ToObject(items).
149 // a. Let A be ? ArrayCreate(len).
154 // 11. Let k be 0.
[all …]
H A Dregexp-match-all.tq16 // 1. Let R be the this value.
23 // 3. Let S be ? ToString(O).
38 // 4. Let C be ? SpeciesConstructor(R, %RegExp%).
39 // 5. Let flags be ? ToString(? Get(R, "flags")).
40 // 6. Let matcher be ? Construct(C, « R, flags »).
109 // 1. Let O be the this value.
124 // 5. Let R be O.[[iteratingRegExp]].
127 // 6. Let S be O.[[IteratedString]].
130 // 7. Let global be O.[[Global]].
131 // 8. Let fullUnicode be O.[[Unicode]].
[all …]
H A Dtyped-array-subarray.tq12 // 1. Let O be the this value.
19 // 5. Let buffer be O.[[ViewedArrayBuffer]].
22 // 6. Let srcLength be O.[[ArrayLength]].
25 // 7. Let relativeBegin be ? ToInteger(begin).
41 // 11. Let newLength be max(endIndex - beginIndex, 0).
44 // 12. Let constructorName be the String value of O.[[TypedArrayName]].
45 // 13. Let elementSize be the Number value of the Element Size value
49 // 14. Let srcByteOffset be O.[[ByteOffset]].
52 // 15. Let beginByteOffset be srcByteOffset + beginIndex × elementSize.
57 // 16. Let argumentsList be « buffer, beginByteOffset, newLength ».
H A Darray-of.tq10 // 1. Let len be the actual number of arguments passed to this function.
13 // 2. Let items be the List of arguments passed to this function.
16 // 3. Let C be the this value.
24 // a. Let A be ? Construct(C, « len »).
28 // a. Let A be ? ArrayCreate(len).
33 // 6. Let k be 0.
38 // a. Let kValue be items[k].
41 // b. Let Pk be ! ToString(k).
H A Dstring-includes.tq17 // 1. Let O be ? RequireObjectCoercible(this value).
18 // 2. Let S be ? ToString(O).
21 // 3. Let isRegExp be ? IsRegExp(searchString).
27 // 5. Let searchStr be ? ToString(searchString).
30 // 6. Let pos be ? ToIntegerOrInfinity(position).
34 // 8. Let len be the length of S.
37 // 9. Let start be the result of clamping pos between 0 and len.
42 // 10. Let index be ! StringIndexOf(S, searchStr, start).
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/builtins/
H A Darray-copywithin.tq14 // 1. Let O be ? ToObject(this value).
45 // 9. Let count be min(final-from, len-to).
52 // a. Let direction be -1.
55 // b. Let from be from + count - 1.
58 // c. Let to be to + count - 1.
64 // a. Let fromKey be ! ToString(from).
65 // b. Let toKey be ! ToString(to).
71 // i. Let fromVal be ? Get(O, fromKey).
81 // f. Let from be from + direction.
84 // g. Let to be to + direction.
[all …]
H A Darray-from.tq27 // 1. Let C be the this value.
39 // b. Let mapping be true.
53 // i. Let A be ? Construct(C).
57 // i. Let A be ? ArrayCreate(0).
67 // d. Let k be 0.
83 // ii. Let Pk be ! ToString(k).
118 // viii. Let defineStatus be
134 // 7. Let arrayLike be ! ToObject(items).
147 // a. Let A be ? ArrayCreate(len).
152 // 11. Let k be 0.
[all …]
H A Dstring-replaceall.tq98 // 1. Let O be ? RequireObjectCoercible(this value).
103 // a. Let isRegExp be ? IsRegExp(searchString).
105 // i. Let flags be ? Get(searchValue, "flags").
126 // 3. Let string be ? ToString(O).
129 // 4. Let searchString be ? ToString(searchValue).
138 // a. Let replaceValue be ? ToString(replaceValue).
145 // 8. Let advanceBy be max(1, searchLength).
151 // 9. Let matchPositions be a new empty List.
157 // 12. Let endOfLastMatch be 0.
158 // 13. Let result be the empty string value.
[all …]
H A Dtyped-array-subarray.tq12 // 1. Let O be the this value.
19 // 5. Let buffer be O.[[ViewedArrayBuffer]].
22 // 6. Let srcLength be O.[[ArrayLength]].
25 // 7. Let relativeBegin be ? ToInteger(begin).
41 // 11. Let newLength be max(endIndex - beginIndex, 0).
44 // 12. Let constructorName be the String value of O.[[TypedArrayName]].
45 // 13. Let elementSize be the Number value of the Element Size value
49 // 14. Let srcByteOffset be O.[[ByteOffset]].
52 // 15. Let beginByteOffset be srcByteOffset + beginIndex × elementSize.
57 // 16. Let argumentsList be « buffer, beginByteOffset, newLength ».
H A Dregexp-match-all.tq16 // 1. Let R be the this value.
23 // 3. Let S be ? ToString(O).
38 // 4. Let C be ? SpeciesConstructor(R, %RegExp%).
39 // 5. Let flags be ? ToString(? Get(R, "flags")).
40 // 6. Let matcher be ? Construct(C, « R, flags »).
137 // 1. Let O be the this value.
153 // 5. Let R be O.[[iteratingRegExp]].
156 // 6. Let S be O.[[IteratedString]].
159 // 7. Let global be O.[[Global]].
160 // 8. Let fullUnicode be O.[[Unicode]].
[all …]
H A Darray-of.tq10 // 1. Let len be the actual number of arguments passed to this function.
13 // 2. Let items be the List of arguments passed to this function.
16 // 3. Let C be the this value.
24 // a. Let A be ? Construct(C, « len »).
28 // a. Let A be ? ArrayCreate(len).
33 // 6. Let k be 0.
38 // a. Let kValue be items[k].
41 // b. Let Pk be ! ToString(k).
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/builtins/
H A Darray-copywithin.tq13 // 1. Let O be ? ToObject(this value).
44 // 9. Let count be min(final-from, len-to).
51 // a. Let direction be -1.
54 // b. Let from be from + count - 1.
57 // c. Let to be to + count - 1.
63 // a. Let fromKey be ! ToString(from).
64 // b. Let toKey be ! ToString(to).
70 // i. Let fromVal be ? Get(O, fromKey).
80 // f. Let from be from + direction.
83 // g. Let to be to + direction.
[all …]
H A Darray-from.tq26 // 1. Let C be the this value.
38 // b. Let mapping be true.
52 // i. Let A be ? Construct(C).
56 // i. Let A be ? ArrayCreate(0).
66 // d. Let k be 0.
82 // ii. Let Pk be ! ToString(k).
118 // viii. Let defineStatus be
134 // 7. Let arrayLike be ! ToObject(items).
147 // a. Let A be ? ArrayCreate(len).
152 // 11. Let k be 0.
[all …]
H A Dstring-replaceall.tq97 // 1. Let O be ? RequireObjectCoercible(this value).
102 // a. Let isRegExp be ? IsRegExp(searchString).
104 // i. Let flags be ? Get(searchValue, "flags").
124 // 3. Let string be ? ToString(O).
127 // 4. Let searchString be ? ToString(searchValue).
136 // a. Let replaceValue be ? ToString(replaceValue).
143 // 8. Let advanceBy be max(1, searchLength).
149 // 9. Let matchPositions be a new empty List.
155 // 12. Let endOfLastMatch be 0.
156 // 13. Let result be the empty string value.
[all …]
H A Dregexp-match-all.tq16 // 1. Let R be the this value.
23 // 3. Let S be ? ToString(O).
38 // 4. Let C be ? SpeciesConstructor(R, %RegExp%).
39 // 5. Let flags be ? ToString(? Get(R, "flags")).
40 // 6. Let matcher be ? Construct(C, « R, flags »).
109 // 1. Let O be the this value.
124 // 5. Let R be O.[[iteratingRegExp]].
127 // 6. Let S be O.[[IteratedString]].
130 // 7. Let global be O.[[Global]].
131 // 8. Let fullUnicode be O.[[Unicode]].
[all …]
H A Dtyped-array-subarray.tq12 // 1. Let O be the this value.
19 // 5. Let buffer be O.[[ViewedArrayBuffer]].
22 // 6. Let srcLength be O.[[ArrayLength]].
25 // 7. Let relativeBegin be ? ToInteger(begin).
41 // 11. Let newLength be max(endIndex - beginIndex, 0).
44 // 12. Let constructorName be the String value of O.[[TypedArrayName]].
45 // 13. Let elementSize be the Number value of the Element Size value
49 // 14. Let srcByteOffset be O.[[ByteOffset]].
52 // 15. Let beginByteOffset be srcByteOffset + beginIndex × elementSize.
57 // 16. Let argumentsList be « buffer, beginByteOffset, newLength ».

12345678910>>...231