Changes between Version 2 and Version 5 of Ticket #10879


Ignore:
Timestamp:
03/06/11 16:34:54 (11 years ago)
Author:
malb
Comment:

Thanks to the input of Nathann the number of failed doctests was greatly reduced.

linear_programming.rst

This seems to be just another just-as-good solution. Probably, the doctest should be changed to allow alternative solutions?

sage -t -long -force_lib "devel/sage/doc/en/thematic_tutorials/linear_programming.rst"
**********************************************************************
File "/home/malb/Sage/current/devel/sage/doc/en/thematic_tutorials/linear_programming.rst", line 366:
    sage: [e for e,b in matching.iteritems() if b == 1]
Expected:
    [(0, 1), (6, 9), (2, 7), (3, 4), (5, 8)]
Got:
    [(1, 6), (0, 4), (2, 3), (5, 8), (7, 9)]
**********************************************************************

digraph.py

Is this worrisome?

sage -t -long -force_lib "devel/sage/sage/graphs/digraph.py"
**********************************************************************
File "/home/malb/Sage/current/devel/sage/sage/graphs/digraph.py", line 1539:
    sage: x == y
Expected:
    True
Got:
    False
**********************************************************************

mip.pyx

These are purely cosmetic.

sage -t -long -force_lib "devel/sage/sage/numerical/mip.pyx"
**********************************************************************
File "/home/malb/Sage/current/devel/sage/sage/numerical/mip.pyx", line 648:
    sage: p.solve()
Expected:
    0.0
Got:
    -0.0
**********************************************************************
File "/home/malb/Sage/current/devel/sage/sage/numerical/mip.pyx", line 1216:
    sage: p.get_backend()
Expected:
    <sage.numerical.backends.glpk_backend.GLPKBackend object ...>
Got:
    SCIP Constraint Integer Program "" ( maximization, 0 variables, 0 constraints )
**********************************************************************
File "/home/malb/Sage/current/devel/sage/sage/numerical/mip.pyx", line 365:
    sage: p.show()
Expected:
    Maximization:
      Hey[1] +Hey[2]
    Constraints:
      Constraint_1: -3.0 Hey[1] +2.0 Hey[2] <= 2.0
    Variables:
      Hey[1] is a continuous variable (min=0.0, max=+oo)
      Hey[2] is a continuous variable (min=0.0, max=+oo)
Got:
    Maximization:
      x_0 +x_1
    Constraints:
      Constraint_1: -3.0 x_0 +2.0 x_1 <= 2.0
    Variables:
      x_0 is a continuous variable (min=0.0, max=+oo)
      x_1 is a continuous variable (min=0.0, max=+oo)
**********************************************************************

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #10879

    • Property Status changed from new to needs_work
  • Ticket #10879 – Description

    v2 v5  
    1919 * the following doctests fail
    2020{{{
    21  sage -t  -long -force_lib devel/sage/doc/en/thematic_tutorials/linear_programming.rst # 9 doctests failed
     21 sage -t  -long -force_lib devel/sage/doc/en/thematic_tutorials/linear_programming.rst # 1 doctests failed
    2222 sage -t  -long -force_lib devel/sage/sage/graphs/digraph.py # 1 doctests failed
    23  sage -t  -long -force_lib devel/sage/sage/graphs/graph_coloring.py # 3 doctests failed
    24  sage -t  -long -force_lib devel/sage/sage/graphs/graph_generators.py # 2 doctests failed
    25  sage -t  -long -force_lib devel/sage/sage/numerical/knapsack.py # 4 doctests failed
    26  sage -t  -long -force_lib devel/sage/sage/numerical/mip.pyx # 11 doctests failed
    27  sage -t  -long -force_lib devel/sage/sage/graphs/generic_graph.py # 18 doctests failed
     23 sage -t  -long -force_lib devel/sage/sage/numerical/mip.pyx # 3 doctests failed
    2824}}}
     25 * printing of quadratic constraints does not work yet.