I believe that you don&#39;t have to do anything.  Your helper methods should just not start with `test_`.

The only methods that unittest will execute [1] are `setUp`, anything that starts with `test`, and `tearDown` [2], in that order. You can make helper methods and call them anything except for those three things, and they will not be executed by unittest.

You can think of `setUp` as `__init__`: if you&#39;re generating mock objects that are used by multiple tests, create them in `setUp`.

&lt;!--language: python --&gt;

    def setUp(self):
        self.mock_obj = MockObj()

[1]: This is not entirely true, but these are the main 3 groups of methods that you can concentrate on when writing tests.

[2]: For legacy reasons, unittest will execute both `test_foo` and `testFoo`, but `test_foo` is the preferred style these days. `setUp` and `tearDown` should appear as such.

The test runner will only directly execute methods beginning with `test`, so just make sure your helper methods&#39; names don&#39;t begin with `test`.

My sites Aweber registration forms are getting a lot of spam. I was told to create the forms dynamically via javascript after page has rendered or via clicking button. How would I create and render a form via javascript?

How to Create a Form Dynamically Via Javascript

Quite simply, can one instance of `javax.crypto.Cipher` (e.g. `Cipher.getInstance(&quot;RSA&quot;)`) be used from multiple threads, or do I need to stick multiple of them in a `ThreadLocal` (in my case)?

Is Cipher thread-safe?

Ok, as Google search isn&#39;t helping me in a while (even when using the correct keywords).

I have a class extending from TestCase in which I want to have some auxiliary methods that are not going to be executed as part of the test, they&#39;ll be used to generate some mocked objects, etc, auxiliary things for almost any test.

I know I could use the @skip decorator so unittest doesn&#39;t run a particular test method, but I think that&#39;s an ugly hack to use for my purpose, any tips?

Thanks in advance, community :D

Non-test methods in a Python TestCase

Ok, as Google search isn't helping me in a while (even when using the correct keywords).
I have a class extending from TestCase in which I want to have some auxiliary methods that are not going to be executed as part of the test, they'll be used to generate some mocked objects, etc, auxiliary things for almost any test.
I know I could use the @skip decorator so unittest doesn't run a particular test method, but I think that's an ugly hack to use for my purpose, any tips?
Thanks in advance, community :D

