This is an archive of the discontinued Mercurial Phabricator instance.

Differential D3475

tests: port test-pathencode.py to Python 3
ClosedPublic

Authored by durin42 on May 8 2018, 12:27 AM.

Details

Reviewers
pulkit
Group Reviewers
hg-reviewers
Commits
rHG1b230e19d044: tests: port test-pathencode.py to Python 3
Summary
  1. skip-blame uninteresting changes, mainly b prefixes

Diff Detail

Repository
rHG Mercurial
Lint
Automatic diff as part of commit; lint not applicable.
Unit
Automatic diff as part of commit; unit tests not applicable.

Event Timeline

durin42 created this revision.May 8 2018, 12:27 AM
Closed by commit rHG1b230e19d044: tests: port test-pathencode.py to Python 3 (authored by durin42). · Explain WhyMay 8 2018, 9:34 AM
This revision was automatically updated to reflect the committed changes.

Revision Contents
Changeset List

PathPackages
Mcontrib/python3-whitelist (1 line)
Mtests/test-pathencode.py (49 lines)

Diff 8530

contrib/python3-whitelist

test-obsolete-bundle-strip.t test-obsolete-bundle-strip.t
test-obsolete-changeset-exchange.t test-obsolete-changeset-exchange.t
test-obsolete-checkheads.t test-obsolete-checkheads.t
test-obsolete-distributed.t test-obsolete-distributed.t
test-obsolete-tag-cache.t test-obsolete-tag-cache.t
test-parents.t test-parents.t
test-pathconflicts-merge.t test-pathconflicts-merge.t
test-pathconflicts-update.t test-pathconflicts-update.t
test-pathencode.py
test-pending.t test-pending.t
test-permissions.t test-permissions.t
test-phases.t test-phases.t
test-pull-branch.t test-pull-branch.t
test-pull-http.t test-pull-http.t
test-pull-permission.t test-pull-permission.t
test-pull-pull-corruption.t test-pull-pull-corruption.t
test-pull-r.t test-pull-r.t

tests/test-pathencode.py

