Implement queues in java
What is a NullPointerException, and how do I fix it?
Accessing UI thread handler from a service Book, it follows a guy in a dystopian future What if the answers of a historical locked question become obsolete? My understanding is that a question is historically locked because the information in it is too valuable for the question to be deleted.   But if the "valuable information" becomes obsolete, what happens then?  We cannot modify the question content, or the answers for a historically locked question, right? Beamer: how to justify the whole text? Which kind of functions $f(x, \ y)$ can be written as $g(x)\cdot h(y)$? Refreshing open attribute table in ArcMap using ArcPy rather than ArcObjects? I am running the Calculate Field GP tool from the arcpy in ArcMap. When a row value is updated, it does not show up untill I use the Reload Cache tool (Table Options > Reload Cache). How do I refresh the attribute table automatically without using ArcObjects?  I have tried updating the definition query as @blah238 suggested , but this doesn't help. Resetting the data source is not an option because the feature class might be in the editing session and I don't want to lose the connection to the source data. i have a simple sort of a database file which consists only of entries in the following format     variable=value   i want to create a simple vim syntax highlighting for it and set it for specific file extension  for instance, variable part could be light blue, and value part light red  i googled it and came across things such as $vimruntime\syntax\, syntax set=, syntax match, and hi keywords, but couldn't set it up myself eventually  so i want a very simple vim code snippet that would realize it by matching the left and right hand sides and coloring them separately ReadList can't read from file containing high-precision Reals That's basically the question, is there a "right" way to implement operator&lt;&lt; ? Reading  I can see that something like:  friend bool operator&lt;&lt;(obj const&amp; lhs, obj const&amp; rhs);   is preferred to something like   ostream&amp; operator&lt;&lt;(obj const&amp; rhs);   But I can't quite see why should I use one or the other.  My personal case is:  friend ostream &amp; operator&lt;&lt;(ostream &amp;os, const Paragraph&amp; p) {     return os &lt;&lt; p.to_str(); }   But I could probably do:  ostream &amp; operator&lt;&lt;(ostream &amp;os) {     return os &lt;&lt; paragraph; }   What rationale should I base this decision on?  Note:   Paragraph::to_str = (return paragraph)    where paragraph's a string. Do I require airport transit visa at Frankfurt? I am flying from Mumbiai to Montego Bay via Dubai and Frankfurt as my final destination. Do i require airport transit visa at Frankfurt. i will be having invitation letter from husband and  even visa from Montego Bay. Teams of users rails app Are you allowed to use numbers as table names in MySQL? I'm thinking of having a program that dynamically creates new tables as the need arises. Can I have tables named with just numbers in MySQL? Can a shadow move faster than the speed of light? I'm just a layman with no real science background  (a) I'm not really sure what a shadow is. Some people are saying that it's the absence of something (a photon?) and therefore it is not subject to laws of physics. But I know when I'm in a shadow and when in sunlight... that's "information", and I thought that information flow can't break the speed of light limit.  (b) Some others use the laser pointer/flicking wrist example to talk about laser dots moving faster than light speed. But that can't be right, can it? The photons from the laser point have to travel from A to B and (after wrist flick) from A to C ... but the photons are all moving at the speed of light - there's no law-breaking in moving the laser dot from point B to point C because the photons are moving either from A to B or A to C ... the distance from B to C is not material (is it?).  (c) Also, can a shadow be thought of as a gap in a photon flow? E.g. if I interrupt a beam of single photons then can I think of it as e.g. PPPSSSPPPSSSPPPSSSPPP, etc where P = photons and S(shadow) = no photon &amp;, if so, the "SSS" is effectively travelling at the speed of light ... no faster. Interpolation of multibeam bathymetry using ArcGIS Desktop? I'm trying to make a 3D map with multi-beam bathymetry (65536 features, xyz), but it seems that the interpolation methods are too rigid. I need to smooth the data so it looks more natural and realistic.   Which parameters do I have to vary so I can get this? Can't do comparison on PageReference Prime factorizations of consecutive numbers, can they both contains powers of greater than or equal to $1000$? How do I disable the alt-right click keyboard binding? For all infinite cardinals $\kappa, \ (\kappa \times \kappa, <_{cw}) \cong (\kappa, \in).$ I don't understand the proof to the a/m claim. How we know that $\eta &lt; \kappa$ and $(\alpha,\beta)&lt;_{cw} (0, \eta) $ and hence $h: \mu \to \eta \times \eta$ is injective? Appreciate if anyone could advise.  Here is an excerpt of the proof:  For an infinite ordinal $\kappa,$ the canonical well-ordering of $\kappa \times \kappa,$ denoted by $&lt;_{cw}$ is defined as follows: $(\alpha_1, \beta_1)&lt;_{cw} &lt; (\alpha_2, \beta_2)$ iff either one of the following holds.  $(1): \max\{\alpha_1,\beta_1\} &lt; \max\{\alpha_2,\beta_2\}$  $(2): \max\{\alpha_1,\beta_1\} =\max\{\alpha_2,\beta_2\}$ and $\alpha_1&lt;\alpha_2$   $(3): \max\{\alpha_1,\beta_1\} =\max\{\alpha_2,\beta_2\}$ and $\alpha_1 = \alpha_2$ and $\beta_1 &lt; \beta_2.$  Claim: For all infinite cardinals $\kappa, (\kappa \times \kappa, &lt;_{cw}) \cong (\kappa, \in).$  Proof: (It has been show that it is true for $\kappa = \omega$) Assume there is a counterexample  $\kappa.$ Let $A= \{\lambda \in \kappa + 1| \lambda\geq \omega \ is \ a \ cardinal \ and \ (\lambda \times \lambda, &lt;_{cw}) \not\cong (\lambda, \in)\}.$ Then, $\kappa \in A.$ Let $\mu$ be least element of $A.$ Thus, $\mu &gt; \omega$ and for all $\lambda,$ if $\omega \leq \lambda &lt; \mu$ and $\lambda$ is a cardinal, then $(\lambda \times \lambda, &lt;_{cw}) \cong (\lambda, \in).$  By Comparability theorem, $(\mu, \in)$ is isomorphic to initial segment of $(\mu \times \mu, &lt;_{cw})$ since $|\mu \times \mu| \geq \mu$ and $\mu$ is cardinal. Let $(\alpha, \beta) \in \mu \times \mu$ such that $(\mu, \in)$ is isomorphic to initial segment of $(\mu \times \mu, &lt;_{cw})$ given by $(\alpha, \beta).$ Let $h$ be the isomorphism. Let $\eta= \max\{\alpha, \beta\}+ \omega.$ Then $\eta &lt; \kappa$ and $(\alpha,\beta)&lt;_{cw} (0, \eta).$ HENCE, $h: \mu \to \eta \times \eta$ is injective. During Winter Bash, users can earn hats. But sometimes it seems that a hat was awarded even though its requirements weren't (yet) met, or vice versa.  What could be the reason for this? What is an uninterruptible process? Sometimes whenever I write a program in Linux and it crashes due to a bug of some sort, it will become an uninterruptible process and continue running forever until I restart my computer (even if I log out).  My questions are:   What causes a process to become uninterruptible? How do I stop that from happening? This is probably a dumb question, but is there any way to interrupt it without restarting my computer?