Jump to content

Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • even or odd, as in isEven = (x % 2 == 0), where % is the modulo operator the use of simple arithmetic constants, e.g., in expressions such as circumference...
    50 KB (4,671 words) - 21:34, 17 May 2025
  • perform a constant number of simple data-constructing operations, in general). This call would thus be a tail call save for ("modulo") the said cons operation...
    41 KB (4,334 words) - 10:00, 1 June 2025
  • Thumbnail for Python (programming language)
    arithmetic operators (+, -, *, /), the floor-division operator //, and the modulo operator %. (With the module operator, a remainder can be negative, e.g...
    175 KB (14,436 words) - 16:17, 30 May 2025
  • Thumbnail for Microsoft Excel
    some of these issues are addressed in Excel 2010. Excel has issues with modulo operations. In the case of excessively large results, Excel will return...
    101 KB (9,679 words) - 18:04, 25 May 2025
  • Thumbnail for ENIAC
    period of verification and debugging, aided by the ability to execute the program step by step. A programming tutorial for the modulo function using an ENIAC...
    75 KB (8,304 words) - 16:12, 30 May 2025
  • Thumbnail for AWK
    current line number, starting at 1 for the first line of input. % is the modulo operator. NR % 4 == 1 is true for the 1st, 5th, 9th, etc., lines of input...
    41 KB (4,764 words) - 11:38, 27 May 2025
  • array bytes at i and j. Finally, i and j are set to 0. All additions are modulo 256. The following Standard Forth version uses Core and Core Extension words...
    44 KB (5,630 words) - 19:45, 29 May 2025
  • Thumbnail for Central processing unit
    different integer arithmetic operations, such as addition, subtraction, modulo operations, or bit shifts. Often, calculating a memory address involves...
    101 KB (11,424 words) - 02:20, 1 June 2025
  • received; it acknowledges that all frames with N(S) values up to N(R)−1 (modulo 8 or modulo 128) have been received and indicates the N(S) of the next frame it...
    41 KB (5,026 words) - 08:43, 25 October 2024
  • integrity checks. ^k Ada modulo types implement modulo arithmetic in all operations, i.e. no range violations are possible. Modulos are not restricted to...
    161 KB (2,287 words) - 06:50, 17 March 2025
  • Thumbnail for ARPANET
    head of ARPA at that time. It computed a polynomial of degree 224 + 17 modulo the 64-bit prime p = 264 − 59. The algorithm was later used by Digital Equipment...
    84 KB (9,178 words) - 08:39, 26 May 2025
  • p of a given number n by looking for values xi and xi+λ which are equal modulo p without knowing p in advance. This is done by computing the greatest common...
    34 KB (4,554 words) - 06:11, 21 May 2025
  • high-order bits are usually lost, as the un-scaled integer gets reduced modulo 2n where n is the size of the storage area. The sign bit, in particular...
    44 KB (5,904 words) - 21:06, 5 May 2025
  • random number generation also belong here. Operations of the form a = b, modulo and bitwise computations that result in the loss of data, are termed to...
    17 KB (1,801 words) - 05:30, 22 June 2024
  • and arithmetic of single-variable polynomials with complex, rational, or modulo p coefficients, as well as string handling and limited list handling abilities...
    16 KB (2,091 words) - 10:47, 27 May 2025
  • desired reducer. A typical default is to hash the key and use the hash value modulo the number of reducers. It is important to pick a partition function that...
    46 KB (5,480 words) - 18:47, 12 December 2024
  • Thumbnail for Scheme (programming language)
    provide a traditional Lisp-style read–eval–print loop for development and debugging. Many also compile Scheme programs to executable binary. Support for embedding...
    73 KB (8,206 words) - 22:54, 27 May 2025
  • finitely-sized machine words, which are more suitably modeled using the integers modulo 2 n {\textstyle 2^{n}} (where n is the bit width of a machine word). There...
    24 KB (2,924 words) - 09:28, 24 May 2025
  • Thumbnail for Random number generation
    as the Fisher–Yates shuffle. Again, a naive implementation may induce a modulo bias into the result, so more involved algorithms must be used. A method...
    36 KB (4,422 words) - 12:00, 18 May 2025
  • provided as a framework feature with the method Debug.Assert(), which is only evaluated when the DEBUG constant is defined. Since version 1.4, Java provides...
    152 KB (13,904 words) - 20:59, 25 January 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)