I am new to HTML When I type  in notepad++ it does not automatically make the end tags as it should,  How do I activate this feature.
In Dreamweaver typing &lt;/ will automatically close the last open tag, so you don't have to type it all out, and it helps if you aren't sure if you closed one or not. Is there a plugin that dose this for Notepad++?  This is not like text FX where typing the opening tag/bracket adds the close on the other side of the cursor. This behavior is an auto completion that happens when &lt;/ is typed, DW finds whatever the innermost open tag is, and closes it. I find that, when I have the option of using DW, I will use this feature far more often than anything else that DW provides. Thus I would love to know if there was a way to do it in NPP.  Here is DW preference in question:  Notice how there is a different option that does what text FX does, but I don't want that.  I am not opposed to unorthodox suggestions, some kind of macro, or hack of a plugging. Anything to emulate the functionality. If need be, I could write a plugin, I just have no idea how to go about it.
This morning I read this sentence (see ):     On July 24th and again on July 29th,   Egyptian police did shoot dead unarmed   African migrants attempting to cross   that border.   Why "did shoot" and not "shot"? How do I use the json_encode() function with MySQL query results? Do I need to iterate through the rows or can I just apply it to the entire results object? How to panelize gerber files? I am planning on ordering a panel with four different designs on it. Two were made in Altium, while the other two were made in Eagle.  Altium has a great tool for panelizing boards designed in it, but I don't believe it can put designs from other programs on the panel.  How can I panelize these PCBs? Is there any efficient algorithm for finding subgroups of a given finite group? I am implementing an algorithm which finds every subgroup of given group.  Here's my algorithm.  Let $G$ be a group of order $n$ with elements $g_1,\cdots,g_n$.  Then I consider each $\langle g_i\rangle $ which are all cyclic subgroups of $G$.  Of course, if $\langle g_i\rangle =\langle g_j\rangle $, we append only $\langle  g_i\rangle $ into our result set.  We call all distinct subgroups of the form $\langle g_i\rangle $ to be the first-generation. (Note that the number of the first-generation subgroups is at most $n$.)  To get $(i+1)$-th generation from $i$-th generation inductively, we construct the subgroup $S$ from each two elements of $i$-th generation $S_1, S_2$ to be  $$S=\langle S_1,S_2\rangle .$$  Obviously, if generated subgroup is already in previous generations, we do not call it $(i+1)$-th generation, hence every subgroups of $G$ has the unique generation number.  We do this construction until the number of the typical generation subgroups to be $0$, since we get all subgroups of $G$.  This works perfectly to any groups, but unfortunately, it is not fast although I implemented additional steps to avoid repeated computation.  So I searched some other algorithms but they are all vague to understand.  One of the algorithm is called the cyclic extension algorithm, but I can not get it easily unless I have studied some backgrounds for this method.  If you have enough knowledge about the cyclic extension algorithm or some other algorithms, please give me an easy explanation. I am in undergrad. course of math dept. Thanks. If I have Optimize iPhone Storage enabled on my iPhone and my phone storage is completely full, I understand that iOS will only store a low-res thumbnail of many of my photos on the device. (The full high-res version of the image will only exist in iCloud and on devices with Download and Keep Originals enabled.)  But when only thumbnails exist on the device, how does that work in relation to other photo apps on iOS? For example, do third-party cloud-based photo apps (like Google Photos, Dropbox's Carousel, or Amazon Prime Photos) have access to the full high-res images from the iCloud Photo Library? Or will they only see the low-res thumbnails in some cases? Note: I am posting a question from a former student of mine unable to post on his own for technical reasons.  Given an iid sample $x_1,\ldots,x_n$ from a Weibull distribution with pdf $$ f_k(x) = k x^{k-1} e^{-x^k} \quad x&gt;0 $$ is there a useful missing variable representation  $$f_k(x) = \int_\mathcal{Z} g_k(x,z)\,\text{d}z$$and hence an associated EM (expectation-maximisation) algorithm that could be used to find the MLE of $k$, instead of using straightforward numerical optimisation? Is there any way I can 'undo' the factorial operation? JUst like you can do squares and square roots, can you do factorials and factorial roots (for lack of a better term)?   Here is an example: 5! = 120.  Is there a way I can work out the number that must be factorialed (??) to give the answer 120? In Ubuntu ISO MBR, why does a GPT partition overlap the boot partition, and make MBR uneditable? Can colliding gravitational waves create a black hole? Reduce Spacing In $$ In math, one often needs to put a letter inside the symbols &lt;&gt;, e.g. to denote a cyclic group &lt;x&gt; generated by some element x. However, plain text displays the symbols &lt; and &gt; as an upside down exclamation point and an upside down question mark, respectively, while math type displays a large space like so:  &lt; x &gt;    Is there some way to reduce this spacing? If A and B are correlated with C, why are A and B not necessarily correlated? "All of these things are not beneficial and (they) do not help her" Should I mention the pronoun again in this case?     "All of these things are not beneficial and (they?) do not   help her"   I know that there is already answer about the question "if it's needed to repeat on the pronoun in case that they are in the same position of grammar tense". But in this case it's different because the question deals with case of two different  tenses (in bold). How come if $\ i\ $ not of the following form, then $12i + 5$ must be prime? Steady-State Current I am in the process of completing some homework and have come across a question that says: "What is the steady-state current?" It is asking in reference to a circuit that includes two capacitors in parrallel and a DC source of 24V and an AC source given by $\epsilon = 20 \cos(120 \pi t)\ \text{V}$, where $t$ is in seconds. I assume that it is asking when the current is constant. Because naturally the current is not constant due to the AC source, would I just consider the DC source for this? How should duplicate questions be handled? What should I do when I see a question that is a duplicate of another one?   Should I answer it? Should I downvote it? Should I comment? Should I edit the question to indicate it's a duplicate? If I can, should I (vote to) close the question? What happens when I vote to close as duplicate? Or: Why did a comment with my name on it just appear? Should I flag it for moderator attention? What about similar or related questions? A doubt from Milnor's "Topology from a Differentiable Viewpoint". This is a doubt from Milnor's "Topology from a Differentiable Viewpoint".     For a smooth $f:M\to N$, with $M$ compact, and a regular value $y\in N$, we define $n(f^{-1}(y))$ to be the number of points in $f^{-1}(y)$. It is easy to see that $n(f^{-1}(y))$ is finite. It can also be seen that $n(f^{-1}(y))$ is locally constant; i.e. there is a neighbourhood of $y$ such that for every point $y'$ in that neighbourhood, $n(f^{-1}(y'))=n(f^{-1}(y))$.   The proof for the statement in bold is the following:     Let $x_1,x_2,\dots,x_n$ be the points of $f^{-1}(y)$, and choose disjoint neighbourhoods $U_1,U_2,\dots,U_n$ of these points, which are mapped diffeomorphically into neighbourhoods $V_1,V_2,\dots,V_n$ of $y$. The required neighbourhood is $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$.   I don't understand how $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$ is open. I know that $(V_1\cap V_2\cap\dots V_n)$ is open. However, how can one prove that $f(M-U_1-U_2-\dots U_n)$ is closed? I can see this working if $f$ is surjective, but not otherwise. Why does the humidifier make a stove's flame orange? Just like , the color of my stove's flames were affected by the humidifier as well.  Why does this happen? Is it a good thing or a bad thing ? What does it mean if a professor does not answer your email in time? I recently joined a research group as a postdoc. I wrote the professor an email to ask quick but important questions including asking him when when he wanted me to start. It's been over a week and I haven't received get an answer. Other emails I've sent previously have also gone unanswered for long periods as well.   With that background, my question is: do professors sometimes (intentionally or otherwise) not respond to emails in a timely manner? Is there any difference between "word-for-word translation" and "word-by-word translation" and is the latter actually valid? First off, some data: According to COCA word-for-word has 60 usages, 3 of them are &quot;word-for-word translation&quot;. Word-by-word has 26 usages, none of them are &quot;word-by-word translation&quot; (but some with &quot;transcription&quot;). The definition of word-for-word:  : In exactly the same or, when translated, exactly equivalent words : being in or following the exact words, verbatim : one word at a time, without regard for the sense of the whole  Only the last dictionary contains a definition for word-by-word, too:  : one word at a time  The definitions given by The Free Dictionary are, obviously, identical to each other. Google hits: Word-for-word ~21m Word-for-word translation ~318k Word-by-word ~3.8m Word-by-word translation ~95k According to usages and dictionaries word-by-word is, at least, less popular. And assuming that there may be a lot of usages from non-natives among the Google hits, this could be an indicator for word-by-word being even utterly wrong. In another forum I found the following :  When I translate something &quot;literally,&quot; (wörtlich) it still follows the main rules of the language I'm translating into. What you mean is &quot;word-by-word&quot; (wortwörtlich) to me.  I assume that this was written by a German but I don't know it. However, if this would be true a &quot;word-by-word translation&quot; would be a translation where I keep, for instance, the order of the words, disregarding if it makes sense in the target language. Some examples:  Original: word-by-word Word-by-word translation: Wort bei Wort (That's a terrible translation!) Original: It is critical to know... Word-by-word translation: Es ist kritisch zu wissen... (That's a terrible translation!) Original: Ich glaub, ich spinne. Word-by-word translation: I think I spider. (I guess only Germans understand this.)  A &quot;word-for-word translation&quot;, however, would be an attempt to keep the word-choice as close as possible but following the rules of the target language (e.g. order of words) and also considering if the statement still makes sense in the other language. Here are better translations for the examples above:  Wort für Wort Es ist wichtig zu wissen... I think, I'm going nuts. (Actually, this is not a word-for-word translation but rather a .)  So, my questions again:  As neither Oxford nor Merriam-Webster have any entries for word-by-word in their dictionaries: is word-by-word actually valid? If yes, is there any difference between &quot;word-by-word translation&quot; and &quot;word-for-word translation&quot;? If yes again, what is it specifically? Do file descriptors optimise writing to files?