import collections import collections
import itertools import itertools
import math import math
import os import os
import random import random
import sys import sys
import time import time
from mercurial import ( from mercurial import (
pycompat,
store, store,
) )
try: try:
xrange xrange
except NameError: except NameError:
xrange = range xrange = range
validchars = set(map(chr, range(0, 256))) validchars = set(map(pycompat.bytechr, range(0, 256)))
alphanum = range(ord('A'), ord('Z')) alphanum = range(ord('A'), ord('Z'))
for c in '\0/': for c in (b'\0', b'/'):
validchars.remove(c) validchars.remove(c)
winreserved = ('aux con prn nul'.split() + winreserved = (b'aux con prn nul'.split() +
['com%d' % i for i in xrange(1, 10)] + [b'com%d' % i for i in xrange(1, 10)] +
['lpt%d' % i for i in xrange(1, 10)]) [b'lpt%d' % i for i in xrange(1, 10)])
def casecombinations(names): def casecombinations(names):
'''Build all case-diddled combinations of names.''' '''Build all case-diddled combinations of names.'''
combos = set() combos = set()
for r in names: for r in names:
for i in xrange(len(r) + 1): for i in xrange(len(r) + 1):
for c in itertools.combinations(xrange(len(r)), i): for c in itertools.combinations(xrange(len(r)), i):
d = r d = r
for j in c: for j in c:
d = ''.join((d[:j], d[j].upper(), d[j + 1:])) d = b''.join((d[:j], d[j:j + 1].upper(), d[j + 1:]))
combos.add(d) combos.add(d)
return sorted(combos) return sorted(combos)
def buildprobtable(fp, cmd='hg manifest tip'): def buildprobtable(fp, cmd='hg manifest tip'):
'''Construct and print a table of probabilities for path name '''Construct and print a table of probabilities for path name
components. The numbers are percentages.''' components. The numbers are percentages.'''
counts = collections.defaultdict(lambda: 0) counts = collections.defaultdict(lambda: 0)
break break
fp.write('(%r, %.03f), ' % (k, vt)) fp.write('(%r, %.03f), ' % (k, vt))
fp.write('\n )\n') fp.write('\n )\n')
# A table of character frequencies (as percentages), gleaned by # A table of character frequencies (as percentages), gleaned by
# looking at filelog names from a real-world, very large repo. # looking at filelog names from a real-world, very large repo.
probtable = ( probtable = (
('t', 9.828), ('e', 9.042), ('s', 8.011), ('a', 6.801), ('i', 6.618), (b't', 9.828), (b'e', 9.042), (b's', 8.011), (b'a', 6.801), (b'i', 6.618),
('g', 5.053), ('r', 5.030), ('o', 4.887), ('p', 4.363), ('n', 4.258), (b'g', 5.053), (b'r', 5.030), (b'o', 4.887), (b'p', 4.363), (b'n', 4.258),
('l', 3.830), ('h', 3.693), ('_', 3.659), ('.', 3.377), ('m', 3.194), (b'l', 3.830), (b'h', 3.693), (b'_', 3.659), (b'.', 3.377), (b'm', 3.194),
('u', 2.364), ('d', 2.296), ('c', 2.163), ('b', 1.739), ('f', 1.625), (b'u', 2.364), (b'd', 2.296), (b'c', 2.163), (b'b', 1.739), (b'f', 1.625),
('6', 0.666), ('j', 0.610), ('y', 0.554), ('x', 0.487), ('w', 0.477), (b'6', 0.666), (b'j', 0.610), (b'y', 0.554), (b'x', 0.487), (b'w', 0.477),
('k', 0.476), ('v', 0.473), ('3', 0.336), ('1', 0.335), ('2', 0.326), (b'k', 0.476), (b'v', 0.473), (b'3', 0.336), (b'1', 0.335), (b'2', 0.326),
('4', 0.310), ('5', 0.305), ('9', 0.302), ('8', 0.300), ('7', 0.299), (b'4', 0.310), (b'5', 0.305), (b'9', 0.302), (b'8', 0.300), (b'7', 0.299),
('q', 0.298), ('0', 0.250), ('z', 0.223), ('-', 0.118), ('C', 0.095), (b'q', 0.298), (b'0', 0.250), (b'z', 0.223), (b'-', 0.118), (b'C', 0.095),
('T', 0.087), ('F', 0.085), ('B', 0.077), ('S', 0.076), ('P', 0.076), (b'T', 0.087), (b'F', 0.085), (b'B', 0.077), (b'S', 0.076), (b'P', 0.076),
('L', 0.059), ('A', 0.058), ('N', 0.051), ('D', 0.049), ('M', 0.046), (b'L', 0.059), (b'A', 0.058), (b'N', 0.051), (b'D', 0.049), (b'M', 0.046),
('E', 0.039), ('I', 0.035), ('R', 0.035), ('G', 0.028), ('U', 0.026), (b'E', 0.039), (b'I', 0.035), (b'R', 0.035), (b'G', 0.028), (b'U', 0.026),
('W', 0.025), ('O', 0.017), ('V', 0.015), ('H', 0.013), ('Q', 0.011), (b'W', 0.025), (b'O', 0.017), (b'V', 0.015), (b'H', 0.013), (b'Q', 0.011),
('J', 0.007), ('K', 0.005), ('+', 0.004), ('X', 0.003), ('Y', 0.001), (b'J', 0.007), (b'K', 0.005), (b'+', 0.004), (b'X', 0.003), (b'Y', 0.001),
) )
for c, _ in probtable: for c, _ in probtable:
validchars.remove(c) validchars.remove(c)
validchars = list(validchars) validchars = list(validchars)
def pickfrom(rng, table): def pickfrom(rng, table):
c = 0 c = 0
) )
# Components of a name following the first. # Components of a name following the first.
resttable = firsttable[:-1] resttable = firsttable[:-1]
# Special suffixes. # Special suffixes.
internalsuffixcombos = casecombinations('.hg .i .d'.split()) internalsuffixcombos = casecombinations(b'.hg .i .d'.split())
# The last component of a path, before a slash or at the end of a name. # The last component of a path, before a slash or at the end of a name.
lasttable = resttable + ( lasttable = resttable + (
(lambda rng: '', 95), (lambda rng: b'', 95),
(lambda rng: rng.choice(internalsuffixcombos), 5), (lambda rng: rng.choice(internalsuffixcombos), 5),
) )
def makepart(rng, k): def makepart(rng, k):
'''Construct a part of a pathname, without slashes.''' '''Construct a part of a pathname, without slashes.'''
p = pickfrom(rng, firsttable)(rng) p = pickfrom(rng, firsttable)(rng)
l = len(p) l = len(p)
ps = [p] ps = [p]
maxl = rng.randint(1, k) maxl = rng.randint(1, k)
while l < maxl: while l < maxl:
p = pickfrom(rng, resttable)(rng) p = pickfrom(rng, resttable)(rng)
l += len(p) l += len(p)
ps.append(p) ps.append(p)
ps.append(pickfrom(rng, lasttable)(rng)) ps.append(pickfrom(rng, lasttable)(rng))
return ''.join(ps) return b''.join(ps)
def makepath(rng, j, k): def makepath(rng, j, k):
'''Construct a complete pathname.''' '''Construct a complete pathname.'''
return ('data/' + '/'.join(makepart(rng, k) for _ in xrange(j)) + return (b'data/' + b'/'.join(makepart(rng, k) for _ in xrange(j)) +
rng.choice(['.d', '.i'])) rng.choice([b'.d', b'.i']))
def genpath(rng, count): def genpath(rng, count):
'''Generate random pathnames with gradually increasing lengths.''' '''Generate random pathnames with gradually increasing lengths.'''
mink, maxk = 1, 4096 mink, maxk = 1, 4096
def steps(): def steps():
for i in xrange(count): for i in xrange(count):
yield mink + int(round(math.sqrt((maxk - mink) * float(i) / count))) yield mink + int(round(math.sqrt((maxk - mink) * float(i) / count)))