Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)

Page title matches

  • :*   How easy is it to present Unicode strings in source code? :*   Is it convenient to manipulate Unicode strings in the language? ...
    89 KB (13,449 words) - 09:51, 29 March 2024
  • 31 bytes (3 words) - 23:08, 20 February 2011
  • ...to handle ''binary'' strings (strings made of arbitrary bytes, i.e. ''byte strings'' according to Wikipedia) for those languages that don't have built-in supp * Join strings ...
    150 KB (20,586 words) - 08:55, 8 May 2024
  • ..., whose base 2 representation is the concatenation of two identical binary strings, ;;; is the concatenation of two identical binary strings, ...
    96 KB (8,010 words) - 10:11, 3 May 2024
  • ...different length, determine which string is longer or shorter. Print both strings and their length, one on each line. Print the longer one first. Given more than two strings: ...
    89 KB (11,124 words) - 21:19, 29 May 2024
  • ...a &nbsp; [[wp:List_(abstract_data_type)|list]] &nbsp; of arbitrarily many strings, show how to: ...nce/tuple variable (whatever is most idiomatic) with the name &nbsp; <code>strings</code>, &nbsp; and just show the expressions for performing those two tests ...
    111 KB (15,156 words) - 17:44, 30 May 2024
  • <br>Turn the numbers them into strings and concatenate them. with Ada.Strings.Fixed; ...
    28 KB (3,006 words) - 12:32, 28 February 2024
  • 1 KB (184 words) - 19:59, 7 May 2017

Page text matches

  • #REDIRECT [[Binary strings]] ...
    28 bytes (3 words) - 08:23, 2 July 2010
  • #REDIRECT [[Binary strings]] ...
    28 bytes (3 words) - 12:34, 6 February 2010
  • * long (65535 character) strings * NUL-terminated strings ...
    676 bytes (89 words) - 03:24, 4 August 2011
  • * Not allowing certain datastructures: strings/arrays/... : [[Odd word problem]] ...
    648 bytes (86 words) - 01:48, 3 November 2014
  • ...*|BF]] implementation compiles BF programs into functions (from strings to strings) in the host language, [[E]]. ...
    2 KB (291 words) - 11:15, 1 September 2022
  • ** strings, lists, dicts, numbers ...
    766 bytes (98 words) - 01:47, 18 May 2010
  • ==How strings are stored in memory== Strings are encoded using one or more encoding methods, such as [[ASCII]] or [[Unic ...
    4 KB (699 words) - 11:45, 14 August 2023
  • ===Python 3 f-strings and walrus operator=== ...
    4 KB (587 words) - 20:59, 1 September 2022
  • works only if objects are Characters or Strings" iff the objects of the collection are strings or characters" ...
    4 KB (544 words) - 17:37, 8 January 2010
  • "strings" is := strings.Split(raw, "\n") ...
    2 KB (238 words) - 08:52, 1 September 2022
  • ...ganization. Information is stored in "nodes" which contain data (integers, strings, etc., sometimes called an "element") and one or more "links" to to other n ...
    2 KB (299 words) - 23:36, 14 November 2018
  • splitting strings ; ...
    2 KB (262 words) - 08:51, 1 September 2022
  • ...entry retains most of the style of the Python entry, this means cards are strings instead of an enum, etc. Usually in idiomatic D code you use enums instead, In D strings are only partially reference types, unlike in Python, so I have used a smal ...
    7 KB (728 words) - 08:11, 31 August 2022
  • ...'' may be used for allocation of non-contiguous objects, typically varying strings (consisting of the dope and body). ...
    2 KB (346 words) - 13:33, 12 November 2008
  • ...ersion of the algorithm results in incorrect answers for a small subset of strings. One example is ["abcdefgh", "defghabc"] with the correct answer being 6 an ...
    2 KB (320 words) - 20:27, 16 November 2020
  • ...implementation can ignore characters which are not common between the two strings. So, for compactness, let's reduce our example to: 'tisistest' and 'testit We can inspect our two strings for commonalities by comparing all possible combinations of characters: ...
    11 KB (1,136 words) - 22:14, 1 February 2013
  • ...is a total preorder, but not a total order, since it identifies different strings. * '''Proof.''' For, the only way for two different strings s, s' to have the same lexicographic ordering is for one of them to pad to ...
    20 KB (2,321 words) - 19:33, 28 February 2024
  • ...is a total preorder, but not a total order, since it identifies different strings. ...
    12 KB (1,645 words) - 18:50, 26 May 2024
  • ...e. Single dimensional arrays of characters can be initialized by character strings, as the variable S shows. Of course, array aggregates can participate in ar let d = [| "hello"; "world" |] // array of strings ...
    6 KB (785 words) - 17:45, 26 June 2018
  • The present task is focused on the conversion of strings of comma-separated values (CSV) to strings of tab-separated values (TSV) subject to the specific ...
    26 KB (3,674 words) - 10:48, 21 November 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)