Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | | Move UIDs assigning to sphinx.versioning | Takeshi KOMIYA | 2017-10-31 | 1 | -0/+32 | |
|/ | ||||||
* | Merge branch 'stable' | Takeshi KOMIYA | 2017-03-26 | 1 | -1/+1 | |
|\ | ||||||
| * | Year++ | Takeshi KOMIYA | 2017-03-26 | 1 | -1/+1 | |
| | | ||||||
* | | Add type-check annotations to sphinx.* | Takeshi KOMIYA | 2016-11-16 | 1 | -2/+11 | |
|/ | ||||||
* | Obligatory copyright update. | Georg Brandl | 2016-01-14 | 1 | -1/+1 | |
| | ||||||
* | Merge branch 'stable' | Georg Brandl | 2015-01-03 | 1 | -1/+1 | |
|\ | ||||||
| * | all: update copyright | Georg Brandl | 2015-01-03 | 1 | -1/+1 | |
| | | ||||||
* | | If the ``python-levenshtein`` 3rd-party package is installed, it will ↵ | Takayuki Shimizukawa | 2014-10-05 | 1 | -1/+10 | |
| | | | | | | | | improve the calculation time. refs #1426. | |||||
* | | Incompatibility. Now :confval:`gettext_uuid` is set False by default. If ↵ | Takayuki Shimizukawa | 2014-10-05 | 1 | -0/+3 | |
| | | | | | | | | False, also levenshtein calculation is disabled. refs #1426 | |||||
* | | use six privided iteritems(),itervalues() to support py2/py3 in one source. ↵ | Takayuki Shimizukawa | 2014-04-29 | 1 | -1/+2 | |
| | | | | | | | | refs #1350. | |||||
* | | use six privided functions/classes to support py2/py3 in one source. refs #1350. | Takayuki Shimizukawa | 2014-04-29 | 1 | -3/+3 | |
| | | ||||||
* | | introduce the six module and reduce sphinx.util.pycompat implementation. ↵ | Takayuki Shimizukawa | 2014-04-29 | 1 | -2/+2 | |
| | | | | | | | | refs #1350. | |||||
* | | Update copyright year. | Georg Brandl | 2014-03-01 | 1 | -1/+1 | |
|\ \ | |/ | ||||||
| * | Update copyright year. | Georg Brandl | 2014-03-01 | 1 | -1/+1 | |
| | | ||||||
* | | Drop python-2.5 and remove 2.4,2.5 support codes | Takayuki Shimizukawa | 2013-12-15 | 1 | -1/+2 | |
|/ | ||||||
* | Copyright update. | Georg Brandl | 2013-01-01 | 1 | -1/+1 | |
| | ||||||
* | Import all from pycompat | Daniel Neuhäuser | 2011-01-08 | 1 | -1/+1 | |
| | ||||||
* | Replace unneeded defaultdict with dict | Daniel Neuhäuser | 2011-01-08 | 1 | -2/+1 | |
| | ||||||
* | merge with 1.0 | Georg Brandl | 2011-01-04 | 1 | -1/+1 | |
| | ||||||
* | Supply substitute implementation of itertools.(i)zip_longest. | Georg Brandl | 2010-08-21 | 1 | -5/+1 | |
| | ||||||
* | Added a fallback for itertools product to pycompat for python versions < 2.6 | Daniel Neuhäuser | 2010-08-21 | 1 | -1/+2 | |
| | ||||||
* | Small code style changes, remove unused imports. | Georg Brandl | 2010-08-21 | 1 | -10/+11 | |
| | ||||||
* | Fix get_ratio for empty strings | Daniel Neuhäuser | 2010-08-16 | 1 | -1/+6 | |
| | ||||||
* | Optimized further and added several comments explaining the merging algorithm | Daniel Neuhäuser | 2010-08-16 | 1 | -3/+35 | |
| | ||||||
* | Optimized merging algorithm | Daniel Neuhäuser | 2010-08-15 | 1 | -3/+9 | |
| | ||||||
* | Make levenshtein implementation faster for equal strings | Daniel Neuhäuser | 2010-08-15 | 1 | -4/+3 | |
| | ||||||
* | Replaced the merging algorithm with one that handles similarities better, ↵ | Daniel Neuhäuser | 2010-08-15 | 1 | -86/+26 | |
| | | | | it's awfully slow though, if anybody has a better idea please implement it | |||||
* | Fixed NameError introduced by last changeset | Daniel Neuhäuser | 2010-08-12 | 1 | -2/+2 | |
| | ||||||
* | Fallback to zip_longest for python3 | Daniel Neuhäuser | 2010-08-12 | 1 | -1/+5 | |
| | ||||||
* | Removed unnecessary check | Daniel Neuhäuser | 2010-08-10 | 1 | -1/+0 | |
| | ||||||
* | Fixed algorithm test_insert passes now and everything seems to be working fine | Daniel Neuhäuser | 2010-08-10 | 1 | -2/+2 | |
| | ||||||
* | Fix line length | Daniel Neuhäuser | 2010-08-10 | 1 | -1/+2 | |
| | ||||||
* | Fixed documentation | Daniel Neuhäuser | 2010-08-10 | 1 | -2/+1 | |
| | ||||||
* | Initial version tracking implementation | Daniel Neuhäuser | 2010-08-10 | 1 | -0/+145 | |