Ticket #18948: log

File log, 42.5 KB (added by dimpase, 4 years ago)

top part of git log

Line 
1commit a89a02a24b44fd0b2ce1c92ecce22b672bbd9e21
2Author: Dima Pasechnik <dimpase@gmail.com>
3Date:   Tue Aug 4 22:56:26 2015 +0100
4
5    another unknown graph, instead of the known one
6
7commit d959afa2fe6093a1ddc6440c444cf2e5cdc62225
8Author: Nathann Cohen <nathann.cohen@gmail.com>
9Date:   Tue Aug 4 22:32:39 2015 +0200
10
11    trac #18988: Orthogonal Polar graphs in strongly_regular_graph
12
13commit 449a23ec5b0305fc2f7132bdd38ba0923ec01b89
14Author: Dima Pasechnik <dimpase@gmail.com>
15Date:   Tue Aug 4 21:52:53 2015 +0100
16
17    improving seidel_switching()
18
19commit c4269aeae44bbd64afbdee96f04fb120d73f0de1
20Author: Dima Pasechnik <dimpase@gmail.com>
21Date:   Tue Aug 4 20:28:35 2015 +0100
22
23    doc and srg DB fixes
24
25commit 758da33a4bd616f97e2b9748236c0d866fb8f79d
26Author: Dima Pasechnik <dimpase@gmail.com>
27Date:   Tue Aug 4 14:33:39 2015 +0100
28
29    SRG_279_150_85_75 added.
30   
31    I don't know how to rebuild the database, so that it is available as
32    sage: graphs.strongly_regular_graph(279, 150, 85, 75)
33
34commit 5115728f80aa95f87a272feec999e317ccdffba4
35Author: Dima Pasechnik <dimpase@gmail.com>
36Date:   Mon Aug 3 21:36:09 2015 +0100
37
38    make descendant computation faster
39
40commit f72b84ea89a0f371a53a965620ca7820886f0f82
41Merge: 3b0bd4f a75774f
42Author: Dima Pasechnik <dimpase@gmail.com>
43Date:   Mon Aug 3 13:06:25 2015 +0100
44
45    rebase...
46
47commit 3b0bd4f77e7b50f3197631dae88a9669ee13cc2a
48Merge: 7331311 dc2d326
49Author: Dima Pasechnik <dimpase@gmail.com>
50Date:   Mon Aug 3 12:46:23 2015 +0100
51
52    Merge branch 'u/ncohen/18960' of git://trac.sagemath.org/sage into seidelsw
53
54commit 7331311b78d59d5e932fd92af3a4cb4a3188a348
55Author: Dima Pasechnik <dimpase@gmail.com>
56Date:   Mon Aug 3 12:38:47 2015 +0100
57
58    minor typos etc
59
60commit 3eeca75f420da293a72012fe54eddc28de1495fd
61Author: Dima Pasechnik <dimpase@gmail.com>
62Date:   Mon Aug 3 12:29:17 2015 +0100
63
64    introducing class TwoGraph
65
66commit a75774fa9f6168b4f0e34c6cdd93496f7283b179
67Author: Nathann Cohen <nathann.cohen@gmail.com>
68Date:   Mon Aug 3 11:40:20 2015 +0200
69
70    trac #18948: take into account the BIBD from #18934
71
72commit dc2d3261a823a5ed8db1129497ada25e3059d7ee
73Author: Nathann Cohen <nathann.cohen@gmail.com>
74Date:   Mon Aug 3 11:32:26 2015 +0200
75
76    trac #18960: Lint -> vLint
77
78commit 0aafa88f085c4bd0962512831ef2fc39911a1f99
79Merge: edb1b08 21b01bc
80Author: Dima Pasechnik <dimpase@gmail.com>
81Date:   Mon Aug 3 10:18:24 2015 +0100
82
83    Merge branch 'u/dimpase/seidelsw' of git://trac.sagemath.org/sage into seidelsw
84
85commit 4f51703c4e63909516d4711714a5429cfd4f5050
86Author: Nathann Cohen <nathann.cohen@gmail.com>
87Date:   Mon Aug 3 10:04:17 2015 +0200
88
89    trac #18948: DOcstring
90
91commit 21b01bcc384a0bef91b019dbe6914911a3aad5db
92Author: Dima Pasechnik <dimpase@gmail.com>
93Date:   Sun Aug 2 22:54:21 2015 +0100
94
95    no need for explicit .eps in LaTeX
96
97commit e5144c17944ba15810fa6add30e1d9a996559607
98Author: Dima Pasechnik <dimpase@gmail.com>
99Date:   Sun Aug 2 22:41:44 2015 +0100
100
101    initial version of twograph functionality
102
103commit cf8f2dad1cd90ff5aaa0cec15a25f87c64289719
104Author: Nathann Cohen <nathann.cohen@gmail.com>
105Date:   Sat Aug 1 19:04:05 2015 +0200
106
107    trac #18948: guess mu
108
109commit 46bdc550161b3fce56097c8c3f0bf101ea2c5c64
110Author: Dmitrii Pasechnik <dimpase@gmail.com>
111Date:   Sat Aug 1 03:33:45 2015 +0100
112
113    switching construction for the Chang graphs
114
115commit a48e9e2c5ca13c44468a42a1420fac8b70ee9faa
116Author: Dmitrii Pasechnik <dimpase@gmail.com>
117Date:   Sat Aug 1 01:41:56 2015 +0100
118
119    modifications suggested by Nathann in comment 1
120
121commit 83ed332c58dbad71fe5b74d8c2d9e3aa3fe52d84
122Author: Nathann Cohen <nathann.cohen@gmail.com>
123Date:   Fri Jul 31 10:32:23 2015 +0200
124
125    trac #18960: Again...
126
127commit b76c9a0369a5babc98481d6b96125c9b86f1adc9
128Author: Dmitrii Pasechnik <dimpase@gmail.com>
129Date:   Fri Jul 31 02:12:30 2015 +0100
130
131    Seidel adj.mat. constructor, creation, switching
132
133commit a9280c9ae07f2703e7d004d463a77d8e6482025f
134Author: Nathann Cohen <nathann.cohen@gmail.com>
135Date:   Thu Jul 30 18:44:48 2015 +0200
136
137    trac #18948: Rephrasing the doc
138
139commit 8f254930985e06432a8261c697d2b5e0edf97f9d
140Merge: edb1b08 4adcf95
141Author: Nathann Cohen <nathann.cohen@gmail.com>
142Date:   Thu Jul 30 18:42:19 2015 +0200
143
144    trac #18948: Merged with 6.9.beta0
145
146commit 606d15fbf46b427ed47a92e7250d75f4711cdd78
147Author: Nathann Cohen <nathann.cohen@gmail.com>
148Date:   Thu Jul 30 17:42:04 2015 +0200
149
150    trac #18960: Adding nonzero somewhere
151
152commit 3eee1e76896f8406e2f98c0664ebb0e959798df2
153Merge: edb1b08 6390dd9
154Author: Nathann Cohen <nathann.cohen@gmail.com>
155Date:   Thu Jul 30 17:40:50 2015 +0200
156
157    trac #18960: Merge 6.9.beta0
158
159commit edb1b0870d25373a1cf8def52c5fe3159245f59d
160Author: Volker Braun <vbraun.name@gmail.com>
161Date:   Wed Jul 29 17:07:30 2015 +0200
162
163    Updated Sage version to 6.9.beta0
164
165commit a7cb38e82628a8a0ae845cc6f714aa0deead3f36
166Merge: 5b81e36 1be3c2b
167Author: Release Manager <release@sagemath.org>
168Date:   Wed Jul 29 11:24:23 2015 +0200
169
170    Trac #18962: Double free in ft2font
171   
172    As reported at https://groups.google.com/d/msg/sage-
173    support/K-neaKVSGiE/YMvQqVNQCQAJ
174    {{{
175    sage: import matplotlib
176    sage: matplotlib.rc('text', usetex=True)
177    sage: plot(sin).save('/tmp/test.svg') # works
178    sage: plot(sin).save('/tmp/test.svg') # segfault
179    }}}
180    This is a bug in freetype 2.5.2 (http://savannah.nongnu.org/bugs/?40997)
181   
182    Update to freetype-2.6 fixes it.
183   
184    URL: http://trac.sagemath.org/18962
185    Reported by: vbraun
186    Ticket author(s): Volker Braun
187    Reviewer(s): François Bissey
188
189commit 5b81e3674d0c057baf1d9586f4364b0c2241d5b1
190Merge: 0feb845 1a30b06
191Author: Release Manager <release@sagemath.org>
192Date:   Wed Jul 29 11:23:34 2015 +0200
193
194    Trac #16133: delete deprecation warning in FSM.process and __call__
195   
196    Delete the deprecation warning and its documentation in
197    {{{FiniteStateMachine.process}}}.
198   
199    See #16132 for details. The deprecation warning was active sind #16132
200    was merged in 6.2.rc0 (2014-04-23), thus also in 6.2 (2014-05-06).
201   
202    URL: http://trac.sagemath.org/16133
203    Reported by: dkrenn
204    Ticket author(s): Daniel Krenn, Clemens Heuberger
205    Reviewer(s): Daniel Krenn
206
207commit 0feb845c9309c083c11be2e6e054792c5f456a5a
208Merge: 79beba9 e35ebe9
209Author: Release Manager <release@sagemath.org>
210Date:   Wed Jul 29 11:23:29 2015 +0200
211
212    Trac #14243: Try not to pick up user versions of things like numpy, mpl
213   
214    At [http://ask.sagemath.org/question/1449/sage-uses-system-wide-python
215    this ask.sagemath.org question], where some users have the system Python
216    being picked up for some reasons, Volker asks
217    {{{
218    Can you try
219    export PYTHONNOUSERSITE=yes
220    sage
221    This should prevent Sage from picking up stuff in .local/lib. If that
222    fixes your problem we can add it to the next release.
223    }}}
224    Apparently this works, and
225    [https://groups.google.com/forum/?fromgroups=#!topic/sage-
226    support/Y9bjhb6-dcM this sage-support question] suggests it works a lot.
227    Maybe we should put this in now.
228   
229    URL: http://trac.sagemath.org/14243
230    Reported by: kcrisman
231    Ticket author(s): John Palmieri
232    Reviewer(s): Buck Evan
233
234commit 1be3c2b15b3aa1ba78396d549bfc4ba7161cd097
235Author: Volker Braun <vbraun.name@gmail.com>
236Date:   Wed Jul 29 10:11:59 2015 +0200
237
238    Update to freetype 2.6
239
240commit 79beba9dc7a706278b73fb9b17d0be1ab985c0c6
241Merge: a24ef7d cfbc7da
242Author: Release Manager <release@sagemath.org>
243Date:   Wed Jul 29 00:50:44 2015 +0200
244
245    Trac #18760: Posets: Slightly faster is_lattice()
246   
247    Finite join-semilattice with bottom element is a lattice. (Resp. meet-
248    semilattice with top element.)
249   
250    URL: http://trac.sagemath.org/18760
251    Reported by: jmantysalo
252    Ticket author(s): Jori Mäntysalo
253    Reviewer(s): David Einstein
254
255commit a24ef7dd68cad1be4161af1193f6e1a0ca332a0f
256Merge: 8b9b5f8 24f7b3b
257Author: Release Manager <release@sagemath.org>
258Date:   Wed Jul 29 00:50:40 2015 +0200
259
260    Trac #16106: Delete deprecation warning in Transducer.cartesian_product
261   
262    Delete the deprecation warning and its documentation in
263    Transducer.cartesian_product.
264   
265    See #16061 for the reasons for this deprecation warning. The deprecation
266    warning was active since #16061 was merged, i.e. in 6.2.beta8
267    (2014-04-14) and 6.2 (2014-05-06).
268   
269    URL: http://trac.sagemath.org/16106
270    Reported by: skropf
271    Ticket author(s): Sara Kropf, Clemens Heuberger
272    Reviewer(s): Daniel Krenn
273
274commit 8b9b5f856800a27328a37250b4a30c7241fcfe5a
275Merge: 30db7a2 1197483
276Author: Release Manager <release@sagemath.org>
277Date:   Wed Jul 29 00:50:35 2015 +0200
278
279    Trac #18950: Remove make_dlxwrapper from the sage namespace
280   
281    {{{make_dlxwrapper}}} is used for creating a dlx_solver from a pickled
282    list:
283   
284    {{{
285     $ sage -grep make_dlxwrapper
286    sage/combinat/matrices/all.py:from dancing_links import make_dlxwrapper
287    sage/combinat/matrices/dancing_links.pyx:            sage: x =
288    make_dlxwrapper(dumps(rows))
289    sage/combinat/matrices/dancing_links.pyx:            sage: print
290    make_dlxwrapper(dumps(rows)).__str__()
291    sage/combinat/matrices/dancing_links.pyx:            sage: x =
292    make_dlxwrapper(dumps(rows))
293    sage/combinat/matrices/dancing_links.pyx:        return
294    sage.combinat.matrices.dancing_links.make_dlxwrapper,
295    (dumps(self.rows),)
296    sage/combinat/matrices/dancing_links.pyx:def make_dlxwrapper(s):
297    sage/combinat/matrices/dancing_links.pyx:        sage: x =
298    make_dlxwrapper(dumps(rows))
299    }}}
300   
301    This is a follow-up for #11814.
302   
303    URL: http://trac.sagemath.org/18950
304    Reported by: slabbe
305    Ticket author(s): Sébastien Labbé
306    Reviewer(s): Jeroen Demeyer
307
308commit 30db7a2328eee696c4d9e5f99f87c31ba64171eb
309Merge: 302e07a 8d86cb3
310Author: Release Manager <release@sagemath.org>
311Date:   Wed Jul 29 00:50:29 2015 +0200
312
313    Trac #18901: Bug in continued fractions of real literal
314   
315    As reported in #14567, `continued_fraction` fails for real literals
316    {{{
317    sage: continued_fraction_list(1.575709393346379)
318    Error in lines 1-1
319    Traceback (most recent call last):
320    ...
321    ValueError: does not know how to compute the continued fraction of
322    1.57570939334638
323    }}}
324   
325    URL: http://trac.sagemath.org/18901
326    Reported by: vdelecroix
327    Ticket author(s): Vincent Delecroix
328    Reviewer(s): Sébastien Labbé
329
330commit 302e07a2097ee0e7fabda8a42909b2cd16602f51
331Merge: b0c423f dcdfd06
332Author: Release Manager <release@sagemath.org>
333Date:   Wed Jul 29 00:48:33 2015 +0200
334
335    Trac #11814: Catch and fix the segmentation fault in dlx_solver
336   
337    On a 64-bit Gentoo Linux system running sage-4.7.2.alpha2:
338   
339    {{{
340    sage: from sage.combinat.matrices.dancing_links import dlx_solver
341    sage: rows = []
342    sage: x = dlx_solver(rows)
343    sage: x.search()
344    /usr/local/src/sage-4.7.2.alpha2/local/lib/libcsage.so(print_backtrace+0
345    x31)[0x7f6c37015e02]
346    /usr/local/src/sage-4.7.2.alpha2/local/lib/libcsage.so(sigdie+0x14)[0x7f
347    6c37015e34]
348    /usr/local/src/sage-4.7.2.alpha2/local/lib/libcsage.so(sage_signal_handl
349    er+0x20c)[0x7f6c37015a82]
350    /lib/libpthread.so.0(+0xf400)[0x7f6c3c26e400]
351    /usr/local/src/sage-4.7.2.alpha2/local/lib/python2.6/site-packages/sage/
352    combinat/matrices/dancing_links.so(+0x738b)[0x7f6c1612f38b]
353    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
354    alFrameEx+0x4c32)[0x7f6c3c55d842]
355    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
356    alCodeEx+0x879)[0x7f6c3c55f819]
357    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
358    alCode+0x32)[0x7f6c3c55f912]
359    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
360    alFrameEx+0x4ccb)[0x7f6c3c55d8db]
361    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
362    alCodeEx+0x879)[0x7f6c3c55f819]
363    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
364    alFrameEx+0x5364)[0x7f6c3c55df74]
365    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
366    alCodeEx+0x879)[0x7f6c3c55f819]
367    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
368    alFrameEx+0x5364)[0x7f6c3c55df74]
369    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
370    alFrameEx+0x5a8a)[0x7f6c3c55e69a]
371    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
372    alCodeEx+0x879)[0x7f6c3c55f819]
373    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
374    alFrameEx+0x5364)[0x7f6c3c55df74]
375    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
376    alCodeEx+0x879)[0x7f6c3c55f819]
377    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
378    alFrameEx+0x5364)[0x7f6c3c55df74]
379    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
380    alCodeEx+0x879)[0x7f6c3c55f819]
381    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
382    alFrameEx+0x5364)[0x7f6c3c55df74]
383    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
384    alCodeEx+0x879)[0x7f6c3c55f819]
385    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyEval_Ev
386    alCode+0x32)[0x7f6c3c55f912]
387    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyRun_Fil
388    eExFlags+0xb0)[0x7f6c3c581d20]
389    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(PyRun_Sim
390    pleFileExFlags+0xdf)[0x7f6c3c58275f]
391    /usr/local/src/sage-4.7.2.alpha2/local/lib/libpython2.6.so.1.0(Py_Main+0
392    xb23)[0x7f6c3c58fa23]
393    /lib/libc.so.6(__libc_start_main+0xe6)[0x7f6c3b897ba6]
394    python[0x4006e9]
395   
396    ------------------------------------------------------------------------
397    Unhandled SIGSEGV: A segmentation fault occurred in Sage.
398    This probably occurred because a *compiled* component of Sage has a bug
399    in it and is not properly wrapped with sig_on(), sig_off(). You might
400    want to run Sage under gdb with 'sage -gdb' to debug this.
401    Sage will now terminate.
402    ------------------------------------------------------------------------
403    }}}
404   
405    Note that this behaviour is actually documented in
406    `sage/combinat/tiling.py`:
407    {{{
408        def is_suitable(self):
409            r"""
410            Return whether the volume of the box is equal to sum of the
411    volume
412            of the polyominoes and the number of rows sent to the DLX solver
413    is
414            larger than zero.
415   
416            If these conditions are not verified, then the problem is not
417    suitable
418            in the sense that there are no solution.
419   
420            .. NOTE::
421   
422                The DLX solver throws a Segmentation Fault when the
423                number of rows is zero::
424   
425                    sage: from sage.combinat.matrices.dancing_links import
426    dlx_solver
427                    sage: rows = []
428                    sage: x = dlx_solver(rows)
429                    sage: x.search()        # not tested
430                    BOOM !!!
431    }}}
432   
433    For sage-on-gentoo, there is an assertion failure:
434    {{{
435    sage:  x = dlx_solver(rows)
436    python2.7: sage/combinat/matrices/dancing_links_c.h:217: void
437    dancing_links::setup_columns(): Assertion `nr_columns > 0' failed.
438    /usr/lib64/libcsage.so(print_backtrace+0x24)[0x7fea73a945f7]
439    /usr/lib64/libcsage.so(sigdie+0x1d)[0x7fea73a94687]
440    /usr/lib64/libcsage.so(sage_signal_handler+0x157)[0x7fea73a94822]
441    /lib64/libpthread.so.0(+0xfee0)[0x7fea79206ee0]
442    /lib64/libc.so.6(gsignal+0x35)[0x7fea78ea5ee5]
443    /lib64/libc.so.6(abort+0x186)[0x7fea78ea7896]
444    /lib64/libc.so.6(__assert_fail+0xf5)[0x7fea78e9e7a5]
445    /usr/lib64/python2.7/site-packages/sage/combinat/matrices/dancing_links.
446    so(+0x855d)[0x7fea4e73255d]
447    }}}
448   
449    Additionally, we can segfault with a different kind of trivial problem,
450   
451    {{{
452        sage: from sage.combinat.matrices.dancing_links import dlx_solver
453        sage: d = dlx([[]])
454        sage: d.search()
455        *boom!*
456    }}}
457   
458    And even adding rows can be a problem... this doesn't always go boom
459    {{{
460        sage: d = dlx_solver([[0,1],[2]])
461        sage: d.add_rows([[0,1],[1]])
462        *boom!*
463    }}}
464   
465    Actually... *why the hell* would we ever support the following:
466    {{{
467        sage: d = dlx_solver(anything)
468        sage: d.search()
469        sage: d.add_rows(anything else)
470    }}}
471   
472    URL: http://trac.sagemath.org/11814
473    Reported by: jdemeyer
474    Ticket author(s): Sébastien Labbé
475    Reviewer(s): Jeroen Demeyer
476
477commit 6390dd942ab5c913d08ba183c84be76a876baf93
478Author: Nathann Cohen <nathann.cohen@gmail.com>
479Date:   Tue Jul 28 22:08:26 2015 +0200
480
481    trac #18960: Strongly Regular Graphs from two-weight codes
482
483commit e35ebe9bb554e4f00bcd0c4eabe91cb196997a1a
484Author: John H. Palmieri <palmieri@math.washington.edu>
485Date:   Tue Jul 28 12:58:45 2015 -0700
486
487    trac 14243: set PYTHONNOUSERSITE=yes to avoid picking up user's Python files.
488
489commit cf50d705fe5fc6bc1d8dc0174a93cc27fe6f783c
490Merge: 7eb8510 4adcf95
491Author: Nathann Cohen <nathann.cohen@gmail.com>
492Date:   Tue Jul 28 21:25:10 2015 +0200
493
494    trac #18948: Merged with 6.8
495
496commit dcdfd06c1e924a72a49cf0c13929930ddcb61e08
497Author: Sébastien Labbé <slabqc@gmail.com>
498Date:   Tue Jul 28 21:13:16 2015 +0200
499
500    Trac #11814: Fix failing Assertion nr_columns > 0 in setup_columns()
501
502commit b0c423f9543f4fb4518fcabbcff717f2ca60bd76
503Merge: 79703ef eb01c42
504Author: Release Manager <release@sagemath.org>
505Date:   Tue Jul 28 20:40:44 2015 +0200
506
507    Trac #18331: Introduce initial distribution for Markov chains
508   
509    We introduce the attribute {{{FSMState.initial_probability}}}. It is the
510    probability of starting in this state of a Markov chain.
511    In {{{FiniteStateMachine.is_Markov_chain}}}, we additionally check
512    whether the sum of the initial probabilities over all states is one or
513    all initial probabilities are set to None.
514   
515    URL: http://trac.sagemath.org/18331
516    Reported by: skropf
517    Ticket author(s): Sara Kropf, Clemens Heuberger
518    Reviewer(s): Clemens Heuberger
519
520commit 1a30b06dc5c308107f76fa327f85e98011d72541
521Author: Clemens Heuberger <clemens.heuberger@aau.at>
522Date:   Tue Jul 28 12:54:22 2015 +0200
523
524    Trac #16133: remove three further instances of FSMOldProcessOutput
525
526commit 6b3172e064b86be2af1b9e4ab72e4f92627c4733
527Author: Clemens Heuberger <clemens.heuberger@aau.at>
528Date:   Tue Jul 28 12:51:45 2015 +0200
529
530    Trac #16133: Three docstrings: command instead of description
531
532commit ae135097e391fcb2d480719e2a726894881b187b
533Merge: e2fcf3b 24f7b3b
534Author: Clemens Heuberger <clemens.heuberger@aau.at>
535Date:   Tue Jul 28 12:48:23 2015 +0200
536
537    Trac #16133: Merge #16106
538
539commit 24f7b3bca8846f551595dc5cd6864be61ad03e48
540Author: Clemens Heuberger <clemens.heuberger@aau.at>
541Date:   Tue Jul 28 11:47:59 2015 +0200
542
543    Trac #16106: remove further occurrences of FSMOldCodeTransducerCartesianProduct
544
545commit 4a832851eb3086e6bafd59778b9062864d292561
546Merge: 5f45124 7eb8510
547Author: Clemens Heuberger <clemens.heuberger@aau.at>
548Date:   Tue Jul 28 11:46:43 2015 +0200
549
550    Merge tag '6.8' into fsm/cartesian-product-intersection-no-deprecation
551   
552    Sage version 6.8
553
554commit 79703efc9a66ecd0475610467fc2ea92a01646dc
555Merge: 7f4edff 0304d9f
556Author: Release Manager <release@sagemath.org>
557Date:   Mon Jul 27 17:16:38 2015 +0200
558
559    Trac #18868: a MemoryAllocator object for easier Cython memory management
560   
561    This is a re-implementation of an example appearing in Cython's
562    documentation (see bottom of [1]).
563   
564    The idea is simple: an object has a `.malloc` method, and returns arrays
565    of memory. When that object is garbage-collected, the memory it
566    allocated is automatically freed.
567   
568    This makes it much easier to deal with C pointers in Cython code, which
569    must be freed before any 'return' and whenever an exception can be
570    raised.
571   
572    As an illustration of how useful this can be, I removed a *lot* of graph
573    code.
574   
575    Nathann
576   
577    [1] http://docs.cython.org/src/tutorial/memory_allocation.html
578   
579    URL: http://trac.sagemath.org/18868
580    Reported by: ncohen
581    Ticket author(s): Nathann Cohen, Jeroen Demeyer
582    Reviewer(s): Jeroen Demeyer, Volker Braun
583
584commit cfbc7daccfee560158f7d52a9aa0e00dfeb7d868
585Author: Jori Mäntysalo <jori.mantysalo@uta.fi>
586Date:   Mon Jul 27 14:52:14 2015 +0300
587
588    Faster is_lattice().
589
590commit 7f4edffef6179b077480d865b54f37ee3aa8781e
591Merge: 8a5edad 3b9cb9c
592Author: Release Manager <release@sagemath.org>
593Date:   Mon Jul 27 01:50:37 2015 +0200
594
595    Trac #18949: a doc typo in graph.py
596   
597    let us correct that typo
598   
599    URL: http://trac.sagemath.org/18949
600    Reported by: chapoton
601    Ticket author(s): Frédéric Chapoton
602    Reviewer(s): Nathann Cohen
603
604commit 8a5edad209fbd8732bb32dbb6f23d6af2deccdb0
605Merge: bd1cc60 1662110
606Author: Release Manager <release@sagemath.org>
607Date:   Mon Jul 27 01:50:31 2015 +0200
608
609    Trac #18943: typo in infinity crystal
610   
611    let us correct a typo there, plus a few pep8/pyflakes details
612   
613    URL: http://trac.sagemath.org/18943
614    Reported by: chapoton
615    Ticket author(s): Frédéric Chapoton
616    Reviewer(s): Travis Scrimshaw
617
618commit bd1cc60426529b6c3aa0f6fb7f6aaac0df3316b2
619Merge: 1e4a91f 8688fd9
620Author: Release Manager <release@sagemath.org>
621Date:   Mon Jul 27 01:50:27 2015 +0200
622
623    Trac #18925: Poset documentation polishing: covers
624   
625    Do some polishing to `upper_covers()`, `cover_relations_iterator()` and
626    so on at `posets.py`.
627   
628    URL: http://trac.sagemath.org/18925
629    Reported by: jmantysalo
630    Ticket author(s): Jori Mäntysalo
631    Reviewer(s): Travis Scrimshaw
632
633commit 1e4a91fe627ebe1a109686f5eb7acc49eec5e355
634Merge: be37bdb ce9d265
635Author: Release Manager <release@sagemath.org>
636Date:   Mon Jul 27 01:50:22 2015 +0200
637
638    Trac #18864: New method for the eccentricity of undirected graphs
639   
640    This patch implements the algorithm proposed in [1] for computing the
641    eccentricity of all vertices of a connected undirected unweighted graph.
642    It can be faster than the standard algorithm.
643   
644    {{{
645    sage: from sage.graphs.distances_all_pairs import eccentricity
646    sage: G = graphs.PetersenGraph()
647    sage: %time _= eccentricity(G, method='standard')
648    CPU times: user 299 µs, sys: 75 µs, total: 374 µs
649    Wall time: 361 µs
650    sage: %time _= eccentricity(G, method='bounds')
651    CPU times: user 218 µs, sys: 29 µs, total: 247 µs
652    Wall time: 235 µs
653    sage: G = graphs.RandomBarabasiAlbert(10000,2)
654    sage: %time _= eccentricity(G, method='standard')
655    CPU times: user 2.78 s, sys: 7.8 ms, total: 2.78 s
656    Wall time: 2.79 s
657    sage: %time _= eccentricity(G, method='bounds')
658    CPU times: user 1.66 s, sys: 8.06 ms, total: 1.67 s
659    Wall time: 1.67 s
660    }}}
661   
662    Similar method for directed graphs and weighted (di)graphs can be the
663    object of future tickets.
664   
665    ----
666    [1] F. W. Takes and W. A. Kosters. Computing the eccentricity
667    distribution of large graphs. *Algorithms* 6:100-118 (2013)
668    http://dx.doi.org/10.3390/a6010100
669   
670    URL: http://trac.sagemath.org/18864
671    Reported by: dcoudert
672    Ticket author(s): David Coudert
673    Reviewer(s): Michele Borassi
674
675commit be37bdb2af7dab8765c4a557def9cf3ea497c1a1
676Merge: 745a19d a5ec517
677Author: Release Manager <release@sagemath.org>
678Date:   Mon Jul 27 01:50:18 2015 +0200
679
680    Trac #18791: Matroid k-connectivity
681   
682    Decide if a matroid is k-connected using matroid intersection.
683   
684    URL: http://trac.sagemath.org/18791
685    Reported by: chaoxu
686    Ticket author(s): Chao Xu
687    Reviewer(s): Rudi Pendavingh
688
689commit 745a19ded913bf620074bb3e0d2f523fe99d9bff
690Merge: a499206 38d4de5
691Author: Release Manager <release@sagemath.org>
692Date:   Mon Jul 27 01:50:13 2015 +0200
693
694    Trac #17485: Poset: Documentation of characteristic_polynomial
695   
696    Documentation says first "Return the characteristic polynomial of a
697    '''graded''' poset - -", then later "If P is a '''graded poset with - -
698    a unique minimal element'''"  and the function can throw "the poset
699    should be '''ranked'''". Somebody understanding what is characteristic
700    polynomial should check this.
701   
702    Also the list of poset functions at the beginning of the file does not
703    contain this function.
704   
705    URL: http://trac.sagemath.org/17485
706    Reported by: jmantysalo
707    Ticket author(s): Jori Mäntysalo
708    Reviewer(s): Frédéric Chapoton
709
710commit a499206775e25101116f7f120f99e484b69d94f2
711Merge: 9f03cc2 bd1d6eb
712Author: Release Manager <release@sagemath.org>
713Date:   Mon Jul 27 01:50:08 2015 +0200
714
715    Trac #18947: Add a -fix-pkg-checksums argument to sage
716   
717    The 'sage-fix-pkg-checksums' utility is not (yet) available as an option
718    of 'sage'. This branch fixes it.
719   
720    Nathann
721   
722    URL: http://trac.sagemath.org/18947
723    Reported by: ncohen
724    Ticket author(s): Nathann Cohen
725    Reviewer(s): Sébastien Labbé
726
727commit 9f03cc29962556d31299537fd6af8e55a287748e
728Merge: 16c5a77 37011a4
729Author: Release Manager <release@sagemath.org>
730Date:   Mon Jul 27 01:50:04 2015 +0200
731
732    Trac #18926: Auto-generated index of functions
733   
734    This branch implements a new function named {{{gen_rest_table_index}}}
735    which generates an index of the functions given as arguments.
736   
737    It can also generate the list of all methods of a given class `A`.
738   
739    With this functions, it is then very easy to add an index of functions
740    in a Sage module, that does not have to be kept updated manually.
741   
742    Nathann
743   
744    URL: http://trac.sagemath.org/18926
745    Reported by: ncohen
746    Ticket author(s): Nathann Cohen
747    Reviewer(s): Johan Sebastian Rosenkilde Nielsen
748
749commit 16c5a772d123eab866fecbe5eecf6acc055738a4
750Merge: 4577fde a7b60c5
751Author: Release Manager <release@sagemath.org>
752Date:   Mon Jul 27 01:50:00 2015 +0200
753
754    Trac #18923: Remove flag METH_OLDARGS
755   
756    It's deprecated since
757    [https://www.python.org/download/releases/2.4.1/notes/#id160 Python 2.2]
758    and has been removed in [https://docs.python.org/3.0/whatsnew/3.0.html
759    #build-and-c-api-changes Python 3].
760   
761    URL: http://trac.sagemath.org/18923
762    Reported by: aapitzsch
763    Ticket author(s): André Apitzsch
764    Reviewer(s): Jeroen Demeyer
765
766commit 4577fdef763eebe489c4cb7d91384ec421a66536
767Merge: 85339c8 299bc40
768Author: Release Manager <release@sagemath.org>
769Date:   Mon Jul 27 01:49:54 2015 +0200
770
771    Trac #18906: Refactor min spanning tree
772   
773    Solve some strange behaviors / bugs in minimum spanning tree routines.
774   
775    Usually, if the graph is weighted, the weight is ignored, and the
776    `weight_function` argument is used. If this argument is not provided,
777    the (rather counterintuitive) behavior is to set all weights to 1 (so
778    that any spanning tree can be outputted). However, if Kruskal algorithm
779    is used, and `check` is set to `True`, then edge weights are used,
780    instead.
781   
782    {{{
783    sage: g = Graph(weighted=True)
784    sage: g.add_edges([[0,1,1],[1,2,1],[2,0,10]])
785    sage: g.min_spanning_tree(algorithm='Kruskal')
786    [(0, 1, 1), (0, 2, 10)]
787    sage: g.min_spanning_tree(algorithm='Prim_fringe')
788    [(0, 1), (0, 2)]
789    sage: g.min_spanning_tree(algorithm='Prim_edge')
790    [(0, 1, 1), (0, 2, 10)]
791    sage: sage: g.min_spanning_tree(algorithm='Kruskal', check=True)
792    [(0, 1, 1), (1, 2, 1)]
793   
794    }}}
795    This example also shows that the outputs are different.
796   
797    Moreover, NetworkX algorithm does not work:
798   
799    {{{
800    sage: g.min_spanning_tree(algorithm='NetworkX')
801    ------------------------------------------------------------------------
802    ---
803    TypeError                                 Traceback (most recent call
804    last)
805    <ipython-input-27-b461ae20ba97> in <module>()
806    ----> 1 g.min_spanning_tree(algorithm='NetworkX')
807   
808    /home/michele/Programmi/sage/local/lib/python2.7/site-
809    packages/sage/graphs/generic_graph.pyc in min_spanning_tree(self,
810    weight_function, algorithm, starting_vertex, check)
811       3433             import networkx
812       3434             G = networkx.Graph([(u, v,
813    dict(weight=weight_function((u, v)))) for u, v, l in
814    self.edge_iterator()])
815    -> 3435             return list(networkx.mst(G))
816       3436         else:
817       3437             raise NotImplementedError("Minimum Spanning Tree
818    algorithm '%s' is not implemented." % algorithm)
819   
820    TypeError: 'module' object is not callable
821   
822    }}}
823    This ticket will change this behavior, by defining a specific order in
824    the choice of weights:
825   
826     * if the function weight_function is provided, it is used as default;
827     * if the function weight_function is None (default) and the graph is
828    weighted, the edge weights are used;
829     * otherwise, all weights are set to 1.
830   
831    Moreover, it will fix NetworkX problems, and it will standardize the
832    output.
833   
834    Finally, it will modify Kruskal algorithm as follows:
835   
836     * now, the input can only be an undirected graph, so that the behavior
837    is much more clear, and the documentation becomes much smaller;
838     * we moved the code to remove self-loops and multiple edges in a
839    separate routine, because it will be used by Boost.
840   
841    This is a first step before the inclusion of Boost minimum spanning tree
842    algorithms.
843   
844    URL: http://trac.sagemath.org/18906
845    Reported by: borassi
846    Ticket author(s): Michele Borassi
847    Reviewer(s): David Coudert
848
849commit 85339c8adc360494531a8fb9d25646ff302850eb
850Merge: 54ef590 1ccf786
851Author: Release Manager <release@sagemath.org>
852Date:   Mon Jul 27 01:49:50 2015 +0200
853
854    Trac #18898: Fix sorting of riggings when doing complement_rigging
855   
856    The following does not sort the riggings, breaking an internal
857    assumption of rigged configurations:
858    {{{
859    sage: RC = RiggedConfigurations(['D',4,1], [[2,1], [2,1], [2,3]])
860    sage: x = RC(partition_list=[[1], [1,1], [1], [1]], rigging_list=[[0],
861    [2,1], [0], [0]])
862    sage: x.complement_rigging(True)
863   
864    0[ ]0
865   
866    2[ ]0
867    2[ ]1
868   
869    0[ ]0
870   
871    0[ ]0
872    }}}
873   
874    URL: http://trac.sagemath.org/18898
875    Reported by: tscrim
876    Ticket author(s): Travis Scrimshaw
877    Reviewer(s): Anne Schilling
878
879commit 54ef590ebcc7ba9d2aaa1b3cde581fdd6b2c04d8
880Merge: f347008 a567eda
881Author: Release Manager <release@sagemath.org>
882Date:   Sun Jul 26 16:18:30 2015 +0200
883
884    Trac #18871: MILP formulation for cutwidth
885   
886    This ticket adds a MILP formulation for computing the cutwidth of
887    graphs. This method has no limit on the size of the input graph, but it
888    is slow. It also enables to compare results.
889   
890    URL: http://trac.sagemath.org/18871
891    Reported by: dcoudert
892    Ticket author(s): David Coudert
893    Reviewer(s): Nathann Cohen
894
895commit f34700819fc9eec899ab25dda571c166d56e72ef
896Merge: 9a1899b aa93226e
897Author: Release Manager <release@sagemath.org>
898Date:   Sun Jul 26 16:18:20 2015 +0200
899
900    Trac #18812: latte_int: count integer points
901   
902    Exposes the counting of the integer points of a polytope.. Mostly a
903    copy/paste from `ehrhart_polynomial`.
904   
905    This branch also adds a `file_output` optional flag to
906    `cdd_Hrepresentation` and `cdd_Vrepresentation`. The functions calling
907    external executable already contain sufficiently non-mathematical code.
908   
909    Nathann
910   
911    URL: http://trac.sagemath.org/18812
912    Reported by: ncohen
913    Ticket author(s): Nathann Cohen
914    Reviewer(s): Jeroen Demeyer, Dima Pasechnik
915
916commit 9a1899b3424405220579cd4c22c9569f48f77f43
917Merge: f1e2907 f7efbfe
918Author: Release Manager <release@sagemath.org>
919Date:   Sun Jul 26 16:18:14 2015 +0200
920
921    Trac #18583: Clean up PARI declarations
922   
923    We should really clean up the declarations in `sage/libs/paridecl.pxd`,
924    analogous to what has been done for `gmp` for example.
925   
926    This also fixes the unneeded linking of `pari` in the following Cython
927    extensions:
928    {{{
929    src/build/cythonized/sage/rings/number_field/totallyreal.c
930    src/build/cythonized/sage/rings/padics/common_conversion.c
931    src/build/cythonized/sage/rings/padics/padic_capped_absolute_element.c
932    src/build/cythonized/sage/rings/padics/padic_capped_relative_element.c
933    src/build/cythonized/sage/rings/padics/padic_fixed_mod_element.c
934    src/build/cythonized/sage/rings/real_double.c
935    }}}
936   
937    URL: http://trac.sagemath.org/18583
938    Reported by: jdemeyer
939    Ticket author(s): Jeroen Demeyer
940    Reviewer(s): Jean-Pierre Flori
941
942commit f1e2907af0c23fa21c6bece5401bd201133ffe2c
943Merge: b41c808 9f3b7e7
944Author: Release Manager <release@sagemath.org>
945Date:   Sun Jul 26 16:18:08 2015 +0200
946
947    Trac #15463: Implement crystal morphisms, subcrystals, and virtual crystals
948   
949    This implements:
950   
951    - Crystal morphisms (usual, twisted, and virtual).
952    - Subcrystals, so we no long have to do the subset workaround in
953    `digraph()`.
954    - Virtual crystals, so we can now view the elements in the virtual
955    crystal as a crystal graph.
956   
957    This also reworks `DirectSumOfCrystals` and `TensorProductOfCrystals` to
958    make them associative as constructions.
959   
960    After this, we will be able to do coercions between crystals.
961   
962    URL: http://trac.sagemath.org/15463
963    Reported by: tscrim
964    Ticket author(s): Travis Scrimshaw
965    Reviewer(s): Anne Schilling
966
967commit b41c808e8ad2a4ef8439e536c1f7a4d4334d0d67
968Merge: ee47081 96b61e3
969Author: Release Manager <release@sagemath.org>
970Date:   Sun Jul 26 16:18:01 2015 +0200
971
972    Trac #14585: Make lazy_format and lazy_string faster
973   
974    At [https://groups.google.com/forum/?fromgroups=#!topic/sage-devel
975    /Gnw389Bd-0k sage-devel], Nils suggests to use some kind of lazy object
976    for the error messages of errors that are deeply buried in the coercion
977    model.
978   
979    This approach is similar to what we already do with
980    `sage.structure.misc.AttributeErrorMassage`. However, this is
981    specifically restricted to error messages of attribute errors. In the
982    more general case, it makes sense to use either
983    `sage.misc.lazy_format.LazyFormat` or
984    `sage.misc.lazy_string.lazy_string`. The latter seems to be faster,
985    according to these timings that are according to Nils' example:
986    {{{
987    sage: from sage.misc.lazy_string import lazy_string
988    sage: f = lambda op,A,B:"unsupported operand parent(s) for '%s': '%s'
989    and '%s'"%(op,A,B)
990    sage: R = GF(5)
991    sage: S = GF(3)
992    sage: %timeit Exception(lazy_string(f, '+', R, S))
993    1000000 loops, best of 3: 1.47 us per loop
994    sage: lazy_string(f, '+', R, S)
995    l"unsupported operand parent(s) for '+': 'Finite Field of size 5' and
996    'Finite Field of size 3'"
997    sage: %timeit Exception("unsupported operand parent(s) for '%s': '%s'
998    and '%s'"%('+', R, S))
999    100000 loops, best of 3: 5.04 us per loop
1000    sage: from sage.misc.lazy_format import LazyFormat
1001    sage: ErrMess = LazyFormat("unsupported operand parent(s) for '%s': '%s'
1002    and '%s'")
1003    sage: %timeit Exception(ErrMess%('+', R, S))
1004    10000 loops, best of 3: 23.1 us per loop
1005    sage: ErrMess%('+', R, S)
1006    unsupported operand parent(s) for '+': 'Finite Field of size 5' and
1007    'Finite Field of size 3'
1008    }}}
1009    We're better off making a fresh `LazyFormat` object every time, due to
1010    an inefficiency in the copying operation required for rebinding such an
1011    object:
1012    {{{
1013    sage: %timeit LazyFormat("unsupported operand parent(s) for '%s': '%s'
1014    and '%s'")%('+', R, S)
1015    1000000 loops, best of 3: 2.08 µs per loop
1016    }}}
1017    Luckily, present use of `LazyFormat` follows this pattern.
1018   
1019    So, it would already make sense to replace all error messages using
1020    string formatting by a call to `lazy_string`, while `LazyFormat` seems
1021    to be quite sluggish.
1022   
1023    Two tasks:
1024    1. Make `lazy_string` and `LazyFormat` a lot faster (perhaps by using
1025    Cython)
1026    2. Use it for errors raised when trying to find coercions. The problem
1027    is particularly urgent if the string representation of an object is
1028    difficult to compute.
1029   
1030    '''__Note__'''
1031   
1032    For the second task, we meanwhile have #14592
1033   
1034    Apart from making coercion faster, there is the following problem that
1035    we would fix as well. Consider creation of a parent. It may happen that
1036    relatively early during initialisation, a coercion is needed, but only
1037    later, the string representation of the parent will become available.
1038    Hence, if there is an error raised (and caught) inside of the coercion
1039    system that relies on the string representation of the parent, then we
1040    are in trouble.
1041   
1042    __Apply__
1043   
1044    [attachment:trac14585-cythoned_lazy_string.patch]
1045   
1046    URL: http://trac.sagemath.org/14585
1047    Reported by: SimonKing
1048    Ticket author(s): Simon King, Jeroen Demeyer
1049    Reviewer(s): Simon King, Jeroen Demeyer
1050
1051commit ee47081e36cb966c64ef4976717dbe1e43712e8f
1052Merge: 7eb8510 09cba3c
1053Author: Release Manager <release@sagemath.org>
1054Date:   Sun Jul 26 16:17:56 2015 +0200
1055
1056    Trac #7744: STL, AMF, X3D and PLY export for 3D printing
1057   
1058    {{{
1059    def surface_to_stl(surface):
1060        """
1061        Return an STL representation of the surface.
1062   
1063        INPUT:
1064            - `surface` -- any surface, eg. output of a 3d plot function.
1065   
1066        OUTPUT:
1067            A string that represents the surface in the STL format.
1068   
1069        COMMENTS:
1070            (1) You must view the surface before plotting it.
1071                Otherwise, this will not work.
1072            (2) In order to do 3d printing with this, you will need to
1073                convert it into gcode. Skeinforge is an open-source
1074                program that can do this.
1075            (3) The size of the surface is not normalized in export.
1076                Sage's units will become the units of the STL
1077                description. These seem to be ~0.05 cm (at least when
1078                printed using skeinforge -> replicatorg -> hacklab.to's
1079                cupcake).
1080            (4) Be aware of the overhang limits of your 3d printer;
1081                most printers can only handle an overhang of Pi/2 (45*)
1082                before your model will start drooping.
1083   
1084        EXAMPLES:
1085            sage: x,y,z = var('x,y,z')
1086            sage: a = implicit_plot3d(x^2+y^2+z^2-9, [x,-5,5],
1087    [y,-5,5],[z,-5,5])
1088            sage: a
1089            sage: f=file.open("foo.stl",'w')
1090            sage: f.write(surface_to_stl(a))
1091            sage: f.close()
1092        """
1093   
1094        out =  "solid mathsurface\n"
1095        for i in surface.face_list():
1096            n = ( i[1][1]*i[2][2] - i[2][1]*i[1][2],
1097                  i[1][2]*i[2][0] - i[1][0]*i[2] 2],
1098                  i[1][0]*i[2][1] - i[2][0]*i[1][1] )
1099            abs = (n[0]^2+n[1]^2+n[2]^2)^0.5
1100            n= (n[0]/abs,n[1]/abs,n[2]/abs)
1101            out += "  facet normal " + repr(n[0])  + " " + repr(n[1])    + "
1102    " + repr(n[2])
1103            out += "    outer loop\n"
1104            out += "      vertex " + repr(i[0][0]) + " " + repr(i[0][1]) + "
1105    " + repr(i[0][2]) + "\n"
1106            out += "      vertex " + repr(i[1][0]) + " " + repr(i[1][1]) + "
1107    " + repr(i[1][2]) + "\n"
1108            out += "      vertex " + repr(i[2][0]) + " " + repr(i[2][1]) + "
1109    " + repr(i[2][2]) + "\n"
1110            out += "    endloop\n"
1111            out += "  endfacet\n"
1112        out += "endsolid surface\n"
1113        return out
1114    }}}
1115   
1116    URL: http://trac.sagemath.org/7744
1117    Reported by: colah
1118    Ticket author(s): Christopher Olah, Frédéric Chapoton
1119    Reviewer(s): Miguel Marco
1120
1121commit 7eb8510dacf61b691664cd8f1d2e75e5d473e5a0
1122Author: Volker Braun <vbraun.name@gmail.com>
1123Date:   Sun Jul 26 15:34:41 2015 +0200
1124
1125    Updated Sage version to 6.8
1126
1127commit 4adcf950cd34c28460383468b17b59c695633f01
1128Author: Nathann Cohen <nathann.cohen@gmail.com>
1129Date:   Sun Jul 26 12:56:23 2015 +0200
1130
1131    trac #18948: Two missing graphs
1132
1133commit bd1d6ebb6136c11fa14cdb3545e4f429782d244e
1134Author: Sébastien Labbé <slabqc@gmail.com>
1135Date:   Sun Jul 26 08:14:58 2015 +0200
1136
1137    Trac #18947: Move -fix-pkg-checksums in making packages section of sage -advanced
1138
1139commit 8d86cb325724472a7fe55e1a351ab5958b474ddf
1140Author: Sébastien Labbé <slabqc@gmail.com>
1141Date:   Sat Jul 25 22:07:40 2015 +0200
1142
1143    Trac #18901: Fix ReST syntax
1144
1145commit 11974832bf3c6d13ed758a109f537033f56394fb
1146Author: Sébastien Labbé <slabqc@gmail.com>
1147Date:   Sat Jul 25 21:51:40 2015 +0200
1148
1149    18950: Remove make_dlxwrapper from sage namespace
1150
1151commit e2b82a4b7b035d84955c3c15a41cd740fc050eaf
1152Author: Sébastien Labbé <slabqc@gmail.com>
1153Date:   Sat Jul 25 14:05:27 2015 +0200
1154
1155    Fix doctest in games/quantumino.py
1156
1157commit 56c74ed227fb8def88644a7e2371bd33701d8f28
1158Author: Sébastien Labbé <slabqc@gmail.com>
1159Date:   Sat Jul 25 13:47:40 2015 +0200
1160
1161    Better __repr__ for dancing links, added rows method
1162
1163commit 3a3dd8be8ff50d04bc84dc60401ea9af11871af6
1164Author: Sébastien Labbé <slabqc@gmail.com>
1165Date:   Sat Jul 25 13:04:16 2015 +0200
1166
1167    Removed cimport Integer from dancing links
1168
1169commit 392b62c70d342679c41799e0b45857c537ad8a8e
1170Author: Jeroen Demeyer <jdemeyer@cage.ugent.be>
1171Date:   Sat Jul 25 12:37:42 2015 +0200
1172
1173    Simplify dancing links code
1174
1175commit 549575955408f4ca4c8c24341c6c8149d14e4a1d
1176Author: Sébastien Labbé <slabqc@gmail.com>
1177Date:   Sat Jul 25 11:33:30 2015 +0200
1178
1179    Trac #11814: Fix segmentation Fault raised by an assert
1180
1181commit 38d4de5f072cb50711368d3e1720e5277b1b54db
1182Author: Jori Mäntysalo <jori.mantysalo@uta.fi>
1183Date:   Sat Jul 25 10:56:33 2015 +0300
1184
1185    "to to" -> "to".
1186
1187commit 35f074c4a0a48af5583582e25fe76d0483ca7778
1188Author: Sébastien Labbé <slabqc@gmail.com>
1189Date:   Sat Jul 25 09:40:33 2015 +0200
1190
1191    Trac #11814: Added not tested flag for segmentation fault
1192
1193commit 3b9cb9c7eccebbe96da6e08a0fd779fa53842ae6
1194Author: Frédéric Chapoton <chapoton@math.univ-lyon1.fr>
1195Date:   Fri Jul 24 21:20:41 2015 +0200
1196
1197    just a few details in graph.py
1198
1199commit 7f538952608ae5f884625148f2d47f67f2c3cd81
1200Author: Jori Mäntysalo <jori.mantysalo@uta.fi>
1201Date:   Fri Jul 24 22:17:42 2015 +0300
1202
1203    Typo corrected.
1204
1205commit a0173e2789e7a8f79c88a77d753b48788f183e65
1206Author: Nathann Cohen <nathann.cohen@gmail.com>
1207Date:   Fri Jul 24 17:38:54 2015 +0200
1208
1209    trac #18948: Strongly Regular Graphs database
1210
1211commit dbd6c1ab34c7c9a40d1cbec975dbddc3ab21c2ec
1212Author: Nathann Cohen <nathann.cohen@gmail.com>
1213Date:   Fri Jul 24 18:31:27 2015 +0200
1214
1215    trac #18947: Add a -fix-pkg-checksums argument to sage
1216
1217commit 25741dfc1c52709faa59042024248824247275f4
1218Merge: 3648190 8ee8dd8
1219Author: Sébastien Labbé <slabqc@gmail.com>
1220Date:   Fri Jul 24 15:12:16 2015 +0200
1221
1222    Trac #11814: Merge with 6.8.rc1
1223
1224commit 37011a4187cbd3d91ca68224a82151666682dd67
1225Author: Nathann Cohen <nathann.cohen@gmail.com>
1226Date:   Fri Jul 24 15:08:45 2015 +0200
1227
1228    trac #18926: Cleaning
1229
1230commit 8ee8dd81d654d6d68baa335b15251a2427c3dc8e
1231Author: Sébastien Labbé <slabqc@gmail.com>
1232Date:   Fri Jul 24 14:59:10 2015 +0200
1233
1234    Trac #11814: Catch the segmentation fault in dancing links
1235
1236commit 62fae3d72ebc65be67fd72a426f744a581dda42d
1237Author: Johan S. R. Nielsen <jsrn@jsrn.dk>
1238Date:   Fri Jul 24 14:36:39 2015 +0200
1239
1240    More reviewer^2 comments
1241
1242commit 978870cf7157ac3b65e98aad4aa6483be9547971
1243Author: Jori Mäntysalo <jori.mantysalo@uta.fi>
1244Date:   Fri Jul 24 15:27:49 2015 +0300
1245
1246    Added a type checking for the poset.
1247
1248commit 3a9e3b5cbb00db4ffa5f97542ce3d027b19ee006
1249Author: Johan S. R. Nielsen <jsrn@jsrn.dk>
1250Date:   Fri Jul 24 14:07:57 2015 +0200
1251
1252    Yet another docstring fix
1253