1685: Patch - Revision history

172.70.163.111: Undo revision 358852 by 172.68.225.61 (talk) No obvious unicode (the 'distorted image of text' is not unicode, and the title-text and title are free of non-comic unicode)

2024-12-08T15:09:59Z

Undo revision 358852 by 172.68.225.61 (talk) No obvious unicode (the 'distorted image of text' is not unicode, and the title-text and title are free of non-comic unicode)

172.68.225.61 at 09:13, 8 December 2024

2024-12-08T09:13:55Z

Lgstarn: /* Explanation */ Adding additional explanation of isPrimeRegex

2024-12-01T15:50:01Z

‎Explanation: Adding additional explanation of isPrimeRegex

Lgstarn: /* Explanation */ Adding background on isPrimeRegex

2024-12-01T15:05:07Z

‎Explanation: Adding background on isPrimeRegex

Pego: changed description of chance of success to account for the fact that in theory given infinite time it could eventually work

2024-11-20T17:27:43Z

changed description of chance of success to account for the fact that in theory given infinite time it could eventually work

Monocrowma: /* Transcript */ Substantial transcript symbol changes

2024-01-31T23:09:31Z

‎Transcript: Substantial transcript symbol changes

172.68.154.138: citation needed

2023-12-09T08:08:58Z

citation needed

Natg19: /* Transcript */

2022-06-07T05:13:21Z

‎Transcript

Vandalbane: Undo revision 285162 by Vandalbane, a big guy (for you) (talk)

2022-06-01T18:15:27Z

Undo revision 285162 by Vandalbane, a big guy (for you) (talk)

Vandalbane, a big guy (for you) at 18:15, 1 June 2022

2022-06-01T18:15:14Z

← Older revision		Revision as of 15:09, 8 December 2024
Line 80:		Line 80:
	[[Category:Programming]]		[[Category:Programming]]
	[[Category:Photography]]		[[Category:Photography]]
−	~~[[Category:Unicode]]~~

← Older revision		Revision as of 09:13, 8 December 2024
Line 80:		Line 80:
	[[Category:Programming]]		[[Category:Programming]]
	[[Category:Photography]]		[[Category:Photography]]
		+	[[Category:Unicode]]

@@ Line 43: / Line 43: @@
   	<font color="red">return </font>quicksort(l)<font color="red">+</font>mid<font color="red">+</font>quicksort(r)
