Search results

View ( | ) (20 | 50 | 100 | 250 | 500)
  • sComplement: .fill BUFFERSIZE,1,0 mov x2,#0 // counter byte string 1 ...
    48 KB (5,847 words) - 21:19, 14 June 2024
  • <pre>[(0, 0), (0, 1), (0, 2), (0, 3), (0, 4)] [(0, 0), (0, 1), (0, 2), (0, 3), (1, 0)] ...
    115 KB (13,636 words) - 11:01, 6 December 2023
  • Other languages, on the other hand do have file inclusion, e.g.: C, COBOL, PL/1. ...the pre-processor must recognise and handle "#include" directives. For PL/1, %include statements would be processed and for COBOL, COPY statements, and ...
    42 KB (5,338 words) - 16:07, 20 November 2023
  • 1.95313e+06 1.95313e+06 ...
    42 KB (4,175 words) - 11:57, 3 December 2023
  • <syntaxhighlight lang="11l">[1,2,1,3,2] < [1,2,0,4,4,0,0,0]</syntaxhighlight> qTabList1: .quad 1,2,3,4,5 ...
    83 KB (9,530 words) - 16:12, 9 January 2024
  • FOR i=0 TO len-1 dst(start+len-i-1)=src(start+i) ...
    85 KB (11,267 words) - 18:54, 22 May 2024
  • {{omit from|SQL PL|It only prints in standard output. There is no way to print in standard err to a different output stream than [[User Output - text|normal text console messages]]. ...
    42 KB (5,392 words) - 22:21, 4 March 2024
  • <syntaxhighlight lang="arturo">user: "admin" Authorization: "Basic " ++ encode user ++ ":" ++ pass ...
    29 KB (3,383 words) - 10:13, 10 December 2023
  • Some languages allow multiple '''loop''' ranges, such as the '''PL/I''' example (snippet) below. prod= 1; /*start with a product of unity. */ ...
    108 KB (13,568 words) - 08:09, 8 June 2024
  • [0, 3, 1, 7, 5, 9, 8, 6, 4, 2], [7, 0, 9, 2, 1, 5, 4, 8, 6, 3], ...
    109 KB (10,292 words) - 00:58, 11 May 2024
  • [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1] element in the Thue-Morse sequence is 0, if it is odd it is 1. You can even use the same register ...
    75 KB (8,023 words) - 17:08, 16 April 2024
  • print ["added user with id:" addUser "JohnDoe" "jodoe@gmail.com" 35] print ["added user with id:" addUser "JaneDoe" "jadoe@gmail.com" 14] ...
    50 KB (6,069 words) - 15:15, 9 March 2024
  • ...t:bold;padding-left:3em;> 1<sup>1</sup> + 3<sup>2</sup> + 5<sup>3</sup> == 1 + 9 + 125 == 135</span> ...such that n equals the sum of its digits raised to the consecutive powers (1,2,3,...)]] ...
    129 KB (15,358 words) - 20:12, 8 May 2024
  • OP + = ( INT a, BOOL b )INT: IF b THEN a + 1 ELSE a FI; 10 "+" 11 = -1 = 21? false ...
    48 KB (5,789 words) - 10:32, 9 January 2024
  • [[User:Codecop|Codecop]] 13:33, 28 January 2012 (UTC) ...ple with production code in QuickBasic, that's a nonsensical position. --[[User:Short Circuit|Michael Mol]] 14:44, 28 January 2012 (UTC) ...
    30 KB (4,956 words) - 22:08, 15 August 2012
  • FOR i% = 1 TO LEN(GW$) WAITUNTIL Close=1 ...
    47 KB (6,032 words) - 17:48, 1 March 2024
  • ...ide interrupt facilities, sometimes called signals either generated by the user or as a result of program failure or reaching a limit like file space. <!-- some systems have difficulty with 1/2 second and that's not the point of this subject anyway DG--> ...
    52 KB (6,544 words) - 07:25, 28 December 2023
  • * prompts the user to enter a number; print(‘#2. #.’.format(L.index + 1, item)) ...
    102 KB (13,172 words) - 17:17, 13 June 2024
  • INT nop = 0, lda = 1, sta = 2, add = 3, sub = 4, brz = 5, jmp = 6, stp = 7; INT m pos := -1; ...
    126 KB (14,070 words) - 17:57, 26 May 2024
  • FOR i=0 TO 1 FOR j=0 TO 1 ...
    127 KB (19,983 words) - 15:39, 5 February 2024
View ( | ) (20 | 50 | 100 | 250 | 500)