Modify integer values throughout program
Is Java "pass-by-reference" or "pass-by-value"?
A native speaker said: "I have ever went to" I heard a guy from Manchester, UK said &mdash;     It was the best restaurant I have ever went to.   And Google offers 23 million pages for the query "have ever went to", and only 3 millions for "I have ever gone to".  Is this form correct? Has the grammar changed? Show/Hide function folding margin on Notepad++ Is it possible to get rid of the function folding margin on Notepad++? It seems like the sort of thing that should be in the prefs but I'm not seeing it anywhere. find the number of analytic functions which vanish only on $S$? What recourse do I have if I believe a moderator has abused their privileges? One or more of the following things happened to me on a Stack Exchange site:   My post(s) were wrongly deleted or locked by a moderator A moderator posted a wrong comment on one of my posts I was suspended, but did not do anything wrong I asked a meta question, but the question was closed and/or deleted A moderator discredited me in public ...   I think a moderator has abused their power, but I feel powerless against them.  What recourse do I have now? What can I do when I feel that a moderator has abused their power, and has been repeatedly unfair in their dealings with me? Extension of degree 2 with characteristic not 2 I am told that $K \leq L$ is a field extension of degree 2 and that $K$ has characteristic not 2. I am then asked to show that $\exists \: \alpha \in L$ such that $L = K(\alpha), \; \alpha^2\in K $  So far I have that:  $\exists \; \alpha_1, \alpha_2 \in L$ such that $L = K( \alpha_1, \alpha_2)$  $\Rightarrow |L:K| = |L:K(\alpha_1)| |K(\alpha):K| $ so $|K(\alpha):K| = 1$ or $2$  $|K(\alpha_1):K| = 2 \Rightarrow L = K(\alpha_1)$ and $deg(f_{\alpha_1}(t)) = 2  $ where $f_{\alpha_1}(t)$ is the minimal polynomial of $\alpha_1$ over $K$   So $f_{\alpha_1}(t) = t^2 + at + b$ for some $a,b \in K$  Also, $|K(\alpha_1):K|=1 \Rightarrow K(\alpha_1) = K$ and $L = K(\alpha_2)$ which means $degf_{\alpha_2}(t) = 2$ where $f_{\alpha_2}(t)$ is the minimal polynomial of $\alpha_2$ over $K$.   So $f_{\alpha_2}(t) = t^2 + at + b$ for some $a,b \in K$  Given that we consider the same polynomial each time, relabel to consider:   $f_{\alpha}(t) = t^2 + at+ b $ for some $a,b \in K$  We have already demonstrated that $L=K(\alpha)$ for some $\alpha \in L$ so now we much show that $\alpha^2 \in K$  $\alpha^2 \in K \Leftrightarrow a = 0_K$  I now have no idea how to show that this coefficient of $f_{\alpha}(t)$ is necessarily $0$.   I know that $f_{\alpha}(t)$ has two roots in $L$ and that because $K$ and thus $L$ has characteristic not 2, they cannot be the same root, but I don't know how to then conclude that they must sum to $0$  Any help would be greatly appreciated. Review Audit failed when "late answer" answer is a duplicate I just got a review audit where the "late answer" was a duplicate of the accepted answer, but flagging it on that basis failed the review. That seems like a bug to me.  Question here:   I found that by clicking the question to view the entire Q&amp;A, and noticed that the copy was from a generic "user12345" account (probably with 1 rep as well) and the original from a real-looking account. Viewing the whole Q&amp;A is often useful when reviewing, especially late answers (which are often repeats of earlier points, disagreements with those, or random addendums better submitted as edits). I looked at the duplicate and thought "weird, rep harvesting maybe?" so I clicked "needs moderator attention" and wrote "copy and paste of accepted answer". FAIL!  I think that this review type can't ever work, because to avoid the problem I found you'd need to make up whole new "late answers" which by definition the review bot can't know anything useful about. Either that or to pass you'd just need to take any action at all, including upvoting the original of the duplicated answer. Which I didn't do, BTW, because I had no idea or opinion about the question or answer.  (this is not a duplicate of "What are review tests", it predates that and focuses on a particular defect within the process. See the comments below). How to insert text before the first line of a file? ArcGIS ModelBuilder iterator reports only last input shapefile? Using Arc 10.3.1, if I manually enter the names of multiple shapefiles (all from the same folder) into the Check Geometry tool, the (single) output table lists the errors that exist in all of the shapefiles.    That is, only one output table is created, even if multiple input shapefiles have errors.  For example, if two shapefiles have errors, both will be listed in the single output table. Here's a screen print of the input:    However, if I iterate those same shapefiles (using the Feature Classes option), the output table only lists the last shapefile that went through the iteration.  Here's a screenshot of the model:     I suspect that the iterator is running Check Geometry not once, but three times, with a single input shapefile going through each iteration, overwriting the previous output.    How do I get the iterator to list all of the shapefiles with errors, either in separate output tables or aggregated in a single output table? I can say "I feed someone". Am I forced to say "I give someone a drink", or is there a single word for this (as in "I [verb] someone")?  Unfortunately my thesaurus can't really help me. How strongly can a 1mo be rocked? My 1 month old baby only seems to quiet down when I vigorously rock her (while I carefully hold her head). Can I cause her some (brain?) damage if I rock her too hard? I want to show that if a function $f:[a,b]\rightarrow \mathbb R$ satisfies a Hölder condition of order $\alpha &gt; 1 $ then it is constant.  The way I think of it is as follows:  $$|f(x) - f(y)| &lt; K|x-y|^\alpha$$  $$\frac{|f(x) - f(y)|} {|x-y]}  &lt; K|x-y|^{\alpha -1}$$  $$\lim_{y\rightarrow x} \frac{|f(x) - f(y)|} {|x-y]} \le \lim_{y\rightarrow x}  K|x-y|^{\alpha -1} =0 $$ As the limit is $0$, we can remove the modulus, so we get:  $$\lim_{y\rightarrow x} \frac{f(x) - f(y)} {x-y} = 0$$ So $f$ is derivable and $f'(x) = 0$ for all $x$ in $[a,b]$. Note that the reason we can add the limit $y\rightarrow x$ is because $[a,b]$ is closed in $\mathbb R$.  However, the question gives as a hint using the mean value theorem. I am not sure why one should do that. You would first have to prove that $f$ is derivable in a similar manner to what I did, and then prove that $f$ is constant. Or is there a simpler way to do it and I am missing it?  Also please inform me of any mistakes I did in the proof (if any)/ Thank you! How to never "allow this device to access photos and videos"? Is there a way to make sure that a deleted file can not be recovered?   As you know, deleting a file by pressing shift-del or using trash doesn't mean that file is gone forever. It resides somewhere in the computer.  In day to day life, law enforcement or thieves use recovery programs to reveal our private data or something else.   They can recover all data that resides on hard disk, in RAM, and even USB.  To protect us from these people, what should one do? Which program should one use?  Note: I don't want an answer like first use a recovery program then erase that file with shred. With just one program, I want to erase all unused/deleted files on my computer. Assume you have a flat table that stores an ordered tree hierarchy:  Id   Name         ParentId   Order  1   'Node 1'            0      10  2   'Node 1.1'          1      10  3   'Node 2'            0      20  4   'Node 1.1.1'        2      10  5   'Node 2.1'          3      10  6   'Node 1.2'          1      20   Here's a diagram, where we have [id] Name.  Root node 0 is fictional.                          [0] ROOT                           /    \                [1] Node 1          [3] Node 2               /       \                   \     [2] Node 1.1     [6] Node 1.2      [5] Node 2.1           /            [4] Node 1.1.1   What minimalistic approach would you use to output that to HTML (or text, for that matter) as a correctly ordered, correctly indented tree?   Assume further you only have basic data structures (arrays and hashmaps), no fancy objects with parent/children references, no ORM, no framework, just your two hands. The table is represented as a result set, which can be accessed randomly.   Pseudo code or plain English is okay, this is purely a conceptional question.  Bonus question: Is there a fundamentally better way to store a tree structure like this in a RDBMS?    EDITS AND ADDITIONS  To answer one commenter's ('s) question: A root node is not necessary, because it is never going to be displayed anyway. ParentId = 0 is the convention to express "these are top level". The Order column defines how nodes with the same parent are going to be sorted.  The "result set" I spoke of can be pictured as an array of hashmaps (to stay in that terminology). For my example was meant to be already there. Some answers go the extra mile and construct it first, but thats okay.  The tree can be arbitrarily deep. Each node can have N children. I did not exactly have a "millions of entries" tree in mind, though.  Don't mistake my choice of node naming ('Node 1.1.1') for something to rely on. The nodes could equally well be called 'Frank' or 'Bob', no naming structure is implied, this was merely to make it readable.  I have posted my own solution so you guys can pull it to pieces. I was going to ask , but I came to the conclusion that I'm not going to do it (asking and building).  Now my question is: why is it (usually, if we leave the silly high-end prices alone) more expensive to build a bike from scratch? What is the reason for the top secret two space newline markdown weirdness? How do I change the login manager's keyboard layout? I have a netbook with an AZERTY layout. I've changed it to "bépo" to try it, but now I've reset it to a french layout.  While all the apps have taken the change into account, Ubuntu's login manager still uses bépo, making entering passwords a challenge. I've enabled the virtual keyboard for the time being so that I could login again.  I don't remember what I had done in the first place to switch the login screen to bépo, but now I can't switch it back.    EDIT : In the keyboard settings page, if I click "use system defaults", then everything is in bépo ! Where is this different keyboard layout set ?  ANOTHER EDIT : Here's what did not work :   Changing the layout in settings using the "use system defaults" checkbox in settings sudo dpkg-reconfigure keyboard-configuration changing it in Xconf adding a line in /etc/lightdm/lightdm.conf  sudo dpkg-reconfigure locales slaming head against desk dpkg-reconfigure lightdm sudo gsettings set org.gnome.libgnomekbd.keyboard layouts "['fr']" combinations of the above     Is it possible to relaunch the keyboard configuration tool that's in ubuntu's setup ? The thing has automatic layout detection and it changes the setting everywhere. Why is $2\pi i \neq 0?$ We know that $e^{\pi i} = -1$ because of de Moivre's formula. ($e^{\pi i} = \cos \pi + i\sin \pi = -1).$  Suppose we square both sides and get $e^{2\pi i} = 1$(which you also get from de Moivre's formula), then shouldn't $2\pi i=0$? What am I missing here? How can I combine two or more querysets in a Django view? I am trying to build the search for a Django site I am building, and in that search, I am searching in three different models. And to get pagination on the search result list, I would like to use a generic object_list view to display the results. But to do that, I have to merge three querysets into one. How can I do that? I've tried this: result_list = [] page_list = Page.objects.filter(     Q(title__icontains=cleaned_search_term) |     Q(body__icontains=cleaned_search_term)) article_list = Article.objects.filter(     Q(title__icontains=cleaned_search_term) |     Q(body__icontains=cleaned_search_term) |     Q(tags__icontains=cleaned_search_term)) post_list = Post.objects.filter(     Q(title__icontains=cleaned_search_term) |     Q(body__icontains=cleaned_search_term) |     Q(tags__icontains=cleaned_search_term))  for x in page_list:     result_list.append(x) for x in article_list:     result_list.append(x) for x in post_list:     result_list.append(x)  return object_list(     request,     queryset=result_list,     template_object_name='result',     paginate_by=10,     extra_context={         'search_term': search_term},     template_name=&quot;search/result_list.html&quot;)  But this doesn't work. I get an error when I try to use that list in the generic view. The list is missing the clone attribute. How can I merge the three lists, page_list, article_list and post_list? Add a downvote option in the VLQ review There are many answers that are well-formed and well-formatted but are simply plain wrong or misleading. When reviewing, I often have a hard time deciding which action to take, as:   Looks Good: is OK per se but I would never say "good" (would work if the wording was changed slightly), Edit: The question is formatted well and editing it to be right would go against the intent of the author, Recommend deletion: this looks like the most reasonable choice, but I wouldn't flag it if I were browsing the site in normal mode, Not sure: I am quite sure what is wrong but I end up clicking this because the other three options do not seem fitting.   My proposal is to add a fifth option - Downvote that would make it easier to choose in case of such answers.