I need get all the words of a UITextView of individual form.  In an array for example.
What is the best way to tokenize/split a NSString in Objective-C?
Conditional formatting of an entire row based on multiple cells I'm trying to make a conditional formatting rule in Google Spreadsheet that would highlight a row green based on text in multiple cells.   If cells L2, M2, and N2 = APPROVED; and cell O2 = X; then row 2 = highlighted green. how do i change the color of typeface on photoshop? Russian SE has a slightly longer and more storied history than Japanese SO Are all integers fractions? What, precisely, is a confidence interval? Nesting quotes in JavaScript/HTML Convergence of sequence of real numbers and (sub)subsequence Let $(x_n)_{n\in \mathbb{N}}$ be a sequence of real numbers. A well known result is:     The sequence $(x_n)_{n\in \mathbb{N}}$ converges to $a\in \mathbb{R}$ if and only if every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ converges to $a\in \mathbb{R}$.   Now, I'm working on an exercise which essentialy asks to prove the following:     The sequence $(x_n)_{n\in \mathbb{N}}$ converges to $a\in \mathbb{R}$ if and only if for every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ there is a (sub)subsequence $(x_{n_{k_j}})_{j\in \mathbb{N}}$ which converges to $a$.   Now, one direction is trivial. If in fact $(x_n)_{n\in \mathbb{N}}$ converges to $a$, then by the result I've mentioned, every subsequence of $(x_{n})_{n\in \mathbb{N}}$ converges to $a$. Let then $(x_{n_k})_{k\in \mathbb{N}}$ be an arbitrary subsequence. In that case, we know that it is a subsequence of itself, and hence we've found a (sub)subsequence which converges to $a$.  The other way around seems quite complicated for me. The reason is as follows: I must assume that every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ has a (sub)subsequence which converges to $a$ and the proof that the original one converges to $a$.  My problem is exactly that "a". If it had all (sub)subsequences converging to $a$, then by the result i've mentionted, the subsequence $(x_{n_k})_{k\in \mathbb{N}}$ would converge to $a$. In that case, we would have every subsequence converging to $a$ and the result would follow.  My idea to prove the claim was then:  First remember that a subsequence is the restriction of the original one $x: \mathbb{N}\to \mathbb{R}$ to an infinite subset $\mathbb{N}'\subset \mathbb{N}$. In that case a (sub)subsequence is the restriction of $\tilde{x} = x|\mathbb{N}'$ to an infinite subset $\mathbb{N}''\subset \mathbb{N}$. But since $\tilde{x}$ is the restriction of $x$ to $\mathbb{N}'$ and since $\mathbb{N}''\subset \mathbb{N}'$, the restriction of $\tilde{x}$ to $\mathbb{N}''$ is itself the restriction of $x$ to $\mathbb{N}''$.  In other words, every (sub)subsequence can be viewed as a subsequence of the original one. Considering this, by hypothesis every subsequence has a (sub)subsequence which converges to $a$. But by this argument, this means that we can replace every subsequence with a convergent one. And then we can use the result I stated.  Is my idea correct? Is this really the way to prove the claim? My only doubt is that I need every subsequence converging to $a$ to use the result. In this case I can't see how I can argue that this implies every subsequence converges to $a$.  How can I finish this proof? My website title shows up slightly different from what's in my title tag, only in Google search Proving that a Binary Tree of $n$ nodes has a height of at least $\log(n)$. I'm currently developing a script for Blender to handle Mesh Frequency Decomposition.  The script is nearly complete, but i need one more thing: The SciPy library to compute eigenvalues and eigenvectors.  Following the installation instructions on , I'm able to install it as well as Numpy. Numpy works fine, but I can't even import SciPy:  Traceback (most recent call last): File "/CAF_FD.py", line 4, in &lt;module&gt; ImportError: No module named 'scipy' Error: Python script fail, look in the console for now...   By the way, I'm working on Linux 64 bit and I've installed SciPy and Numpy with my package manager.  Edit: When I try to use SciPy with a terminal prompt, it works. I want to have my super key start dmenu. I have set it as a keyboard shortcut in my rc.xml as follows:  &lt;keybind key="0xffeb"&gt;       &lt;action name="Execute"&gt;         &lt;command&gt;dmenu_run&lt;/command&gt;       &lt;/action&gt; &lt;/keybind&gt;   I tried specifying it in the key attribute as W, W-, and 0xffeb, but none of these worked. W responds to pressing the letter w, and the others appear to do nothing.  I want the shortcut to trigger when the super key is pressed and released on it's own. Is this possible?    This is  from super user as per the . I've read this question: , but I didn't see any useful information in it. A function for which one-sided limits are zero and infinity Is there an operation similar to inset that creates faces in the opposite direction? That is, instead of creating faces inwards, they create faces outwards? A normal inset operation:  What I would like: tl;dr : For SEO, should I redirect from one to the other or list both on the DNS records?    It seems that most experts think that both www and non-www should exist. (Please correct me if I'm wrong.) And Google Webmasters Tools lets you choose which is the main one.  But: will a redirect give all SEO weight to one of them instead of splitting it? (There are other search engines after all, so setting the main one in Google Webmasters Tools might not be enough.) Will having both on the DNS records give them more importance? No difference? How to search a string in the list of answers added by me on Stack Overflow? I am able to view all the answers given by me and questions asked by me, but not able to search a string in them?  Currently I have no other choice than clicking each ques/ans link manually (very hectic) ? How can I solve this quantum mechanical "paradox"? Questions like  dealing with Ancalagon in particular, and Middle-earth's dragons in general, clearly show that Ancalagon was ridiculously, absurdly, unimaginably enormous.      The non-canonical image above shows one person's impression of how the different dragons of Middle-earth stacked up, with Smaug looking absolutely tiny at the far left, and Ancalagon on the right, too big to even fit in the picture.    Below, a presumably canonical picture, painted by Tolkien himself, shows Smaug in relation to Bilbo.  The rough measurements I took from this image suggest that Smaug is about 11 times longer than Bilbo is tall.  Depending on how tall Bilbo is - almost certainly somewhere between 3'6" and 4' tall - Smaug is approximately 38-44 feet long.      If the first picture is even vaguely accurate, Ancalagon would appear to be a minimum of something like 720 feet long from the tip of his nose to the end of his tail:  the visible portions of his head and body are at least 6 times longer than Smaug is from end to end, and we have to assume that the portion of his body that is out of frame is at least 3 times longer still, perhaps even 4 times or more (so the upper range of his length might exceed 1,000 feet).  Does Tolkien give us any way to estimate how big Ancalagon was?  It isn't his normal practice to describe things in great detail, I realize, but he often gives a few hints that allow for some rough approximation to be made.  Does anything he says suggest that the first image is anything like what he had in mind?  Note:  I haven't read anything about Ancalagon from Tolkien's own pen, except a few quotes on this site;  the most important bit of information I've gleaned is that he smashed 3 volcanoes to pieces when he died (or something like that).  How accurate is this, and what else did Tolkien say?    This question is not a duplicate of "", because none of the answers to that question address Ancalagon's size in any detail - except my own, which is based on what little information I was able to glean from the two pictures I included in this question.  All the other answers address how Ancalagon was killed, not how big he was.  I have no interest in how he died, only how big he was, or rather, what hints we can find that might give some indication of how big he was.  I wouldn't ask this question, linking that question in my own, if it contained the information I am interested in.    Note 2:  Regarding the relative sizes and impressiveness of Smaug and Ancalagon:  Imagine a meeting between Smaug and Ancalagon in Dragon Heaven: Smaug: "How'd you die?" Ancalagon: "A flying boat full of fire made by the Angels and driven by a Magic Elf smashed into me, so I fell onto a mountain and broke it, and I died. The Magic Elf lives in outer space now, and the boat turned into a star. How'd you die?" Smaug: "Um... Some dude shot me with an arrow." Where does the term $|\psi\rangle\langle\psi|$ come from while calculating the expectation value? Sensitivity to initial conditions and topological transitivity I'm a bachelor student majoring in math, and pretty interested in physics. I would like a book to study for classical mechanics, that will prepare me to work through . What books would be good for a beginner?