I want to make a generic container class that can contain one object of some other class. I thought this might be a reasonable approach:   class Container &lt;T&gt; {     private T thing;      public void Store(T obj) {         thing = obj;     }      public T ReturnIt() {         return thing;     } }   When I try this together with let's say a Book class, I get the following error message:  "Note: GenericContainer.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details."  Could it be that the public T ReturnIt() { return thing; } is the cause of the error, and is this the wrong way to go about returning object that is contained in the Container-class?  I did not get any further information when I tried to compile it with -Xlint:unchecked.  What do I make of the error message?    Code that caused the error:  class GenericContainer {      public static void main(String[] args) {         Container BookStorage = new Container &lt;Book&gt;();         Book thejavabook = new Book("The Java book");            BookStorage.Store(thejavabook);     }        }  class Book {     private String title;     Book(String title) {         this.title = title;     } }  class Container &lt;T&gt; {     private T thing;      public void Store(T obj) {         thing = obj;     }      public T ReturnIt() {         return thing;     } }
For example:  javac Foo.java Note: Foo.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details.
Is there ever a reason (aside from Outbound Messages) to use Workflow instead of Process Builder? Specifically a side-by-side comparison of how well each performs for single-condition field updates, for email alerts or for task creation.  This is not a question about differences (that's well documented) but whether there is any advantage to using Workflow at all.  Are there known obstacles that only exist in one but not the other that would help people decide when to use one or the other? Could be aspects like:   Resource Consumption  Time-based Behavior  Edge case options (e.g.selection of recipients for email) Deployment considerations Prevent VLC from starting a new instance every time a media file is opened I'm making a door with piston sliding sideways that reacts to pressure plates. As the pressure plates are sending the current to redstone at a very low level, I need to raise it somehow, and this leads to awkward stairs of redstone.    So I'm wondering whether there are better ways of sending the redstone current up, maybe even vertically. When should a Test Case be marked as "No Apply"? Given:  DateTime.UtcNow   How do I get a string which represents the same value in an -compliant format?  Note that ISO 8601 defines a number of similar formats. The specific format I am looking for is:  yyyy-MM-ddTHH:mm:ssZ How do I opt-out of the Social Security system? Does the Lunatic Cultist spawn on iPad? I was searching for more answers on the internet. I kept searching, and I found one thing that help me a little. I went back to Terraria and tried it out, but the Lunatic Cultist didn’t spawn.  Does the Lunatic Cultist spawn on an iPad? I'm at roughly 67% completion of the Alola Dex, with ~200 caught, ~290 seen. After scanning QR codes, I've caught a Swinub and Cyndaquil. However, neither were registered in the Pokédex, since neither are Pokémon in the Alola Dex. This brought up the following question:  When will I unlock the National Dex?   Do I need to have seen all the Pokémon in the Alola Dex? Do I need to complete some specific quest, like catching/defeating the Ultra Beasts? After turning census block data into a raster, how do I redistribute the density to reflect land cover types I plan on rasterizing (terminology?) census block data relating to density to a regular 30 m by 30 m grid for use with NLCD data.  I then hope to distribute the density of the original census block among each result set of grid cells within the original polygon according to the land cover type dictated by the NLCD dataset.  For example, let's imagine a string of city blocks with a park, all found within one census block.  If within this census block the average density is 1000 people/km^2, we ultimately would want the resulting grid cell containing the park to have a lower population density than the grid cells containing the surrounding apartments.  This information may be captured by the NLCD dataset, with the park being classified as '21' (open but developed land) versus 24 for apartment buildings which could be classified as '24' (high density development).  Is there a method, or set of methods, within ArcMap that would allow me to:   Redistribute the density based on the NLCD value Perform this redistribution only within the original census block polygon   I don't know if this is possible, but I figured I would ask.  Edit  Here's what I have been trying:  I converted the census block data to a raster, snapping it to the NLCD land cover data and ensuring the output grid cells were the same size.  Each cell contains the same info as the original census block (housing umbers, population, etc). I have been trying to figure out a way to edit the new grid so that if the NLCD grid cell contains a land cover type that doesn't support a business or housing (park, forest, farm, etc.) that it's housing and population values area set to 0.  My next move was going to be figuring out how to subtract the non-residential/non-business grid cells area from the area of the original census block, and force a recalculation of the density.  Converted the altered census block layer to grid cells again, with each having the new density value, and once again set the cells' housing, population, and density values that don't support a business or housing (park, forest, farm, etc.) to 0.  Kind of circular, and I'm not sure of all the steps (raster calculator for editing individual grid cells based on another raster's grid cell value?), but it seems to logically work out if I can get the parts to work.  On the other hand, @dof1985's answer seems to simplify the first part of my workflow (by directing me to the correct toolset), but I will still have to nullify the grid cells where parks, etc., do exits after the density has been recalculated for the census data. Are partitions to the inner/outer edge significantly faster Some linux dual/multi-boot tutorials / general partitioning tutorials say that the inner side of a hard disk is faster than the outer side so partitions towards the outside tend to be slower while some say that the exact opposite is true.  Which side is actually faster?  Is the difference noticeable?  How are the partitions physically placed on the disk as compared to the partition listing order-for example gparted shows a logical ribbon layout of the partitions. Are the partitions shown to the left side of this ribbon near the outer or inner edge of the disk physically?  Are there software benchmarks like testing some disk intensive stuff for the first time on identical vanilla installs of the same OS but on different partitions, inner and outer?  EDIT: Links   ctrl + f for "slower" on this page   Says outer side is faster   Says inner side is faster   Says outer side is faster(not about dual-booting) How to analyse 'Element not Found' exceptions when working with Selenium Destroy chunked block like Minecraft I am going to start a phd at the US with an F1 visa. University told me that I could enter the US only 30 days before the date on I-20. Since English is not my first language (and this would be a big change in my life) I would like to go there by June.  The thing is that I have an European passport with a valid ESTA. My plan would be to arrive with this passport, stay 4-6 weeks , go to Canada for a short vacation (maybe flight maybe by land) and come back to the USA with F1 visa.  I have two questions about this:  1) is this possible?   2) If yes, how could I justify knowing I will lose my come-back flight during my first entry? (I would purchase round trip because one-way are too expensive, probably with less than 90 days difference) Can a PC with the Alert feat alert his friends? I've been reading about a lot of different types of philosophies, religions, ways of thinking etc. I was wondering what are the most recently created philosophical ways of looking at the universe? Where can one find out about new cutting edge ideas?  Example: Before we had Marxism, Communism, Zen, Christianity etc. Now X,Y, and Z have been created building on and evolving the ideas of A,B,C.   Everything I read about are ideas that were created a long time ago. What is new and updated? When I entered the value $$\frac{1}{i}$$ in my calculator, I received the answer as $-i$ whereas I was expecting the answer as $i^{-1}$. Even google calculator shows the same answer (Click  to check it out).  Is there a fault in my calculator or $\frac{1}{i}$ really equals $-i$? If it does then how? In Dummit and Foote, Exercise 15.18 (p. 727 3rd edition) one is asked to prove that for a commutative ring with unity $R$, and $f$ a non-nilpotent element of $R$, that the localization $R_f$ is isomorphic to $R[x]/(xf - 1)$.  I have done this, using the strategy outlined in the problem, using the universal property of $R_f$ proved in Theorem 36. The problem I have is this:  If $R_f \cong R[x]/(xf - 1)$ and $\phi:R[x] \to R_f$ is a surjective homomorphism, it stands to reason that $\text{ker}(\phi)$ should be $(xf - 1)$. I cannot show this directly. The surjective homomorphism I have in mind is, for:  $p(x) = a_0 + a_1x + \cdots + a_mx^m$  $\phi(p) = \dfrac{a_0}{1} + \dfrac{a_1}{f} + \cdots + \dfrac{a_m}{f^m}$  It is clear to me that $\phi$ annihilates $(xf - 1)$, so that ideal is contained in the kernel. What I cannot show is the other containment, or equivalently:  If $\phi(g) = 0_{R_f}$ then $g(x) \in (xf - 1)$. The trouble I am running into is that $R$ might be a "bad" ring, containing a lot of zero-divisors, $f$ might even be a zero-divisor (being non-nilpotent is a considerably weaker property), so the usual polynomial tricks of the division algorithm or using the irreducibility of $xf - 1$ aren't much use, here.  I feel I am missing something obvious....what is it? From  by Richard Brualdi  We have a chess master. He has 11 weeks to prepare for a competition so he decides that he will practice everyday by playing at least 1 game a day. To make sure that he's able to take a couple of breaks, he also decides that he wont play more than 12 games per week.  My question is, how do you prove/dis-prove that there will be a succession of (consecutive) days in which he will play k games, $k \geq  22$?  Specifically, I don't quite understand the use of the pigeonhole principle here.  Thanks in advance! :D  EDIT  I'll try to clarify what I'm asking:  The goal is to prove that for every possible practice schedule that the chess master makes, there will always be a consecutive sequence of days such that he plays exactly k games.  So for example, if k = 22, how do you prove that no matter what his schedule is like, he will always play exactly k games in r days, $1 \leq r\leq  77$.  My main question is: what is the general method for proving different values of k? Are there values of k (from 1 to 132 inclusive) that are impossible to obtain?  Note that he does not necessarily have to play 132 games within 77 days! Also, keep in mind the bounds of k. How to show that $\lim_{n \to +\infty} n^{\frac{1}{n}} = 1$? What is the likelihood of ever discovering the graviton? How would one look for and confirm existence of a graviton?  Someone was speaking to me about perhaps one day discovering the graviton, but to me it seems unlikely, although I'm young and essentially quite naive, so am coming to you physicists to ask    What actually is the likelihood of finding it?  How would we find it?