I made a loop that inserts a number into a string, and by the color of the number (blue - registered, red - missing), using the standard utility Digital Colors Meter determines the color of the number. Then, depending on the color, it either adds a variable with a number from the initial txt file to the new one, or starts the script from the beginning. At least it should be.  But something is going wrong in loop. It checks the color, inserts numbers, everything is fine, but apparently the wrong condition, apparently the wrong data types. It inserts different numbers into the scatter. Some will insert, some will not, regardless of the initial condition. What could be the reason? Where is the error?     tell application "Digital Color Meter" to activate     tell application "System Events"         tell process "Digital Color Meter"             click menu item 1 of menu 1 of menu bar item 4 of menu bar 1         end tell         do shell script "/usr/bin/python -c \"import objc;bndl = objc.loadBundle('CoreGraphics', globals(), '/System/Library/Frameworks/ApplicationServices.framework');objc.loadBundleFunctions(bndl, globals(), [('CGWarpMouseCursorPosition', 'v{CGPoint=dd}')]);CGWarpMouseCursorPosition((" &amp; 1002 &amp; "," &amp; 222 &amp; "));\""         set rgbColors to words of (the clipboard)     end tell     if rgbColors is equal to {"77", "39", "38"} then         exit repeat     else         do shell script "echo " &amp; quoted form of n &amp; " &gt;&gt; /Users/oneone/Desktop/base2.txt"     end if   Only the color check condition for Digital Color Meter is presented here. Through the do shell, the color is read at the mouse position and the variable is added to the new file.
I'm trying to do a number checker in imessage. We all know that there is no such api, so I'm trying to use the tools at hand. The main took with past issues on this site on this topic.  I made a loop that inserts a number into a string, and by the color of the number (blue - registered, red - missing), using the standard utility Digital Colors Meter determines the color of the number. Then, depending on the color, it either adds a variable with a number from the initial txt file to the new one, or starts the script from the beginning. At least it should be.  But something is going wrong in loop. It checks the color, inserts numbers, everything is fine, but apparently the wrong condition, apparently the wrong data types. It inserts different numbers into the scatter. Some will insert, some will not, regardless of the initial condition. What could be the reason? Where is the error?      tell application "Digital Color Meter" to activate     tell application "System Events"         tell process "Digital Color Meter"             click menu item 1 of menu 1 of menu bar item 4 of menu bar 1         end tell         do shell script "/usr/bin/python -c \"import objc;bndl = objc.loadBundle('CoreGraphics', globals(), '/System/Library/Frameworks/ApplicationServices.framework');objc.loadBundleFunctions(bndl, globals(), [('CGWarpMouseCursorPosition', 'v{CGPoint=dd}')]);CGWarpMouseCursorPosition((" &amp; 1002 &amp; "," &amp; 222 &amp; "));\""         set rgbColors to words of (the clipboard)     end tell     if rgbColors is equal to {"77", "39", "38"} then         exit repeat     else         do shell script "echo " &amp; quoted form of n &amp; " &gt;&gt; /Users/oneone/Desktop/base2.txt"     end if   Only the color check condition for Digital Color Meter is presented here.  Through the do shell, the color is read at the mouse position and the variable is added to the new file.
Default constructor with empty brackets Is there any good reason that an empty set of round brackets (parentheses) isn't valid for calling the default constructor in C++?  MyObject  object;  // ok - default ctor MyObject  object(blah); // ok  MyObject  object();  // error   I seem to type "()" automatically everytime. Is there a good reason this isn't allowed? I have a specific requirement (probably silly!) for testing a browser of Chrome. I realize this requirement isn't the most logical, but politics being what they may I'd like to know the technical workaround.  I need to test a site in version, let's say, 28 of Google Chrome. Obviously Google runs a silent updater which can be disabled, but at this point they don't (to my knowledge) release old archives of the MSI installers (which I can easily use to reinstall and force a no-update option for testing). If we can get this working on a single instance then there's a possibility that a virtual machine or some other workaround will give us an easy restore point to meet this test.  If anyone has a good idea of where to start here that would be amazing.  I've already floated the "why are we doing this question?" and the answer is that it is part of the requirements so we need to make a best effort.  UPDATE:   FileHippo appears to only archive the online installer (automatic update)  OldApps doesn't archive Chrome anymore  OldVersion doesn't appear to have any Chrome Archives   UPDATE 2:  - The accepted answer's server is the correct solution here at this point in time. Basically speaking you're looking for the full install (30 or so MB). If you have an 800K file it is the online installer which automatically updates. Understanding the proof for $\gcd (F_n, F_{n+k}) = 1$ where $F_n$ is a Fermat number I'm trying to understand the following proof of why      No two Fermat numbers have a common divisor greater than $1$.   Hardy and Wright show the following proofs:   If $x = 2^{2^n}$, we have  $$\frac{F_{n+k} - 2}{F_n}(\circ) = \frac{2^{2^{n+k}}-1}{2^{2^n}+1} = \frac{x^{2^k}-1}{x+1} = x^{2^k-1} - x^{2^k-2} + \ldots -1$$  The main issue I'm having is the $\circ$ part. I don't understand how they get that. The rest of the proof makes sense but the first part is really confusing me. Can someone please explain where they get that fraction?  Thanks a bunch! When people want to classify a group with certain (small) order, they seem to find a normal subgroup $H$ and a subgroup $K$, and then consider how many distinct $H \rtimes_\varphi K$ are there.  My question is: For any group $G$, does it always exist normal subgroup $H$, subgroup $K$ and $\phi : K \rightarrow Aut(H)$ s.t. $G\cong H \rtimes_\varphi K $?  Sorry if this question is too basic...  Thanks the comment and the answers. Then if the $G$ is not simple, can we have can $G\cong H\rtimes_\varphi K$ for proper subgroup $H$, $K$, with $H$ normal?  EDIT:  If we have a group $G$, that is not simple (then $G$ has at least one normal subgroup), are there always a non-trivial normal subgroup $H$ and a proper subgroup $K$ s.t. $G \cong H \rtimes K$. (Note that if $G$ is simple this is clearly not possible).  But the quaternion group and $Z_4$ given in answers have shown that we cannot always have it. In Ubuntu ISO MBR, why does a GPT partition overlap the boot partition, and make MBR uneditable? RegEx for matching UK Postcodes Today I got what I presume was the update that should take care of Spectre and Meltdown. That didn't go very well. What do I do now? See screen photo.    I can't boot the 4.4.0-108-generic kernel because of a kernel panic. I'm running 16.04 on an Intel Core i5-4670K CPU @ 3.40GHz × 4. Norm of adjoint operator in Hilbert space I'm a student and I'm working on a low power communication project. I am trying to design a PCB using the . There is a MC-306 (32.768kHz, 12.5pf, and 20/50ppm).   I don't know what the 20/50ppm rating is. For me, the size is very important, so I decided to replace it with the , but its ppm is -20/+20. Will it cause a problem if I use this one instead?  What is the ppm rating in the crystal oscillator? I haven't seen this behavior out in the wild much, but it happened again recently and I was wondering if a flag could be automatically raised when this happens:   User posts answer Answer is down voted User deletes answer User posts exact same text as a new answer User effectively ditched down votes   Got down voted again? Wash, rinse and repeat. Profit (perhaps after modifying the post, which is what you should have done to begin with)    I feel that this should raise a duplicate content flag, with slightly stronger wording. Would this be possible to implement? Or, perhaps, don't let users post new answers if they have a deleted answer to a question. Rather, force them to edit and restore the deleted answer instead, unless locked by a moderator.  I do have a link, but I don't want a lot of people to descend on it and create an even bigger disruption. It happened exactly as I described. Can we have a black hole without a singularity? Assuming we have a sufficiently small and massive object such that it's escape velocity is greater than the speed of light, isn't this a black hole? It has an event horizon that light cannot escape, time freezes at this event horizon, etc. However this object is not a singularity.  If a large star's mass were compressed to the size of, say, a proton, it would certainly have these properties but it would still not be a singularity as a proton does have volume.  The reason "physics breaks down" at singularities is because we cannot divide by zero, but as long as the proton-sized object has volume, physics won't "break down", yet we still have an event horizon and an object that is invisible (but not undetectable) from the outside.  I have read the answers to  related question. I'm not sure if they don't address my specific question or if I don't understand the answers. How do you do it? Given a byte array:  byte[] foo = new byte[4096];   How would I get the first x bytes of the array as a separate array? (Specifically, I need it as an IEnumerable&lt;byte&gt;)  This is for working with Sockets. I figure the easiest way would be array slicing, similar to Perls syntax:  @bar = @foo[0..40];   Which would return the first 41 elements into the @bar array. Is there something in C# that I'm just missing, or is there some other thing I should be doing?  LINQ is an option for me (.NET 3.5), if that helps any. What is necessary and/or sufficient for polynomials to provide isomorphic quotient rings? Is it safe to fully cook a stuffed turkey the night before thanksgiving? Intuitively, why does (B → S) ≡ (¬B ∨ S)? I pursue only intuition; please do not answer with  or . I comprehend the following explanation, but it still does not supply the intuition and I sense a deeper, directer, more intuitive explanation. So how else can I intuit this? Or have I neglected something below? I rewrote: p 51-52.  (2010 2 ed) by Henle, Garfield, Tymoczko.    If the kid misbehaves and the teacher forces him to stay, then the teacher spoke truthfully. Suppose the kid misbehaves but travels. Then clearly the teacher lied. But what if the kid misbehaves, but a big snowstorm forces the trip’s cancellation? You can’t say the teacher lied. The kid behaved but didn’t go; nobody went. The teacher spoke truthfully. 1. If the kid behaved and travels, the teacher spoke truthfully.  Notice that the pattern of Ts and Fs we get, is the pattern for disjunction (see p. 38). I want to attach a code file to my question, but I am not able to find a link to do it. Is attaching files possible at all? copy a certain range of one sheet to a certain specifed cell in other sheet Will two-letter font style commands (\bf , \it , …) ever be resurrected in LaTeX? I understand that \bf and \it are now obsolete in LaTeX and that \textbf and \textit are proper, as they produce more sophisticated (in particular, cumulative and properly kerned) changes to font style. I have read the  and I understand the rules and their reasons, as well as the several other commands that are affected.  However, I find it convenient to use LaTeX for notetaking during lectures, and in that rushed environment, shortening a command by any number of keystrokes helps keep me from falling behind. \bf and its two-letter kin are still very useful to me for that reason, and once a presentation is finished I can go through and replace all appearances of \bf et al. with \textbf et al.  My question is this: is there a plan eventually to replace the short font style commands like \bf with the implementations of \textbf etc. some day, or should I expect \bf always to remain in existence but obsolete, for reasons of backward compatibility with original TeX? Original TeX has been greatly improved on in countless ways, but in the heat of transcription I sometimes miss its conciseness. I am not talking about mirrors, just a plain window made of glass like material. Would it be possible to allow light pass only in one direction but not the other? How to tell M2Eclipse to install jar file as a maven dependency