I have this code:  booleans.put(varToSet, choiceResponse);   and it throws a NullPointerException. The error it shows is this:  Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException     at com.salsagames.prometheus.code.Compiler$2.either(Compiler.java:120)     at com.salsagames.prometheus.code.message.YesNo.lambda$new$2(YesNo.java:73)     at javax.swing.plaf.basic.BasicButtonListener.mouseReleased(BasicButtonListener.java:252)   The two variables I use are:  varToSet test  choiceResponse true  I am using the right types for the Map, (String in, Boolean out).  My Map needed to be declared as new HashMap&lt;&gt;()
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
I have some shares that are mounted during login. I used Users &amp; Groups' "Login Items" panel to do this. When I login, all of the shares pop up in their own Finder windows.  How can I keep the Finder windows from popping up at login? I've already tried checking the Hide checkbox. How to create a color of the same brightness and saturation? Let's consider three colors: Red, Green and Blue. For blue I created a specific shade, something like #F2F5F7. If you see this color, it has a certain level of shade, brightness and saturation value of blue.  I want to create the same equivalent color but for Green and Red, how to get that? Last digits, numbers Can anyone please help me?  1) Find the last digit of $7^{12345}$   2) Find the last 2 digits of $3^{3^{2014}}$.  Attempt: 1)  By just setting the powers of $7$ we have $7^1 = 7$, $7^2=49$, $7^3=343$, $7^4 = 2401$, $7^5 = 16807$, $7^6 = 117649$, $\dots$  After the power of $4$, the last digits will repeat. Then by noticing the pattern the digits will end in $7,9,3$ and $1$.  Then we can divide the exponent $(12345)$ by $4$ since this is the cycle that makes it repeat. Then $12345 : 4$ has remainder $1$. So $7^1 = 7$ is the unit digit to $7^{12345}$.   So the last digit is $7$.   I know how to do it like this, the problem does not state how to find the last digit, but I know it has something do do with Euler's theorem.  for part $2$) I don't know how to start. Can anyone please help me?   Thank you for the help. How can I tell if an iOS device has a GPS? Consider equations defined in $D_x = (0,\infty) \times (0,\infty)$  1) Find the maximal solution to  $$ \dot y = \frac{3t^2}{5y^4} $$ satisfying the initial value problem $y(1) = 2^{\frac{1}{5}}$  I have found the maximum solution to be $((0,\infty), (t^3+1)^\frac{1}{5})$  2) Find the maximal solution to   $$ \dot y = -\frac{2y}{5t}+\frac{3}{5y^4}$$  satisfying the IVP $y(1) = 2^{\frac{1}{5}}$.  (HINT: Use a transformation of the form $t^{\alpha}y(t)$.   I hope someone can explain how to use the transformation to find the maximal solution. Why is this sequence of equicontinuous functions uniformly bounded? Let $\left\{f_{n}\right\}$ be a sequence of equicontinuous functions where $f_n: [0,1] \rightarrow \mathbf{R}$.  If $\{f_n(0)\}$ is bounded, why is $\left\{f_{n}\right\}$ uniformly bounded? How to install hp scanjet 200 in Ubuntu 12.04? Unable to scan with hp scan-jet 200. When I type lsusb command in terminal it shows the scanner details.  I opened the simple scan which displays no scanners found, and x sane image scanners also displays the same error. Why does Windows 7 ask for additional drivers when installing from a USB 3.0 drive? How prove this $\sum_{k=1}^{2^{n-1}}\sigma{(2^n-2k+1)}\sigma{(2k-1)}=8^{n-1}$ Given the positive integer numbers $n$,prove that $$\sum_{k=1}^{2^{n-1}}\sigma{(2^n-2k+1)}\sigma{(2k-1)}=8^{n-1}$$  where $\sigma(n)$ is defined as $$\sigma{(N)}=\sum_{d|N}d$$  This problem I think is very interesting, and have nice methods?  Thank you everyone.  and I find some of this     or can see: In C, is it possible to forward the invocation of a variadic function? As in,  int my_printf(char *fmt, ...) {     fprintf(stderr, "Calling printf with fmt %s", fmt);     return SOMEHOW_INVOKE_LIBC_PRINTF; }   Forwarding the invocation in the manner above obviously isn't strictly necessary in this case (since you could log invocations in other ways, or use vfprintf), but the codebase I'm working on requires the wrapper to do some actual work, and doesn't have (and can't have added) a helper function akin to vfprintf.  [Update: there seems to be some confusion based on the answers that have been supplied so far. To phrase the question another way: in general, can you wrap some arbitrary variadic function without modifying that function's definition.] Finding descendants of British great grand uncle who emigrated to Australia? From  I have received the information of the person with the possibility of great-grandfather.   However, I have a bigger problem from here which is whether he really is my great-grandfather because there was a brother to him in the information.   If I can find his brother's descendants, then I may be able to learn the kinship with DNA testing.   How can I find the living descendants of this great grand uncle?  I was born and grew up in Japan where research is easy for me but I do not know the best way in Britain and Australia.  C.Z.Ede is the name of the candidate for my great-grandfather and his information can be found at   There is also a Mr Peter Zohrab site () which mentions "Sydney Cuthbert Ede, Eagleville Station, Talbotville, Victoria, Australia".  Mr Peter Zohrab from that site suggested that I look for descendants of Sydney Cuthbert Ede in Australia or New Zealand. However, I have not yet found any. I am also inquiring at the church in which he was baptized. What is the white smoke-like fog called? It's not really fog, mist or haze. I used to think that it's mist, but from what I've read here, it turns out that it isn't.  It's the white smoke-like fog that is close to the ground. I've seen it recently above a couple of small ponds (and ground) in a damp forest. It was almost as white as smoke, you can barely see through it, but it is close to the ground, from 20cm to a meter or so.  Since it isn't fog (which is a cloud that you can see, say from a mountaintop, and if it's not mist (which is more like 'rain'), then what is it? Foobar2000-like music player? Let $R$ be a commutative ring.  The nilradical $\text{nil}(R)$ is the set of all nilpotent elements, and it is the intersection of all the prime ideals of $R$.  Is the following true in the polynomial ring? $$\text{nil}(R[X])=(\text{nil}(R))[X]$$  Any polynomial in the right hand side has all its coefficients nilpotent in $R$, hence also in $R[X]$, and therefore it is nilpotent in $R[X]$ as the sum of nilpotent elements.  The other inclusion is not clear to me.  Is there a counterexample? register_nav_menus() won't register menus Please help with menu registeration:  I have followed this guide (http://codex.wordpress.org/Navigation_Menus) step by step.  Added the following code to functions.php:  function register_my_menus() {   register_nav_menus(     array('header-menu' =&gt; __( 'Header Menu' ) )   ); }  add_action( 'init', 'register_my_menus' );   But the guide says that this will make the menu appear in the Appearance -> Menus admin screen in the "Theme Locations" box as "Header Menu".  When I go to Appearance -> Menus everything is greyed out and there is no option of "Theme Locations" Prove the following: If $a \mid bc$, then $a \mid \gcd(a, b)c$. Prove the following: If $a \mid bc$, then $a  \mid \gcd(a, b)c$.   I tried to set $\gcd(a, b)$ to $b$ and used the fundamental theorem of arithmetic to prove that it is divisible by $a$, but I can't prove that $a \mid bc$, if and only if $a\mid b$ and $a\mid c$. Please help. Thanks. How accurate is the GPS on the iPhone's Find My iPhone app?  I used Find My iPhone app to track a friend. The first 3 stops were dead on but when it refreshed it showed them to be several streets over from actual location. What could cause that? Beamer in LyX: no sperator option avaiable I have been using beamer in LyX for a while now. Love it. But I just got a new computer, istalled LyX again and when I create a new beamer file (or open an old one) the "separator" option that is used to end a frame is not avaiable.  I do not know if there is something wrong with my installation or if I should install some package, or something else.  Has anybody ever run into this problem as well?  Thank you for the help.  Edited: Thank you for the answers, I basically need to update lyx on the other computers now. For f continuous on $[0,1]$, show that there exist points $\alpha_k$ such that $\sum \limits_{k=1}^n \frac{1}{f'(\alpha_k)} = n $ How do I test a private function or a class that has private methods, fields or inner classes? How do I unit test (using xUnit) a class that has internal private methods, fields or nested classes? Or a function that is made private by having  (static in C/C++) or is in a private () namespace?  It seems bad to change the access modifier for a method or function just to be able to run a test.