i am try to make a mini password game to learn c# on a course and i keep getting this error when im try to make the game read the password. here is the code anything i need to get rid of? or maybe add? if this helps im using unity as my engine. thanks // Game state int level; enum Screen { MainMenu, Password, Win };  Screen currentScreen;  string password; // Use this for initialization void Start() {     ShowMainMenu(); }  void ShowMainMenu() {     currentScreen = Screen.MainMenu;     Terminal.ClearScreen();     Terminal.WriteLine(&quot;What would you like to hack into?&quot;);     Terminal.WriteLine(&quot;Press 1 for the local library&quot;);     Terminal.WriteLine(&quot;Press 2 for the police station&quot;);     Terminal.WriteLine(&quot;Enter your selection:&quot;); } void OnUserInput(string input) {     if (input == &quot;menu&quot;)     {         ShowMainMenu();     }     else if (currentScreen == Screen.MainMenu)     {         Runmainmenu(input);     }     else if (currentScreen == Screen.Password)     {         Checkpassword(input);      } }    void CheckPassword(string input) {     if (input == password)     {         checkpassword(input);         Terminal.WriteLine(&quot;Sorry, wrong password!&quot;);     }     else     {         Terminal.WriteLine(&quot;WELL DONE!&quot;);       }   }  private void checkpassword(string input) {     Checkpassword(input); }  private void Runmainmenu(string input) {     {         if (input == &quot;1&quot;)         {             level = 1;             password = &quot;book&quot;;             StartGame();         }         if (input == &quot;2&quot;)         {             level = 2;             password = &quot;handcuffs&quot;;             StartGame();         }         else if (input == &quot;007&quot;)         {             Terminal.WriteLine(&quot;Please select a level Mr Bond!&quot;);         }         else         {                      }     } }      void StartGame() {     currentScreen = Screen.Password;     Terminal.WriteLine(&quot;You have chosen level &quot; + level);     Terminal.WriteLine(&quot;Please enter your password: &quot;); }  void Checkpassword(string input) {     checkpassword(input);  }  private void runmainmenu(string input) {     runmainmenu(input);       }  string GetDebuggerDisplay() {     return ToString(); }
I would like to either prevent or handle a StackOverflowException that I am getting from a call to the XslCompiledTransform.Transform method within an Xsl Editor I am writing. The problem seems to be that the user can write an Xsl script that is infinitely recursive, and it just blows up on the call to the Transform method.  (That is, the problem is not just the typical programmatic error, which is usually the cause of such an exception.)  Is there a way to detect and/or limit how many recursions are allowed?  Or any other ideas to keep this code from just blowing up on me?
I want to implement an addition key layer, so that I can access non-alphanumeric keys without having to move my wrists.  I've been using Autokey for this purpose, but the experience was unsatisfactory: it had occasional lags and let original keystrokes slip into certain apps.  So I need a low-level solution. Isomorphism between two models of Hilbert's Axioms with different notions of congruence Remove Indentation for a Single Paragraph Is there a way to remove the indentation at the beginning of a paragraph for a single paragraph.  I know I could do  \setlength{\parindent}{0cm} This is my paragraph.  Blah blah blah. \setlength{\parindent}{default}   Where default is whatever the default indentation is for the document class I am using (part of the problem is that I don't know what this default value is).  I feel as if there should be a better way to accomplish this than by the above method.  I am looking for a solution of the form:  \noindent This is my paragraph.  Blah blah blah.   Is there a way to do this, or will I have to resort to the former method?  If I have to resort to the former method, what is the default indentation value for the amsart document class? Prove that $d(n)\leq 2\sqrt{n}$ In Waclaw Sierpinski's book Elementary Theory of Numbers on page 168 there is the following exercise:  "Exercises. 1. Prove that for natural numbers $n$ we have $d(n) \leq 2\sqrt{n}$," where $d(n)$ is the number of divisors of n.  As a hint right below is given: "The proof follows from the fact that of two complementary divisors of a natural number $n$ one is always not greater than $\sqrt{n}$.  I understand the hint but I don't know how it can be used to prove $d(n)\leq 2\sqrt{n}$.  Complementary divisors are pairs of divisors that when multiplied gives the number that is to be divided. For example the number $120$ has the complementary divisors: \begin{align*} &amp; 1, 120 \\ &amp; 2, 60 \\ &amp; 3, 40 \\ &amp; 4, 30 \\ &amp; 5, 24 \\ &amp; 6, 20 \\ &amp; 8, 15 \\ &amp; 10, 12 \\ \end{align*} How do you prove that $d(n) \leq 2\sqrt{n}$? How to update Wine to the latest version? Is there any way to force SQL Server NOT to mark subscriptions as inactive, ever?  It happens sporadically when there are connection issues and I don't want to have to reinitialize the subscription every time.  Note, I'm not talking about the subscriptions being marked as expired...just as inactive.  We have retention set to 0 (infinite). I'd rather have a big distribution database than have to reinitialize a 15GB database to a subscriber over the WAN. Anyway, the real issue here is that they are getting marked as inactive within just a few hours sometimes...or sometimes a few days...it seems sporadic. Is there any way to tell WHY SQL decided in its wisdom to mark them inactive? How to Self-Study Mathematical Methods? Edit:  Ok, user  made comment that truly helps narrow the focus of my question. Basically, I'm asking for a self-study course of Mathematical Methods.  Thanks to his recommendation I identified a book that is very close to the answer:  Mathematical Methods in the Physical Sciences by Mary L. Boas  Supposedly, the book covers most of the Math a person needs to learn in order to understand the simulations I presented.  Does this book suit my needs?    Hello,  I have always been interested on the idea to study Math at an Undergraduate level to be able to implement simulations like the followings:  Finite Difference Simulation of the Wave Equation    Heat Equation in Two Dimensions    Besides my precollege experience in Math, I have only been able to do very simple simulations due to my lack of knowledge of Advanced Math. Every time I ask about the inner workings of the simulations I get redirected to papers that look like foreign language to me and, unfortunately, I depend on easy-to-read tutorials to understand them, and while I have found   I'm more interested in reaching the solution myself.  I checked some of the questions related to book recommendations for self-study and while they are very helpful I'm interested in learning by example (There is a book called: "Accelerated C++ Practical Programming by Example" that fits very well my study habits)  Thanks in advance. How is the /tmp directory cleaned up? Is it automatic? If so, how frequently is it cleaned up? We currently have two rewards checking accounts.  We are nearing the maximums permitted on each account, after which we receive .5% and .25% APY.  It's within our means to perhaps open another one, but at that point we are looking at using our debit cards 50 to 55 times a month.  I feel that running that number of debit transactions is getting out of hands as it's just the two of us.  I realize there are easy ways to game the system, but I want these things to stay around and another person doing just such that could lead to the ends of these accounts.  We are saving towards a new house down payment.  As such we don't require these funds to be fully liquid, but would still like to remain free of as much risk as possible -- however I realize we are unlikely to find anything near our rewards checking accounts (4% APY interest for meeting various rules: direct deposit, a certain number of debit card transactions, and not receiving a paper statement), but would hope we can get at least half of that.  We aren't fully sure when we will be buying, but we are probably a couple of years out.  For that reason I don't think CDs would work.  Even if we ladder them, when we need the money we will need it pretty much instantly.  Do I bite the bullet and just find the best available money market account?  What other options do I have that let me deposit monthly, and not have a timebomb associated to accessing that money that isn't in the initial lump sum? What advantages does using (function(window, document, undefined) { ... })(window, document) confer? Earlier I asked a question about  and got the answer that while it is only necessary for anonymous types, that it is used nonetheless to make writing code 'quicker'/easier and 'just because'.  Following  I saw that var gets compiled down to the correct type in the IL (you will see it about midway down article).  My question is how much more, if any, IL code does using the var keyword take, and would it be even close to having a measurable level on the performance of the code if it was used everywhere? Keeping track of programs When I install a simple program it often uses make &amp;&amp; make install and doesn't often even have an uninstall target.  If I wish to upgrade a program, is it standard protocol to assume it just rewrites seamlessly over the old program?  How do I keep track of these programs; do most people just 'fire and forget' and if no uninstall target is given do I have to manually delete everything? I eliminated a computer player that had a strong religion (Buddhism). My religion was weak, whereas this other one was taking over the continent quickly. Now that I have him overrun, I want, well wanted, to work on converting cities to mine, but I see now that all of the cities period have his religion! I tried making an Inquisitor just to test, but he is ineffectual at removing Buddhism, being that I can only buy him in Buddhist cities. (Because all of my cities are Buddhist and my religion, Shinto, has been wiped out.   Is there no way to recover your religion in such a situation? I uninstalled and re-installed steam. I didn't uninstall my games, and they still exist on my hard drive (I checked).  I have an SSD and a HDD, and to save space I install programs (including steam) to C:\Program Files (x86)\Steam drive (SSD) and games to D:\Games\SteamApps (HDD). How to I let steam know the programs are installed there? I've just made a set of armor by using a male body mesh model I downloaded and selecting certain faces from the model and duplicating them to create viable armor pieces.   Since the pieces are just duplicated from the same mesh male model, then it's still part of the same object.   How do I separate the armor piece from the model to make the pieces separate? i would like to know how to prove that if $a^2+b^2=c^2$ then   a) $3|a$ or $3|b$  b) $5|a$ or $5|b$ or $5|c$  c) $4|a$ or $4|b$   Also that $a^2+b^2+c^2+1$ can't be divisible by 8  Thank you very much! Finding acute triangle probability A stick is broken in three parts of any length ,  if we join the pieces then what's the probability of getting a acute angled triangle? I have 3 folders with large amount of data in each which has to be maintained seperately. Can I create a sym link or shortcut.in windows which should show me the merged contents of the 3 folders. I am not looking for library conf in Win7.   Any suggestion is highly appreciated. This is problem 6.2 from the 3rd edition of Principles of Mathematical Analysis.      Problem 6.2: Suppose $f\geq 0$, f is continuous on $[a, b]$, and $\int_a^b f(x) \, dx = 0$. Prove that $f(x)=0$ for all $x \in [a, b]$.   I'm looking for a critique of my proof. It's a pretty easy problem, but I am always wary of making too bold of assumptions, especially on these low level/fundamental proofs. I'll be using Rudin's notation and refer to theorems from the text (If I should include the text of each theorem, feel free to leave a comment... I'm lazy but could probably use the TeX practice :p)  Proof: Assume, for contradiction, that $f&gt;0$. Then, for any partition $P$ we have the Lower Riemann Sum: $L(P, f)=\sum_{i=1}^n m_i \, \Delta x_i$. At least one $\Delta x_i$ must be positive, since $a &lt; b$, and each $m_i$ must be positive since we have $f&gt;0$ by assumption, so certainly $\sup f &gt; 0$. That means $L(P, f)&gt;0$. Thus, we have: $$0 = 0(b-a) &lt; L(P,f)\leq \sup L(P, f) = \inf U(P,f) =L$$ where the last string of equalities holds because our function is continuous on a compact interval, so is integrable by theorems 6.8 and 6.6. So our integral has value $L&gt;0$. This is in contradiction to our given assumption that $\int_a^b f(x) \, dx = 0$, so we must have that $f=0$ on $[a, b]$. $\Box$  So, I am wondering if my proof is correct (and is presented well). Also if someone could enlighten me as to what Rudin means when he say "Compare this with exercise 1," I'd be appreciative. Is it a hint or is there something else he expects you to notice? there are a lot of things I could compare :)...  Exercise 6.1: Suppose $\alpha$ increases on $[a, b]$, $a \leq x_0 \leq b$, $\alpha$ is continuous at $x_0$, $f(x_0)=1$, and $f(x)=0$ if $x\neq x_0$. Prove that $f$ is Riemann-Stieltjes Integrable and that $\int f \, d\alpha = 0$ Why would a partition be in use by the system if it isn't mounted? I've been migrating my system from btrfs to ext4 after running into performance issues with VMs. I have two hard drives in my laptop to work with. I've successfully moved my home partition, but the same steps I used aren't working for root.  Progress so far:  I've dd'd my root partition from /dev/sda3 into /dev/sdb3. I modified /etc/fstab to the following:  $ cat /etc/fstab #  # /etc/fstab: static file system information # # &lt;file system&gt; &lt;dir&gt;   &lt;type&gt;  &lt;options&gt;       &lt;dump&gt;  &lt;pass&gt; # UUID=95f13c34-96ca-49e3-bcb2-ff594df31506 /dev/sdb3               /               btrfs           rw,noatime,ssd,space_cache,discard      0 0  # UUID=0fe04f59-599f-41e2-ac30-2ad0f17a9727 /dev/sda2               /boot           ext2            rw,relatime     0 2  # UUID=44741e0f-924a-4841-80ef-2132bef84182 /dev/sda4               /home           ext4            rw,noatime,discard      0 0   and run sudo mkinitcpio -p linux. It seems to work. I'm able to boot by mounting the partition on the second disk. df shows:  $ df Filesystem      Size  Used Avail Use% Mounted on /dev/sdb3        28G   18G  9.8G  65% /   So, clearly, sdb3 is mounted, not sda3. Here's the problematic step: When I try to format sda3, which is supposedly unused, I get the following:  $ sudo mkfs.ext4 /dev/sda3 [sudo] password for stew:  mke2fs 1.42.11 (09-Jul-2014) /dev/sda3 contains a btrfs file system Proceed anyway? (y,n) y /dev/sda3 is apparently in use by the system; will not make a filesystem here!   sda3 is in use. How and why could it possibly be in use?  As per casey's comment, the output of mount:  mount | grep sd /dev/sdb3 on / type btrfs (rw,noatime,ssd,discard,space_cache) /dev/sda4 on /home type ext4 (rw,noatime,discard,data=ordered) /dev/sda2 on /boot type ext2 (rw,relatime)   As per Warwick's comment, unmounting:  $ sudo umount /dev/sda3 umount: /dev/sda3: not mounted   Mounting and umounting sda3 elsewhere works successfully, but changes nothing.  Update: More fishy behavior:  $ mount | grep sd /dev/sdb3 on / type btrfs (rw,noatime,ssd,discard,space_cache) /dev/sda4 on /home type ext4 (rw,noatime,discard,data=ordered) /dev/sda2 on /boot type ext2 (rw,relatime) $ sudo mount /dev/sda3 mnt [sudo] password for stew:  $ mount | grep sd /dev/sda3 on / type btrfs (rw,noatime,ssd,discard,space_cache) /dev/sda4 on /home type ext4 (rw,noatime,discard,data=ordered) /dev/sda2 on /boot type ext2 (rw,relatime) /dev/sda3 on /home/stew/mnt type btrfs (rw,relatime,ssd,discard,space_cache)   After mounting sda3, sdb3 is no longer mounter. Weird, huh?  As per mikeserv:  $ rmmod btrfs rmmod: ERROR: Module btrfs is in use   This is very much expected, since sdb3 is btrfs and supposed to be mounted to root. From my mkinitcpio.conf file:  MODULES="" HOOKS="base udev autodetect modconf block filesystems keyboard fsck"