I would like to run every method annotated with @Test, across multiple classes, at the same time.  For some cases, I would like to limit this, and say that only 100 total can run at any one time.  I would like methods with @BeforeClass annotations to be run once before any Test in a class runs, and I would like @AfterClass annotations to be run once after all Tests in a class run.  I would like System.out, System.err, and Exceptions to be appropriately buffered/captured rather than written out, so that they don't interleave, and I can read the final output and understand what happened.  Does this exist?  I have a large number of independent test cases, and my application is (I believe) threadsafe.  None of these tests have dependencies out of the JVM, and I want to finish them as quickly as possible, given my hardware.  If this doesn't exist, is there a concrete reason why not?  How much time is lost by junit users worldwide because this isn't easy?  Can I build it into Junit?  In my mind, this should be as simple as a single flag, and it "just works".
I'm using JUnit 4.4 and Maven and I have a large number of long-running integration tests.  When it comes to parallelizing test suites there are a few solutions that allow me to run each test method in a single test-class in parallel. But all of these require that I change the tests in one way or another.  I really think it would be a much cleaner solution to run X different test classes in X threads in parallel. I have hundreds of tests so I don't really care about threading individual test-classes.  Is there any way to do this?
What book has criminals wear a ring? I remember reading one of my father's books when I was younger.  It was about a guy who ended up getting in trouble with the law and was required to wear a ring that could not be removed and would shock the wearer any time they committed a crime (No matter how minor.)    The book was probably published in the early to mid 80s.  I thought the name of the book was 'The Ring', but I am unable to locate anything.  The cover had a car with a single wheel driving on a metal I-beam. Where did object dimensions go in 2.8? Anyone seen this panel? Essential for precise modeling. How can brackets be escaped in using string.Format? For example: String val = &quot;1,2,3&quot; String.Format(&quot; foo {{0}}&quot;, val);  This example doesn't throw an exception, but it outputs the string foo {0}. Is there a way to escape the brackets? Is there any general and systematic way of reducing the higher order linear ODE to a system of first order ODE?  For example, assume we have $a_3x^{(3)}+a_2x^{(2)}+a_1x^{(1)}+a_0x=0$, then how do we convert this into matrix form(a system of first order ODE). And after we solve the system of equation, how to combine them into our final solution $x(t)$?  Thanks for helping me out! Proving prime $p$ divides $\binom{p}{k}$ for $k\in\{1,\ldots,p-1\}$ Prove if $p$ is a prime then $p \mid \binom pk$ for $k\in\{1,\ldots,p-1\}$  I don't really know where to begin with this one.   I can see that I have to use the fact that $p$ is prime somewhere - the same is not true for composite numbers, for example $4\nmid 6=\binom42$.  I have checked that this is true for the first few primes:    $3$ divides $\binom 31=\binom32=3$ $5$ divides both $\binom 51=\binom 54=5$ and $\binom 52=\binom 53=10$ $7$ divides $\binom71=\binom76=7$, $\binom72=\binom75=21$ and $\binom73=\binom74=35$. Reviewing suggested edit of own post after completing 20 reviews I've completed 20 suggested edits reviews today. Then, I came across a  and I approved it.   Then, I had a doubt that whether the review count has incremented or not, oh! it's not incrementing. System works fine.  But, take a look at review page,     The edit was already reviewed by one reviewer and then I reviewed it. As I'm the Owner of the post it's enough to approve the edit. But, the review history doesn't show the detail that I had approved it. It's misleading that only one vote of a reviewer who is neither the community user nor the OP nor the moderator, is enough.  So, what should we do in this type of situation?  Is it correct to make OP to review the suggested edit after completing daily limit?  Should we need to display/hide the OP has approved the edit in the review history? I'm examining a part of my dataset containing 46840 double values ranging from 1 to 1690 grouped in two groups. In order to analyze the differences between these groups I started by examining the distribution of the values in order to pick the right test.  Following a guide on testing for normality, I did a qqplot, histogram &amp; boxplot.       This doesn't seem to be a normal distribution. Since the guide states somewhat correctly that a purely graphical examination isn't sufficient I also want to test the distribution for normality.   Considering the size of the dataset and the limitation of the shapiro-wilks test in R , how should the given distribution be tested for normality and considering the size of the dataset, is this even reliable? ()  Edit:  The limitation of the Shapiro-Wilk test I'm referring to is that the dataset to be tested is limited to 5000 points.  To cite  concerning this topic:     An additional issue with the Shapiro-Wilk's test is that when you feed   it more data, the chances of the null hypothesis being rejected   becomes larger. So what happens is that for large amounts of data even   very small deviations from normality can be detected, leading to   rejection of the null hypothesis event hough for practical purposes   the data is more than normal enough.      [...] Luckily shapiro.test protects the user from the above described   effect by limiting the data size to 5000.   As to why I am testing for normal distribution in the first place:  Some hypothesis tests assume normal distribution of the data. I want to know whether or not I can use these tests. Carry over long sequence of missing values with Postgres I have a table like this:  create table foo (foo_label text, foo_price int, foo_date date);  insert into foo (           values           ('aaa', 100,  '2017-01-01'),           ('aaa', NULL, '2017-02-01'),           ('aaa', NULL, '2017-03-01'),           ('aaa', NULL, '2017-04-01'),           ('aaa', 140,  '2017-05-01'),           ('aaa', NULL, '2017-06-01'),           ('aaa', 180,  '2017-07-01')         );   As you can see a few values on the foo_price column are missing.  What I need is that missing values get filled up with the "previous" available value in this way:   foo_label | fixed_foo_price | foo_date -----------+-----------------+------------  aaa       | 100             | 2017-01-01  aaa       | 100             | 2017-02-01  aaa       | 100             | 2017-03-01  aaa       | 100             | 2017-04-01  aaa       | 140             | 2017-05-01  aaa       | 140             | 2017-06-01  aaa       | 180             | 2017-07-01   My attempt:  select      foo_label,      (case when foo_price is null then previous_foo_price else foo_price end) as fixed_foo_price,     foo_date from (   select        foo_label,        lag(foo_price) OVER (PARTITION BY foo_label order by foo_date::date) as previous_foo_price,        foo_price,       foo_date       from foo ) T;   As you can see from here:    It doesn't fill completely the '100' series.  Any idea how can I get the wanted result? Allow an edit to notify downvoters: "I think I've fixed the issue now - please check" Graphics horribly corrupted on Ubuntu 16.04 in VirtualBox, showing random strips of pixelated colors Inside a VirtualBox VM, I have installed myself an Ubuntu 16.04.1 LTS Server installation. However, when I installed the ubuntu-desktop package and rebooted, this happened:    Exact command I used: sudo apt-get update; sudo apt-get install ubuntu-desktop ..and then a reboot command.  This just seems like a corrupted top-left portion of the screen, as my cursor can appear in view (but corrupted):    This is a purely graphical issue because I can use the keyboard to successfully progress to a desktop:    Note: On startup it shows correct graphics for a split-second then reverts to glitch.    Any help on this? Two-Weapon Fighting & Bonus Actions Is it possible to have the dock in different positions in different desktop? Is it possible to have the dock in different positions in different desktops? In particular I'd like to change the settings between a normal desktop and a desktop where there's an app at full screen. In this way I'd keep the dock in lower side of the desktop when there's an app at full screen and vertically on the left side during normal use.  I have this problem that, sicne I usually have the dock vertically on the left, it pops out everytime i go to the far left in an app I'm using with full screen, and using this app I have to move the mouse to the left quite often. Text spirals with TikZ I just ran across this, and I'm curious about whether it can be replicated in TeX...    Ideally one would have the spiral getting tighter and tighter as one got to the centre, as in    I know TikZ has the ability to fit text along a path, but I'm not sure how one might make text get smaller and smaller.  The closest I can find is , but that uses manually inserted font commands.  Edit: I got what I wanted using mwibrow's answer: I'm a begginer in blender, so please forgive me if the question looks silly to you!  Almost all the objects in my scene disappeared (except 2) as if I deleted them by mistake. The thing is all the objects are still listed in the right side graph. The all have the eye button activated, but yet nothing is visible anymore! As I don't have a backup file, I simply can't find any tricks to fix this...  Thank you for you help! How can I recover files from partitioned disk? Is there a word that means "a span of six months"? That is, I want to connote a stretch of time that lasts half a year, not an event that happens every six months. How to create and animate the water reflection (Caustics) on an object? What is the best method to create this kind of reflection and how to animate it? Replace preg_replace() e modifier with preg_replace_callback Setting the correct encoding when piping stdout in Python When piping the output of a Python program, the Python interpreter gets confused about encoding and sets it to None. This means a program like this:  # -*- coding: utf-8 -*- print u"åäö"   will work fine when run normally, but fail with:     UnicodeEncodeError: 'ascii' codec can't encode character u'\xa0' in position 0: ordinal not in range(128)   when used in a pipe sequence.  What is the best way to make this work when piping? Can I just tell it to use whatever encoding the shell/filesystem/whatever is using?   The suggestions I have seen thus far is to modify your site.py directly, or hardcoding the defaultencoding using this hack:  # -*- coding: utf-8 -*- import sys reload(sys) sys.setdefaultencoding('utf-8') print u"åäö"   Is there a better way to make piping work? Summarize the mathematical problem at the heart of breaking a Curve25519 public key It's pretty easy to generate a Curve25519 private key: generate 32 random bytes of data and then do:  e[0] &amp;= 248 e[31] &amp;= 127 e[31] |= 64   You can then generate a public key by doing  on the private key. For example, here's a random keypair I just generated:  public: e40ed268dff20db8497d0691421d00b086aad1efedcd5bd223d9eb6c0b85665f secret: e3c0e8b20ba7894882ddb37522dbe90867befcf9f31a5ce29c0d7997e0bd856d   The whole safety of public key encryption is that it is hard to take a public key and reverse the operation. Elliptic curve cryptography, as I understand it, relies on the fact that a  is hard to find. In particular, for a given large b and g, it is hard to find an integer k such that  $b^k = g$  How does that equation relate to Curve25519? Specifically, if I had a public key like the one above, how would I express, in math terms, the problem I need to solve to find the private key? How does it relate to the equation I see from time to time - $y^2 = x^3+486662x^2+x$, and the number $2^{255} - 19$?  I am guessing it is not as simple as "the private key is k and the public key is b and/or g" in the equation above. I'm also a little confused because the keys would appear to have roughly the same number of digits, which would seem to imply that there aren't many feasible values for k?