upstream/mercurial-mirror Files · mercurial/pure/base85.py

track-tags: introduce first bits of tags tracking during transaction...

track-tags: introduce first bits of tags tracking during transaction This changeset introduces detection of tags changes during transaction. When this happens a 'tag_moved=1' argument is set for hooks, similar to what we do for bookmarks and phases. This code is disabled by default as there are still various performance concerns. Some require a smarter use of our existing tag caches and some other require rework around the transaction logic to skip execution when unneeded. These performance improvements have been delayed, I would like to be able to experiment and stabilize the feature behavior first. Later changesets will push the concept further and provide a way for hooks to know what are the actual changes introduced by the transaction. Similar work is needed for the other families of changes (bookmark, phase, obsolescence, etc). Upgrade of the transaction logic will likely be performed at the same time. The current code can report some false positive when .hgtags file changes but resulting tags are unchanged. This will be fixed in the next changeset. For testing, we simply globally enable a hook in the tag test as all the possible tag update cases should exist there. A couple of them show the false positive mentioned above. See in code documentation for more details.

Gregory Szorc - - Load All Authors

File last commit:

r27334:9007f697 default


                r31994:b36318e6

default

Download file

             base85.py
        
                    77 lines
            
             | 1.9 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / mercurial / pure / base85.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # base85.py: pure python base85 codec

      #

      # Copyright (C) 2009 Brendan Cully <brendan@kublai.com>

      #

      # This software may be used and distributed according to the terms of the

      # GNU General Public License version 2 or any later version.

      from __future__ import absolute_import

      import struct

      _b85chars = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" \

                  "abcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~"

      _b85chars2 = [(a + b) for a in _b85chars for b in _b85chars]

      _b85dec = {}

      def _mkb85dec():

          for i, c in enumerate(_b85chars):

              _b85dec[c] = i

      def b85encode(text, pad=False):

          """encode text in base85 format"""

          l = len(text)

          r = l % 4

          if r:

              text += '\0' * (4 - r)

          longs = len(text) >> 2

          words = struct.unpack('>%dL' % (longs), text)

          out = ''.join(_b85chars[(word // 52200625) % 85] +

                        _b85chars2[(word // 7225) % 7225] +

                        _b85chars2[word % 7225]

                        for word in words)

          if pad:

              return out

          # Trim padding

          olen = l % 4

          if olen:

              olen += 1

          olen += l // 4 * 5

          return out[:olen]

      def b85decode(text):

          """decode base85-encoded text"""

          if not _b85dec:

              _mkb85dec()

          l = len(text)

          out = []

          for i in range(0, len(text), 5):

              chunk = text[i:i + 5]

              acc = 0

              for j, c in enumerate(chunk):

                  try:

                      acc = acc * 85 + _b85dec[c]

                  except KeyError:

                      raise ValueError('bad base85 character at position %d'

                                       % (i + j))

              if acc > 4294967295:

                  raise ValueError('Base85 overflow in hunk starting at byte %d' % i)

              out.append(acc)

          # Pad final chunk if necessary

          cl = l % 5

          if cl:

              acc *= 85 ** (5 - cl)

              if cl > 1:

                  acc += 0xffffff >> (cl - 2) * 8

              out[-1] = acc

          out = struct.pack('>%dL' % (len(out)), *out)

          if cl:

              out = out[:-(5 - cl)]

          return out

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				# base85.py: pure python base85 codec
				#
				# Copyright (C) 2009 Brendan Cully <brendan@kublai.com>
				#
				# This software may be used and distributed according to the terms of the
				# GNU General Public License version 2 or any later version.

				from __future__ import absolute_import

				import struct

				_b85chars = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" \
				"abcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{\|}~"
				_b85chars2 = [(a + b) for a in _b85chars for b in _b85chars]
				_b85dec = {}

				def _mkb85dec():
				for i, c in enumerate(_b85chars):
				_b85dec[c] = i

				def b85encode(text, pad=False):
				"""encode text in base85 format"""
				l = len(text)
				r = l % 4
				if r:
				text += '\0' * (4 - r)
				longs = len(text) >> 2
				words = struct.unpack('>%dL' % (longs), text)

				out = ''.join(_b85chars[(word // 52200625) % 85] +
				_b85chars2[(word // 7225) % 7225] +
				_b85chars2[word % 7225]
				for word in words)

				if pad:
				return out

				# Trim padding
				olen = l % 4
				if olen:
				olen += 1
				olen += l // 4 * 5
				return out[:olen]

				def b85decode(text):
				"""decode base85-encoded text"""
				if not _b85dec:
				_mkb85dec()

				l = len(text)
				out = []
				for i in range(0, len(text), 5):
				chunk = text[i:i + 5]
				acc = 0
				for j, c in enumerate(chunk):
				try:
				acc = acc * 85 + _b85dec[c]
				except KeyError:
				raise ValueError('bad base85 character at position %d'
				% (i + j))
				if acc > 4294967295:
				raise ValueError('Base85 overflow in hunk starting at byte %d' % i)
				out.append(acc)

				# Pad final chunk if necessary
				cl = l % 5
				if cl:
				acc = 85 * (5 - cl)
				if cl > 1:
				acc += 0xffffff >> (cl - 2) * 8
				out[-1] = acc

				out = struct.pack('>%dL' % (len(out)), *out)
				if cl:
				out = out[:-(5 - cl)]

				return out