java.lang.ClassCastException: java.util.HashMap cannot be cast to java.util.TreeMap
putExtra treeMap returns HashMap cannot be cast to TreeMap android
How could towns restrain a magic user? The modern concept of crime and punishment is very reliant on the ability to disarm and restrain and control an individual (think handcuffs, the dividers in police cars, and jails).  How can that be replicated in a world where even a wizard's apprentice has a much power as an armed man with a handgun?  I've seen stories where magical restraints are present, but you can't write that into every thorp and hamlet, even in Eberron.    How can you restrain a magic user in a fantasy setting?   Either answers that conform to modern concepts of crime and punishment or answers about restraining a magic-user in a psuedo-medieval setting are acceptable. Find the integer which is closest to the value of   $\frac{1}{\sqrt[6]{5^6+1}- \sqrt[6]{5^6-1}}$  I have tried putting them between n and n+1 and tried manipulating  n but I cant seem to find a strategy. Lightning Web Component embedded in Visualforce Page via Aura Component and App not displaying I am writing a lightning web component that is going to be used in Salesforce Classic, Lightning Experience and an Employee Community. It does not HAVE to be a lightning web component - I could use a traditional Aura Lightning Component if I must.   However, what I am finding is that the visualforce page does not work, even when the lwc component is embedded in a aura component that is then used with Lightning Components for Visualforce. I can see from the documentation  that using a lwc directly from within visualforce is not supported, but I was under the impression that it may work if wrapped in an aura component.   My question then is this:  Has anyone had success having a lwc wrapped in an aura component display successfully within Visualforce? Or is this completely unsupported behaviour? I have some thoughts on this. First, I want to say I am no expert on cryptography, I just know some stuff, and I took a cryptography class in University. I am very interested in this topic.  I understand that many security experts out there might get angry just by the discussion of these things, but I hope you can spare me :)  My Questions:  Would it be possible to break an RSA key, in for example 1 week of time, if the cracker have already spent X number of years building an index of primes by performing every permutation of existing prime keys up to 2^2048 ?  I understand this would take an immense amount of time to do, but it would only be done once.  Given the public key, you would be able to look up what the two primes are, and hence retrieve the private key instantly.  When I consider who might break such a code, I am primarily thinking about NSA and other Governments that might have spent years in research and have the resources and interest in doing so.  Breaking an 256 AES would then be easier, as AES keys are often generated using the RSA private key.  Would it be possible to build such an index ? How long would that take in permutations, and perhaps with the fastest computer in the world ?  I hope we can have a nice chat about this. We are just discussion theory here. I hope you can offer me some insight on this topic.  Thanks! Prove that a set of connectives is inadequate It is relatively easy to prove that a given set of connectives is adequate. It suffices to show that the standard connectives can be built from the given set. It is proven that the set $\{\lor, \land, \neg\}$ is adequate, and from that set it can be inferred (applying De Morgan laws and such) that $\{\lor, \neg\}$, $\{\land, \neg\}$ and $\{\to, \neg\}$ are also adequate.  Nevertheless, I'm stuck trying to understand how to prove that a given set of connectives is inadequate. I know I have to prove that a standard connective can't be build using only the connectives of the given set, but I can't figure out how to do it.  FYI, I'm trying to prove that $\{\lor, \land\}$ and $\{\leftrightarrow, \neg\}$ are inadequate sets of connectives.  Thanks in advance. What is a combo update and how is it different than the regular update? Cases environment compresses fractions? what should I do to stop the cases environment compressing the first line of the following? \begin{equation} \alpha_{mn} = \begin{cases} \frac{16\mu^2}{mn\pi^2\left[\pi^2(m^2/a^2 + n^2/b^2) - \mu^2\right]} &amp;\mbox{for } m \mbox{ and } n \mbox{ odd;}  \\ 0 &amp;\mbox{for } m \mbox{ or } n \mbox{ even;} \end{cases} \\[1ex] \end{equation}  I'm not sure to do tex on this site, but if anyone tries it they see the first case is compressed because it's a fraction. Computing the Galois group of polynomials $x^n-a \in \mathbb{Q}[x]$ Why was Padmé made to clean an astromech? Reading  (the Amidala stand-in) I remembered that I always wondered why she ordered the actual queen to scrub R2-D2. There were enough actual servants who could have done it, so why Padmé? If that wasn't enough, after giving the actual queen (Padmé) the order to go away, she tells Panaka to continue with the discussion. How does that make sense?  The significant piece of dialogue:     AMIDALA : Thank you, Artoo Detoo. You have proven to be very loyal...Padme!    ...    AMIDALA : (Cont'd) Clean this droid up the best you can. It deserves our gratitude...(to Panaka) Continue, Captain.   Note that this question is two-fold:   Why was Padmé chosen in the first place? Why would an important meeting with the ship's captain be continued without her? says the following:     Saving an OS can be achieved by running sudo grub-set-default if   DEFAULT=saved is set in /etc/default/grub. It may also be saved if   GRUB_SAVEDEFAULT=true is also set in /etc/default/grub. In this case,   the default OS remains until a new OS is manually selected    from the   GRUB 2 menu or the grub-set-default command is executed.   I put the lines DEFAULT=saved AND GRUB_SAVEDEFAULT=true in /etc/default/grub, and ran sudo grub-set-default.  Here is the output:  $ sudo grub-set-default entry not specified. Usage: grub-set-default [OPTION] entry Set the default boot entry for GRUB.    -h, --help              print this message and exit   -v, --version           print the version information and exit   --boot-directory=DIR    expect GRUB images under the directory DIR/grub                           instead of the /boot/grub directory  ENTRY is a number or a menu item title.  Report bugs to &lt;bug-grub@gnu.org&gt;.   Am I not following the documentation correctly?  What's the correct way to do this? Is it the airport security at the country you flying from? I highly doubt it because I have been to countries where it's so corrupted that you buy the airport officials for the price of a dinner.   Is it the aircrew' responsibility? Again I don't think they care much - unless there is severe punishments - in corrupted third world countries.   I have been personally in a situation when an officer at a certain airport insisted on examining my British passport before he allowed me to move to the gate because I refused to slip him a $100 note. I was travelling to the UK yet I have another passport which is valid and it is issued by the country I was flying from, which means he had no reason whatsoever - nor I think he cared - to examine my British passport to check if it's valid.  Edit to summarize it, I want to expose as little as possible of information about my dual nationality. For that I need to know whom I am obligated to show my passport(s) Labeling (one-way) streets in QGIS? Prove that in any GCD domain every irreducible element is prime C++: delete vs. free and performance At what time intervals does ntpd update the time? I'm running the latest ntpd.   When I start ntpd my system time synchronizes with ntp server's ntp. After synchronizing I changed my system time manually using date command date -s '1997-02-22 12:00:00'   My system time got changed as per the date command.   NTPD is still running, I want to know at what time interval my system time will sync with the internet via ntp. What is the difference between String and string in C#? Example (note the case):  string s = "Hello world!"; String s = "Hello world!";   What are the guidelines for the use of each? And what are the differences? How to use sed to replace only the first occurrence in a file? Performing test for homogeneity of variance without samples I'd like to perform a test for homogeneity of variance in r, but I don't have samples available to test.    I have the sample mean of each group, the sample deviation of each group, and the sample size of each group(100).  Brand    ybar_i  s_i    n_i --------------------------- LowTar   9.64    .291   100 A        10.22   .478   100 B        10.77   .372   100 C        11.57   .352   100 D        13.59   .469   100   I'm thinking I should use the Levene test from Lawstat package, but that requires samples to test.  Or I think I could use the Fmax test. but that also requires samples. I've got two arrays of the same size.  I'd like to merge the two so the values of one are the key indexes of the new array, and the values of the new array are the values of the other.  Right now I'm just looping through the arrays and creating the new array manually, but I have a feeling there is a much more elegant way to go about this.  I don't see any array functions for this purpose, but maybe I missed something?  Is there a simple way to this along these lines?  $mapped_array = mapkeys($array_with_keys, $array_with_values); I'm wondering how can I simulate a sample of n Weibull distribution lifetimes that include Type I right-censored observations. For instance lets have the n = 3, shape = 3, scale = 1 and the censoring rate = .15, and the censoring time = .88.  I know how to generate a Weibull sample but I do not know how to generate a censored data that have type I right-censored in R.  T = rweibull(3, shape=.5, scale=1)