I have the following plot:
    
    import matplotlib.pyplot as plt

    fig2 = plt.figure()
    ax3 = fig2.add_subplot(2,1,1)
    ax4 = fig2.add_subplot(2,1,2)
    ax4.loglog(x1, y1)
    ax3.loglog(x2, y2)
    ax3.set_ylabel(&#39;hello&#39;)


I want to be able to create axes labels and titles not just for each of the two subplots, but also common labels that span both subplots.  For example, since both plots have identical axes, I only need one set of x and y- axes labels.  I do want different titles for each subplot though.

I tried a few things but none of them worked right

pyplot common axes labels for subplots

I have taken [Problem #12][1] from [Project Euler][2] as a programming exercise and to compare my (surely not optimal) implementations in C, Python, Erlang and Haskell. In order to get some higher execution times, I search for the first triangle number with more than 1000 divisors instead of 500 as stated in the original problem.

The result is the following:

**C:**

&lt;!-- language: none --&gt;

    lorenzo@enzo:~/erlang$ gcc -lm -o euler12.bin euler12.c
    lorenzo@enzo:~/erlang$ time ./euler12.bin
    842161320
    
    real	0m11.074s
    user	0m11.070s
    sys	0m0.000s

**Python:**

&lt;!-- language: none --&gt;

    lorenzo@enzo:~/erlang$ time ./euler12.py 
    842161320
    
    real	1m16.632s
    user	1m16.370s
    sys	0m0.250s

**Python with PyPy:**

&lt;!-- language: none --&gt;

    lorenzo@enzo:~/Downloads/pypy-c-jit-43780-b590cf6de419-linux64/bin$ time ./pypy /home/lorenzo/erlang/euler12.py 
    842161320
    
    real	0m13.082s
    user	0m13.050s
    sys	0m0.020s

**Erlang:**

&lt;!-- language: none --&gt;

    lorenzo@enzo:~/erlang$ erlc euler12.erl 
    lorenzo@enzo:~/erlang$ time erl -s euler12 solve
    Erlang R13B03 (erts-5.7.4) [source] [64-bit] [smp:4:4] [rq:4] [async-threads:0] [hipe] [kernel-poll:false]
    
    Eshell V5.7.4  (abort with ^G)
    1&gt; 842161320
    
    real	0m48.259s
    user	0m48.070s
    sys	0m0.020s

**Haskell:**

&lt;!-- language: none --&gt;

    lorenzo@enzo:~/erlang$ ghc euler12.hs -o euler12.hsx
    [1 of 1] Compiling Main             ( euler12.hs, euler12.o )
    Linking euler12.hsx ...
    lorenzo@enzo:~/erlang$ time ./euler12.hsx 
    842161320
    
    real	2m37.326s
    user	2m37.240s
    sys	0m0.080s

**Summary:**

 - C: 100%
 - Python: 692% (118% with PyPy)
 - Erlang: 436% (135% thanks to RichardC)
 - Haskell: 1421%

I suppose that C has a big advantage as it uses long for the calculations and not arbitrary length integers as the other three. Also it doesn&#39;t need to load a runtime first (Do the others?).

**Question 1:**
Do Erlang, Python and Haskell lose speed due to using arbitrary length integers or don&#39;t they as long as the values are less than `MAXINT`?

**Question 2:**
Why is Haskell so slow? Is there a compiler flag that turns off the brakes or is it my implementation? (The latter is quite probable as Haskell is a book with seven seals to me.)

**Question 3:**
Can you offer me some hints how to optimize these implementations without changing the way I determine the factors? Optimization in any way: nicer, faster, more &quot;native&quot; to the language.

### **EDIT:**

**Question 4:**
Do my functional implementations permit LCO (last call optimization, a.k.a tail recursion elimination) and hence avoid adding unnecessary frames onto the call stack?

I really tried to implement the same algorithm as similar as possible in the four languages, although I have to admit that my Haskell and Erlang knowledge is very limited.

----------

Source codes used:

&lt;!-- language: c --&gt;

    #include &lt;stdio.h&gt;
    #include &lt;math.h&gt;
    
    int factorCount (long n)
    {
    	double square = sqrt (n);
    	int isquare = (int) square;
    	int count = isquare == square ? -1 : 0;
    	long candidate;
    	for (candidate = 1; candidate &lt;= isquare; candidate ++)
    		if (0 == n % candidate) count += 2;
    	return count;
    }
    
    int main ()
    {
    	long triangle = 1;
    	int index = 1;
    	while (factorCount (triangle) &lt; 1001)
    	{
    		index ++;
    		triangle += index;
    	}
    	printf (&quot;%ld\n&quot;, triangle);
    }

----------

&lt;!-- language: python --&gt;

    #! /usr/bin/env python3.2
    
    import math
    
    def factorCount (n):
    	square = math.sqrt (n)
    	isquare = int (square)
    	count = -1 if isquare == square else 0
    	for candidate in range (1, isquare + 1):
    		if not n % candidate: count += 2
    	return count
    
    triangle = 1
    index = 1
    while factorCount (triangle) &lt; 1001:
    	index += 1
    	triangle += index
    
    print (triangle)

----------

&lt;!-- language: erlang --&gt;

    -module (euler12).
    -compile (export_all).
    
    factorCount (Number) -&gt; factorCount (Number, math:sqrt (Number), 1, 0).
    
    factorCount (_, Sqrt, Candidate, Count) when Candidate &gt; Sqrt -&gt; Count;
    
    factorCount (_, Sqrt, Candidate, Count) when Candidate == Sqrt -&gt; Count + 1;
    
    factorCount (Number, Sqrt, Candidate, Count) -&gt;
    	case Number rem Candidate of
    		0 -&gt; factorCount (Number, Sqrt, Candidate + 1, Count + 2);
    		_ -&gt; factorCount (Number, Sqrt, Candidate + 1, Count)
    	end.
    
    nextTriangle (Index, Triangle) -&gt;
    	Count = factorCount (Triangle),
    	if
    		Count &gt; 1000 -&gt; Triangle;
    		true -&gt; nextTriangle (Index + 1, Triangle + Index + 1)	
    	end.
    
    solve () -&gt;
    	io:format (&quot;~p~n&quot;, [nextTriangle (1, 1) ] ),
    	halt (0).

----------

&lt;!-- language: haskell --&gt;

    factorCount number = factorCount&#39; number isquare 1 0 - (fromEnum $ square == fromIntegral isquare)
    	where square = sqrt $ fromIntegral number
    	      isquare = floor square
    
    factorCount&#39; number sqrt candidate count
    	| fromIntegral candidate &gt; sqrt = count
    	| number `mod` candidate == 0 = factorCount&#39; number sqrt (candidate + 1) (count + 2)
    	| otherwise = factorCount&#39; number sqrt (candidate + 1) count
    
    nextTriangle index triangle
    	| factorCount triangle &gt; 1000 = triangle
    	| otherwise = nextTriangle (index + 1) (triangle + index + 1)
    
    main = print $ nextTriangle 1 1


  [1]: http://projecteuler.net/index.php?section=problems&amp;id=12
  [2]: http://projecteuler.net/

Speed comparison with Project Euler: C vs Python vs Erlang vs Haskell

When discussing metaclasses, [the docs][1] state:

&gt; You can of course also override other class methods (or add new
&gt; methods); for example defining a custom `__call__()` method in the
&gt; metaclass allows custom behavior when the class is called, e.g. not
&gt; always creating a new instance.

*[Editor&#39;s note: This was removed from the docs in 3.3. It&#39;s here in 3.2: [Customizing class creation](https://docs.python.org/3.2/reference/datamodel.html#customizing-class-creation)]*

My questions is: suppose I want to have custom behavior when the class is called, for example caching instead of creating fresh objects. I can do this by overriding the `__new__` method of the class. When would I want to define a metaclass with `__call__` instead? What does this approach give that isn&#39;t achievable with `__new__`?

  [1]: http://docs.python.org/reference/datamodel.html

Using the __call__ method of a metaclass instead of __new__?

Is there a less verbose alternative to this:

    for x in xrange(array.shape[0]):
        for y in xrange(array.shape[1]):
            do_stuff(x, y)

I came up with this:

    for x, y in itertools.product(map(xrange, array.shape)):
        do_stuff(x, y)

Which saves one indentation, but is still pretty ugly.

I&#39;m hoping for something that looks like this pseudocode:

    for x, y in array.indices:
        do_stuff(x, y)

Does anything like that exist?

Iterating over a numpy array

Consider the following expressions. Note that some expressions are repeated to present the &quot;context&quot;.

(this is a long list)

    a, b = 1, 2                          # simple sequence assignment
    a, b = [&#39;green&#39;, &#39;blue&#39;]             # list asqignment
    a, b = &#39;XY&#39;                          # string assignment
    a, b = range(1,5,2)                  # any iterable will do
    
    
                                         # nested sequence assignment
    
    (a,b), c = &quot;XY&quot;, &quot;Z&quot;                 # a = &#39;X&#39;, b = &#39;Y&#39;, c = &#39;Z&#39; 
    
    (a,b), c = &quot;XYZ&quot;                     # ERROR -- too many values to unpack
    (a,b), c = &quot;XY&quot;                      # ERROR -- need more than 1 value to unpack
    
    (a,b), c, = [1,2],&#39;this&#39;             # a = &#39;1&#39;, b = &#39;2&#39;, c = &#39;this&#39;
    (a,b), (c,) = [1,2],&#39;this&#39;           # ERROR -- too many values to unpack
    
    
                                         # extended sequence unpacking
    
    a, *b = 1,2,3,4,5                    # a = 1, b = [2,3,4,5]
    *a, b = 1,2,3,4,5                    # a = [1,2,3,4], b = 5
    a, *b, c = 1,2,3,4,5                 # a = 1, b = [2,3,4], c = 5
    
    a, *b = &#39;X&#39;                          # a = &#39;X&#39;, b = []
    *a, b = &#39;X&#39;                          # a = [], b = &#39;X&#39;
    a, *b, c = &quot;XY&quot;                      # a = &#39;X&#39;, b = [], c = &#39;Y&#39;
    a, *b, c = &quot;X...Y&quot;                   # a = &#39;X&#39;, b = [&#39;.&#39;,&#39;.&#39;,&#39;.&#39;], c = &#39;Y&#39;
    
    a, b, *c = 1,2,3                     # a = 1, b = 2, c = [3]
    a, b, c, *d = 1,2,3                  # a = 1, b = 2, c = 3, d = []
    
    a, *b, c, *d = 1,2,3,4,5             # ERROR -- two starred expressions in assignment
    
    (a,b), c = [1,2],&#39;this&#39;              # a = &#39;1&#39;, b = &#39;2&#39;, c = &#39;this&#39;
    (a,b), *c = [1,2],&#39;this&#39;             # a = &#39;1&#39;, b = &#39;2&#39;, c = [&#39;this&#39;]
    
    (a,b), c, *d = [1,2],&#39;this&#39;          # a = &#39;1&#39;, b = &#39;2&#39;, c = &#39;this&#39;, d = []
    (a,b), *c, d = [1,2],&#39;this&#39;          # a = &#39;1&#39;, b = &#39;2&#39;, c = [], d = &#39;this&#39;
    
    (a,b), (c, *d) = [1,2],&#39;this&#39;        # a = &#39;1&#39;, b = &#39;2&#39;, c = &#39;t&#39;, d = [&#39;h&#39;, &#39;i&#39;, &#39;s&#39;]
    
    *a = 1                               # ERROR -- target must be in a list or tuple
    *a = (1,2)                           # ERROR -- target must be in a list or tuple
    *a, = (1,2)                          # a = [1,2]
    *a, = 1                              # ERROR -- &#39;int&#39; object is not iterable
    *a, = [1]                            # a = [1]
    *a = [1]                             # ERROR -- target must be in a list or tuple
    *a, = (1,)                           # a = [1]
    *a, = (1)                            # ERROR -- &#39;int&#39; object is not iterable
    
    *a, b = [1]                          # a = [], b = 1
    *a, b = (1,)                         # a = [], b = 1
    
    (a,b),c = 1,2,3                      # ERROR -- too many values to unpack
    (a,b), *c = 1,2,3                    # ERROR - &#39;int&#39; object is not iterable
    (a,b), *c = &#39;XY&#39;, 2, 3               # a = &#39;X&#39;, b = &#39;Y&#39;, c = [2,3]
    
    
                                         # extended sequence unpacking -- NESTED
    
    (a,b),c = 1,2,3                      # ERROR -- too many values to unpack
    *(a,b), c = 1,2,3                    # a = 1, b = 2, c = 3
    
    *(a,b) = 1,2                         # ERROR -- target must be in a list or tuple
    *(a,b), = 1,2                        # a = 1, b = 2
    
    *(a,b) = &#39;XY&#39;                        # ERROR -- target must be in a list or tuple
    *(a,b), = &#39;XY&#39;                       # a = &#39;X&#39;, b = &#39;Y&#39;
    
    *(a, b) = &#39;this&#39;                     # ERROR -- target must be in a list or tuple
    *(a, b), = &#39;this&#39;                    # ERROR -- too many values to unpack
    *(a, *b), = &#39;this&#39;                   # a = &#39;t&#39;, b = [&#39;h&#39;, &#39;i&#39;, &#39;s&#39;]
    
    *(a, *b), c = &#39;this&#39;                 # a = &#39;t&#39;, b = [&#39;h&#39;, &#39;i&#39;], c = &#39;s&#39;
    
    *(a,*b), = 1,2,3,3,4,5,6,7           # a = 1, b = [2, 3, 3, 4, 5, 6, 7]
    
    *(a,*b), *c = 1,2,3,3,4,5,6,7        # ERROR -- two starred expressions in assignment
    *(a,*b), (*c,) = 1,2,3,3,4,5,6,7     # ERROR -- &#39;int&#39; object is not iterable
    *(a,*b), c = 1,2,3,3,4,5,6,7         # a = 1, b = [2, 3, 3, 4, 5, 6], c = 7
    *(a,*b), (*c,) = 1,2,3,4,5,&#39;XY&#39;      # a = 1, b = [2, 3, 4, 5], c = [&#39;X&#39;, &#39;Y&#39;]
    
    *(a,*b), c, d = 1,2,3,3,4,5,6,7      # a = 1, b = [2, 3, 3, 4, 5], c = 6, d = 7
    *(a,*b), (c, d) = 1,2,3,3,4,5,6,7    # ERROR -- &#39;int&#39; object is not iterable
    *(a,*b), (*c, d) = 1,2,3,3,4,5,6,7   # ERROR -- &#39;int&#39; object is not iterable
    *(a,*b), *(c, d) = 1,2,3,3,4,5,6,7   # ERROR -- two starred expressions in assignment
    
    
    *(a,b), c = &#39;XY&#39;, 3                  # ERROR -- need more than 1 value to unpack
    *(*a,b), c = &#39;XY&#39;, 3                 # a = [], b = &#39;XY&#39;, c = 3
    (a,b), c = &#39;XY&#39;, 3                   # a = &#39;X&#39;, b = &#39;Y&#39;, c = 3
    
    *(a,b), c = &#39;XY&#39;, 3, 4               # a = &#39;XY&#39;, b = 3, c = 4
    *(*a,b), c = &#39;XY&#39;, 3, 4              # a = [&#39;XY&#39;], b = 3, c = 4
    (a,b), c = &#39;XY&#39;, 3, 4                # ERROR -- too many values to unpack

How to correctly deduce the result of such expressions by hand?

Unpacking, extended unpacking and nested extended unpacking

I am introducing tests in a project that makes heavy use of IO operations (the file system, in this case). The system constantly opens/closes files, checks if files exist, deletes them, etcetera.

It soon became obvious that regular mocking wouldn&#39;t be of much use, as that would make my tests hard to set up and reason about. On the other hand, having a fake file system would be awesome, and I think, pretty easy to set up.

It seems the ruby guys did it again, and there&#39;s exactly what I am asking for in ruby: http://ozmm.org/posts/fakefs.html.

Is there anything remotely similar for Java?

Are there any Fake File System frameworks for Java?

Having this simple code I get &quot;Cannot drop database &quot;test_db&quot; because it is currently in use&quot; (CleanUp method) as I run it. 

    [TestFixture]
    public class ClientRepositoryTest
    {
		private const string CONNECTION_STRING = &quot;Data Source=.;Initial Catalog=test_db;Trusted_Connection=True&quot;;
		private DataContext _dataCntx;

		[SetUp]
		public void Init()
		{
			Database.SetInitializer(new DropCreateDatabaseAlways&lt;DataContext&gt;());
			_dataCntx = new DataContext(CONNECTION_STRING);
			_dataCntx.Database.Initialize(true);
		}

		[TearDown]
		public void CleanUp()
		{
			_dataCntx.Dispose();
			Database.Delete(CONNECTION_STRING);
		}
	}


DataContext has one property like this 

     public DbSet&lt;Client&gt; Clients { get; set; }


How can force my code to remove database?
Thanks

&quot;Cannot drop database because it is currently in use&quot;. How to fix?

I have a model with managed = False. 

    class SampleModel(models.Model):
        apple = models.CharField(max_length=30)
        orange = models.CharField(max_length=30)
    
        class Meta:
            managed = False

I have a unit test which creates a SampleModel, however when I run the test I get:

    DatabaseError: no such table: SAMPLE_SAMPLE_MODEL

The django docs - https://docs.djangoproject.com/en/dev/ref/models/options/#managed documents the following:

&gt; For tests involving models with managed=False, it&#39;s up to you to
&gt; ensure the correct tables are created as part of the test setup.

How can I actually &quot;create&quot; the tables during the test setup? Or alternatively, how can I make it so that when I am running tests, this model has &quot;managed = True&quot; for the duration of the test?

In the real application, this model is actually backed by a view in the database. However for the during of the test, I would like to treat this as a table and be able to insert test data in there.

How to create table during Django tests with managed = False

What&#39;s the most succinct way to use Moq to mock a method that will throw an exception the first time it is called, then succeed the second time it is called?

Moq: Setup a mocked method to fail on the first call, succeed on the second

What are the main differences between these two testing frameworks? 

I am a totally new to Test Driven Development and starting from the very beginning.

Content Type	Original Author	Original Content on Stackoverflow
Question	victorcampos	View Question on Stackoverflow
Solution 1 - Python	J Lundberg	View Answer on Stackoverflow
Solution 2 - Python	Brian Riley	View Answer on Stackoverflow
Solution 3 - Python	Mark Cidade	View Answer on Stackoverflow

Non-test methods in a Python TestCase

Python Problem Overview

Python Solutions

Solution 1 - Python

Solution 2 - Python

Solution 3 - Python

Is Cipher thread-safe?

How to Create a Form Dynamically Via Javascript

Attributions