This enables testing with hash randomization. Hash randomization is a new
feature of Python where hash values are randomized, so as to prevent against a
hash collision security issue. It causes many test failures (see [issue
3272](http://code.google.com/p/sympy/issues/detail?id=3272)) because
Updates:
Labels: NeedsReview
Comment #6 on issue 1625 by krastano...@gmail.com: sympify of logical
operations gets confused with ==
http://code.google.com/p/sympy/issues/detail?id=1625
check https://github.com/sympy/sympy/pull/1378
--
You received this message because you are subscri
Now this works:
```
In [1]: sympify('ahttps://github.com/Krastanov/sympy sympify_relational
Or you can view, comment on it, or merge it online at:
https://github.com/sympy/sympy/pull/1378
-- Commit Summary --
* Preprocess strings containing relational operators in sympify
-- File Changes --
Implemented the product replacement algorithm for producing random group
elements, Monte Carlo testing for the alternating/symmetric group, Atkinson's
algorithm for finding minimal blocks, and testing a permutation group for
primitivity.
Added some more functionality to the function orbit, and
```
In [1]: p = Piecewise( (0, x<0), (x, x<=1), (1, True)); p
Out[1]:
/0 for x < 0
|
http://code.google.com/p/sympy/issues/detail?id=2937
You can merge this Pull Request by running:
git pull https://github.com/jrioux/sympy piecewise
Or you can view, comment on it, or merge it o
These generators accept None, int, or a sequence. The returned
generator is then called like random's version, e.g. _randint()(1,3)
and mostly the result is the same unless a sequence is sent. In that
case the elements of the sequence that satisfy the arguments given
will be returned, e.g. ri = _ra
