When I'm writing code, and i purposely write a syntax error like:  Console.WriteLine(;   Visual Studio doesn't show me the red squiggle Intellisense errors.  But when i start the program it shows the error. That's not how it should work.   Any ideas on what to do?
My Visual Studio (2008) Editor has stopped to underline Errors (this nifty wavy red lines). I can't really tell when, but it can be related to the installation of .Net Framework 3.5 SP 1 or the MVC Beta (which I guess is unlikely). Furthermore have I installed and uninstalled both CodeRush and Resharper for evaluation purposes (decided not to keep either one of them).  Does anyone know the problem and how to restore this functionality again?
How to limit Docker total resources? I'm trying to limit the total resources accessible from docker (for example only 90% of the RAM and 1500% of the CPU). I cannot use CPU and RAM limit when I'm launching my containers, that's why I need to limit the total resources available for docker containers.  I have around 20 containers which can consume the maximum CPU and memory but not at the same time, so I cannot set the CPU and RAM limit, that's why I need to limit the total resource used by docker  First of all I've created a slice: I tried the instruction above, but impossible to limit both the RAM and the CPU usage  # /etc/systemd/system/docker_limit.slice [Unit] Description=Slice that limits docker resources Before=slices.target  [Slice] CPUAccounting=true CPUQuota=700% #Memory Management MemoryAccounting=true MemoryHigh=20G MemoryMax=25G MemoryMaxSwap=10G   And my daemon.json  {   "insecure-registries" : [ "url1", "url2"],   "cgroup-parent": "docker_limit.slice" }   But when I try from a container:  stress --vm-bytes $(awk '/MemAvailable/{printf "%d\n", $2 * 0.9;}' &lt; /proc/meminfo)k --vm-keep -m 1   I can see from docker stats it's using 111Go of Ram (full capacity of my server)  stress --cpu 16   I can see from docker stats it's using near 1600 % (full capacity of my server)  I think I've missed something but I don't know what What's the problem with my Young slits experiment? My Young's slits experiment doesn’t work. I mean I tried to see wave effect of light but I didn’t see any thing expect particles! I’ve sent you a pic of my laser and a short video of the experiment. Is there any problem you think? This is a summary of the excerpt:  Given that we have:  *$10^9$ people  *each person has a chance of 0.01 of going to a hotel  *we have $10^5$ hotels, each hotel holds 100 people  *Thus, $P(2 \text{ persons meet on the same hotel in any given day}) = 0.01 \cdot 0.01 \cdot 10^{-5}$  *and $P(2\text{ persons on the same hotel in $2$ day}) = P(2 \text{ persons on the same hotel in any given days})^2 = 10^{-18}$  the book "Mining of Massive Dataset" said that the expected number of pairs who stay in the same hotel for 2 days is:  $P(2 \text{ persons on the same hotel in $2$ days}) \cdot ( \text{number of pairs of people} ) \cdot (\text{number of pairs of days})$  this is the part where I got stuck. Can't understand how it come to this derivation. Can anybody explain it in more elaborate detail.  You can find the content on page 6 of this link:  (it is freely available) Seeking QGIS tutorials and web resources? I wish to familiarize myself with the capabilities of QGIS up to and beyond QGIS version 3.0.   Can you recommend some good web resources and tutorials that would show me QGIS' capabilities?   I am interested in both using QGIS through its GUI and in developing applications using QGIS. I've recently set up the compiz cube again, and I was very happy to find that that flickering window glitch is gone! However, the cube reflection and deformation plugins are also gone.  I am running a fresh 12.10 install, and I have every compiz plugin package installed (including compiz-plugins-extra, which supposedly contains everything that compiz-fusion-plugins-extra package used to have), but those two plugins are still missing. I haven't been able to find anyone with the same problem.   Any ideas? (thanks!) I read that     A typical stream cipher encrypts plaintext one byte at a time, although a stream cipher may be designed to operate on one bit at a time or on units larger than a byte at a time.   (Source: , William Stallings.)  A block cipher encrypts one block at a time. The block may be of size one byte or more or less. That means we can also encrypt a block of one byte by help of a stream cipher as a stream.  So, what exactly is the difference between a stream cipher and a block cipher? "Please do not repeat the mistake" and "Please do not repeat the mistake again" Find $\lim_{n\to \infty}({1\over \sqrt{n^2+1}}+{1\over \sqrt{n^2+2}}+\cdots+{1\over \sqrt{n^2+n}})$ strong textFind $\lim_\limits{n\to \infty}\left({1\over \sqrt{n^2+1}}+{1\over \sqrt{n^2+2}}+\cdots+{1\over \sqrt{n^2+n}}\right)$. I do know it is bounded by $1$. I tried using the sandwich rule with no success. How can I solve it? About the anime version of Air:  Some sources on the net state that Kanna's curses were broken, and her next reincarnation would be a happy one.  Some say that the pair of children playing on the beach were the reincarnations of Misuzu-Kanna / Yukito-Ryūya.  What is the canonical explanation of this ending? Did the curses really get lifted? Please include sources in your answer. In the 1997 film "", the antagonist is attempting to elude some assassins who are after him. When they are pursuing his van, he quickly      pulls the van into a parking garage and washes off the color-changing paint he had earlier painted the van with, thus changing the color of the van.    He then takes a small can and sprays it onto the door handle of the van before taking off. A few minutes later, the assassins      enter the parking garage and notice the dyed water running away from the van. When one of the men goes to open the van using the tainted door handle, he pulls his hand away like it hurt, then starts foaming at the mouth. He immediately has a seizure of some kind and falls down dead.   What was the substance sprayed on the handle, and how could it do this so quickly? Why does James Bond use his real name? In the James Bond universe most characters go by a code name M, Q, the various 00s, In Skyfall Silva is a made up name.  Others such as Tanner, Robinson and Moneypenny, Trevelyan we're not so sure but we've got no reason to believe they're real.  However Bond uses his own name - we've even seen the grave of his parents to confirm this.  Why does Bond use his real name and (as far as we know) no one else does? What is the difference between:   The company would rather each employee be provided with ID card.  The company would rather each employee were provided with ID card. Show that $8 \mid (a^2-b^2)$ for $a$ and $b$ both odd I was having trouble playing the game on my android so I downloaded it to my wife's phone (Galaxy S6). I read some posts on how to get it running on my android and it worked but, my level 7 account is on my wife's phone.  How do I get it back to my android? When I sign out and back in it doesn't ask for any sign in info. I've tried deleting the app's data and even uninstalling and re-installing, but it still doesn't ask for sign-in info. Save entire process for continuation after reboot I developed an algorithm for a fairly hard problem in mathematics which is likely to need several months to finish. As I have limited resources only, I started this on my Ubuntu 12.04 (x86) laptop. Now I want to install some updates and actually restart the laptop (the "please reboot" message is just annoying).  Is there a way to save an entire process including its allocated memory for continuation beyond a reboot?  Here is some information about the process you might need. Please feel free to ask for further information if needed.   I called the process in a terminal with the command "./binary &gt; ./somefile &amp;" or "time ./binary > ./somefile &amp;", I cannot really remember. It's printing some debug information to std::cerr (not very often). It's currently using roughly 600.0 kiB and even though this will increase, it's unlikely to increase rapidly. the process runs with normal priority the kernel is 3.2.0-26-generic-pae, the cpu is an AMD, the operating system is Ubuntu 12.04 x86. it runs since 9 days and 14 hours (so too long to cancel it ;-) ) Number of connected components of the complement of a compact Let $X$ be a connected, locally compact space and let $K$ be a compact subset of $X$. Is the number of connected components of the complement $X\setminus K$ finite? If it is not, are there some hypotheses over $X$ for finiteness of connected components? How are the age restrictions followed by ICC for under 19 cricket tournaments? I have some doubts under this topic,   Can a player aged 19 play under 19 international cricket match? (Since 19 is not under 19) Consider a player having birthday during the series/tournament. How the age will be calculated for him? Prove that $\int f\ d\lambda = \int_{a}^{b} f(x)\ dx,$ for any $f \in \mathcal R[a,b].$ Theorem $:$ Let $f : [a,b] \longrightarrow \Bbb R$ be a Riemann integrable function. Then $f \in L_1[a,b]$ and $$\int f\ d\lambda = \int_{a}^{b} f(x)\ dx.$$  The proof given in my book is as follows $:$     At the fag end of the proof $f$ has been proved to be measurable which uses the completeness of the measure space $\left ([a,b], \mathcal L \cap [a,b], \lambda |_{[a,b]} \right ).$ Then it has been stated that $f \leq \Phi_n,$ $\forall$ $n$ and hence $f \in L_1[a,b]$ since $\Phi_n \in L_1[a,b]$ by the proposition $5.4.3 \ $(i) which states the following $:$  Let $f \in \Bbb L$ and $g \in L_1[a,b].$ If $|f(x)| \leq g(x)$ for a.e. $x(\mu).$ Then $f \in L_1[a,b].$  I don't know how to use this proposition to claim that $f \in L_1[a,b].$ Also I don't understand the way dominated convergence theorem used here. What I know about dominated convergence theorem is as follows $:$  Let $(X, \mathcal S, \mu)$ be a complete measure space. Let $g \in L_1(X)$ and $\{f_n \}_{n \geq 1}$ be a sequence in $\Bbb L$ such that $|f_n(x)| \leq g(x)$ a.e. $x(\mu).$ Let $f_n(x) \to f(x)$ as $n \to \infty$ a.e. $x (\mu).$ Then $f \in L_1(X)$ and $$\int f\ d\mu = \lim\limits_{n \to \infty} \int f_n\ d\mu.$$  From here how to conclude that $$\Psi_n\ \bigg\uparrow\ f \implies \int f\ d\lambda = \lim\limits_{n \to \infty} \int \Psi_n\ d\lambda.$$ Please help me in this regard. Thanks in advance. What is the remainder when $24^{1202}$ is divided by $1446$? I tried remainder theorem but that does not simplify it.   I tried factorizing $1446$ as $2\cdot3\cdot241$ and got remainders when numerator is divided by $2,3$ and $241$ individually but then I did not know what to do next? Stuck! Prove $f(S \cup T) = f(S) \cup f(T)$ $f(S \cup T) = f(S) \cup f(T)$  $f(S)$ encompasses all $x$ that is in $S$ $f(T)$ encompasses all $x$ that is in $T$  Thus the domain being the same, both the LHS and RHS map to the same $y$, since the function $f$ is the same for both.  Can you post the solution?