[root@localhost opt]# cat cfg key = value [root@localhost opt]# grep 'key\s*=\s*.+' cfg [root@localhost opt]#    My intent is: the = sign may be followed by zero or more spaces, but must be followed one or more non-space characters.  Why doesn't it output the line key = value?
I wrote a regular expression which works well in a certain program (grep, sed, awk, perl, python, ruby, ksh, bash, zsh, find, emacs, vi, vim, gedit, …). But when I use it in a different program (or on a different unix variant), it stops matching. Why?
Why is my attempt at downloading Big Sur failing? I am currently using a MacBook Pro 13&quot; Mid 2018 with Touch Bar. Today macOS Big Sur was released and I tried to download it but it's getting stuck at 484.4 MB. Initially, it shows 16-17 minutes left, but as soon as it reaches 484.4 MB it's stuck and the timer goes till 10 hours! My Wi-Fi is totally stable with a speed of 100 Mbps. I tried to restart my Mac but it still gets stuck. Earlier there were similar issues in the App Store (even now they are). The issue was I was not able to download an app unless I connect to the US VPN. I even contacted support but they were not able to help out. It wasn't a big deal as a VPN could be used. But now even with VPN, it gets stuck. How to replace spaces with newlines/enter in a text-file? I have simple text file named "example".  Reading with terminal command: cat example  Output:  abc cdef ghi jk lmnopq rst uv wxyz   I want to convert (transform) into following form: (expected output from cat example)  abc cdef ghi jk lmnopq rst uv wxyz   How can I do this via the command-line?   (This is only an example file, I want to convert word's position in vertical-column) Is there any "superlogarithm" or something to solve an equation like this:  $$x^x = 10?$$ I'm trying to setup OpenVPN using NetworkManager. The GUI seems buggy and unresponsive. Are there any other tools for setting up a VPN client? How do I convert my PhD dissertation so that it can be published as a book? What is "summoning sickness" and how does it affect my creatures? Note: this is intended to be a canonical question about summoning sickness.  "Summoning sickness", broadly, is the rule that stops you from attacking or paying {T} costs with a creature that you just played. But how exactly does it work? How does it interact with other rules and effects?  For example, if I'm trying to figure out how a creature is affected:   Does the status matter (tapped/untapped, face down/face up, etc.)? What if it came into play, but I didn't cast it? What if it's a token? What if it was on the battlefield when my turn started, but it wasn't a creature? What if it stops being a creature? What if it's a creature and also another card type? What if it's a double-faced card that just transformed? What if it changes control? What if it's a copy of another creature? Which of the creature's activated abilities can I use? Are any of its other abilities affected? Can I tap the creature to pay a cost that is not a {T} cost?   (These examples are primarily taken from questions about summoning sickness that have already been asked on the site) In Iron Man 3,      When the real villain kidnapped the President of the United States,   it is never explained why none of the other Avengers came to help, or why Tony didn't call them. The only explanation so far is: "it was an Iron Man movie...", but an in universe answer would be good. Variational Derivation of Schrodinger Equation How do I identify which Linux distro is running? We have some new hardware in our office which runs its own customized Linux OS.   How do I go about figuring which distro it's based on? How to draw good arrows explaining parts of equation? How to replace the_post_thumbnail template tag and show the first inside the post image instead Is string in array? What would be the best way to look in a string[] to see if it contains a element. This was my first shot at it. But perhaps there is something that I am overlooking. The array size will be no larger than 200 elements.  bool isStringInArray(string[] strArray, string key) {     for (int i = 0; i &lt;= strArray.Length - 1; i++)         if (strArray[i] == key)             return true;     return false; } Find $P(n+1)$ for a polynomial P Fix a nonnegative integer $n$. Let $P(x)$ be a polynomial of degree $n$ (over the real numbers) such that for all $k\in\left\{0,1,\ldots,n\right\}$, we have $P(k)=\dfrac{k}{k+1}$. Find $P(n+1)$.   My attempt:  I consider a new polynomial $Q(x)=(x+1)P(x)-x$. This $Q$ is a polynomial of degree $\leq n+1$ satisfying: $Q(k)=0\quad\forall k\in\{0,1,2,\ldots,n\}$. Therefore $Q(x)=\lambda x(x-1)\cdots(x-n)$ for a certain real $\lambda$. Hence, $Q(-1)=\lambda \cdot (-1)^{n+1}(n+1)!$, but also $Q(-1)=(-1+1)P(-1)+1=1$. Comparing these, we get $\lambda \cdot (-1)^{n+1} (n+1)! = 1$, thus $\lambda=\dfrac{(-1)^{n+1}}{(n+1)!}$. Since $Q(n+1)=\lambda(n+1)!$ then $Q(n+1)=(-1)^{n+1} $, and from $P(x) = \dfrac{Q(x)+x}{x+1}$ we deduce: $$P(n+1)=\dfrac{(-1)^{n+1}+n+1}{n+2}.$$ I doubted that the answer were $P(n+1)=\frac{n+1}{n+2}$ but the term $(-1)^{n+1}$ wasn’t expected. Is there any mistake here? Does someone have an alternative proof? Prove that a set of connectives is inadequate Is "life" a countable noun in English? I am a learner of English. Sometimes I see an article (a and the) before the noun (life) but sometimes I also see the noun without any article. So I am confused when should I use an article before the noun and when I should not. Please check the examples and let me know are they correct?     Examples:      His life is an awesome life.      I want to get a beautiful life.      I like the life he lived. I have a geo-tiff created by Pix4D which is about 375 Mb in file size.   I have clipped it to a smaller area using Qgis 2.8(using Raster ‣ Extraction ‣ Clipper), and the output file is about 900 MB in size.  Why did the clipping process generate such a large file, when the source file was smaller?   How do I run the clipper tool so that it produces a smaller size? Where are static variables stored in C and C++? I have come across these three definitions of the limit superior (or upper limit) and the limit inferior (or lower limit) of a sequence of real numbers and I wonder how to establish the equivalence of these.    Walter Rudin: PRINCIPLES OF MATHEMATICAL ANALYSIS, 3rd edition:  Definition 3.16: Given a sequence $\{s_n\}$ of real numbers, let $E$ be the set of numbers $x$ (in the extended real number system) such that $s_{n_k} \to x$ for some subsequence $\{s_{n_k}\}$. This set contains all subsequential limits ..., plus possibly the numbers $+\infty$, $-\infty$. We now ... put  $$s^{*} = \sup E,$$ $$s_{*} = \inf E.$$ The numbers $s^{*}$, $s_{*}$ are called the upper and lower limits of $\{s_n\}$; we use the notation  $$ \lim_{n \to \infty} \sup s_n = s^{*}, \, \, \, \lim_{n \to \infty} \inf s_n = s_{*}.$$ Tom M. Apostol: MATHEMATICAL ANALYSIS, 2nd edition:  Sec. 8.3: Definition 8.2: Let $\{a_n\}$ be a sequence of real numbers. Suppose there is a real number $U$ satisfying the following conditions:    i} For every $\epsilon &gt; 0$ there exists an integer $N$ such that $n &gt; N$ implies $$a_n &lt; U + \epsilon.$$ ii) Given $\epsilon &gt; 0$ and given $m &gt; 0$, there exists an integer $n&gt; m$ such that $$a_n &gt; U - \epsilon.$$ Then $U$ is called the limit superior (or upper limit) of $\{a_n\}$, and we write $$U = \lim_{n \to \infty} \sup a_n.$$ Statement (i) implies that the set $\{a_1, a_2, a_3, \ldots \}$ is bounded above. If this set is not bounded above, we define $$\lim_{n\to\infty}\sup a_n = +\infty.$$ If the set is bounded above but not bounded below and if $\{a_n\}$ has no finite limit superior, then we say $\lim \sup_{n\to\infty} a_n = -\infty$. The limit inferior (or lower limit) of $\{a_n\}$ is defined as follows: $$\lim_{n\to\infty}\inf a_n = -\lim_{n\to\infty}\sup b_n,$$ where $b_n = -a_n$ for $n= 1, 2, 3, \ldots$.    Robert G. Bartle and Donald R. Sherbert: INTRODUCTION TO REAL ANALYSIS, 3rd edition: Exercises for Section 3.3: Problem 10: Let $(x_n)$ be a bounded sequence of real numbers, and for each $n\in \mathbb{N}$ let $s_n \colon= \sup \{x_k \colon k \geq n\}$ and let $t_n \colon= \inf \{x_k \colon k \geq n\}$. Prove that $(s_n)$ and $(t_n)$ are monotone and convergent. Also prove that if $\lim (s_n) = \lim (t_n)$, then $(x_n)$ is convergent. [One calls $\lim (s_n)$ the limit superior of $(x_n)$ and $\lim (t_n)$ the limit inferior of $(x_n)$.]   Now how can one show that the above three definitions are equivalent (i.e. these three definitions are of the same pair of numbers)? I'm describing a situation that happened in the past. To explain it, I want to use a description that is both true now and true when the situation happened.  Specifically, I want something like:     She touched me where my neck met my collarbone.   Since my neck is still attached to my collarbone (thankfully), I'm wondering if I shouldn't use the present tense here instead:     She touched me where my neck meets my collarbone.   Which is preferable, and why? How do Android tablets use magnet to auto-lock the device?