Why can I call a private method of another instance of the same type outside of that instance?
Why and how does C# allow accessing private variables outside the class itself when it's within the same containing class?
How do I resize root partition? Scorched3d worked then stopped. Unistalled and reinstalled did not help. Running Ubuntu 16.04.04LTS. I think it was after installing new release.  I think the problem is the Ubuntu 16.04.4LTS. The newer version has no Scorched3d in the Ubuntu Software Center. I have 3 systems. After updating to new version. Scorched3D will not install and work after updating.  ron@RonsComputer:~$ sudo objdump -p $(type -p scorched3d) | grep NEEDED  NEEDED libwx_gtk2u_adv-3.0.so.0  NEEDED libwx_gtk2u_core-3.0.so.0 NEEDED libwx_baseu-3.0.so.0 NEEDED libfreetype.so.6 NEEDED libz.so.1 NEEDED libSDL-1.2.so.0 NEEDED libSDL_net-1.2.so.0 NEEDED libexpat.so.1  NEEDED libstdc++.so.6 NEEDED libm.so.6 NEEDED libgcc_s.so.1 NEEDED libpthread.so.0 NEEDED libc.so.6   ron@ron-desktop ~ $ objdump -p $(type -p scorched3d) | grep NEEDED | awk '{print $2}' | xargs -n 1 dpkg -S  libwxgtk3.0-0v5:amd64: /usr/lib/x86_64-linux-gnu/libwx_gtk2u_adv-3.0.so.0.2.0 libwxgtk3.0-0v5:amd64: /usr/lib/x86_64-linux-gnu/libwx_gtk2u_adv-3.0.so.0 libwxgtk3.0-0v5:amd64: /usr/lib/x86_64-linux-gnu/libwx_gtk2u_core-3.0.so.0.2.0 libwxgtk3.0-0v5:amd64: /usr/lib/x86_64-linux-gnu/libwx_gtk2u_core-3.0.so.0 libwxbase3.0-0v5:amd64: /usr/lib/x86_64-linux-gnu/libwx_baseu-3.0.so.0.2.0 libwxbase3.0-0v5:amd64: /usr/lib/x86_64-linux-gnu/libwx_baseu-3.0.so.0 libfreetype6:amd64: /usr/lib/x86_64-linux-gnu/libfreetype.so.6.12.1 libfreetype6:i386: /usr/lib/i386-linux-gnu/libfreetype.so.6 libfreetype6:amd64: /usr/lib/x86_64-linux-gnu/libfreetype.so.6 libfreetype6:i386: /usr/lib/i386-linux-gnu/libfreetype.so.6.12.1 zlib1g:i386: /lib/i386-linux-gnu/libz.so.1.2.8 zlib1g:amd64: /lib/x86_64-linux-gnu/libz.so.1 zlib1g:i386: /lib/i386-linux-gnu/libz.so.1 zlib1g:amd64: /lib/x86_64-linux-gnu/libz.so.1.2.8 libsdl1.2debian:amd64: /usr/lib/x86_64-linux-gnu/libSDL-1.2.so.0.11.4 libsdl1.2debian:i386: /usr/lib/i386-linux-gnu/libSDL-1.2.so.0 libsdl1.2debian:i386: /usr/lib/i386-linux-gnu/libSDL-1.2.so.0.11.4 libsdl1.2debian:amd64: /usr/lib/x86_64-linux-gnu/libSDL-1.2.so.0 libsdl-net1.2:amd64: /usr/lib/x86_64-linux-gnu/libSDL_net-1.2.so.0 libsdl-net1.2:i386: /usr/lib/i386-linux-gnu/libSDL_net-1.2.so.0 libsdl-net1.2:amd64: /usr/lib/x86_64-linux-gnu/libSDL_net-1.2.so.0.8.0 libsdl-net1.2:i386: /usr/lib/i386-linux-gnu/libSDL_net-1.2.so.0.8.0 libexpat1:i386: /lib/i386-linux-gnu/libexpat.so.1.6.0 libexpat1:amd64: /lib/x86_64-linux-gnu/libexpat.so.1 libexpat1:amd64: /lib/x86_64-linux-gnu/libexpat.so.1.6.0 libexpat1:i386: /lib/i386-linux-gnu/libexpat.so.1 libstdc++6:amd64: /usr/share/gdb/auto-load/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.21-gdb.py libstdc++6:i386: /usr/lib/i386-linux-gnu/libstdc++.so.6 libstdc++6:amd64: /usr/lib/x86_64-linux-gnu/libstdc++.so.6 libstdc++6:amd64: /usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.21 libstdc++6:i386: /usr/lib/i386-linux-gnu/libstdc++.so.6.0.21 libstdc++6:i386: /usr/share/gdb/auto-load/usr/lib/i386-linux-gnu/libstdc++.so.6.0.21-gdb.py libc6:amd64: /lib/x86_64-linux-gnu/libm.so.6 libc6:i386: /lib/i386-linux-gnu/libm.so.6 libgcc1:amd64: /lib/x86_64-linux-gnu/libgcc_s.so.1 libgcc1:i386: /lib/i386-linux-gnu/libgcc_s.so.1 libc6:i386: /lib/i386-linux-gnu/libpthread.so.0 libc6:amd64: /lib/x86_64-linux-gnu/libpthread.so.0 libc6:i386: /lib/i386-linux-gnu/libc.so.6 libc6:amd64: /lib/x86_64-linux-gnu/libc.so.6 ron@ron-desktop ~ $ How do you integrate $e^{x^2}$? I know that $\int{\frac{1}{x}}dx$ is simply $\ln{(x)}+c$ (-which is clearly unrelated to the problem but I just thought I would share anyway) but I am not sure how to approach $e^{x{^2}}$. Perhaps a substitution? Redirecting stdout to a file you don't have write permission on I've posted a question or an answer, and I have received one or more downvotes. I am not really sure why I was down voted, or I think I know why, but I disagree.  Why did this happen, and what should I do about it? When comments get too chatty the move-to-chat feature asks if you'd like to move it out. But this often happens after the fact and thus doesn't prevent it.   I propose that:   Move-to-chat be provided as a button along side so that a user who knows their question or conversation may become drawn out may elect to preempt and take the conversation "off-line" Who are the diamond moderators, and what is their role? Some people have a diamond after their username (e.g. )    What special privileges do diamond moderators have? How can I become a diamond moderator? Who are the diamond moderators?  How many are there?      For more information, see  in the .     Note: not to confuse with certain Stack Exchange employees, for example  members or "community managers", who often have diamonds as well, but are not ordinary moderators. The page I'm trying to fetch is public.  The server logs show no request.  Google reports that any page on my site is "Temporarily unreachable". It won't even fetch the verification file, a static HTML file that was successfully used to verify with the webmaster tool application itself.   My site is running on the .  What is causing this? Generating a range of numbers in MySQL How do I generate a range of consecutive numbers (one per line) from a MySQL query so that I can insert them into a table?  For example:  nr 1 2 3 4 5   I would like to use only MySQL for this (not PHP or other languages). Is there a font, available to -all- TeX users, that includes a glyph that can be recognized as the Unicode Replacement Character?  I realize I can use XeTeX with a  (or maybe any character not in the font), but I'm interested in using standard pdfTeX with standard LaTeX 2e and a pure ASCII input file.  The glyph typically looks like a filled black diamond with a white question mark inside it:    If no such font is available, what's the best robust strategy for getting such a glyph into a standard pdfTeX document (one whose input file has no Unicode or non-ASCII UTF-8 byte sequences in it) without using XeTeX or similar?  Inserting TikZ commands?  Raw PostScript?  Right now, for lack of a better solution, I'm using a \textbullet, simply because it's the boldest/blackest glyph I can think of, and it's available in most standard fonts.  Creating a custom font with one glyph in it is not really viable, or if it is it's a strategy of last resort, unless (perhaps) it can be done automatically and on the fly when processing the document each time.  (Reposted from the texhax mailing list: ; originally posed by Doug McKenna) If $S$ is a finitely generated graded algebra over $S_0$, $S_{(f)}$ is finitely generated algebra over $S_0$? Let $S = \bigoplus_{n\ge 0} S_n$ be a graded commutative ring. Let $f$ be a homogeneous element of $S$ of degree $&gt; 0$. Let $S_{(f)}$ be the degree $0$ part of the graded ring $S_f$, where $S_f$ is the localization with respect to the multiplicative set $\{1, f, f^2,\dots\}$. Suppose $S$ is finitely generated algebra over $S_0$. Then $S_{(f)}$ is a finitely generated algebra over $S_0$. Hello recently I went to best buy and played with a Nikon B500, it was great. I was able to focus on the smallest things, close or far, zoomed all the way in and all the way out. So I went on the internet and found out that the B700 shoots in raw so I got it instead thinking it was better. Only I cant get it to focus on anything close up, weather in macro or not after like 25% zoom it no longer focuses on anything no matter what settings I put it on leaving me to think that I should have gotten the cheaper B500. It may not shoot in raw but at least it would be usable. I am fairly new to photography I had a friend with much more experience come over and try to figure it out. He told me that my camera has a range that it is able to focus on. Only the cheaper B500 focused on things way more zoomed in and with the camera much closer to the object so it doesn't make much since to me. So my question is why wont my camera focus on macro shots (weather in macro or not)? I'm reading .     The graph of $f: A \rightarrow B$ is the subset of $A × B$ consisting   of all ordered pairs $(a, b)$ with $f (a) = b$. If $A$ happens to be   $B^n$ for some $n ∈ N$, then we say that $f$ is a function on $B$ and   $n$ is the arity of $f$.   I don't understand the notation for the exponent of a set, I'm aware of what  is, it's the number of arguments or operands the function takes. I'm just not so sure if I can assume that a set with an exponent such as in $B^n$ means that a function has two operands.  I know the question may be too naive and perhapes the answer is the one I suggested and it's right in front of my face, I'm just searching for a confirmation or the negation of it. Thanks. Create a hexadecimal colour based on a string with JavaScript Are the XBLA and PC versions of Minecraft compatible? Why are papers without code but with results accepted? I just started reading some papers (Computer Science, specifically Computer Vision) and thought "now let's look at the source code" and was quite astonished that most of the papers don't have any source code implementing the described methods to look at, while claiming some performance or being better than other papers.  How do these papers get accepted in journals / conferences? Do people have to submit their source code privately to the reviewers at least, so that they can reproduce the experiment if possible.  Do most journals / conferences just "trust" that people who submit the paper really implemented the theory and got those exact results?  I always had this idea that any experiment should be reproducible by others else it's not scientific justified. Been wondering about this the last few days. How to upgrade from 18.10 to 19.10, using the command line? I'm trying to upgrade from 18.10 to 19.10, using sudo do-release-upgrade however I only get an error: An upgrade from 'cosmic' to 'eoan' is not supported with this tool. I performed the steps to update my sources.list to point to old-release server, as suggested here:  This did not help. I get the same error. What determines SPECIAL inheritance in children? Prove $2^k+1$ divisible by 3 for odd K What is the relation between computational security and provable security? I read the book "Introduction modern cryptography". It gives the notion of computational security of private-key encryption at first which comes from perfect security and statistical security.     Let $(E,D)$ be an encryption scheme that uses $n$-bits keys to encrypt $l(n)$-length messages. $(E,D)$ is computationally secure if    $$E_{U_{n}}(x_{0}) \approx E_{U_{n}}(x_1)$$   And then it introduces the secure game (e.g. CPA, CCA)? I think it is a part of provable security.  "Unconditional security" (or "information-theoretic security" or "perfectly secrecy") and "computational security" are two opposite classes of security. But I do not think "computational security" and "provable security" are two independent classes of security. I know that computational security emphasizes the power of attacker is bounded (polynomial-time algorithm). And the provable emphasizes the mathematical assumptions or cryptography primitives. But it also related to the computational power.