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

treemanifest: make node reuse match flat manifest behavior...

treemanifest: make node reuse match flat manifest behavior In a flat manifest, a node with the same content but different parents is still considered a new node. In the current tree manifests however, if the content is the same, we ignore the parents entirely and just reuse the existing node. In our external treemanifest extension, we want to allow having one treemanifest for every flat manifests, as a way of easeing the migration to treemanifests. To make this possible, let's change the root node treemanifest behavior to match the behavior for flat manifests, so we can have a 1:1 relationship. While this sounds like a BC breakage, it's not actually a state users can normally get in because: A) you can't make empty commits, and B) even if you try to make an empty commit (by making a commit then amending it's changes away), the higher level commit logic in localrepo.commitctx() forces the commit to use the original p1 manifest node if no files were changed. So this would only affect extensions and automation that reached passed the normal localrepo.commit() logic straight into the manifest logic.

Gregory Szorc - - Load All Authors

File last commit:

r27334:9007f697 default


                r31294:c134a33b

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