Long

Long is a term applied to an object that is of the same basic form as some standard object, but longer. The term long typically denotes a pattern (usually the second-smallest) in a family of patterns which are simple linear extensions of a base pattern. Prototypical examples include long snake, long canoe, long boat and long ship.

Not all families of arbitrarily extensible patterns use the term long; some families such as the barber pole family and lightweight spaceship family have alternate terms for extended patterns.

Examples
́
A boat.
A long boat.
A long2 boat.
A long3 boat.

Specific names
A very^12 long ship
TermPattern in family
long1, long2nd-smallest
long2, long long, very long3rd-smallest
long3, very very long, extra long4th-smallest
long4, very3 long, extra extra long, remarkably long[1]5th-smallest
long5, very4 long, terribly long[1]6th-smallest
long6, very5 long, absurdly long[1]7th-smallest
long7, very6 long, stupidly long[2]8th-smallest
long8, very7 long, ridiculously long[3]9th-smallest
long9, very8 long, ludicrously long[1]10th-smallest
......
longn, veryn-1 long, extran-2 long(n+1)th-smallest
......
gollark: WHY(JIT) is capable of arbitrary IO.
gollark: Er, you'd need to sandbox it.
gollark: ```python#!/usr/bin/env python3import argparseimport subprocessimport randomimport stringparser = argparse.ArgumentParser(description="Compile a WHY program using WHYJIT.")parser.add_argument("input", help="File containing WHY source code")parser.add_argument("-o", "--output", help="Filename of the output executable to make", default="./a.why")parser.add_argument("-O", "--optimize", help="Optimization level", type=int, default="0")args = parser.parse_args()def randomword(length): letters = string.ascii_lowercase return ''.join(random.choice(letters) for i in range(length))def which(program): proc = subprocess.run(["which", program], stdout=subprocess.PIPE) if proc.returncode == 0: return proc.stdout.replace(b"\n", b"") else: return Nonedef find_C_compiler(): compilers = ["gcc", "clang", "tcc", "cc"] for compiler in compilers: path = which(compiler) if path != None: return pathdef build_output(code, mx): C_code = f"""#define QUITELONG long long intconst QUITELONG max = {mx};int main() {{ volatile QUITELONG i = 0; // disable some "optimizations" that RUIN OUR BEAUTIFUL CODE! while (i < max) {{ i++; }} {code}}} """ heredoc = randomword(100) devnull = "2>/dev/null" shell_script = f"""#!/bin/shTMP1=/tmp/ignore-meTMP2=/tmp/ignore-me-tooTMP3=/tmp/dont-look-here cat << {heredoc} > $TMP1{C_code}{heredoc}sed -e '1,/^exit \$?$/d' "$0" > $TMP3chmod +x $TMP3$TMP3 -x c -o $TMP2 $TMP1chmod +x $TMP2$TMP2exit $?""".encode("utf-8") with open(find_C_compiler(), "rb") as f: return shell_script + f.read()input = args.inputoutput = args.outputwith open(input, "r") as f: contents = f.read() looplen = max(1000, (2 ** -args.optimize) * 1000000000) code = build_output( contents, looplen ) with open(output, "wb") as out: out.write(code)```
gollark: I mean, it uses (y, x) coordinates, if I remember correctly!
gollark: Where n = infinity.

References
  1. "Re: Soup search results". ConwayLife.com forums (June 15, 2016). Retrieved on June 16, 2016.
  2. Billabob (August 18, 2015). "Re: Soup search results". Retrieved on October 22, 2015.
  3. Dave Greene (October 22, 2015). "Re: apgsearch v2.2". Retrieved on October 22, 2015.
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.