Syntax coloring

16 Jan 2017

This is how you find out if a number is prime in JavaScript:

function isPrime(n) {
  var divisor = 2;

  while (n > divisor) {
    if (n % divisor == 0) {
     return false;
    }
    else
      divisor++;
  }
  return true;
}

Although it‘s not very efficient.

Replace All in Lisp

  1. (defun replace-all (string part replacement &key (test #'char=))
  2. "Returns a new string in which all the occurences of the part is replaced with replacement."
  3.     (with-output-to-string (out)
  4.       (loop with part-length = (length part)
  5.             for old-pos = 0 then (+ pos part-length)
  6.             for pos = (search part string
  7.                               :start2 old-pos
  8.                               :test test)
  9.             do (write-string string out
  10.                              :start old-pos
  11.                              :end (or pos (length string)))
  12.             when pos do (write-string replacement out)
  13.             while pos)))

Nonetheless, does anyone know what for (i = 0; i <= 65555; i++); does?