I first experienced this today, when I flagged a question for the first time on the StackApps Q&amp;A. When I had flagged the question, I went back to my profile where I couldn't find a link to my flag summary.   There is no "helpful flags" link  Then I went to my StackOverflow profile, on which the "helpful flags" link was already present. I copied the link http://stackoverflow.com/users/flag-summary/1419007 and changed the site and userId (http://stackapps.com/users/flag-summary/12680. At this page, I was able to see that my flag had not been processed yet.  However, the "helpful flags" link did not appear on my profile until the flag got approved (about 6 hours later). I think it's unnecessarily confusing that you can't see* which posts you've flagged until at least one of your flags gets approved.    I'm not sure if this is by design (although it appears to be ), but in my opinion users should be able to figure out where their flags went, especially if they are new to a site (meaning they didn't flag anything before).  TL;DR: The "helpful flags" link doesn't appear until at least one of your flags gets approved. IMO, this should be changed so the link will be displayed if you've got any pending flags as well.  * Okay, technically you can see it. But new users don't even know where to find it, and even more experienced users will have to dig to get there.
The Problem  Currently if I flag a post, I cannot check the status of the flag unless I have prior helpful flags. This means, for example, that a new user who wants to check the status of his first flag cannot do so while it is pending (active).  This feature request is based on my experience on MSO, where I wanted to check the status of my flag but could not get to the summary page without cheating (tweaking my SO link to work with MSO). It also stems from this question, where the OP indicates he had the same issue:   My Proposal  If I have flagged any post, then show me a "flags" link (red arrow in image below). If I have any helpful flags, then the number of helpful flags should be displayed (blue arrow). If I have not flagged anything, then neither should be displayed (as with current site functionality).
Comparison of backup tools I am creating a type of adventure map. Once you enter the map, you step on some pressure plates that are supposed to seamlessly close the wall behind you. For some reason this command does not work when in a command block or just in text. Here is the command:  /fill -17 4 -109 -18 5 109 minecraft:light_gray_concrete   The output it gives me is "That position is not loaded". I am on a singleplayer superflat world in 1.14.3. Any help would be very appreciated! i have a tiny little problem with xslt, js and html entities, eg. within a template:  &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     for (var i = 0; i &amp;lt; 5; i++) {         //            ^^^ js error     } &lt;/script&gt;  &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     for (var i = 0; i &lt; 5; i++) {         //            ^ xslt error     } &lt;/script&gt;  &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     // &lt;![CDATA[     for (var i = 0; i &lt; 5; i++) {         //            ^ becomes &amp;lt;     }     // ]]&gt; &lt;/script&gt;   &lt;script type="text/javascript"&gt;     &lt;xsl:value-of select="/some/node"/&gt;     for (var i = 0; i &lt;xsl:value-of disable-output-escaping="yes" select="string('&amp;lt;')"/&gt; 5; i++) {         // works of course     } &lt;/script&gt;   does anyone have an idea where my problem could come from? i always thought the xslt processor would leave the content of a &lt;script/&gt; element unescaped when using the html output method ...  i run libxslt2 version 1.1.24 on OSX which was installed using macportsports ... When speaking precisely or technically, one would say that "Homo erectus and homo sapiens are two species of hominid" rather than "Homo erectus and homo sapiens are two species of hominids." The hominid here should be singular because we are speaking about instances of a single class ("class" being used here in its broader sense, not in the sense of taxonomic grouping).  Now let's consider more common parallel constructions replacing the word species with other words.      Tide and Wisk are two brands of detergent.       Tide and Wisk are two brands of detergents.      Cats and dogs are two types of pet you can buy at Pets-R-Us.       Cats and dogs are two types of pets you can buy at Pets-R-Us.   I feel that using the singular noun to specify the class is more grammatically correct, but sounds stilted in conversation. Almost everyone I hear making these constructions uses the plural form. What are your thoughts about singular vs. plural here?  Edit  Here's a more extreme example that may help clarify the issue. Consider the following sentence:     It was my first attempt at calming an angry crowd, and I just        stood there while people were hurling all kinds of insults at me.   Here I think the singular insult sounds strange, if not downright wrong.  Further Edit  I just noticed in A Treasury for Word Lovers (Morton S. Freeman, 1983) a section entitled "Types of Errors." This is a book about (American) English usage by an English professor and editor, which purports to be a "practical guide for serious writers and readers." I wish I could say this discovery satisfies the question, but in fact I now feel somewhat farther from the truth, if there is any single "truth" in this matter. But at least I don't have to worry about being wrong when using the plural form of the class in these constructions. Methods of speeding up a huge DELETE FROM  with no clauses Using SQL Server 2005.  I am performing a huge DELETE FROM  with no where clauses.  It's basically equivalent to a TRUNCATE TABLE statement - except I'm not allowed to use TRUNCATE.  The problem is the table is huge - 10 million rows, and it takes over an hour to complete.  Is there any way of making it faster without:   Using Truncate Disabling or dropping indexes?   The t-log is already on a separate disk.  Any suggestions welcome! Why isn't $\mathbb Z [\sqrt{pq}]$ a factorial domain This is exercise 8 on page 147 of Jacobson's Basic Algebra:     Let $p$ be a prime of the form $4n+1$ and let $q$ be a prime such that $ \left( \frac{q}{p} \right) =-1$. Show that $\mathbb Z[\sqrt{pq}]$ is not factorial.   Here, $ \left( \frac{q}{p} \right) =-1$ means that $\overline{q}$ is not a quadratic number in the field $\mathbb Z / (p)$.  In the special case when $p=5$ and $q=2$, $9 = 3 \cdot 3 = (\sqrt{10} +1 )(\sqrt{10 }-1)$, with $3$ and $\sqrt{10} +1$ or $\sqrt{10} - 1$ nonassociates. But I have no idea what can I do with the general case.  I know that primes of the form $4n+1$ can be written in the form $m^2 + n^2$ with $m,n \in \mathbb Z$. But when $q$ is odd and not of the form $4n+1$, $pq$ is not the sum of two quadratic numbers. How can I use the fact $\left( \frac{q}{p} \right) =-1$?  Thanks~ Resolve build errors due to circular dependency amongst classes I often find myself in a situation where I am facing multiple compilation/linker errors in a C++ project due to some bad design decisions (made by someone else :) ) which lead to circular dependencies between C++ classes in different header files (can happen also in the same file). But fortunately(?) this doesn't happen often enough for me to remember the solution to this problem for the next time it happens again.  So for the purposes of easy recall in the future I am going to post a representative problem and a solution along with it. Better solutions are of-course welcome.     A.h  class B; class A {     int _val;     B *_b; public:      A(int val)         :_val(val)     {     }      void SetB(B *b)     {         _b = b;         _b-&gt;Print(); // COMPILER ERROR: C2027: use of undefined type 'B'     }      void Print()     {         cout&lt;&lt;"Type:A val="&lt;&lt;_val&lt;&lt;endl;     } };       B.h  #include "A.h" class B {     double _val;     A* _a; public:      B(double val)         :_val(val)     {     }      void SetA(A *a)     {         _a = a;         _a-&gt;Print();     }      void Print()     {         cout&lt;&lt;"Type:B val="&lt;&lt;_val&lt;&lt;endl;     } };       main.cpp  #include "B.h" #include &lt;iostream&gt;  int main(int argc, char* argv[]) {     A a(10);     B b(3.14);     a.Print();     a.SetB(&amp;b);     b.Print();     b.SetA(&amp;a);     return 0; } Why does signing on to one site not sign me on to all of them? I've seen this question asked 3 times, but in none of those threads did I find a satisfactory answer.  I'm not asking about reputation: it makes sense that different sites should have different reputations.  However, consider the StackExchange drop-down menu at the top left of the screen.  When looking through the "Hot questions", the links are often to sister websites of StackExchange (programmers.stackexchange i.e.).  It doesn't make sense to me that if I go to one of those sister sites, I'm no longer logged in.  I feel like it's counterintuitive to click a link to go answer a question, only to find that you can't answer that question until you log in.  What is the reason for this?  Is there an option to do as I'm suggesting? Learn QM algebraic formulations and interpretations I have a good undergrad knowledge of quantum mechanics, and I'm interesting in reading up more about interpretation and in particular things related to how QM emerges algebraically from some reasonable real world assumptions. However I want to avoid the meticulous maths style and rather read something more meant for physicists (where rigorous proofs aren't needed and things are well-behaved ;) ) I.e. I'd prefer more intuitive resources as opposed to the rigorous texts.       Can you recommend some reading to get started? Why is there a factor of $4\pi$ in certain force equations? I mean to ask why there is $4\pi$ present in force equations governing electricity? Though all objects in universe are not spherical and circular, the constant of proportionality in both equations contain $4\pi$. Why? How exactly is Arda supposed to be an ancient Earth? As most Tolkien fans know, Arda (Tolkien's world) is supposed to be Earth in its past, and all its stories are supposed to have happened long ago on this very same planet. Of course, this is fiction, so this is not supposed to be actually true.  But, if one wanted to roll with it... how could it possibly make sense from a geographical standpoint? All maps of Middle Earth (before or after the destruction of Beleriand and Numenor) just don't match anything on Earth, even when considering continental drift.  Of course, one could simply say "the Valar reshaped it (again)", but not only this is a bit unsatisfactory, it also doesn't make much sense in context, as Valar are well known for not wanting to meddle with Arda unless absolutely needed, and even then, as little as possible.    Update:  Hey, please calm down, guys. Mine was not a rant at all. And I know perfectly well this is fiction (and I've stated it plainly). The sense of my question was: "If one wanted to follow this line of thought and assume Arda should be related to Earth as Tolkien said, then how could this relationship be explained?". What is the purpose of LongLength for .Net Arrays? What is the purpose of the LongLength property for arrays in .Net.  Using a standard integer for length, you could accommodate up to 2 billion indices.  Are there really people using .Net to maintain a single array with more the 2 billion elements.  Even if each element was a single byte, that would still be 2 GB of data.   Is it feasible to use such a large array in .Net? Access to our computer (not only to the internet) needs to be restricted for the accounts of my kids (7, 8) until they are old enough to manage this by themselves. Until then we need to be able to define the following:   the hours of the day when computing is o.k. (e.g. 5 - 9 pm) the days of the week when computing is not o.k. (e.g. mondays to fridays) the amount of time allowed per day (e.g. 2 hours)   In 11.10 all of the following that used to do the job don't work any more:   : for > 11.10 no more available through the ppa. : command line alternative, but from 11.10 removed from the repositories. : Looks great but repeatedly crashes to force restarting X-server. So we can't use or recommed this program at the moment.   Are there any other alternatives? Let $A$ be a squared matrix, and suppose there exists an $n\in \Bbb N$ in a way that $A^n=0$. Show that $I-A$ is invertible and that $(I-A)^{-1}=I+A+\cdots+A^{n-1}$    I don't have a clue where to start from. A friend of mine was trying to explain to me how all infinities are equal. For example, they were saying that there are the same amount of numbers between $0$–$1$ as there are between $0$–$2$.  The way they explained it, you could prove that there are the same amount of numbers by getting a match to each number.  For example, for any number in the range from $0$–$2$, you can find a matching number in the range $0$–$1$ by dividing the number by 2. In every case, the ending number will end up between $0$–$1$. In addition, if you multiplied any number in the range of $0$–$1$ by 2, you will always end up with a number between $0$–$2$ Therefore, there should be the same infinite amount of numbers between  $0$–$1$ as there are between $0$–$2$.  Is this principle accurate? The problem that I had with it was, if in-fact there are the same amount of numbers between 0 and 1 as there are between 0 and 2, why is 2 greater than 1? Why is Python running my module when I import it, and how do I stop it? Interactive pixel information of an image in Python? How to set a letter to the margin of the page and position it vertically according to alphabetical order? If you cast Blindness/Deafness as a 3rd level spell, can you target one creature with both effects? Struct padding in C++