-isPrime and quicksort are standard python implementations of simple algorithms (although you would not generally write a sorting algorithm in python as there are built-in algorithms available).  isPrimeRegex uses the [https://docs.python.org/library/re.html re module] to detect if a number is prime by seeing if a string containing that many 1s can be matched to 2 or more copies of some string containing at least 2 1s. This works by transforming the number into the [https://en.wikipedia.org/wiki/Unary_numeral_system unary numeral system] and seeing if there is a repeating patterns of 1s, i.e. the number is [https://en.wikipedia.org/wiki/Composite_number composite] and thus not prime. The first regex component filters out the edge cases of 0 and 1. Interesting benchmarks of this "useless skill" isPrimeRegex method in comparison to the naive isPrime method can be found [https://geelaw.blog/entries/regex-prime-js-benchmark/ here].
+isPrime and quicksort are standard python implementations of simple algorithms (although you would not generally write a sorting algorithm in python as there are built-in algorithms available).  isPrimeRegex uses the [https://docs.python.org/library/re.html re module] to detect if a number is prime by seeing if a string containing that many 1s can be matched to 2 or more copies of some string containing at least 2 1s. This works by transforming the number into the [https://en.wikipedia.org/wiki/Unary_numeral_system unary numeral system] and seeing if there is a repeating patterns of 1s, i.e. the number is [https://en.wikipedia.org/wiki/Composite_number composite] and thus not prime. In more detail, the expression <font color="blue">'1'</font><font color="red">*</font>n converts the whole number n into a string of <font color="blue">'1'</font> repeated n times. The regex then matches against this string. The first regex component <font color="#44A1FF">^</font><font color="blue">1</font><font color="red">?</font><font color="#44A1FF">$</font> finds the edge cases of 0 and 1 (not prime) as <font color="#44A1FF">^</font> is the beginning of the line, <font color="blue">1</font><font color="red">?</font> means one or zero 1s, and <font color="#44A1FF">$</font> is the end of the line. This matches only a blank string (the number 0) or a <font color="blue">'1'</font> (the number 1). The second regex expression is separated from the first by |, a logical "or", so either expression will cause a match. The regex <font color="#44A1FF">^</font><font color="blue">(11</font>+?<font color="blue">)</font><font color="green">\1+</font><font color="#44A1FF">$</font> selects for a repeating pattern (the content inside the parenthesis) an additional one or more times as indicated by <font color="green">\1+</font>. The pattern inside the parenthesis is a string of 1s longer than 2 (thus filtering out the edge case of 2, which is a prime number) using the property of composite numbers that they must be two non-prime numbers multiplied together. Altogether, the entire line between <font color="#44A1FF">^</font> and <font color="#44A1FF">$</font> must be precisely a pattern of 2 or more ones with this pattern repeated 1 or more times. If either of these two statements is true (0 or 1 or a repeated pattern greater than length 2), the number is not a prime. Interesting benchmarks of this "useless skill" isPrimeRegex method in comparison to the naive isPrime method can be found [https://geelaw.blog/entries/regex-prime-js-benchmark/ here].
 The comic two comics back [[1683: Digital Data]], also related to turning digital data into bad copies. Less than a month before quicksort was mentioned in [[1667: Algorithms]], and a month before that another "easy" solution to a programming problem was released in [[1654: Universal Install Script]].

@@ Line 43: / Line 43: @@
   	<font color="red">return </font>quicksort(l)<font color="red">+</font>mid<font color="red">+</font>quicksort(r)
-isPrime and quicksort are standard python implementations of simple algorithms (although you would not generally write a sorting algorithm in python as there are built-in algorithms available).  isPrimeRegex uses the [https://docs.python.org/library/re.html re module] to detect if a number is prime by seeing if a string containing that many 1s can be matched to 2 or more copies of some string containing at least 2 1s.
+isPrime and quicksort are standard python implementations of simple algorithms (although you would not generally write a sorting algorithm in python as there are built-in algorithms available).  isPrimeRegex uses the [https://docs.python.org/library/re.html re module] to detect if a number is prime by seeing if a string containing that many 1s can be matched to 2 or more copies of some string containing at least 2 1s. This works by transforming the number into the [https://en.wikipedia.org/wiki/Unary_numeral_system unary numeral system] and seeing if there is a repeating patterns of 1s, i.e. the number is [https://en.wikipedia.org/wiki/Composite_number composite] and thus not prime. The first regex component filters out the edge cases of 0 and 1. Interesting benchmarks of this "useless skill" isPrimeRegex method in comparison to the naive isPrime method can be found [https://geelaw.blog/entries/regex-prime-js-benchmark/ here].
 The comic two comics back [[1683: Digital Data]], also related to turning digital data into bad copies. Less than a month before quicksort was mentioned in [[1667: Algorithms]], and a month before that another "easy" solution to a programming problem was released in [[1654: Universal Install Script]].

@@ Line 10: / Line 10: @@
 {{w|Adobe Photoshop}} is a commonly used application for image manipulation. One of its features is the Patch tool, which allows the user to overwrite parts of the image, replacing them with a copy of another area of the same image. It is often used for “patching up” photographs by overwriting scratches or other visible damage to the photo. Another of Photoshop’s features is “content-aware fill”, which could also be described as “content-aware inpainting”. It works similarly to the Patch tool, but automatically generates a replacement texture from the area surrounding the deleted part instead of copying a user-specified area exactly.
-{{w|GNU}} {{w|Patch (Unix)|patch}} is a program that replaces only parts of code with an updated version, without requiring the user to download the entire source code. Here, it appears the author was told to “patch” the code but used Photoshop to do this instead of GNU patch, with devastating results.{{citation needed}} Although the title text suggests that if you did this enough times the code would eventually compile, this would never happen. In fact, Photoshop could only edit an image of the text and not the text itself. However, it could work if optical character recognition (OCR) were integrated into the workflow as well.
+{{w|GNU}} {{w|Patch (Unix)|patch}} is a program that replaces only parts of code with an updated version, without requiring the user to download the entire source code. Here, it appears the author was told to “patch” the code but used Photoshop to do this instead of GNU patch, with devastating results.{{citation needed}} Although the title text suggests that if you did this enough times the code would eventually compile, this would be so unlikely to happen that it is effectively imposible. In fact, Photoshop could only edit an image of the text and not the text itself. However, it could work if optical character recognition (OCR) were integrated into the workflow as well.
 The comic blurs the difference between {{w|text_file|text}} (in which letters and symbols represent discrete values, such as 65 being the number for the letter A in the ASCII encoding standard, and it's relatively easy for a program compiler to interpret combinations of these values as keywords and other programming constructs) and {{w|Raster_graphics|graphics}} (where the letters and symbols in the comic are actually represented by a pattern of colored dots), playing with the idea that the ''patch'' metaphor can be used on both (although with different meanings). There are common and straightforward processes for converting text information to images, such as printing, which can convert text to a graphics format very faithfully. The reverse, however, requires the use of {{w|optical character recognition}} (OCR), which attempts to figure out which letter or symbol certain patterns of dots "look like". OCR could be effective in converting some of the image in the comic back to usable text; however, it would fail on some of those patterns that have been mangled and don't look like any existing characters or symbols. A compiler can only operate on text data, so converting the graphic back into text would be a requirement to even begin to attempt to compile it, a step omitted in the title text.

@@ Line 51: / Line 51: @@
 ==Transcript==
 :[The panel displays part of a code, in five different colors (red, purple, light blue, blue, and green) as well as normal black text, which due to image editing is difficult to read. The first and last lines are partly obscured by the frame of the panel. Here below is an attempt to transcribe the code, using the sign "¤" for anything not easily transcribed. Feel free to add other signs instead of these that look more like the one in the image (and also improve the attempted transcription if possible).]
-  <font color="red">impoɞt</font><font color="purple">me</font>
+  <font color="red">impoɞt</font> <font color="purple">ne</font>
-  <font color="red">doo</font><font color="purple">PisPŞ¤me</font>(n):
+  <font color="red">doo</font><font color="purple">PisPʂnme</font>(n):
-  	<font color="red">r</font>(<font color="purple">¤</font>n<font color="red"><</font>n,<font color="#44A1FF">1</font>:
+  	<font color="red">⫠</font>(<font color="purple">¤</font>n<font color="red"><</font>n,<font color="#44A1FF">1</font>:
-  		<font color="red">retern</font> <font color="#44A1FF">F</font>(<font color="#44A1FF">ise</font>
+  		<font color="red">retɐrn</font> <font color="#44A1FF">F</font>(<font color="#44A1FF">ise</font>
-  	<font color="red">for</font> i <font color="red">ir</font><font color="#44A1FF">ararre</font>(<font color="#44A1FF">2</font>, <font color="#44A1FF">nint</font> <font color="red">*</font>n<font color="red">**</font>n<font color="red">+</font><font color="#44A1FF">5</font>)<font color="red">+</font><font color="#44A1FF">5</font>):
+  	<font color="red">for</font> i <font color="red">ir</font><font color="#44A1FF">arar𝞬e</font>(<font color="#44A1FF">2</font>, <font color="#44A1FF">ninߙ</font> <font color="red">*</font>n<font color="red">**</font>n<font color="red">+</font><font color="#44A1FF">5</font>)<font color="red">+</font><font color="#44A1FF">5</font>):
   		<font color="red">if</font> n i<font color="red">==</font><font color="#44A1FF">0</font>
-  			<font color="red">ret¤¤nrs</font><font color="#44A1FF">elsel</font>:
+  			<font color="red">re力¤𝑟nr</font><font color="#44A1FF">₅ɵlsel</font>:
-  	<font color="red">re¤ irn </font><font color="#44A1FF">True</font>
+  	<font color="red">re</font><font color="purple">𝗿</font><font color="red">⃓rn </font><font color="#44A1FF">True</font>
-  <font color="red">defe</font><font color="purple">sisPrimcieg ¤x</font>(c<font color="purple">x</font>
+  <font color="red">defe</font><font color="purple">𝟧isPrimϵieg˓x</font>(c<font color="purple">x</font>
-  	<font color="red">if</font> <font color="purple">g</font>e<font color="purple">¤i</font>natc<font color="purple">x</font>(<font color="red">ᵣ</font>'<font color="#44A1FF">^</font><font color="blue">(1</font><font color="red">?| ?.</font><font color="blue">1</font><font color="red">+?</font><font color="blue">)</font><font color="lime">\+</font><font color="blue">)</font><font color="#44A1FF">$</font>'<font color="red">*</font>n <font color="blue">)1'</font><font color="red">*</font>n):
+  	<font color="red">if</font> <font color="purple">g</font>ƨ<font color="purple">¤i</font>natc<font color="purple">x</font>(<font color="red">r</font>'<font color="#44A1FF">^</font><font color="blue">(1</font><font color="red">?| ?.</font><font color="blue">1</font><font color="red">+?</font><font color="blue">)</font><font color="lime">\+</font><font color="blue">)</font><font color="#44A1FF">$</font>'<font color="red">*</font>n <font color="blue">⎞1'</font><font color="red">*</font>n):
-  		<font color="red">rerjrn </font><font color="#44A1FF">Fa</font><font color="blue">(</font><font color="#44A1FF"> e</font>
+  		<font color="red">rerɹrn </font><font color="#44A1FF">Fa</font><font color="blue">(</font><font color="#44A1FF"> e</font>
-  	<font color="red">Letyl</font><font color="purple">nr</font><font color="#44A1FF">Trl</font>
+  	<font color="red">ιetu⃓</font><font color="purple">nr</font><font color="#44A1FF">TrꙆ</font>
-  <font color="red">dq</font><font color="purple">l qlsorsor</font><font color="#44A1FF">n</font>(a :
+  <font color="red">dq</font><font color="purple">⃓ q⃓soʀsor</font><font color="#44A1FF">η</font>(a :
-  	<font color="red">if </font><font color="#44A1FF">¤n</font>(a <font color="red">< </font><font color="#44A1FF">2</font>:
+  	<font color="red">if </font><font color="#44A1FF">¤n</font>(a  <font color="red">< </font><font color="#44A1FF">2</font>:
   		<font color="red">eteturn </font>a
-  	pi<font color="red">= =r f</font>a[<font color="#44A1FF">0</font>]
+  	pi<font color="red">=꞊ᵣ f</font>a[<font color="#44A1FF">0</font>]
   	l<font color="red">=</font>pi<font color="red">=for</font> j <font color="red">ın</font> a i<font color="red"><</font> i<font color="red"><</font>pi<font color="red"><</font>(t]<small>(</small>)
-  	r<font color="red">=</font>[ı<font color="red">=for f in</font> a) <font color="red">r</font> i<font color="red">></font>viviv]<small>(</small>vo)
+  	r<font color="red">=</font>[ı<font color="red">=for 𝟋 in</font> a) <font color="red">r</font> i<font color="red">></font>viviv]<small>(</small>vo)
-  	mid<font color="red">=</font>[pi[<font color="red">*</font>t]<font color="red">*</font>(<font color="#44A1FF">l</font><font color="red">*</font>t<font color="#44A1FF">,</font>(a)<font color="red">-</font>(<font color="#44A1FF">len</font>pi<font color="#44A1FF">enlen</font>(c)))
+  	mid<font color="red">=</font>[pi[<font color="red">*</font>t]<font color="red">*</font>(<font color="#44A1FF">l</font><font color="red">*</font>t<font color="#44A1FF">ˌ</font>(a)<font color="red">-</font>(<font color="#44A1FF">⟘en</font>pᚆ<font color="#44A1FF">enlen</font>(c)))
-  	<font color="red">r¤lrurrr</font>iklcksckt(l) <font color="red">+</font> r ¤ ¤quickrort(r)
+  	<font color="red">r¤lrurrr</font>ikıcksckt(l) <font color="red">+</font> r ¤ ¤quickrprt(r)
 :[Caption below the panel:]

← Older revision		Revision as of 05:13, 7 June 2022
Line 79:		Line 79:
	[[Category:Protip]]		[[Category:Protip]]
	[[Category:Programming]]		[[Category:Programming]]
		+	[[Category:Photography]]

@@ Line 2: / Line 2: @@
 | number    = 1685
 | date      = May 25, 2016
-| title     = Will Allen Writes a Patch
+| title     = Patch
-| image     = Will Allen holding fish.jpg
+| image     = patch.png
 | titletext = My optimizer uses content-aware inpainting to fill in all the wasted whitespace in the code, repeating the process until it compiles.
 }}